Interpretability degrees of finitely axiomatized sequential theories

Archive for Mathematical Logic 53 (1-2):23-42 (2014)
  Copy   BIBTEX

Abstract

In this paper we show that the degrees of interpretability of finitely axiomatized extensions-in-the-same-language of a finitely axiomatized sequential theory—like Elementary Arithmetic EA, IΣ1, or the Gödel–Bernays theory of sets and classes GB—have suprema. This partially answers a question posed by Švejdar in his paper (Commentationes Mathematicae Universitatis Carolinae 19:789–813, 1978). The partial solution of Švejdar’s problem follows from a stronger fact: the convexity of the degree structure of finitely axiomatized extensions-in-the-same-language of a finitely axiomatized sequential theory in the degree structure of the degrees of all finitely axiomatized sequential theories. In the paper we also study a related question: the comparison of structures for interpretability and derivability. In how far can derivability mimic interpretability? We provide two positive results and one negative result

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,853

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The unprovability of small inconsistency.Albert Visser - 1993 - Archive for Mathematical Logic 32 (4):275-298.
Vaught's theorem on axiomatizability by a scheme.Albert Visser - 2012 - Bulletin of Symbolic Logic 18 (3):382-402.
Effectively inseparable Boolean algebras in lattices of sentences.V. Yu Shavrukov - 2010 - Archive for Mathematical Logic 49 (1):69-89.
A Finitely Axiomatized Formalization of Predicate Calculus with Equality.Norman D. Megill - 1995 - Notre Dame Journal of Formal Logic 36 (3):435-453.
Modal analysis of generalized Rosser sentences.Vítězslav Švejdar - 1983 - Journal of Symbolic Logic 48 (4):986-999.
Bimodal logics for extensions of arithmetical theories.Lev D. Beklemishev - 1996 - Journal of Symbolic Logic 61 (1):91-124.
The formalization of interpretability.Albert Visser - 1991 - Studia Logica 50 (1):81 - 105.
The logic of π1-conservativity.Petr Hajek & Franco Montagna - 1990 - Archive for Mathematical Logic 30 (2):113-123.
Pairs, sets and sequences in first-order theories.Albert Visser - 2008 - Archive for Mathematical Logic 47 (4):299-326.

Analytics

Added to PP
2013-11-23

Downloads
33 (#484,404)

6 months
9 (#308,593)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

The small‐is‐very‐small principle.Albert Visser - 2019 - Mathematical Logic Quarterly 65 (4):453-478.
Avicenna on Syllogisms Composed of Opposite Premises.Behnam Zolghadr - 2021 - In Mojtaba Mojtahedi, Shahid Rahman & MohammadSaleh Zarepour (eds.), Mathematics, Logic, and their Philosophies: Essays in Honour of Mohammad Ardeshir. Springer. pp. 433-442.

Add more citations

References found in this work

On the scheme of induction for bounded arithmetic formulas.A. J. Wilkie & J. B. Paris - 1987 - Annals of Pure and Applied Logic 35 (C):261-302.
Cuts, consistency statements and interpretations.Pavel Pudlák - 1985 - Journal of Symbolic Logic 50 (2):423-441.
The unprovability of small inconsistency.Albert Visser - 1993 - Archive for Mathematical Logic 32 (4):275-298.
Faith & falsity.Albert Visser - 2004 - Annals of Pure and Applied Logic 131 (1-3):103-131.

View all 19 references / Add more references