Effectively inseparable Boolean algebras in lattices of sentences
DOI10.1007/s00153-009-0161-3zbMath1184.03041OpenAlexW1987745576MaRDI QIDQ2655144
Publication date: 22 January 2010
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-009-0161-3
degrees of interpretabilitydiagonalizable algebrasarithmetic theoriesideal definabilitylattices of \(\Sigma_n\) sentences
Undecidability and degrees of sets of sentences (03D35) First-order arithmetic and fragments (03F30) Boolean algebras with additional operations (diagonalizable algebras, etc.) (06E25) Theory of numerations, effectively presented structures (03D45) Relative consistency and interpretations (03F25)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Coding in the partial order of enumerable sets
- On Partially Conservative Sentences and Interpretability
- Universal recursion theoretic properties of r.e. preordered structures
- Undecidability in diagonalizable algebras
- Intervals of the Lattice of Computably Enumerable Sets and Effective Boolean Algebras
- Effectively dense Boolean algebras and their applications
- THE ∀∃ THEORY OF PEANO Σ1 SENTENCES
- Deduction-preserving "Recursive Isomorphisms" between theories
- Effectively extensible theories
This page was built for publication: Effectively inseparable Boolean algebras in lattices of sentences