We show that it consistent with Zermelo-Fraenkel set theory that there is an infinite, compact Boolean algebra.

For an infinite cardinal K a stronger version of K-distributivity for Boolean algebras, called k-partition completeness, is defined and investigated . It is shown that every k-partition complete Boolean algebra is K-weakly representable, and for strongly inaccessible K these concepts coincide. For regular K ≥ u, it is proved that an atomless K-partition complete Boolean algebra is an updirected union of basic K-tree algebras. Using K-partition completeness, the concept of γ-almost compactness is introduced for γ (...) ≥ K. For strongly inaccessible K we show that K is K-almost compact iff K is weakly compact, and if K is 2K-almost compact, then K is measurable. Further K is strongly compact iff it is γ-almost compact for all γ ≥ K. (shrink)

Using Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that κ, λ are infinite cardinals such that κ++ + ≤ λ, κ<κ = κ and 2κ = κ+, and η is an ordinal with κ+ ≤ η < κ++ and cf = κ+. Then, in some cardinal-preserving generic extension there is a superatomic Boolean algebra equation image such that equation image, equation image for every α < η and equation image. Especially, equation image and equation (...) image can be cardinal sequences of superatomic Boolean algebras. (shrink)

THEOREM 1. (⋄ ℵ 1 ) If B is an infinite Boolean algebra (BA), then there is B 1 such that $|\operatorname{Aut} (B_1)| \leq B_1| = \aleph_1$ and $\langle B_1, \operatorname{Aut} (B_1)\rangle \equiv \langle B, \operatorname{Aut}(B)\rangle$ . THEOREM 2. (⋄ ℵ 1 ) There is a countably compact logic stronger than first-order logic even on finite models. This partially answers a question of H. Friedman. These theorems appear in §§ 1 and 2. THEOREM 3. (a) (⋄ ℵ (...) 1 ) If B is an atomic ℵ 1 -saturated infinite BA, ψ ε L ω 1ω and $\langle B, \operatorname{Aut} (B)\rangle \models\psi$ then there is B 1 such that $|\operatorname{Aut}(B_1)| \leq |B_1| = \aleph_1$ and $\langle B_1, \operatorname{Aut}(B_1)\rangle\models\psi$ . In particular if B is 1-homogeneous so is B 1 . (b) (a) holds for B = P(ω) even if we assume only CH. (shrink)

A complete Boolean algebra ${\mathbb{B}}$ satisfies property ${(\hbar)}$ iff each sequence x in ${\mathbb{B}}$ has a subsequence y such that the equality lim sup z n = lim sup y n holds for each subsequence z of y. This property, providing an explicit definition of the a posteriori convergence in complete Boolean algebras with the sequential topology and a characterization of sequential compactness of such spaces, is closely related to the cellularity of Boolean algebras. Here we (...) determine the position of property ${(\hbar)}$ with respect to the hierarchy of conditions of the form κ-cc. So, answering a question from Kurilić and Pavlović (Ann Pure Appl Logic 148(1–3):49–62, 2007), we show that ${``\mathfrak{h}{\rm -cc}\Rightarrow (\hbar)"}$ is not a theorem of ZFC and that there is no cardinal ${\mathfrak{k}}$ , definable in ZFC, such that ${``\mathfrak{k} {\rm -cc} \Leftrightarrow (\hbar)"}$ is a theorem of ZFC. Also, we show that the set ${\{ \kappa : {\rm each}\, \kappa{\rm -cc\, c.B.a.\, has}\, (\hbar ) \}}$ is equal to ${[0, \mathfrak{h})}$ or ${[0, {\mathfrak h}]}$ and that both values are consistent, which, with the known equality ${{\{\kappa : {\rm each\, c.B.a.\, having }\, (\hbar )\, {\rm has\, the}\, \kappa {\rm -cc } \} =[{\mathfrak s}, \infty )}}$ completes the picture. (shrink)

In the present paper, we introduce the notions of quasi-Boolean algebras as the generalization of Boolean algebras. First we discuss the related properties of quasi-Boolean algebras. Second we define filters of quasi-Boolean algebras and investigate some properties of filters in quasi-Boolean algebras. We also show that there is a one-to-one correspondence between the set of filters and the set of filter congruences on a quasi-Boolean algebra. Then we investigate the prime filters and maximal (...) filters of quasi-Boolean algebras, showing that the prime filters of a quasi-Boolean algebra are precisely the maximal filters and the prime spectrum of a quasi-Boolean algebra is a compact Hausdorff topological space. Finally, we define and study the reticulation of a quasi-Boolean algebra. (shrink)

We investigate strictly positive finitely additive measures on Boolean algebras and strictly positive Radon measures on compact zerodimensional spaces. The motivation is to find a combinatorial characterisation of Boolean algebras which carry a strictly positive finitely additive finite measure with some additional properties, such as separability or nonatomicity. A possible consistent characterisation for an algebra to carry a separable separable positive measure was suggested by Talagrand in 1980, which is that the Stone space K of the (...) algebra satisfies that its space M(K) of measures is weakly separable, equivalently that C(K) embeds into l∞. We show that there is a ZFC example of a Boolean algebra (so of a compact space) which satisfies this condition and does not support a separable strictly positive measure. However, we use this property as a tool in a proof which shows that under MA+⇁ CH every atomless ccc Boolean algebra of size < c carries a nonatomic strictly positive measure. Examples are given to show that this result does not hold in ZFC. Finally, we obtain a characterisation of Boolean algebras that carry a strictly positive nonatomic measure in terms of a chain condition, and we draw the conclusion that under MA+⇁ CH every atomless ccc Boolean algebra satisfies this stronger chain condition. (shrink)

