Add to ORKGWe consider the predicative modal provability logic of Peano Arithmetic where the interpretation of each atomic modal formulas is required to be belong to the set of arithmetic formulas of complexity Sigma_0^n. We show that for distinct values of n the corresponding modal formulas form a strict hierarchy and each of them is complete for the class Pi^0_2
International audienceWe define a class of modal logics LF by uniformly extending a class of modal l...
For lack of general algorithmic methods that apply to wide classes of logics, establishing a complex...
The original publication is available at www.springerlink.com. The decision problem for provability ...
We investigate the modal logic of interpretability over Peano arithmetic (PA). Our main result is a...
In this paper we refer to the modal logic GL, of which GL-Lin, is an extension, that is the closure ...
This thesis deals with provability logic. Strengthenings are obtained of some arithmetical completen...
This thesis is a study of nonstandard provability predicates for Peano Arithmetic (PA). By a nonstan...
Labelled sequent calculi are provided for a wide class of normal modal systems using truth values as...
Labelled sequent calculi are provided for a wide class of normal modal systems using truth values as...
In this paper four principles and one scheme of the Provability Logic of (intuitionistic) Heyting Ar...
We introduce verification logics, variants of Artemov's logic of proofs LP with new terms of the for...
We present a new proof-theoretic approach to bounding the complexity of the decision problem for pro...
International audienceModal logics are widely used in computer science. The complexity of modal sati...
The aim of the present paper is twofold: first I am somewhat dissatisfied with current treatments o...
Abstract. The computational complexity of the provability problem in systems of modal proposi-tional...
International audienceWe define a class of modal logics LF by uniformly extending a class of modal l...
For lack of general algorithmic methods that apply to wide classes of logics, establishing a complex...
The original publication is available at www.springerlink.com. The decision problem for provability ...
We investigate the modal logic of interpretability over Peano arithmetic (PA). Our main result is a...
In this paper we refer to the modal logic GL, of which GL-Lin, is an extension, that is the closure ...
This thesis deals with provability logic. Strengthenings are obtained of some arithmetical completen...
This thesis is a study of nonstandard provability predicates for Peano Arithmetic (PA). By a nonstan...
Labelled sequent calculi are provided for a wide class of normal modal systems using truth values as...
Labelled sequent calculi are provided for a wide class of normal modal systems using truth values as...
In this paper four principles and one scheme of the Provability Logic of (intuitionistic) Heyting Ar...
We introduce verification logics, variants of Artemov's logic of proofs LP with new terms of the for...
We present a new proof-theoretic approach to bounding the complexity of the decision problem for pro...
International audienceModal logics are widely used in computer science. The complexity of modal sati...
The aim of the present paper is twofold: first I am somewhat dissatisfied with current treatments o...
Abstract. The computational complexity of the provability problem in systems of modal proposi-tional...
International audienceWe define a class of modal logics LF by uniformly extending a class of modal l...
For lack of general algorithmic methods that apply to wide classes of logics, establishing a complex...
The original publication is available at www.springerlink.com. The decision problem for provability ...