Results 1  10
of
22
Interpretability logic
 Mathematical Logic, Proceedings of the 1988 Heyting Conference
, 1990
"... Interpretations are much used in metamathematics. The first application that comes to mind is their use in reductive Hilbertstyle programs. Think of the kind of program proposed by Simpson, Feferman or Nelson (see Simpson[1988], Feferman[1988], Nelson[1986]). Here they serve to compare the strength ..."
Abstract

Cited by 32 (9 self)
 Add to MetaCart
Interpretations are much used in metamathematics. The first application that comes to mind is their use in reductive Hilbertstyle programs. Think of the kind of program proposed by Simpson, Feferman or Nelson (see Simpson[1988], Feferman[1988], Nelson[1986]). Here they serve to compare the strength of theories, or better to prove
ON THE NUMBER OF STEPS IN PROOFS
, 1989
"... In this paper we prove some results about the complexity of proofs. We consider proofs in Hilbertstyle formal systems such as in [17J. Thus a proof is a sequence of formulas satisfying certain conditions. We caD view the formulas as being strings of symbols; hence the whole proof is a string too. W ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
In this paper we prove some results about the complexity of proofs. We consider proofs in Hilbertstyle formal systems such as in [17J. Thus a proof is a sequence of formulas satisfying certain conditions. We caD view the formulas as being strings of symbols; hence the whole proof is a string too. We consider the following measures of complexity of proofs: length ( = the number of symbols in the proof), depth ( = the maximal depth of a formula in the proof) and number o! steps ( = the number of formulas in the proof). For a particular formaI system and a given formula A we consider the shortest length of a proof of A, the minimal depth ofa proof of A and the minimal number of steps in a proof of A. The main results are the following: (1) a bound on the depth in terms of the number of steps: Theorem 2.2, (2) a bound on the depth in terms of the length: Theorem 2.3, (3) a bound on the length in terms of the number of steps for restricted systems: Theorem 3.1. These results are applied to obtain several corollaries. In particular we show: (1) a bound on the number of steps in a cutfree proof, (2) some speedup results, (3) bounds on the number of steps in proofs of ParisHarrington sentences. Some paper
The interpretability logic of Peano arithmetic
 The Journal of Symbolic Logic
, 1990
"... prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, noncommercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtai ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, noncommercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtained at
The Interpretability Logic of all Reasonable Arithmetical Theories
 ERKENNTNIS
, 1999
"... This paper is a presentation of a status quaestionis, to wit of the problem of the interpretability logic of all reasonable arithmetical theories. We present both the arithmetical side and the modal side of the question. ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
This paper is a presentation of a status quaestionis, to wit of the problem of the interpretability logic of all reasonable arithmetical theories. We present both the arithmetical side and the modal side of the question.
From bounded arithmetic to second order arithmetic via automorphisms
 Logic in Tehran, Lect. Notes Log
"... Abstract. In this paper we examine the relationship between automorphisms of models of I∆0 (bounded arithmetic) and strong systems of arithmetic, such as P A, ACA0 (arithmetical comprehension schema with restricted induction), and Z2 (second order arithmetic). For example, we establish the following ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract. In this paper we examine the relationship between automorphisms of models of I∆0 (bounded arithmetic) and strong systems of arithmetic, such as P A, ACA0 (arithmetical comprehension schema with restricted induction), and Z2 (second order arithmetic). For example, we establish the following characterization of P A by proving a “reversal ” of a theorem of Gaifman: Theorem. The following are equivalent for completions T of I∆0: (a) T ⊢ P A; (b) Some model M = (M, · · ·) of T has a proper end extension N which satisfies I∆0 and for some automorphism j of N, M is precisely the fixed point set of j. Our results also shed light on the metamathematics of the QuineJensen system NF U of set theory with a universal set. 1.
Can we make the Second Incompleteness Theorem coordinate free?
 DEPARTMENT OF PHILOSOPHY, UTRECHT UNIVERSITY, HEIDELBERGLAAN
"... Is it possible to give a coordinate free formulation of the Second Incompleteness Theorem? We pursue one possible approach to this question. We show that (i) cutfree consistency for finitely axiomatized theories can be uniquely characterized modulo EAprovable equivalence, (ii) consistency for fin ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Is it possible to give a coordinate free formulation of the Second Incompleteness Theorem? We pursue one possible approach to this question. We show that (i) cutfree consistency for finitely axiomatized theories can be uniquely characterized modulo EAprovable equivalence, (ii) consistency for finitely axiomatized sequential theories can be uniquely characterized modulo EAprovable equivalence. The case of infinitely axiomatized ce theories is more delicate. We carefully discuss this in the paper.
E.: Modal Matters in Interpretability Logics
, 2004
"... In this paper we expose a method for building models for interpretability logics. The method can be compared to the method of taking unions of chains in classical model theory. Many applications of the method share a common part. We isolate this common part in a main lemma. Doing so, many of our res ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
In this paper we expose a method for building models for interpretability logics. The method can be compared to the method of taking unions of chains in classical model theory. Many applications of the method share a common part. We isolate this common part in a main lemma. Doing so, many of our results become applications of this main lemma. We also briefly describe how our method can be generalized to modal logics with a different signature. With the general method, we prove completeness for the interpretability logics IL, ILM, ILM0 and ILW ∗. We also apply our method to obtain a classification of the essential Σ1sentences of essentially reflexive theories. We briefly comment on such a classification for finitely axiomatizable theories. As a digression we proof some results on selfprovers. Towards the end of the paper we concentrate on modal matters concerning IL(All), the interpretability logic of all reasonable arithmetical theories. We prove the modal incompleteness of the logic ILW ∗ P0. We put forward a new principle R, and show it to be arithmetically sound in any reasonable arithmetical theory. Finally we make some general remarks on the logics ILRW and IL(All).
Growing commas –a study of sequentiality and concatenation. Logic Group Preprint Series 257
 Department of Philosophy, Utrecht University
, 2007
"... In his paper [Grz05], Andrzej Grzegorczyk introduces a theory of concatenation TC. We show that TC does not define pairing. We determine a reasonable extension of TC that is sequential, i.e., has a good sequence coding. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In his paper [Grz05], Andrzej Grzegorczyk introduces a theory of concatenation TC. We show that TC does not define pairing. We determine a reasonable extension of TC that is sequential, i.e., has a good sequence coding.