We compare diverse degrees of compactness and finiteness in Boolean algebras with each other and investigate the influence of weak choice principles. Our arguments rely on a discussion of infinitary distributive laws and generalized prime elements in Boolean algebras. In ZF set theory without choice, a Boolean algebra is Dedekind finite if and only if it satisfies the ascending chain condition. The Denumerable Subset Axiom implies finiteness of Boolean algebras with compact top, whereas the (...) converse fails in ZF. Moreover, we derive from DS the atomicity of continuous Boolean algebras. Some of the results extend to more general structures like pseudocomplemented semilattices. (shrink)

A sequence x=xn:nω of elements of a complete Boolean algebra converges to a priori if lim infx=lim supx=b. The sequential topology τs on is the maximal topology on such that x→b implies x→τsb, where →τs denotes the convergence in the space — the a posteriori convergence. These two forms of convergence, as well as the properties of the sequential topology related to forcing, are investigated. So, the a posteriori convergence is described in terms of killing of tall ideals (...) on ω, and it is shown that the a posteriori convergence is equivalent to the a priori convergence iff forcing by does not produce new reals. A property of c.B.a.’s, satisfying -cc -cc and providing an explicit definition of the a posteriori convergence, is isolated. Finally, it is shown that, for an arbitrary c.B.a. , the space is sequentially compact iff the algebra has the property and does not produce independent reals by forcing, and that implies P is the unique sequentially compact c.B.a. in the class of Suslin forcing notions. (shrink)

A theorem on the extendability of certain subsets of a Boolean algebra to ultrafilters which preserve countably many infinite meets (generalizing Rasiowa-Sikorski) is used to pinpoint the mechanism of the Barwise proof in a way which bypasses the set theoretical elaborations.

By analyzing how one obtains the Stone space of the reduced product of an indexed collection of Boolean algebras from the Stone spaces of those algebras, we derive a topological construction, the "reduced coproduct", which makes sense for indexed collections of arbitrary Tichonov spaces. When the filter in question is an ultrafilter, we show how the "ultracoproduct" can be obtained from the usual topological ultraproduct via a compactification process in the style of Wallman and Frink. We prove theorems dealing (...) with the topological structure of reduced coproducts (especially ultracoproducts) and show in addition how one may use this construction to gain information about the category of compact Hausdorff spaces. (shrink)

We establish several first- or second-order properties of models of first-order theories by considering their elements as atoms of a new universe of set theory and by extending naturally any structure of Boolean model on the atoms to the whole universe. For example, complete f-rings are "boundedly algebraically compact" in the language $(+,-,\cdot,\wedge,\vee,\leq)$ , and the positive cone of a complete l-group with infinity adjoined is algebraically compact in the language (+, ∨, ≤). We also give an (...) example with any first-order language. The proofs can be translated into "naive set theory" in a uniform way. (shrink)

We introduce new algebraic and topological semantics for inquisitive logic. The algebraic semantics is based on special Heyting algebras, which we call inquisitive algebras, with propositional valuations ranging over only the ¬¬-fixpoints of the algebra. We show how inquisitive algebras arise from Boolean algebras: for a given Boolean algebra B, we define its inquisitive extension H(B) and prove that H(B) is the unique inquisitive algebra having B as its algebra of ¬¬-fixpoints. We also show (...) that inquisitive algebras determine Medvedev’s logic of finite problems. In addition to the algebraic characterization of H(B), we give a topological characterization of H(B) in terms of the recently introduced choice-free duality for Boolean algebras using so-called upper Vietoris spaces (UV-spaces). In particular, while a Boolean algebra B is realized as the Boolean algebra of compact regular open elements of a UV-space dual to B, we show that H(B) is realized as the algebra of compact open elements of this space. This connection yields a new topological semantics for inquisitive logic. (shrink)

The history of productivity of the κ-chain condition in partial orders, topological spaces, or Boolean algebras is surveyed, and its connection to the set-theoretic notion of a weakly compact cardinal is highlighted. Then, it is proved that for every regular cardinal κ > א1, the principle □ is equivalent to the existence of a certain strong coloring c : [κ]2 → κ for which the family of fibers T is a nonspecial κ-Aronszajn tree. The theorem follows from an (...) analysis of a new characteristic function for walks on ordinals, and implies in particular that if the κ-chain condition is productive for a given regular cardinal κ > א1, then κ is weakly compact in some inner model of ZFC. This provides a partial converse to the fact that if κ is a weakly compact cardinal, then the κ-chain condition is productive. (shrink)

El objetivo de este artículo es presentar una demostración de un teorema clásico sobre álgebras booleanas y ordenes parciales de relevancia actual en teoría de conjuntos, como por ejemplo, para aplicaciones del método de construcción de modelos llamado “forcing” (con álgebras booleanas completas o con órdenes parciales). El teorema que se prueba es el siguiente: “Todo orden parcial se puede extender a una única álgebra booleana completa (salvo isomorfismo)”. Donde extender significa “sumergir densamente”. Tal demostración se realiza utilizando cortaduras de (...) Dedekind siguiendo el texto “Set Theory” de Jech, y otras ideas propias del autor de este artículo. Adicionalmente, se formulan algunas versiones débiles del axioma de elección relacionadas con las álgebras booleanas, las cuales son también de gran importancia para la investigación en teoría de conjuntos y teoría de modelos, pues estas son poderosas técnicas de construcción de modelos, como por ejemplo, el teorema de compacidad (permite construir modelos no estándar, etc) y el teorema del ultrafiltro, que permite construir ultraproductos (pueden ser usados para investigar problemas de cardinales grandes, etc). Se presentan algunas referencias de problemas abiertos sobre el tema. -/- The objective of this paper is to present a demonstration of a classical theorem on boolean algebras and partial orders of current relevance in set theory, as for example, for applications of model construction method called forcing" (with boolean algebras complete or with partial orders). The theorem to be proved is as follows: Any partial order can be extended to a single complete boolean algebra (up to isomorphism)". Where to extend means embed densely". Such a demonstration is done using Dedekind's cuts following the text Set Theory" of Jech, and other ideas of the author of this article. In addition, some weak versions of the axiom of choice related to boolean algebras are formulated, which are also of great importance for the research in set theory and model theory, since this are powerful model construction techniques, such as the compactness theorem (allows the construction of non-standard models, etc.) and the ultralter theorem, which allows the construction of ultraproducts (can be used to investigate problems of large cardinals, etc). Some references of open problems on the subject are presented. (shrink)

We introduce a variety of algebras in the language of Boolean algebras with an extra implication, namely the variety of pseudo-subordination algebras, which is closely related to subordination algebras. We believe it provides a minimal general algebraic framework where to place and systematise the research on classes of algebras related to several kinds of subordination algebras. We also consider the subvariety of pseudo-contact algebras, related to contact algebras, and the subvariety of the strict implication algebras introduced in Bezhanishvili et (...) al. [(2019). A strict implication calculus for compact Hausdorff spaces. Annals of Pure and Applied Logic, 170, 102714]. The variety of pseudo-subordination algebras is term equivalent to the variety of Boolean algebras with a binary modal operator. We exploit this fact in our study. In particular, to obtain a topological duality from which we derive the known topological dualities for subordination algebras and contact algebras. (shrink)

Part I of this paper is developed in the tradition of Stone-type dualities, where we present a new topological representation for general lattices (influenced by and abstracting over both Goldblatt's [17] and Urquhart's [46]), identifying them as the lattices of stable compact-opens of their dual Stone spaces (stability refering to a closure operator on subsets). The representation is functorial and is extended to a full duality.In part II, we consider lattice-ordered algebras (lattices with additional operators), extending the Jónsson and (...) Tarski representation results [30] for Boolean algebras with Operators. Our work can be seen as developing, and indeed completing, Dunn's project of gaggle theory [13, 14]. We consider general lattices (rather than Boolean algebras), with a broad class of operators, which we dubb normal, and which includes the Jónsson-Tarski additive operators. Representation of l-algebras is extended to full duality. (shrink)

The 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. (shrink)

In this paper, the following are proved:Theorem A. The quotient algebra ${\cal P} (\kappa )/I$ is complete if and only if the only non-trivial I -closed ideals extending I are of the form $I\lceil A$ for some $A\in I^+$ .Theorem B. If $\kappa$ is a stationary cardinal, then the quotient algebra ${\cal P} (\kappa )/ NS_\kappa$ is not complete.Corollary. (1) If $\kappa$ is a weak compact cardinal, then the quotient algebra ${\cal P} (\kappa )/NS_\kappa$ is not (...) complete.(2) If $\kappa$ bears $\kappa$ -saturated ideal, then the quotient algebra ${\cal P} (\kappa )/NS_\kappa$ is not complete.Theorem C. Assume that $\kappa$ is a strongly compact cardinal, I is a non-trivial normal $\kappa$ -complete ideal on $\kappa$ and B is an I -regular complete Boolean algebra. Then if ${\cal P} (\kappa )/I$ is complete, it is B -valid that for some $A\subseteq\check\kappa$ , ${\cal P} (\kappa )/({\bf J}\lceil A)$ is complete, where J is the ideal generated by $\check I$ in $V^B$ .Corollary. Let M be a transitive model of ZFC and in M , let $\kappa$ be a strongly compact cardinal and $\lambda$ a regular uncountable cardinal less than $\kappa$ . Then there exists a generic extension M [ G ] in which $\kappa =\lambda^+$ and $\kappa$ carries a non-trivial $\kappa$ -complete ideal I which is completive but not $\kappa^+$ -saturated. (shrink)

