Admissible Substitutions in Sequent Calculi
نویسنده
چکیده
For first-order classical logic a new notion of admissible substitution is defined. This notion allows optimizing the procedure of the application of quantifier rules when logical inference search is made in sequent calculi. Our objective is to show that such a computer-oriented sequent technique may be created that does not require a preliminary skolemization of initial formulas and that is efficiently comparable with methods exploiting the skolemization. Some results on its soundness and completeness are given.
منابع مشابه
0 N ov 2 01 7 A Cut - free sequent calculus for modal logic S 5 ∗ †
Providing a cut-free sequent calculus for S5 has a long history. The efforts in this direction are numerous, and each of them presents some difficulties. In this paper, we present a sequent calculus system for modal logic S5. It has in a sense subformula property. We show that the cut rule is admissible in this system.
متن کاملDAG Sequent Proofs with a Substitu- tion Rule
In this paper we study an extension to classical sequent calculus with a substitution rule, which is normally admissible in classical logic. The structure of proofs is also extended to permit DAG shaped proofs. We analyse several properties of this system, such as the complexity of cut-elimination, and propose an extended tableau proof system, called s-tableau, that corresponds to the DAGsequen...
متن کاملSequent Calculi for Indexed Epistemic Logics
Indexed epistemic logics constitute a well-structured class of quantified epistemic logics with great expressive power and a well-behaved semantics based on the notion of epistemic transition model. It follows that they generalize term-modal logics. As to proof theory, the only axiomatic system for which we have a completeness theorem is the minimal system Q.Ke, whether with classical or with f...
متن کاملDelayed Substitutions
This paper investigates an approach to substitution alternative to the implicit treatment of the λ-calculus and the explicit treatment of explicit substitution calculi. In this approach, substitutions are delayed (but not executed) explicitly. We implement this idea with two calculi, one where substitution is a primitive construction of the calculus, the other where substitutions is represented...
متن کاملA cut-free sequent calculus for the logic of subset spaces
Following the tradition of labelled sequent calculi for modal logics, we present a one-sided, cut-free sequent calculus for the bimodal logic of subset spaces. In labelled sequent calculi, semantical notions are internalised into the calculus, and we take care to choose them close to the original interpretation of the system. To achieve this, we introduce a variation of the standard method, con...
متن کامل