Skip to search formSkip to main contentSkip to account menu

Provability logic

Provability logic is a modal logic, in which the box (or "necessity") operator is interpreted as 'it is provable that'. The point is to capture the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
This notes provides a brief survey that reflects the early development of provability logic. It includes a detailed exposition of… 
2014
2014
For the Heyting Arithmetic HA, HA* is defined as the theory $\{A\mid {\sf HA}\vdash A^{\Box}\}$, where $A^{\Box}$ is called the… 
2014
2014
We give a construction of finitely generated free algebras for Godel-Lob provability logic, GL. On the semantic side, this… 
2011
2011
We present the design of L10, a rich forward-chaining (a.k.a. “bottom-up”) logic programming language. L10 allows parallel… 
2009
2009
Modern proof-assistants are now mature enough to formalise many aspects of mathematics. I outline some work we have done using… 
2007
2007
Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or… 
1998
1998
Besides the well-known principles K, K4 and L, the Leivant principle (AVВ)→ (AVB) and the Formalized Markov scheme  ¬¬ (A… 
Review
1997
Review
1997
Despite the form, the content is not without interest. Most topics are treated in many different ways, and benefit from this… 
1992
1992
In this paper are studied the properties of the proofs in PRA of provability logic sentences, i.e. of formulas which are Boolean… 
1991
1991
Predicate modal formulas with non-modalized quantifiers (call them Q′-formulas) are considered as schemata of arithmetical…