The previous Part I of the paper discusses the option of the Gödel incompleteness statement (1931: whether “Satz VI” or “Satz X”) to be an axiom due to the pair of the axiom of induction in arithmetic and the axiom of infinity in set theory after interpreting them as logical negations to each other. The present Part II considers the previous Gödel’s paper (1930) (and more precisely, the negation of “Satz VII”, or “the completeness theorem”) as a necessary condition for (...) granting the Gödel incompleteness statement to be a theorem just as the statement itself, to be an axiom. Then, the “completeness paper” can be interpreted as relevant to Hilbert mathematics, according to which mathematics and reality as well as arithmetic and set theory are rather entangled or complementary rather than mathematics to obey reality able only to create models of the latter. According to that, both papers (1930; 1931) can be seen as advocating Russell’s logicism or the intensional propositional logic versus both extensional arithmetic and set theory. Reconstructing history of philosophy, Aristotle’s logic and doctrine can be opposed to those of Plato or the pre-Socratic schools as establishing ontology or intensionality versus extensionality. Husserl’s phenomenology can be analogically realized including and particularly as philosophy of mathematics. One can identify propositional logic and set theory by virtue of Gödel’s completeness theorem (1930: “Satz VII”) and even both and arithmetic in the sense of the “compactness theorem” (1930: “Satz X”) therefore opposing the latter to the “incompleteness paper” (1931). An approach identifying homomorphically propositional logic and set theory as the same structure of Boolean algebra, and arithmetic as the “half” of it in a rigorous construction involving information and its unit of a bit. Propositional logic and set theory are correspondingly identified as the shared zero-order logic of the class of all first-order logics and the class at issue correspondingly. Then, quantum mechanics does not need any quantum logics, but only the relation of propositional logic, set theory, arithmetic, and information: rather a change of the attitude into more mathematical, philosophical, and speculative than physical, empirical and experimental. Hilbert’s epsilon calculus can be situated in the same framework of the relation of propositional logic and the class of all mathematical theories. The horizon of Part III investigating Hilbert mathematics (i.e. according to the Pythagorean viewpoint about the world as mathematical) versus Gödel mathematics (i.e. the usual understanding of mathematics as all mathematical models of the world external to it) is outlined. (shrink)

It is a classic result in modal logic, often referred to as Jónsson-Tarski duality, that the category of modal algebras is dually equivalent to the category of descriptive frames. The latter are Kripke frames equipped with a Stone topology such that the binary relation is continuous. This duality generalizes the celebrated Stone duality for boolean algebras. Our goal is to generalize descriptive frames so that the topology is an arbitrary compact Hausdorff topology. For this, instead of working with (...) the boolean algebra of clopen subsets of a Stone space, we work with the ring of continuous real-valued functions on a compact Hausdorff space. The main novelty is to define a modal operator on such a ring utilizing a continuous relation on a compact Hausdorff space.Our starting point is the well-known Gelfand duality between the category ${\sf KHaus}$ of compact Hausdorff spaces and the category $\boldsymbol {\mathit {uba}\ell }$ of uniformly complete bounded archimedean $\ell $ -algebras. We endow a bounded archimedean $\ell $ -algebra with a modal operator, which results in the category $\boldsymbol {\mathit {mba}\ell }$ of modal bounded archimedean $\ell $ -algebras. Our main result establishes a dual adjunction between $\boldsymbol {\mathit {mba}\ell }$ and the category ${\sf KHF}$ of what we call compact Hausdorff frames; that is, Kripke frames equipped with a compact Hausdorff topology such that the binary relation is continuous. This dual adjunction restricts to a dual equivalence between ${\sf KHF}$ and the reflective subcategory $\boldsymbol {\mathit {muba}\ell }$ of $\boldsymbol {\mathit {mba}\ell }$ consisting of uniformly complete objects of $\boldsymbol {\mathit {mba}\ell }$. This generalizes both Gelfand duality and Jónsson-Tarski duality. (shrink)

We give topological proofs of Görnemann’s adaptation to Heyting algebras of the Rasiowa-Sikorski Lemma for Boolean algebras; and of the Rauszer-Sabalski generalisation of it to distributive lattices. The arguments use the Priestley topology on the set of prime filters, and the Baire category theorem. This is preceded by a discussion of criteria for compactness of various spaces of subsets of a lattice, including spaces of filters, prime filters etc.

We formulate a restricted version of the Tukey-Teichmüller Theorem that we denote by (rTT). We then prove that (rTT) and (BPI) are equivalent in ZF and that (rTT) applies rather naturally to several equivalent forms of (BPI): Alexander Subbase Theorem, Stone Representation Theorem, Model Existence and Compactness Theorems for propositional and first-order logic. We also give two variations of (rTT) that we denote by (rTT)+ and (rTT)++; each is equivalent to (rTT) in ZF. The variation (rTT)++ applies rather naturally to (...) various Selection Lemmas due to Cowen, Engeler, and Rado. (shrink)

