Some Boolean algebras with finitely many distinguished ideals II

We describe the countably saturated models and prime models (up to isomorphism) of the theory Th_prin of Boolean algebras with a principal ideal, the theory Th_max of Boolean algebras with a maximal ideal, the theory Th_ac of atomic Boolean algebras with an ideal such that the supremum of the ideal exists, and the theory Th_sa 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 T_X of Boolean algebras with distinguished ideals to be elementarily equivalent to a countably saturated model of T_X.     

Hyperarithmetical Boolean Algebras with a Distinguished Ideal

We prove a general theorem that allows us to pass from a hyperarithmetical Boolean algebra with a distinguished ideal to some computable Boolean algebra connected with the former by natural algebraic operations. Some examples are given.     

Complexity of some natural problems on the class of computable I-algebras

We study computable Boolean algebras with distinguished ideals (I-algebras for short). We prove that the isomorphism problem for computable I-algebras is Σ ₁ ¹ -complete and show that the computable isomorphism problem and the computable categoricity problem for computable I-algebras are Σ ₃ ⁰ -complete.     

Computable Families of Superatomic Boolean Algebras

We describe the families of superatomic Boolean algebras which have a computable numbering. We define the notion of majorizability and establish a criterion that is formulated only on using algorithmic terms and majorizability. We give some examples showing that the condition of majorizability is essential. We also prove some criterion for the existence of a computable numbering for a family of -atomic algebras ( is a computable ordinal).     

Boolean Algebras with Finite Families of Computable Automorphisms

We prove that each computable Boolean algebra has a computable presentation in which for every computable family of automorphisms the set of atoms moved by at least one of its members is finite. This implies that each computable atomic Boolean algebra has a computable presentation in which its every computable family of automorphisms is finite. The priority argument is not used in the proof.     

Degree Spectra of Relations on Boolean Algebras

We show that every computable relation on a computable Boolean algebra is either definable by a quantifier-free formula with constants from (in which case it is obviously intrinsically computable) or has infinite degree spectrum.     

Unsupported Boolean algebras and forcing

If κ is an infinite cardinal, a complete Boolean algebra B is called κ‐supported if for each sequence 〈b_β : β < κ〉 of elements of B the equality _{α<κ β>α} b_β = equation/tex2gif-inf-5.gif _β∈A b_β holds. Combinatorial and forcing equivalents of this property are given and compared with the other forcing related properties of Boolean algebras (distributivity, caliber, etc.). The set of regular cardinals κ for which B is not κ‐supported is investigated. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

The Lindenbaum-Tarski algebra for Boolean algebras with distinguished ideals

A complete solution is given to the problem of describing algebras with distinguished ideals, formulated by Peretyatkin. It is proven that such an algebra is isomorphic to _× , an interval algebra of the linear ordering × . I-algebras the elementary theory of each of which is axiomatizable by a single atom in some finite quotient with respect to the Frechet ideal of the Lindenbaum-Tarski algebra for the class of Boolean algebras with distinguished ideals are fully described in terms of direct summands.Translated fromAlgebra i Logika, Vol. 34, No. 1, pp. 88–116, January–February, 1995.     

Complexity of Categorical Theories with Computable Models

M. Lerman and J. Scmerl specified some sufficient conditions for computable models of countably categorical arithmetical theories to exist. More precisely, it was shown that if T is a countably categorical arithmetical theory, and the set of its sentences beginning with an existential quantifier and having at most n+1 alternations of quantifiers is _n+1 ⁰ for any n, then T has a computable model. J. Night improved this result by allowing certain uniformity and omitting the requirement that T is arithmetical. However, all of the known examples of theories of₀-categorical computable models had low level of algorithmic complexity, and whether there are theories that would satisfy the above conditions for sufficiently large n was unknown. This paper will include such examples.     

Iterations of Boolean algebras with measure

We consider a classM of Boolean algebras with strictly positive, finitely additive measures. It is shown thatM is closed under iterations with finite support and that the forcing via such an algebra does not destroy the Lebesgue measure structure from the ground model. Also, we deduce a simple characterization of Martin's Axiom reduced to the classM.     

Computable Homogeneous Boolean Algebras and a Metatheorem

We consider computable homogeneous Boolean algebras. Previously, countable homogeneous Boolean algebras have been described up to isomorphism and a simple criterion has been found for the existence of a strongly constructive (decidable) isomorphic copy for such. We propose a natural criterion for the existence of a constructive (computable) isomorphic copy. For this, a new hierarchy of -computable functions and sets is introduced, which is more delicate than Feiner's. Also, a metatheorem is proved connecting computable Boolean algebras and their hyperarithmetical quotient algebras.     

Computably categorical Boolean algebras enriched by ideals and atoms

We describe computably categorical Boolean algebras whose language is enriched by one-place predicates that distinguish a finite set of ideals and atoms with respect to some ideals in this set.     

Uniformity in Computable Structure Theory

We investigate the effects of adding uniformity requirements to concepts in computable structure theory such as computable categoricity (of a structure) and intrinsic computability (of a relation on a computable structure). We consider and compare two different notions of uniformity, previously studied by Kudinov and by Ventsov. We discuss some of their results and establish new ones, while also exploring the connections with the relative computable structure theory of Ash, Knight, Manasse, and Slaman and Chisholm and with previous work of Ash, Knight, and Slaman on uniformity in a general computable structure-theoretical setting.     

Games and general distributive laws in Boolean algebras

The games and are played by two players in -complete and max -complete Boolean algebras, respectively. For cardinals such that or , the -distributive law holds in a Boolean algebra iff Player 1 does not have a winning strategy in . Furthermore, for all cardinals , the -distributive law holds in iff Player 1 does not have a winning strategy in . More generally, for cardinals such that , the -distributive law holds in iff Player 1 does not have a winning strategy in . For regular and , implies the existence of a Suslin algebra in which is undetermined.

     

Boolean products of R0‐algebras

In this paper, the (weak) Boolean representation of R₀‐algebras are investigated. In particular, we show that directly indecomposable R₀‐algebras are equivalent to local R₀‐algebras and any nontrivial R₀‐algebra is representable as a weak Boolean product of local R₀‐algebras (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On poset Boolean algebras of scattered posets with finite width

We prove that the poset algebra of every scattered poset with finite width is embeddable in the poset algebra of a well ordered poset.Mathematics Subject Classification (2000):Primary 03G05, 06A06, 06A11; Secondary 08A05, 54G12     

Topological representation for monadic implication algebras

In this paper, every monadic implication algebra is represented as a union of a unique family of monadic filters of a suitable monadic Boolean algebra. Inspired by this representation, we introduce the notion of a monadic implication space, we give a topological representation for monadic implication algebras and we prove a dual equivalence between the category of monadic implication algebras and the category of monadic implication spaces.