\(\aleph_0\)-categoricity for rings without nilpotent elements and for Boolean structures
From MaRDI portal
Publication:1233438
DOI10.1016/0021-8693(76)90148-4zbMath0346.02031OpenAlexW1984223219MaRDI QIDQ1233438
Joseph G. Rosenstein, Angus J. Macintyre
Publication date: 1976
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-8693(76)90148-4
Related Items (17)
\(\aleph _ 0\)-categoricity in infra primal varieties ⋮ On Vaught’s Conjecture and finitely valued MV algebras ⋮ Unnamed Item ⋮ Théories d'algèbres de Boole munies d'idéaux distingués. II ⋮ On \(\aleph_0\)-categoricity of filtered Boolean extensions ⋮ Stone space partitions indexed by a poset ⋮ On \(\aleph_0\)-categorical nilrings ⋮ QE rings in characteristic pn ⋮ \(\aleph_0\)-categoricity and stability of rings ⋮ Preservation theorems for limits of structures and global sections of sheaves of structures ⋮ Stability theory and Algebra ⋮ Totally categorical groups and rings ⋮ On ℵ0-categorical nilrings. II ⋮ On the structure of \(\aleph_0\)-categorical groups ⋮ On the size of congruence lattices for models of theories with definability of congruences ⋮ Algebraic \(K\)-theory of special groups ⋮ On the preservation of elementary equivalence and embedding by bounded filtered powers and structures of stable continuous functions
Cites Work
- \(\aleph_0\)-categoricity of groups
- Model Companions for ℵ 0 -Categorical Theories
- On formulas of one variable in intuitionistic propositional calculus
- Model-completeness for sheaves of structures
- Omitting types of prenex formulas
- $ℵ_0$-categoricity of linear orderings
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Subrings of Direct Sums
- Topological Representation of Algebras
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: \(\aleph_0\)-categoricity for rings without nilpotent elements and for Boolean structures