We propose developing the theory of consequences of morasses relevant in mathematical applications in the language alternative to the usual one, replacing commonly used structures by families of sets originating with Velleman’s neat simplified morasses called 2-cardinals. The theory of related trees, gaps, colorings of pairs and forcing notions is reformulated and sketched from a unifying point of view with the focus on the applicability to constructions of mathematical structures like Boolean algebras, Banach spaces or compact spaces. The (...) paper is dedicated to the memory of Jim Baumgartner whose seminal joint paper :109–129, 1987) with Saharon Shelah provided a critical mass in the theory in question. A new result which we obtain as a side product is the consistency of the existence of a function \ with the appropriate \-version of property \ for regular \ satisfying \. (shrink)

Abstract. Gettier’s famous examples intended to show that knowledge cannot always be equated with justified true belief. The Gettier problem can also be considered as a problem for topological epistemic logic: If knowledge and justified belief are conceived as topological operators K and B on topological spaces (to be considered as universes of possible worlds), one may ask whether it happens that there is a proposition A such that KA ≠ A & BA or not. If this is the case, (...) the epistemological logic defined by the topological operators K and B may be said to be non-traditional since there is for them a “Gettier proposition” where knowledge does not coincide with justified true belief. As far as we know, for the first time, this topological Gettier problem is discussed in Steinvold’s PhD dissertation (Steinsvold 2012). In Baltag, Bezhanishvili, Özgün, and Smets (2013), Steinvold’s co-derived set account is criticized since it can be easily “Gettierized”. Baltag et alii claim (without proof) that their topological account of Stalnaker’s logic KB of knowledge and belief does not have this flaw. In the following we will give some topological conditions that determine whether a topological KB model does or does not cope with the Gettier challenge. First, it will be shown that every KB model defines a (topologically slightly simplified) model that is rather similar to it but a is a model of traditional JTB (knowledge = justified true belief) logic of knowledge and belief. The existence of such doppelgangers of all KB models may be read as a qualified and partial topological rehabilitation of traditional JTB epistemology. Second, we consider the Gettier problem for a special class of models of Stalnaker’s combined logic of knowledge and belief KB, namely, for T0 Alexandroff spaces. We prove that, that almost all Alexandroff spaces do not face Gettier counterexamples. Third, we prove that the Stone spaces of Boolean algebras of regular closed subsets of Hausdorff (or T2) spaces X do not face Gettier counterexamples if the X are not pseu–docompact, and these Stone spaces do face Gettier counterexamples for compact spaces X. Succinctly formulated, Stalnaker’s KB logic of knowledge and belief can avoid Gettier problems for some models, while it falls back to traditional pre-Gettier JTB epistemology for other models. In contrast, co-derived set semantics is doomed to fail always in the sense that its models always fall prey to Gettier counterexamples. (shrink)

Let X be an infinite set and let and denote the propositions “every filter on X can be extended to an ultrafilter” and “X has a free ultrafilter”, respectively. We denote by the Stone space of the Boolean algebra of all subsets of X. We show: For every well‐ordered cardinal number ℵ, (ℵ) iff (2ℵ). iff “ is a continuous image of ” iff “ has a free open ultrafilter ” iff “every countably infinite subset of has a (...) limit point”. implies “every open filter on extends to an open ultrafilter” implies “has an open ultrafilter” implies It is relatively consistent with that (ω) holds, whereas (ω) fails. In particular, none of the statements given in (2) implies (ω). (shrink)

§1. Introduction. Ideals and filters of subsets of natural numbers have been studied by set theorists and topologists for a long time. There is a vast literature concerning various kinds of ultrafilters. There is also a substantial interest in nicely definable ideals—these by old results of Sierpiński are very far from being maximal— and the structure of such ideals will concern us in this announcement. In addition to being interesting in their own right, Borel and analytic ideals occur naturally in (...) the investigations of compact subsets of the space of all Baire class 1 functions on a Polish space, see [12, 18]. Also, certain objects associated with such ideals are of considerable interest and were quite extensively studied by several authors. Let us list here three examples; in all three of them I stands for an analytic or Borel ideal.1. The partial order induced by I on P: X ≥I Y iff X \ Y ϵ I and the partial order.2. Boolean algebras of the form P/I and their automorphisms.3. The equivalence relation associated with I: XEI Y iff X Δ ϵ I.In Section 4, we will have an opportunity to state some consequences of our results for equivalence relations as in 3. (shrink)

The paper studies how the localic notion of sublocale transfers to formal topology. For any formal topology (not necessarily with positivity predicate) we define a sublocale to be a cover relation that includes that of the formal topology. The family of sublocales has set-indexed joins. For each set of base elements there are corresponding open and closed sublocales, boolean complements of each other. They generate a boolean algebra amongst the sublocales. In the case of an inductively generated (...) formal topology, the collection of inductively generated sublocales has coframe structure. Overt sublocales and weakly closed sublocales are described, and related via a new notion of "rest closed" sublocale to the binary positivity predicate. Overt, weakly closed sublocales of an inductively generated formal topology are in bijection with "lower powerpoints", arising from the impredicative theory of the lower powerlocale. Compact sublocales and fitted sublocales are described. Compact fitted sublocales of an inductively generated formal topology are in bijection with "upper powerpoints", arising from the impredicative theory of the upper powerlocale. (shrink)

