The Theories of Superatomic Boolean Algebras with Distinguished Subalgebra Which Lack Countably Saturated Models

2020 ◽  
Vol 61 (3) ◽  
pp. 516-527
Author(s):  
D. E. Palchunov ◽  
A. V. Trofimov
2018 ◽  
Vol 167 (3) ◽  
pp. 489-504 ◽  
Author(s):  
J. ROSICKÝ

AbstractA. Avilés and C. Brech proved an intriguing result about the existence and uniqueness of certain injective Boolean algebras or Banach spaces. Their result refines the standard existence and uniqueness of saturated models. They express a wish to obtain a unified approach in the context of category theory. We provide this in the framework of weak factorisation systems. Our basic tool is the fat small object argument.


1979 ◽  
Vol 2 (1) ◽  
pp. 17-41
Author(s):  
Michał Jaegermann

In the paper is developed a theory of information storage and retrieval systems which arise in situations when a whole possessed information amounts to a fact that a given document has some feature from properly chosen set. Such systems are described as suitable maps from descriptor algebras into sets of subsets of sets of documents. Since descriptor algebras turn out to be pseudo-Boolean algebras, hence an “inner logic” of our systems is intuitionistic. In the paper is given a construction of systems and are considered theirs properties. We will show also (in Part II) a formalized theory of such systems.


2019 ◽  
Vol 85 (1) ◽  
pp. 109-148
Author(s):  
NICK BEZHANISHVILI ◽  
WESLEY H. HOLLIDAY

AbstractThe standard topological representation of a Boolean algebra via the clopen sets of a Stone space requires a nonconstructive choice principle, equivalent to the Boolean Prime Ideal Theorem. In this article, we describe a choice-free topological representation of Boolean algebras. This representation uses a subclass of the spectral spaces that Stone used in his representation of distributive lattices via compact open sets. It also takes advantage of Tarski’s observation that the regular open sets of any topological space form a Boolean algebra. We prove without choice principles that any Boolean algebra arises from a special spectral space X via the compact regular open sets of X; these sets may also be described as those that are both compact open in X and regular open in the upset topology of the specialization order of X, allowing one to apply to an arbitrary Boolean algebra simple reasoning about regular opens of a separative poset. Our representation is therefore a mix of Stone and Tarski, with the two connected by Vietoris: the relevant spectral spaces also arise as the hyperspace of nonempty closed sets of a Stone space endowed with the upper Vietoris topology. This connection makes clear the relation between our point-set topological approach to choice-free Stone duality, which may be called the hyperspace approach, and a point-free approach to choice-free Stone duality using Stone locales. Unlike Stone’s representation of Boolean algebras via Stone spaces, our choice-free topological representation of Boolean algebras does not show that every Boolean algebra can be represented as a field of sets; but like Stone’s representation, it provides the benefit of a topological perspective on Boolean algebras, only now without choice. In addition to representation, we establish a choice-free dual equivalence between the category of Boolean algebras with Boolean homomorphisms and a subcategory of the category of spectral spaces with spectral maps. We show how this duality can be used to prove some basic facts about Boolean algebras.


1990 ◽  
Vol 84 (1) ◽  
pp. 136
Author(s):  
Gian-Carlo Rota
Keyword(s):  

1998 ◽  
Vol 43 (7) ◽  
pp. 562-564
Author(s):  
Guolong Chen
Keyword(s):  

Order ◽  
2003 ◽  
Vol 20 (3) ◽  
pp. 265-290 ◽  
Author(s):  
Uri Abraham ◽  
Robert Bonnet ◽  
Wiesław Kubiś ◽  
Matatyahu Rubin
Keyword(s):  

1979 ◽  
Vol 2 (1) ◽  
pp. 63-70
Author(s):  
Tadeusz Traczyk

The notion of numerical characterization of Boolean algebras and coproducts are used to define information systems and to develop the theory of such systems.


2006 ◽  
Vol 71 (1) ◽  
pp. 203-216 ◽  
Author(s):  
Ermek S. Nurkhaidarov

In this paper we study the automorphism groups of countable arithmetically saturated models of Peano Arithmetic. The automorphism groups of such structures form a rich class of permutation groups. When studying the automorphism group of a model, one is interested to what extent a model is recoverable from its automorphism group. Kossak-Schmerl [12] show that if M is a countable, arithmetically saturated model of Peano Arithmetic, then Aut(M) codes SSy(M). Using that result they prove:Let M1. M2 be countable arithmetically saturated models of Peano Arithmetic such that Aut(M1) ≅ Aut(M2). Then SSy(M1) = SSy(M2).We show that if M is a countable arithmetically saturated of Peano Arithmetic, then Aut(M) can recognize if some maximal open subgroup is a stabilizer of a nonstandard element, which is smaller than any nonstandard definable element. That fact is used to show the main theorem:Let M1, M2be countable arithmetically saturated models of Peano Arithmetic such that Aut(M1) ≅ Aut(M2). Then for every n < ωHere RT2n is Infinite Ramsey's Theorem stating that every 2-coloring of [ω]n has an infinite homogeneous set. Theorem 0.2 shows that for models of a false arithmetic the converse of Kossak-Schmerl Theorem 0.1 is not true. Using the results of Reverse Mathematics we obtain the following corollary:There exist four countable arithmetically saturated models of Peano Arithmetic such that they have the same standard system but their automorphism groups are pairwise non-isomorphic.


Sign in / Sign up

Export Citation Format

Share Document