Interpretability over peano arithmetic
Journal of Symbolic Logic 64 (4):1407-1425 (1999)
| Abstract | We investigate the modal logic of interpretability over Peano arithmetic. Our main result is a compactness theorem that extends the arithmetical completeness theorem for the interpretability logic ILM ω . This extension concerns recursively enumerable sets of formulas of interpretability logic (rather than single formulas). As corollaries we obtain a uniform arithmetical completeness theorem for the interpretability logic ILM and a partial answer to a question of Orey from 1961. After some simplifications, we also obtain Shavrukov's embedding theorem for Magari algebras (a.k.a. diagonalizable algebras) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,705 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesGeorge Mills (1978). A Model of Peano Arithmetic with No Elementary End Extension. Journal of Symbolic Logic 43 (3):563-567.
Vítězslav Švejdar (1991). Some Independence Results in Interpretability Logic. Studia Logica 50 (1):29 - 38.
Vítězslav Švejdar (1983). Modal Analysis of Generalized Rosser Sentences. Journal of Symbolic Logic 48 (4):986-999.
Pasquale Frascolla (1997). The Tractatus System of Arithmetic. Synthese 112 (3):353-378.
Franco Montagna (1980). Interpretations of the First-Order Theory of Diagonalizable Algebras in Peano Arithmetic. Studia Logica 39 (4):347 - 354.
Joost J. Joosten & Albert Visser (2000). The Interpretability Logic of All Reasonable Arithmetical Theories. Erkenntnis 53 (1-2):3-26.
Maarten Rijke (1991). A Note on the Interpretability Logic of Finitely Axiomatized Theories. Studia Logica 50 (2):241 - 250.
J. Michael Dunn (1980). Quantum Mathematics. PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:512 - 531.
Alessandro Berarducci (1990). The Interpretability Logic of Peano Arithmetic. Journal of Symbolic Logic 55 (3):1059-1089.
Katsumi Sasaki (2002). A Cut-Free Sequent System for the Smallest Interpretability Logic. Studia Logica 70 (3):353-372.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads3 ( #202,056 of 549,196 )Recent downloads (6 months)1 ( #63,397 of 549,196 )How can I increase my downloads? |
My notes
Discussion