We generalize the double negation construction of Boolean algebras in Heyting algebras to a double negation construction of the same in Visser algebras. This result allows us to generalize Glivenko’s theorem from intuitionistic propositional logic and Heyting algebras to Visser’s basic propositional logic and Visser algebras.

In [4] R.Cowen considers a generalization of the resolution rule for hypergraphs and introduces a notion of satisfiability of families of sets of vertices via 2-colorings piercing elements of such families. He shows, for finite hypergraphs with no one-element edges that if the empty set is a consequence ofA by the resolution rule, thenA is not satisfiable. Alas the converse is true for a restricted class of hypergraphs only, and need not to be true in the general case. In this (...) paper we show that weakening slightly the notion of satisfiability, we get the equivalence of unsatisfiability and the derivability of the empty set for any hypergraph. Moreover, we show the compactness property of hypergraph satisfiability and state its equivalence to BPI, i.e. to the statement that in every Boolean algebra there exists an ultrafilter. (shrink)

This undergraduate textbook covers the key material for a typical first course in logic, in particular presenting a full mathematical account of the most important result in logic, the Completeness Theorem for first-order logic. Looking at a series of interesting systems, increasing in complexity, then proving and discussing the Completeness Theorem for each, the author ensures that the number of new concepts to be absorbed at each stage is manageable, whilst providing lively mathematical applications throughout. Unfamiliar terminology is kept to (...) a minimum, no background in formal set-theory is required, and the book contains proofs of all the required set theoretical results. The reader is taken on a journey starting with König's Lemma, and progressing via order relations, Zorn's Lemma, Boolean algebras, and propositional logic, to completeness and compactness of first-order logic. As applications of the work on first-order logic, two final chapters provide introductions to model theory and nonstandard analysis. (shrink)

We offer an alternative approach to the existing methods for intuitionistic formalization of reasoning about probability. In terms of Kripke models, each possible world is equipped with a structure of the form $\langle H, \mu \rangle$ that needs not be a probability space. More precisely, though _H_ needs not be a Boolean algebra, the corresponding monotone function (we call it measure) $\mu : H \longrightarrow [0,1]_{\mathbb {Q}}$ satisfies the following condition: if $\alpha$, $\beta$, \(\alpha \wedge (...) \beta \), $\alpha \vee \beta \in H$, then $\mu (\alpha \vee \beta ) = \mu (\alpha ) + \mu (\beta ) - \mu (\alpha \wedge \beta )$. Since the range of $\mu$ is the set $[0,1]_{\mathbb {Q}}$ of rational numbers from the real unit interval, our logic is not compact. In order to obtain a strong complete axiomatization, we introduce an infinitary inference rule with a countable set of premises. The main technical results are the proofs of strong completeness and decidability. (shrink)

This thesis is divided into three parts, the first and second ones focused on combinatorics and classification problems on discrete and geometrical objects in the context of descriptive set theory, and the third one on generalized descriptive set theory at singular cardinals of countable cofinality.Descriptive Set Theory (briefly: DST) is the study of definable subsets of Polish spaces, i.e., separable completely metrizable spaces. One of the major branches of DST is Borel reducibility, successfully used in the last 30 years to (...) solve and compare many classification problems. One of our goals is the classification of knots, very familiar and tangible objects in everyday life, which also play an important role in modern mathematics. The study of knots and their properties is known as knot theory. Our plan is to gain insight into knots using discrete objects, such as linear and circular orders. This approach was already exploited in [6]. The first part of this work is therefore devoted to countable linear orders and the study of the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results. We also expand our research to the case of circular orders.Another objective of this first part is to extend the notion of convex embeddability on countable linear orders. We provide a family of quasi-orders of which embeddability is a particular case as well. We study these quasi-orders from a combinatorial point of view and analyse their complexity with respect to Borel reducibility. Furthermore, we extend the analysis of these quasi-orders to the set of uncountable linear orders.The second part of the project deals with classification problems on knots and $3$ -manifolds. The goal here is to apply the results obtained in the first part to the study of proper arcs and knots, establishing lower bounds for the complexity of some natural relations between these geometrical objects. We also obtain some combinatorial results which are particularly interesting when we restrict to the set of wild proper arcs and wild knots, classes which haven’t received much attention so far. These parts are included in the two preprints [4, 5] in collaboration with my supervisor Alberto Marcone, Luca Motto Ros (University of Torino), and Vadim Weinstein (University of Oulu).The second part of this work also includes the classification of non-compact $3$ -manifolds up to homeomorphism (the case of compact $3$ -manifolds has already been solved: indeed, there are only countably many $3$ -manifolds up to homeomorphism; see [7]), and that of Cantor sets of $\mathbb {R}^3$ up to conjugation (answering to Question 5.5 of [3]). Here we resort to algebraic tools. Stone duality gives a neat way to go back-and-forth between totally disconnected Polish spaces and countable Boolean algebras (see [1]). The main ingredient is the Stone space of all ultrafilters on a Boolean algebra. In this work we introduce a weaker concept which we call “blurry filter”. Using blurry filters instead of ultrafilters enables one to extend the class of spaces under consideration beyond totally disconnected. As an application of this method, we show that both homeomorphism on non-compact $3$ -manifolds and conjugation of Cantor sets in $\mathbb {R}^3$ are completely classifiable by countable structures. These results are part of an upcoming paper in collaboration with Vadim Weinstein.The last part of this thesis concerns the natural generalization of descriptive set theory that occurs when countable is replaced by uncountable, called Generalized Descriptive Set Theory (briefly: GDST). In particular, we focus on the case of GDST for a singular cardinal $\kappa $ of countable cofinality. The goal here is to study the generalizations of the Perfect Set Property and the Baire Property to subsets of spaces of higher cardinalities, like the power set $\mathcal {P}(\kappa )$. We consider the question under which large cardinal hypotheses classes of definable subsets of these spaces possess such regularity properties, focusing on rank-into-rank axioms, like I2, and classes of sets definable by $\Sigma _1$ -formulas with parameters from various collections of sets. The obtained results are included in [2], a joint work with my co-supervisor Vincenzo Dimonte and Philipp Lücke (University of Hamburg).Abstract prepared by Martina IannellaE-mail: martina.iannella@tuwien.ac.at.URL: https://air.uniud.it/handle/11390/1262824. (shrink)

