- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
The provability logics of recursively enumerable theories extending peano arithmetic at arbitrary theories extending peano arithmetic
Journal of Philosophical Logic 13 (1):97 - 113 (1984)
Abstract
This article has no associated abstract. (fix it)Author's Profile
Other Versions
No versions found
My notes
Similar books and articles
Complete, Recursively Enumerable Relations in Arithmetic.Giovanna D'Agostino & Mario Magnago - 1995 - Mathematical Logic Quarterly 41 (1):65-72.
On first-order theories with provability operator.Sergei Artëmov & Franco Montagna - 1994 - Journal of Symbolic Logic 59 (4):1139-1153.
Provability logics relative to a fixed extension of peano arithmetic.Taishi Kurahashi - 2018 - Journal of Symbolic Logic 83 (3):1229-1246.
On predicate provability logics and binumerations of fragments of Peano arithmetic.Taishi Kurahashi - 2013 - Archive for Mathematical Logic 52 (7-8):871-880.
Relatively Recursively Enumerable Versus Relatively Σ1 in Models of Peano Arithmetic.Grzegorz Michalski - 1995 - Mathematical Logic Quarterly 41 (4):515-522.
Some properties of the syntactic p-recursion categories generated by consistent, recursively enumerable extensions of Peano arithmetic.Robert A. Di Paola & Franco Montagna - 1991 - Journal of Symbolic Logic 56 (2):643-660.
A course on bimodal provability logic.Albert Visser - 1995 - Annals of Pure and Applied Logic 73 (1):109-142.
Arithmetical Completeness Theorem for Modal Logic $$mathsf{}$$.Taishi Kurahashi - 2018 - Studia Logica 106 (2):219-235.
Turing–Taylor Expansions for Arithmetic Theories.Joost J. Joosten - 2016 - Studia Logica 104 (6):1225-1243.
Analytics
Added to PP
2009-01-28
Downloads
117 (#404,181)
6 months
27 (#364,047)
2009-01-28
Downloads
117 (#404,181)
6 months
27 (#364,047)
Historical graph of downloads
Author's Profile
Citations of this work
Current Research on Gödel’s Incompleteness Theorems.Yong Cheng - 2021 - Bulletin of Symbolic Logic 27 (2):113-167.
Arithmetical Completeness Theorem for Modal Logic $$mathsf{}$$.Taishi Kurahashi - 2018 - Studia Logica 106 (2):219-235.
Arithmetical Soundness and Completeness for $$\varvec{\Sigma }_{\varvec{2}}$$ Numerations.Taishi Kurahashi - 2018 - Studia Logica 106 (6):1181-1196.
Leo Esakia on Duality in Modal and Intuitionistic Logics.Guram Bezhanishvili (ed.) - 2014 - Dordrecht, Netherland: Springer.
References found in this work
Robert M. Solovay. Provability interpretations of modal logic. Israel journal of mathematics, vol. 25, pp. 287–304.Robert M. Solovay - 1981 - Journal of Symbolic Logic 46 (3):661-662.
Relatively precomplete numerations and arithmetic.Franco Montagna - 1982 - Journal of Philosophical Logic 11 (4):419 - 430.
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation