Access the full text.
Sign up today, get DeepDyve free for 14 days.
P Hájek, P Pudlák (1998)
Metamathematics of First-Order Arithmetic
G Boolos (1993)
The Logic of Provability
RG Jeroslow (1971)
Consistency statements in formal theoriesFundam. Math., 72
C Smoryński (1989)
Arithmetic analogues of McAloon’s unique Rosser sentencesArch. Math. Logic, 28
A Berarducci (1990)
The interpretability logic of Peano arithmeticJ. Symb. Logic, 55
S Orey (1961)
Relative interpretationsZeitschrift für Mathematische Logik und Grundlagen der Mathematik, 7
P Lindström (1984)
On certain lattices of degrees of interpretabilityNotre Dame J. Formal Logic, 25
A Visser (1992)
An inside view of EXPJ. Symb. Logic, 57
D Jongh, M Jumelet, F Montagna (1991)
On the proof of Solovay’s theoremStud. Log., 50
A Tarski, A Mostowski, R Robinson (1953)
Undecidable Theories
F Montagna (1978)
On the algebraization of a Feferman’s predicateStud. Log., 37
H Ono (1987)
Reflection principles in fragments of Peano arithmeticZeitschrift für Mathematische Logik und Grundlagen der Mathematik, 33
V Shavrukov (1994)
A smart child of Peano’sNotre Dame J. Formal Logic, 35
A Visser (1989)
Peano’s smart children: A provability logical study of systems with built-in consistencyNotre Dame J. Formal Logic, 30
V Švejdar (1978)
Degrees of interpretabilityComment. Math. Univ. Carolinae, 19
A Ehrenfeucht, S Feferman (1961)
Representability op recursively enumerable sets in formal theoriesArchiv für mathematische Logik und Grundlagenforschung, 5
P Hájek (1971)
On interpretability in set theories ICommun. Math. Univ. Carolinae, 12
R Solovay (1976)
Provability interpretations of modal logicIsrael J. Math., 25
S Feferman (1960)
Arithmetization of metamathematics in a general settingFundam. Math., 49
D Guaspari (1979)
Partially conservative extensions of arithmeticTrans. Am. Math. Soc., 254
M Löb (1955)
Solution of a problem of Leon HenkinJ. Symb. Logic, 20
This paper develops the philosophy and technology needed for adding a supremum operator to the interpretability logic $$\mathsf {ILM}$$ ILM of Peano Arithmetic ( $$\mathsf {PA}$$ PA ). It is well-known that any theories extending $$\mathsf {PA}$$ PA have a supremum in the interpretability ordering. While provable in $$\mathsf {PA}$$ PA , this fact is not reflected in the theorems of the modal system $$\mathsf {ILM}$$ ILM , due to limited expressive power. Our goal is to enrich the language of $$\mathsf {ILM}$$ ILM by adding to it a new modality for the interpretability supremum. We explore different options for specifying the exact meaning of the new modality. Our final proposal involves a unary operator, the dual of which can be seen as a (nonstandard) provability predicate satisfying the axioms of the provability logic $$\mathsf {GL}$$ GL .
Archive for Mathematical Logic – Springer Journals
Published: May 26, 2017
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.