On our ordinary representations of space, space is composed of indivisible, dimensionless points; extended regions are understood as infinite sets of points. Region-based theories of space reverse this atomistic picture, by taking as primitive several relations on extended regions, and recovering points as higher-order abstractions from regions. Over the years, such theories have focused almost exclusively on the topological and geometric structure of space. We introduce to region-based theories of space a new primitive binary relation (‘qualitative probability’) that is tied (...) to _measure_. It expresses that one region is _smaller than or equal in size_ to another. Algebraic models of our theory are _separation_ _σ_-_algebras with qualitative probability_: $(\mathbb {B}, \ll, \preceq )$, where $\mathbb {B}$ is a Boolean _σ_-algebra, ≪ is a separation relation on $\mathbb {B}$, and ≼ is a qualitative probability on $\mathbb {B}$. We show that from algebraic models of this kind we can, in an interesting class of cases, recover a compact Hausdorff topology _X_, together with a countably additive measure _μ_ on a _σ_-field of Borel subsets of that topology, and that $(\mathbb {B}, \ll, \preceq )$ is isomorphic to a ‘standard model’ arising out of the pair (_X_, _μ_). It follows from one of our main results that any closed ball in Euclidean space, $\mathbb {R}^{n}$, together with Lebesgue measure arises in this way from a separation _σ_-algebra with qualitative probability. (shrink)

Tarski defined a way of assigning to each Boolean algebra, B, an invariant inv(B) ∈ In, where In is a set of triples from ℕ, such that two Boolean algebras have the same invariant if and only if they are elementarily equivalent. Moreover, given the invariant of a Boolean algebra, there is a computable procedure that decides its elementary theory. If we restrict our attention to dense Boolean algebras, these invariants determine the algebra (...) up to isomorphism. In this paper we analyze the complexity of the question "Does B have invariant x?" For each x ∈ In we define a complexity class Γx that could be either Σⁿ, Πⁿ, Σⁿ ∧ Πⁿ, or Πω+1 depending on x, and we prove that the set of indices for computable Boolean algebras with invariant x is complete for the class Γx. Analogs of many of these results for computably enumerable Boolean algebras were proven in earlier works by Selivanov. In a more recent work, he showed that similar methods can be used to obtain the results for computable ones. Our methods are quite different and give new results as well. As the algebras we construct to witness hardness are all dense, we establish new similar results for the complexity of various isomorphism problems for dense Boolean algebras. (shrink)

The Baire algebra of a topological space X is the quotient of the algebra of all subsets of X modulo the meager sets. We show that this Boolean algebra can be endowed with a natural closure operator, resulting in a closure algebra which we denote $\mathbf {Baire}(X)$. We identify the modal logic of such algebras to be the well-known system $\mathsf {S5}$, and prove soundness and strong completeness for the cases where X is crowded and (...) either completely metrizable and continuum-sized or locally compact Hausdorff. We also show that every extension of $\mathsf {S5}$ is the modal logic of a subalgebra of $\mathbf {Baire}(X)$, and that soundness and strong completeness also holds in the language with the universal modality. (shrink)

For a signature L with at least one constant symbol, an L‐structure is called minimal if it has no proper substructures. Let be the set of isomorphism types of minimal L‐structures. The elements of can be identified with ultrafilters of the Boolean algebra of quantifier‐free L‐sentences, and therefore one can define a Stone topology on. This topology on generalizes the topology of the space of n‐marked groups. We introduce a natural ultrametric on, and show that the Stone topology (...) on coincides with the topology of the ultrametric space iff the ultrametric space is compact iff L is locally finite (that is, L contains finitely many n‐ary symbols for any ). As one of the applications of compactness of the Stone topology on, we prove compactness of certain classes of metric spaces in the Gromov‐Hausdorff topology. This slightly refines the known result based on Gromov's ideas that any uniformly totally bounded class of compact metric spaces is precompact. (shrink)

