Maximal theories

DOI10.1016/0168-0072(87)90083-2zbMath0629.03019OpenAlexW4210249189MaRDI QIDQ1093629

Rodney G. Downey

Publication date: 1987

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(87)90083-2

zbMATH Keywords

maximalitycountable atomless Boolean algebrar.e. idealsr.e. theories of proportions

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Related Items (9)

Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures ⋮ Degrees containing members of thin Π10 classes are dense and co-dense ⋮ Initial segments of the lattice of Π₁⁰ classes ⋮ The Lattice of Computably Enumerable Vector Spaces ⋮ Effectively closed sets and enumerations ⋮ Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees ⋮ The upward closure of a perfect thin class ⋮ Countable thin \(\Pi^0_1\) classes ⋮ Sound, totally sound, and unsound recursive equivalence types

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degrees of members of \(\Pi_ 1^ 0\) classes
• ON A QUESTION OF A. RETZLAFF
• Theory of Formal Systems. (AM-47)
• Pseudo Jump Operators. I: The R. E. Case
• Automorphisms of supermaximal subspaces
• Definable structures in the lattice of recursively enumerable sets
• Co-immune subspaces and complementation inV_∞
• Recursion theory on algebraic structures with independent sets
• The infinite injury priority method
• Recursively enumerable vector spaces
• Recursively enumerable Boolean algebras
• Abstract dependence, recursion theory, and the lattice of recursively enumerable filters
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Axiomatizable theories with few axiomatizable extensions
• ∏ 0 1 Classes and Degrees of Theories

This page was built for publication: Maximal theories