provability logic
   HOME

TheInfoList



OR:

Provability logic is a
modal logic Modal logic is a collection of formal systems developed to represent statements about necessity and possibility. It plays a major role in philosophy of language, epistemology, metaphysics, and natural language semantics. Modal logics extend other ...
, in which the box (or "necessity") operator is interpreted as 'it is provable that'. The point is to capture the notion of a proof predicate of a reasonably rich formal theory, such as
Peano arithmetic In mathematical logic, the Peano axioms, also known as the Dedekind–Peano axioms or the Peano postulates, are axioms for the natural numbers presented by the 19th century Italian mathematician Giuseppe Peano. These axioms have been used nearly u ...
.


Examples

There are a number of provability logics, some of which are covered in the literature mentioned in . The basic system is generally referred to as GL (for GödelLöb) or L or K4W (W stands for
well-foundedness In mathematics, a binary relation ''R'' is called well-founded (or wellfounded) on a class ''X'' if every non-empty subset ''S'' ⊆ ''X'' has a minimal element with respect to ''R'', that is, an element ''m'' not related by ''s&nb ...
). It can be obtained by adding the modal version of
Löb's theorem In mathematical logic, Löb's theorem states that in Peano arithmetic (PA) (or any formal system including PA), for any formula ''P'', if it is provable in PA that "if ''P'' is provable in PA then ''P'' is true", then ''P'' is provable in PA. If Pr ...
to the logic K (or K4). Namely, the axioms of GL are all tautologies of classical
propositional logic Propositional calculus is a branch of logic. It is also called propositional logic, statement logic, sentential calculus, sentential logic, or sometimes zeroth-order logic. It deals with propositions (which can be true or false) and relations b ...
plus all formulas of one of the following forms: * Distribution axiom: * Löb's axiom: And the rules of inference are: * ''Modus ponens'': From ''p'' → ''q'' and ''p'' conclude ''q''; * Necessitation: From \vdash ''p'' conclude \vdash .


History

The GL model was pioneered by
Robert M. Solovay Robert Martin Solovay (born December 15, 1938) is an American mathematician specializing in set theory. Biography Solovay earned his Ph.D. from the University of Chicago in 1964 under the direction of Saunders Mac Lane, with a dissertation on '' ...
in 1976. Since then, until his death in 1996, the prime inspirer of the field was
George Boolos George Stephen Boolos (; 4 September 1940 – 27 May 1996) was an American philosopher and a mathematical logician who taught at the Massachusetts Institute of Technology. Life Boolos is of Greek-Jewish descent. He graduated with an A.B. in ...
. Significant contributions to the field have been made by Sergei N. Artemov, Lev Beklemishev,
Giorgi Japaridze Giorgi Japaridze (also spelled Giorgie Dzhaparidze) is a Georgian-American researcher in logic and theoretical computer science. He currently holds the title of Full Professor at the Computing Sciences Department of Villanova University. Japaridze i ...
,
Dick de Jongh Dick Herman Jacobus de Jongh (born 19 October 1939, Enschede) is a Dutch logician and mathematician and a retired professor at the University of Amsterdam. He received his PhD degree in 1968 from the University of Wisconsin–Madison under super ...
, Franco Montagna, Giovanni Sambin, Vladimir Shavrukov, Albert Visser and others.


Generalizations

Interpretability logic Interpretability logics comprise a family of modal logics that extend provability logic to describe interpretability or various related metamathematical properties and relations such as weak interpretability, Π1-conservativity, cointerpretability ...
s and
Japaridze's polymodal logic Japaridze's polymodal logic (GLP) is a system of provability logic with infinitely many provability modalities. This system has played an important role in some applications of provability algebras in proof theory, and has been extensively studied ...
present natural extensions of provability logic.


See also

*
Hilbert–Bernays provability conditions In mathematical logic, the Hilbert–Bernays provability conditions, named after David Hilbert and Paul Bernays, are a set of requirements for formalized provability predicates in formal theories of arithmetic (Smith 2007:224). These conditions are ...
*
Interpretability logic Interpretability logics comprise a family of modal logics that extend provability logic to describe interpretability or various related metamathematical properties and relations such as weak interpretability, Π1-conservativity, cointerpretability ...
*
Kripke semantics Kripke semantics (also known as relational semantics or frame semantics, and often confused with possible world semantics) is a formal semantics for non-classical logic systems created in the late 1950s and early 1960s by Saul Kripke and André Jo ...
*
Japaridze's polymodal logic Japaridze's polymodal logic (GLP) is a system of provability logic with infinitely many provability modalities. This system has played an important role in some applications of provability algebras in proof theory, and has been extensively studied ...
*
Löb's theorem In mathematical logic, Löb's theorem states that in Peano arithmetic (PA) (or any formal system including PA), for any formula ''P'', if it is provable in PA that "if ''P'' is provable in PA then ''P'' is true", then ''P'' is provable in PA. If Pr ...


References

*
George Boolos George Stephen Boolos (; 4 September 1940 – 27 May 1996) was an American philosopher and a mathematical logician who taught at the Massachusetts Institute of Technology. Life Boolos is of Greek-Jewish descent. He graduated with an A.B. in ...
, '
The Logic of Provability
''. Cambridge University Press, 1993.
Giorgi Japaridze
and Dick de Jongh
''The logic of provability''
In: Handbook of Proof Theory, S. Buss, ed. Elsevier, 1998, pp. 475–546. * Sergei N. Artemov an
Lev Beklemishev''Provability logic''
In: '
Handbook of Philosophical Logic
'', D. Gabbay and F. Guenthner, eds., vol. 13, 2nd ed., pp. 189–360. Springer, 2005. *
Per Lindström Per "Pelle" Lindström (9 April 1936 – 21 August 2009, Gothenburg) ASLbr>Newsletter September 2009 was a Swedish logician, after whom Lindström's theorem and the Lindström quantifier are named. (He also independently discovered Ehrenfeucht– ...
, ''Provability logic—a short introduction''. Theoria 62 (1996), pp. 19–61. *Craig Smoryński, Self-reference and modal logic. Springer, Berlin, 1985. *
Robert M. Solovay Robert Martin Solovay (born December 15, 1938) is an American mathematician specializing in set theory. Biography Solovay earned his Ph.D. from the University of Chicago in 1964 under the direction of Saunders Mac Lane, with a dissertation on '' ...
, ``Provability Interpretations of Modal Logic``,
Israel Journal of Mathematics '' Israel Journal of Mathematics'' is a peer-reviewed mathematics journal published by the Hebrew University of Jerusalem (Magnes Press). Founded in 1963, as a continuation of the ''Bulletin of the Research Council of Israel'' (Section F), the jou ...
, Vol. 25 (1976): 287–304. *
Rineke Verbrugge Laurina Christina (Rineke) Verbrugge (born 12 March 1965 in Amsterdam) is a Dutch logician and computer scientist known for her work on interpretability logic and provability logic. She completed her PhD at the University of Amsterdam in 1993 ...

Provability logic
from the
Stanford Encyclopedia of Philosophy The ''Stanford Encyclopedia of Philosophy'' (''SEP'') combines an online encyclopedia of philosophy with peer-reviewed publication of original papers in philosophy, freely accessible to Internet users. It is maintained by Stanford University. Eac ...
. Modal logic Proof theory {{logic-stub