Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

We deal with the fragment of modal logic consisting of implications of formulas built up from the variables and the constant… Expand

Is this relevant?

2012

2012

The fragment of the polymodal provability logic GLP in the language with connectives ┬, Λ, and 〈n〉 for all n ∈ ω is considered… Expand

Is this relevant?

2010

2010

We present a novel formulation of the modal logic CPL, a constructive logic of provability that is closely connected to the G… Expand

Is this relevant?

2008

2008

In 1983, Valentini presented a syntactic proof of cut-elimi nation for a sequent calculus GLSV for the provability logic GL where… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

A general method for generating contraction- and cut-free sequent calculi for a large family of normal modal logics is presented… Expand

Is this relevant?

2004

2004

Abstract In the pioneering article and two papers, written jointly with McKinsey, Tarski developed the so-called algebraic and… Expand

Is this relevant?

2001

2001

In the paper the joint Logic of Proofs and Provability LPP is presented that incorporates both the modality □ for provability… Expand

Is this relevant?

Highly Cited

1993

Highly Cited

1993

PA is Peano Arithmetic. Pr( x ) is the usual Σ 1 ,-formula representing provability in PA. A strong provability predicate is a… Expand

Is this relevant?

1993

1993

In this paper we develop techniques to build various sets of highly undecidable sentences in Ido + i2,. Our results stem from an… Expand

Is this relevant?

1990

1990

Some basic theorems about provability logic ― the system of modal logic that reflects the behavior of formalized provability… Expand

Is this relevant?