Graduate studies at Western
Journal of Symbolic Logic 59 (4):1139-1153 (1994)
|Abstract||In this paper the modal operator "x is provable in Peano Arithmetic" is incorporated into first-order theories. A provability extension of a theory is defined. Presburger Arithmetic of addition, Skolem Arithmetic of multiplication, and some first order theories of partial consistency statements are shown to remain decidable after natural provability extensions. It is also shown that natural provability extensions of a decidable theory may be undecidable|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
M. Krynicki & K. Zdanowski (2005). Theories of Arithmetics in Finite Models. Journal of Symbolic Logic 70 (1):1-28.
Giorgie Dzhaparidze (1990). Decidable and Enumerable Predicate Logics of Provability. Studia Logica 49 (1):7 - 21.
J. Michael Dunn (1980). Quantum Mathematics. PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:512 - 531.
Albert Visser (1984). The Provability Logics of Recursively Enumerable Theories Extending Peano Arithmetic at Arbitrary Theories Extending Peano Arithmetic. Journal of Philosophical Logic 13 (1):97 - 113.
Alessandro Berarducci (1990). The Interpretability Logic of Peano Arithmetic. Journal of Symbolic Logic 55 (3):1059-1089.
V. Yu Shavrukov (1997). Undecidability in Diagonalizable Algebras. Journal of Symbolic Logic 62 (1):79-116.
L. D. Beklemishev (1991). Provability Logics for Natural Turing Progressions of Arithmetical Theories. Studia Logica 50 (1):107 - 128.
Konstantin N. Ignatiev (1993). On Strong Provability Predicates and the Associated Modal Logics. Journal of Symbolic Logic 58 (1):249-290.
Lev D. Beklemishev (1996). Bimodal Logics for Extensions of Arithmetical Theories. Journal of Symbolic Logic 61 (1):91-124.
Added to index2009-01-28
Total downloads3 ( #213,976 of 739,521 )
Recent downloads (6 months)1 ( #61,778 of 739,521 )
How can I increase my downloads?