scientific article

zbMath0912.03019MaRDI QIDQ3130249

Sergei S. Goncharov

Publication date: 23 April 1997

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

zbMATH Keywords

Boolean algebrascountable modelsmodel-theoretical, algebraic, and computability aspects of Boolean and Ershov algebras

Mathematics Subject Classification ID

Model-theoretic algebra (03C60) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Decidability of theories and sets of sentences (03B25) 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 (35)

Degree spectra and computable dimensions in algebraic structures ⋮ Definable Subsets of Polynomial-Time Algebraic Structures ⋮ Abelian \(p\)-groups and the halting problem ⋮ Prime Model with No Degree of Autostability Relative to Strong Constructivizations ⋮ On a question of Kalimullin ⋮ Boolean algebras realized by c.e. equivalence relations ⋮ Effective categoricity for distributive lattices and Heyting algebras ⋮ Computable torsion abelian groups ⋮ The theories of superatomic Boolean algebras with distinguished subalgebra which lack countably saturated models ⋮ Computable Stone spaces ⋮ Punctually presented structures I: Closure theorems ⋮ Regular bi-interpretability of Chevalley groups over local rings ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Index sets of autostable relative to strong constructivizations constructive models for familiar classes ⋮ Proper divisibility in computable rings ⋮ Algebraic structures computable without delay ⋮ On the isomorphism problem for measures on Boolean algebras ⋮ Index Sets of Constructive Models that are Autostable Under Strong Constructivizations ⋮ Perfect Local Computability of Superatomic Boolean Algebras ⋮ Boolean algebras, Tarski invariants, and index sets ⋮ A note on computable distinguishing colorings ⋮ Punctual dimension of algebraic structures in certain classes ⋮ Computable topological groups and Pontryagin duality ⋮ Computable metrics above the standard real metric ⋮ Partial automorphism semigroups ⋮ Categoricity spectra of computable structures ⋮ What is nominalistic mereology? ⋮ FOUNDATIONS OF ONLINE STRUCTURE THEORY ⋮ Categorical linearly ordered structures ⋮ On bi-embeddable categoricity of algebraic structures ⋮ Computably categorical Boolean algebras enriched by ideals and atoms ⋮ On computable presentations of some functional lattices ⋮ ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES ⋮ COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM ⋮ Algebraic Geometry over Heyting Algebras

This page was built for publication: