Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,261,769 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
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.
2013
2013
Models of transfinite provability logic
David Fernández-Duque
,
J. Joosten
The Journal of Symbolic Logic
2013
Corpus ID: 1839167
Abstract For any ordinal Λ, we can define a polymodal logic GLPΛ, with a modality [ξ] for each ξ < Λ. These represent provability…
Expand
2010
2010
Principles of Constructive Provability Logic
R. Simmons
,
Bernardo Toninho
2010
Corpus ID: 5945045
We present a novel formulation of the modal logic CPL, a constructive logic of provability that is closely connected to the G…
Expand
2010
2010
The Paradox of Inference and the Non-Triviality of Analytic Information
M. Duží
J. Philos. Log.
2010
Corpus ID: 16168379
The classical theory of semantic information (ESI), as formulated by Bar-Hillel and Carnap in 1952, does not give a satisfactory…
Expand
Highly Cited
2005
Highly Cited
2005
Proof Analysis in Modal Logic
Sara Negri
J. Philos. Log.
2005
Corpus ID: 12187857
A general method for generating contraction- and cut-free sequent calculi for a large family of normal modal logics is presented…
Expand
2005
2005
A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic
L. Beklemishev
,
J. Joosten
,
M. Vervoort
J. Log. Comput.
2005
Corpus ID: 12809528
We study a propositional polymodal provability logic GLP introduced by G. Japaridze. The previous treatments of this logic, due…
Expand
Highly Cited
2004
Highly Cited
2004
Intuitionistic logic and modality via topology
L. Esakia
Ann. Pure Appl. Log.
2004
Corpus ID: 46406166
1999
1999
Parameter Free Induction and Provably Total Computable Functions
L. Beklemishev
Theor. Comput. Sci.
1999
Corpus ID: 17730173
Review
1996
Review
1996
An Overview of Interpretability Logic
A. Visser
Advances in Modal Logic
1996
Corpus ID: 15538301
A miracle happens. In one hand we have a class of marvelously complex theories in predicate logic, theories with 'sufficient…
Expand
Highly Cited
1993
Highly Cited
1993
On Strong Provability Predicates and the Associated Modal Logics
K. N. Ignatiev
J. Symb. Log.
1993
Corpus ID: 27856686
PA is Peano Arithmetic. Pr(x) is the usual Σ1,-formula representing provability in PA. A strong provability predicate is a…
Expand
1990
1990
Characters and Fixed Points in Provability Logic
Zachari Gleit
,
W. Goldfarb
Notre Dame J. Formal Log.
1990
Corpus ID: 8921598
Some basic theorems about provability logic ― the system of modal logic that reflects the behavior of formalized provability…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE