Effectively inseparable Boolean algebras in lattices of sentences

DOI10.1007/s00153-009-0161-3zbMath1184.03041MaRDI QIDQ2655144

V. Yu. Shavrukov

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

zbMATH Keywords

degrees of interpretability; diagonalizable algebras; arithmetic theories; ideal definability; lattices of \(\Sigma_n\) sentences

Mathematics Subject Classification ID

03D35: Undecidability and degrees of sets of sentences

03F30: First-order arithmetic and fragments

06E25: Boolean algebras with additional operations (diagonalizable algebras, etc.)

03D45: Theory of numerations, effectively presented structures

03F25: Relative consistency and interpretations

Related Items

EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS, THE ∀∃ THEORY OF PEANO Σ₁ SENTENCES, Franco Montagna's work on provability logic and many-valued logic, Interpretability degrees of finitely axiomatized sequential theories

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 Σ₁ SENTENCES
• Deduction-preserving "Recursive Isomorphisms" between theories
• Effectively extensible theories