Maximal theories

DOI10.1016/0168-0072(87)90083-2MaRDI QIDQ1093629zbMATH OpenOpenAlexFDO

Authors 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

countable atomless Boolean algebramaximalityr.e. idealsr.e. theories of proportions

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Review text

This paper studies the concept of ``maximality in the lattice L of r.e. theories of proportions based on a fixed recursive set of literals \(\{P_ i:\) \(i\in \omega \}\) (or equivalently, the lattice of r.e. ideals in the recursive copy of the countable atomless Boolean algebra). \textit{D. A. Martin} and \textit{M. B. Pour-El} [`Axiomatizable theories with few axiomatizable extensions' J. Symb. Logic 35, 205-209 (1970; Zbl 0209.012)] constructed an r.e. theory T with few r.e. extensions: that is T is essentially undecidable and all r.e. extensions of T are principal over T. In fact, their T was also constructed as generated by \(\{P_ i:\) \(i\in A\}\cup \{\bar P_ j:\) \(j\in B\}\) for suitable A and B. We show such theories can exist in some but not all r.e. degrees, and they can have low degrees. Subsequent work of \textit{C. G. Jockusch}, \textit{M. Stob} and the author [``Array nonrecursive sets and multiple permitting arguments (in preparation)] have shown that such T occur in exactly the ``array nonrecursive degrees. The paper also studies other concepts of maximality in L and also in L' the lattice of r.e. sub-theories of a fixed deciable complete theory. The techniques are of course algebraic priority arguments.

Recommendations

• Some New Lattice Constructions in High R. E. Degrees
• Some undecidability results for lattices in recursion theory
• On maximal theories
• Maximal r.e. equivalence relations
• Upper semilattice of recursively enumerable Q-degrees

Cites work

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

Cited in

(13)

• Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures
• Countable thin ^0_1 classes
• Automorphisms of the lattice of _1⁰ classes; perfect thin classes and anc degrees
• The Lattice of Computably Enumerable Vector Spaces
• Why the theory R is special
• Recursion theory in a lower semilattice
• Diagonals and -maximal sets
• Initial segments of the lattice of Π₁⁰ classes
• Degrees containing members of thin _1⁰ classes are dense and co-dense
• Maximality and refutability
• Sound, totally sound, and unsound recursive equivalence types
• Effectively closed sets and enumerations
• The upward closure of a perfect thin class

This page was built for publication: Maximal theories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1093629)