Stanford Encyclopedia of Philosophy (2008)
AbstractProvability logic is a modal logic that is used to investigate what arithmetical theories can express in a restricted language about their provability predicates. The logic has been inspired by developments in meta-mathematics such as Gödel’s incompleteness theorems of 1931 and Löb’s theorem of 1953. As a modal logic, provability logic has been studied since the early seventies, and has had important applications in the foundations of mathematics. From a philosophical point of view, provability logic is interesting because the concept of provability in a fixed theory of arithmetic has a unique and non-problematic meaning, other than concepts like necessity and knowledge studied in modal and epistemic logic. Furthermore, provability logic provides tools to study the notion of self-reference.
Similar books and articles
The knower paradox in the light of provability interpretations of modal logic.Paul Égré - 2004 - Journal of Logic, Language and Information 14 (1):13-48.
Explicit provability and constructive semantics.Sergei N. Artemov - 2001 - Bulletin of Symbolic Logic 7 (1):1-36.
A propositional logic with explicit fixed points.Albert Visser - 1981 - Studia Logica 40 (2):155 - 175.
‘Necessity’ and ‘provability’ in the later wittgenstein.Shelley L. Trianosky-Stillwell - 1983 - History and Philosophy of Logic 4 (1-2):39-61.
How to extend the dialogical approach to provability logic.Ulrich Nortmann - 2001 - Synthese 127 (1-2):95 - 103.
On first-order theories with provability operator.Sergei Artëmov & Franco Montagna - 1994 - Journal of Symbolic Logic 59 (4):1139-1153.
Provability logics for relative interpretability.Frank Veltman & Dick De Jongh - 1990 - In Petio Petrov Petkov (ed.), Mathematical Logic. Proceedings of the Heyting '88 Summer School. New York, NY, USA: pp. 31-42.
Provability, Complexity, Grammars.Lev Dmitrievich Beklemishev - 1949 - American Mathematical Society.
On strong provability predicates and the associated modal logics.Konstantin N. Ignatiev - 1993 - Journal of Symbolic Logic 58 (1):249-290.
Added to PP
Historical graph of downloads
Citations of this work
Embedding Classical Logic in S4.Sophie Nagler - 2019 - Dissertation, Munich Center for Mathematical Philosophy (Mcmp), Lmu Munich
On the necessary philosophical premises of the Goedelian arguments.Fano Vincenzo & Graziani Pierluigi - unknown
References found in this work
An Essay in Classical Modal Logic.Krister Segerberg - 1971 - Uppsala, Sweden: Uppsala, Filosofiska Föreningen Och Filosofiska Institutionen Vid Uppsala Universitet.
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I.K. Gödel - 1931 - Monatshefte für Mathematik 38 (1):173--198.
Metamathematical Investigation of Intuitionistic Arithmetic and Analysis.Anne S. Troelstra - 1973 - New York: Springer.