In this article we characterize all those sequences of cardinals of length ω1 which are cardinal sequences of some compact scattered space . This extends the similar results from [R. La Grange, Concerning the cardinal sequence of a Boolean algebra, Algebra Universalis, 7 307–313] for such sequences of countable length. For ordinals between ω1 and ω2 we can only give a sufficient condition for a sequence of that length to be a cardinal sequence of a (...) class='Hi'>compact scattered space. This condition is, arguably, the most one can expect in ZFC. In any case, ours is a significant extension of the sufficient conditions given in [J.C. Martinez, A consistency result on thin-tall superatomic Boolean algebras, Proc. Amer. Math. Soc. 115 473–477] and [J. Bagaria, Locally generic Boolean algebras and cardinal sequences, Algebra Universalis 47 283–302]. (shrink)

Some aspects of the theory of Boolean algebras and distributive lattices–in particular, the Stone Representation Theorems and the properties of filters and ideals–are analyzed in a constructive setting.

The theorems of the propositional calculus and the predicate calculus are stated, and the analogous principles of Boolean Algebra are identified. Also, the primary principles of modal logic are stated, and a procedure is described for identifying their Boolean analogues.

We introduce properties of Boolean algebras which are closely related to the existence of winning strategies in the Banach-Mazur Boolean game. A σ-short Boolean algebra is a Boolean algebra that has a dense subset in which every strictly descending sequence of length ω does not have a nonzero lower bound. We give a characterization of σ-short Boolean algebras and study properties of σ-short Boolean algebras.

If κ is an infinite cardinal, a complete Boolean algebra B is called κ-supported if for each sequence 〈bβ : β αbβ = equation imagemath imageequation imageβ∈Abβ holds. Combinatorial and forcing equivalents of this property are given and compared with the other forcing related properties of Boolean algebras . The set of regular cardinals κ for which B is not κ-supported is investigated.

In this paper we investigate Boolean algebras and their subalgebras in Alternative Set Theory . We show that any two countable atomless Boolean algebras are isomorphic and we give an example of such a Boolean algebra. One other main result is, that there is an infinite Boolean algebra freely generated by a set. At the end of the paper we show that the sentence “There is no non-trivial free group which is a set” is (...) consistent with AST. (shrink)

We describe the countably saturated models and prime models of the theory Thprin of Boolean algebras with a principal ideal, the theory Thmax of Boolean algebras with a maximal ideal, the theory Thac of atomic Boolean algebras with an ideal such that the supremum of the ideal exists, and the theory Thsa of atomless Boolean algebras with an ideal such that the supremum of the ideal exists. We prove that there are infinitely many completions of the (...) theory of Boolean algebras with a distinguished ideal that do not have a countably saturated model. Also, we give a sufficient condition for a model of the theory TX of Boolean algebras with distinguished ideals to be elementarily equivalent to a countably saturated model of TX. (shrink)

We consider the theory Thprin of Boolean algebras with a principal ideal, the theory Thmax of Boolean algebras with a maximal ideal, the theory Thac of atomic Boolean algebras with an ideal where the supremum of the ideal exists, and the theory Thsa of atomless Boolean algebras with an ideal where the supremum of the ideal exists. First, we find elementary invariants for Thprin and Thsa. If T is a theory in a first order language and (...) α is a linear order with least element, then we let Sentalg be the Lindenbaum-Tarski algebra with respect to T, and we let intalg be the interval algebra of α. Using rank diagrams, we show that Sentalg ⋍ intalg, Sentalg ⋍ intalg ⋍ Sentalg, and Sentalg ⋍ intalg. For Thmax and Thac we use Ershov's elementary invariants of these theories. We also show that the algebra of formulas of the theory Tx of Boolean algebras with finitely many ideals is atomic. (shrink)

By using the notion of a simplified (κ,1)-morass, we construct κ-thin-tall, κ-thin-thick and, in a forcing extension, κ-very thin-thick superatomic Boolean algebras for every infinite regular cardinal κ.

Following the theory of Boolean algebras with modal operators , in this paper we investigate Boolean algebras with sufficiency operators and mixed operators . We present results concerning representability, generation by finite members, first order axiomatisability, possession of a discriminator term etc. We generalise the classes BAO, SUA, and MIA to classes of algebras with the families of relative operators. We present examples of the discussed classes of algebras that arise in connection with reasoning with incomplete information.

We show, roughly speaking, that it requires ω iterations of the Turing jump to decode nontrivial information from Boolean algebras in an isomorphism invariant fashion. More precisely, if α is a recursive ordinal, A is a countable structure with finite signature, and d is a degree, we say that A has αth-jump degree d if d is the least degree which is the αth jump of some degree c such there is an isomorphic copy of A with universe ω (...) in which the functions and relations have degree at most c. We show that every degree d ≥ 0 (ω) is the ωth jump degree of a Boolean algebra, but that for $n no Boolean algebra has nth-jump degree $\mathbf{d} > 0^{(n)}$ . The former result follows easily from work of L. Feiner. The proof of the latter result uses the forcing methods of J. Knight together with an analysis of various equivalences between Boolean algebras based on a study of their Stone spaces. A byproduct of the proof is a method for constructing Stone spaces with various prescribed properties. (shrink)