Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,167,051 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Interpretability logic
Japaridze's polymodal logic
Kripke semantics
Löb's theorem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2023
2023
Teaching G{ö}del's incompleteness theorems
Gilles Dowek
arXiv.org
2023
Corpus ID: 12188112
The basic notions of logic-predicate logic, Peano arithmetic, incompleteness theorems, etc.-have for long been an advanced topic…
Expand
Review
2017
Review
2017
NOTES ON PROVABILITY LOGIC
Yang Liu
2017
Corpus ID: 51771203
This notes provides a brief survey that reflects the early development of provability logic. It includes a detailed exposition of…
Expand
2015
2015
MAX-PLANCK-INSTITUT FOR INFORMATIK Reflection using the derivability conditions
S. Simpson
2015
Corpus ID: 13140966
We extend arithmetic with a new predicate Pr, giving axioms for Pr based on first-order versions of Lob's derivability conditions…
Expand
2014
2014
The $\Sigma$_1 Provability Logic of HA
Mohammad Ardeshir
,
S. Mojtahedi
2014
Corpus ID: 119324534
For the Heyting Arithmetic HA, HA* is defined as the theory $\{A\mid {\sf HA}\vdash A^{\Box}\}$, where $A^{\Box}$ is called the…
Expand
2014
2014
Free Algebras for Gödel-Löb Provability Logic
S. V. van Gool
Advances in Modal Logic
2014
Corpus ID: 16943775
We give a construction of finitely generated free algebras for Godel-Lob provability logic, GL. On the semantic side, this…
Expand
2011
2011
Declaratively distributed deductive databases The L 10 logic programming language
R. Simmons
,
Bernardo Toninho
,
F. Pfenning
2011
Corpus ID: 2763046
We present the design of L10, a rich forward-chaining (a.k.a. “bottom-up”) logic programming language. L10 allows parallel…
Expand
2009
2009
Machine Checking Proof Theory: An Application of Logic to Logic
R. Goré
Indian Conference on Logic and Its Applications
2009
Corpus ID: 1019455
Modern proof-assistants are now mature enough to formalise many aspects of mathematics. I outline some work we have done using…
Expand
1998
1998
A Modal Analysis of Some Principles of the Provability Logic of Heyting Artihmetic
Rosalie Iemhoff
Advances in Modal Logic
1998
Corpus ID: 45550291
Besides the well-known principles K, K4 and L, the Leivant principle (AVВ)→ (AVB) and the Formalized Markov scheme ¬¬ (A…
Expand
Review
1997
Review
1997
Review: Albert Visser, A Course on Bimodal Provability Logic
F. Montagna
Journal of Symbolic Logic (JSL)
1997
Corpus ID: 118015674
Despite the form, the content is not without interest. Most topics are treated in many different ways, and benefit from this…
Expand
1991
1991
Predicate provability logic with non-modalized quantifiers
G. Dzhaparidze
Studia Logica: An International Journal for…
1991
Corpus ID: 29278805
Predicate modal formulas with non-modalized quantifiers (call them Q′-formulas) are considered as schemata of arithmetical…
Expand