On Rosser's Provability Predicate

Mathematical Logic Quarterly 37 (19‐22):317-330 (1991)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19910371906

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

On Rosser's Provability Predicate.V. Shavrukov - 1991 - Mathematical Logic Quarterly 37 (19-22):317-330.
On Rosser's Provability Predicate.V. Yu Shavrukov - 1991 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 37 (19-22):317-330.
Rosser-Type Undecidable Sentences Based on Yablo’s Paradox.Taishi Kurahashi - 2014 - Journal of Philosophical Logic 43 (5):999-1017.
Gödelizing the Yablo Sequence.Cezary Cieśliński & Rafal Urbaniak - 2013 - Journal of Philosophical Logic 42 (5):679-695.
A probabilistic machine for the estimation of provability in the first order predicate calculus.S. C. van Westrhenen - 1969 - Mathematical Logic Quarterly 15 (19):291-297.
Derivability conditions on Rosser's provability predicates.Toshiyasu Arai - 1990 - Notre Dame Journal of Formal Logic 31 (4):487-497.
Iterated Extensional Rosser's Fixed Points and Hyperhyperdiagonalizable Algebras.Franco Montagna - 1987 - Mathematical Logic Quarterly 33 (4):293-303.
The provability logic for Σ1-interpolability.Konstantin N. Ignatiev - 1993 - Annals of Pure and Applied Logic 64 (1):1-25.
Provability in Elementary Type Theory.Peter B. Andrews - 1974 - Mathematical Logic Quarterly 20 (25‐27):411-418.
S. N. Artemov. Arithmetically complete modal theories. Six papers in logic, American Mathematical Society translations, ser. 2 vol. 135, American Mathematical Society, Providence1987, pp. 39–54. , vol. 14 , pp. 115–133.) - S. N. Artemov. On modal logics axiomatizing provability. Mathematics of the USSR—Izvestiya, vol. 27 no. 3 , pp. 401–429. , pp. 1123–1154.) - S. N. Artemov. Nonarithmeticity of truth predicate logics of provability. Soviet mathematics—Doklady, vol. 32 , pp. 403–405. , pp. 270–271.) - V. A. Vardanyan. Arithmetic complexity of predicate logics of provability and their fragments. Soviet mathematics—Doklady, vol. 33 no. 3 , pp. 569–572. , pp. 11–14.) - S. N. Artemov. Numerically correct provability logics. Soviet mathematics—Doklady, vol. 34 , pp. 384–387. , pp. 1289–1292.). [REVIEW]Vann McGee - 1991 - Journal of Symbolic Logic 56 (1):329-332.

Analytics

Added to PP
2013-12-01

Downloads
19 (#824,913)

6 months
1 (#1,516,001)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Bimodal logics for extensions of arithmetical theories.Lev D. Beklemishev - 1996 - Journal of Symbolic Logic 61 (1):91-124.
Rosser Provability and Normal Modal Logics.Taishi Kurahashi - 2020 - Studia Logica 108 (3):597-617.
Arithmetical completeness theorems for monotonic modal logics.Haruka Kogure & Taishi Kurahashi - 2023 - Annals of Pure and Applied Logic 174 (7):103271.
Some Observations on the FGH Theorem.Taishi Kurahashi - 2023 - Studia Logica 111 (5):749-778.

Add more citations

References found in this work

Self-Reference and Modal Logic.George Boolos & C. Smorynski - 1988 - Journal of Symbolic Logic 53 (1):306.

Add more references