Brodsky’s coding method for propositional logic is considered in the paper. Based on the sequent calculus, the method allows us to determine whether an arbitrary sequent is derivable in the calculus without constructing proof-search trees. The coding method, presented in the paper, can be used as a decision procedure for propositional logic
AbstractThis paper presents results on the definition of a sequent calculus for Minimal Implicationa...
Abstract separation logics are a family of extensions of Hoare logic for reasoning about programs th...
The goal of this article is to design a uniform proof-theoretical framework encompassing classical, ...
International audienceIn this paper we present a sequent calculus for the modal propositional logic ...
In the previous chapter we developed linear logic in the form of natural deduction, which is appropr...
The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non...
International audienceIn this article we define label-free sequent calculi for the intuitionistic mo...
An algorithm for deciding validity in the intuitionistic propositional calculus is presented, togeth...
International audienceIn this paper we present a sequent calculus for propositional dynamic logic bu...
Abstract. In usual proof systems, like the sequent calculus, only a very limited way of combining pr...
International audienceIn usual proof systems, like the sequent calculus, only a very limited way of ...
In this thesis we consider generic tools and techniques for the proof-theoretic investigation of not...
In this paper we present a cut-free sequent calculus, called SeqS, for some standard conditional log...
In this paper we present a cut-free sequent calculus, called SeqS, for some standard conditional log...
We present an extension of Stålmarck's method to classical first order predicate logic. Stålmarck's ...
AbstractThis paper presents results on the definition of a sequent calculus for Minimal Implicationa...
Abstract separation logics are a family of extensions of Hoare logic for reasoning about programs th...
The goal of this article is to design a uniform proof-theoretical framework encompassing classical, ...
International audienceIn this paper we present a sequent calculus for the modal propositional logic ...
In the previous chapter we developed linear logic in the form of natural deduction, which is appropr...
The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non...
International audienceIn this article we define label-free sequent calculi for the intuitionistic mo...
An algorithm for deciding validity in the intuitionistic propositional calculus is presented, togeth...
International audienceIn this paper we present a sequent calculus for propositional dynamic logic bu...
Abstract. In usual proof systems, like the sequent calculus, only a very limited way of combining pr...
International audienceIn usual proof systems, like the sequent calculus, only a very limited way of ...
In this thesis we consider generic tools and techniques for the proof-theoretic investigation of not...
In this paper we present a cut-free sequent calculus, called SeqS, for some standard conditional log...
In this paper we present a cut-free sequent calculus, called SeqS, for some standard conditional log...
We present an extension of Stålmarck's method to classical first order predicate logic. Stålmarck's ...
AbstractThis paper presents results on the definition of a sequent calculus for Minimal Implicationa...
Abstract separation logics are a family of extensions of Hoare logic for reasoning about programs th...
The goal of this article is to design a uniform proof-theoretical framework encompassing classical, ...
DOI
Add to ORKG