This article is cited in
5 papers
Closures and generating sets related to combinations of structures
S. V. Sudoplatovabcd a Institute of Mathematics and Mathematical Modeling
b Novosibirsk State Technical University
c Sobolev Institute of Mathematics
d Novosibirsk State University
Abstract:
We investigate closure operators and describe their properties for
$E$-combinations and
$P$-combinations of structures and
their theories including the negation of finite character and the
exchange property. It is shown that closure operators for
$E$-combinations correspond to the closures with respect to
the ultraproduct operator forming Hausdorff topological spaces. It
is also shown that closure operators for disjoint
$P$-combinations
form topological
$T_0$-spaces, which can be not Hausdorff. Thus
topologies for
$E$-combinations and
$P$-combinations are
rather different. We prove, for
$E$-combinations, that the
existence of a minimal generating set of theories is equivalent to
the existence of the least generating set, and characterize
syntactically and semantically the property of the existence of
the least generating set: it is shown that elements of the least
generating set are isolated and dense in its
$E$-closure.
Related properties for
$P$-combinations are considered: it is
proved that again the existence of a minimal generating set of
theories is equivalent to the existence of the least generating
set but it is not equivalent to the isolation of elements in the
generating set. It is shown that
$P$-closures with the least
generating sets are connected with families which are not
$\omega$-reconstructible, as well as with families having finite
$e$-spectra.
Two questions on the least generating sets for
$E$-combinations and
$P$-combinations are formulated and
partial answers are suggested.
Keywords:
$E$-combination, $P$-combination, closure operator, generating set.
UDC:
510.67:515.12
MSC: 03C30,
03C15,
03C50,
54A05
Language: English