scientific article; zbMATH DE number 934728

Publication date: 14 October 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Boolean algebra Boolean lattice Boolean ring generating tree elementary characteristic of a Boolean algebra Ershov-Tarski ideal elementary theory Ershov algebra dense Boolean linearly ordered generating set recursion-theoretic model theory

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Structure theory of Boolean algebras (06E05) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Research exposition (monographs, survey articles) pertaining to ordered structures (06-02)

Related Items (38)

Degrees of autostability for prime Boolean algebras ⋮ Degrees of autostability relative to strong constructivizations for Boolean algebras ⋮ Effectively categorical abelian groups ⋮ The Boolean Algebra of Piecewise Testable Languages ⋮ \(\Sigma\)-bounded algebraic systems and universal functions. II ⋮ Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism ⋮ Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations ⋮ Preserving categoricity and complexity of relations ⋮ Punctual copies of algebraic structures ⋮ Simple weakly transitive modal algebras ⋮ Computable numberings of the class of Boolean algebras with distinguished endomorphisms ⋮ Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism ⋮ The minimality of certain decidability conditions for Boolean algebras ⋮ Boolean algebras autostable relative to \(n\)-decidable presentations ⋮ Weak interpolation in extensions of the logics S4 and K4 ⋮ Degrees of categoricity for superatomic Boolean algebras ⋮ A note on algebras of languages ⋮ Categoricity for primitive recursive and polynomial Boolean algebras ⋮ The index set of Boolean algebras autostable relative to strong constructivizations ⋮ Autostability relative to strong constructivizations of Boolean algebras with distinguished ideals ⋮ Finitely-axiomatizable superatomic Boolean algebras with distinguished dense subalgebra of finite width ⋮ Interpolation in weakly transitive modal logics ⋮ The existence of strongly computable representations in the class of Boolean algebras ⋮ Boolean algebras of elementary characteristic \((1, 0, 1)\) whose set of atoms and Ershov-Tarski ideal are computable ⋮ Local and nonvanishing superatomic Boolean algebras with a distinguished dense subalgebra ⋮ 2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms ⋮ Boolean Algebras with Distinguished Endomorphisms and Generating Trees ⋮ Degrees of autostability relative to strong constructivizations ⋮ Degree spectra of structures ⋮ On the applicability to semirings of two theorems from the theory of rings and modules. ⋮ A Computable Structure with Non-Standard Computability ⋮ Autostability of Boolean algebras with distinguished ideal ⋮ Classification from a Computable Viewpoint ⋮ Automorphisms of Boolean algebras which are recursive over atoms ⋮ Boolean algebras of regular languages ⋮ Strong constructivizability of Boolean algebras of elementary characteristic \((\infty, 0, 0)\) ⋮ Recursive automorphisms of atomic Boolean algebras ⋮ Autostability spectra for Boolean algebras

This page was built for publication: