Archive for Mathematical Logic 49 (1):69-89 (2010)

Abstract
We show the non-arithmeticity of 1st order theories of lattices of Σ n sentences modulo provable equivalence in a formal theory, of diagonalizable algebras of a wider class of arithmetic theories than has been previously known, and of the lattice of degrees of interpretability over PA. The first two results are applications of Nies’ theorem on the non-arithmeticity of the 1st order theory of the lattice of r.e. ideals on any effectively dense r.e. Boolean algebra. The theorem on degrees of interpretability relies on an adaptation of techniques leading to Nies’ theorem
Keywords Lattice of Σ n sentences  Diagonalizable algebra  Interpretability degrees  Arithmetic  Effectively inseparable Boolean algebra  Ideal definability
Categories (categorize this paper)
Reprint years 2009, 2010
ISBN(s)
DOI 10.1007/s00153-009-0161-3
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 53,784
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Model Theory.Wilfrid Hodges - 2008 - Stanford Encyclopedia of Philosophy.
Aspects of Incompleteness.Per Lindström - 1999 - Studia Logica 63 (3):438-439.
Undecidability in Diagonalizable Algebras.V. Yu Shavrukov - 1997 - Journal of Symbolic Logic 62 (1):79-116.
Recursion Theory.Anil Nerode & Richard A. Shore (eds.) - 1985 - American Mathematical Society.

View all 9 references / Add more references

Citations of this work BETA

The∀∃ Theory of Peano Σ1 Sentences.Per Lindström & V. Yu Shavrukov - 2008 - Journal of Mathematical Logic 8 (2):251-280.
Interpretability Degrees of Finitely Axiomatized Sequential Theories.Albert Visser - 2014 - Archive for Mathematical Logic 53 (1-2):23-42.

Add more citations

Similar books and articles

Boolean Deductive Systems of BL-Algebras.Esko Turunen - 2001 - Archive for Mathematical Logic 40 (6):467-473.
On the Structure of the Medvedev Lattice.Sebastiaan A. Terwijn - 2008 - Journal of Symbolic Logic 73 (2):543 - 558.
Hyper-Archimedean BL-Algebras Are MV-Algebras.Esko Turunen - 2007 - Mathematical Logic Quarterly 53 (2):170-175.
Minimum‐Sized Infinite Partitions of Boolean Algebras.J. Donald Monk - 1996 - Mathematical Logic Quarterly 42 (1):537-550.
Type-Decomposition of an Effect Algebra.David J. Foulis & Sylvia Pulmannová - 2010 - Foundations of Physics 40 (9-10):1543-1565.
Boolean Algebra and Syllogism.V. A. Bocharov - 1986 - Synthese 66 (1):35 - 54.
On Birkhoff’s Common Abstraction Problem.F. Paoli & C. Tsinakis - 2012 - Studia Logica 100 (6):1079-1105.
Boolean Algebras and Distributive Lattices Treated Constructively.John L. Bell - 1999 - Mathematical Logic Quarterly 45 (1):135-143.

Analytics

Added to PP index
2013-11-23

Total views
29 ( #343,494 of 2,350,091 )

Recent downloads (6 months)
1 ( #512,429 of 2,350,091 )

How can I increase my downloads?

Downloads

My notes