Duplication-Free Tableau Calculi Together With Cut-Free and Contraction-Free Sequent Calculi for the Interpolable . . .
نویسندگان
چکیده
منابع مشابه
Contraction-free sequent calculi for geometric theories with an application to Barr's theorem
Geometric theories are presented as contractionand cut-free systems of sequent calculi with mathematical rules following a prescribed rule-scheme that extends the scheme given in Negri and von Plato (1998). Examples include cut-free calculi for Robinson arithmetic and real closed fields. As an immediate consequence of cut elimination, it is shown that if a geometric implication is classically d...
متن کاملDual Systems of Tableaux and Sequents for PLTL
On one hand, traditional tableau systems for temporal logic (TL) generate an auxiliary graph that must be checked and (possibly) pruned in a second phase of the refutation procedure. On the other hand, traditional sequent calculi for TL make use of a kind of inference rules (mainly, invariant-based rules or infinitary rules) that complicates their automatization. A remarkable consequence of usi...
متن کاملSpace-efficient Decision Procedures for Three Interpolable Propositional Intermediate Logics
In this paper we present duplication-free tableau calculi for three propositional intermediate interpolable logics, namely the logic characterized by rooted Kripke models with depth two at most, the logic characterized by rooted Kripke models with two final elements at most and depth two at most and the logic characterized by rooted Kripke models with a final element at most (also known as Jank...
متن کاملNon-elementary Speed-ups in Proof Length by Different Variants of Classical Analytic Calculi
In this paper, diierent variants of classical analytic calculi for rst-order logic are compared with respect to the length of proofs possible in such calculi. A cut-free sequent calculus is used as a prototype for diierent other analytic calculi like analytic tableau or various connection calculi. With modiied branching rules ({rules), non-elementary shorter minimal proofs can be obtained for a...
متن کاملAre Tableaux an Improvement on Truth-Tables? Cut-Free proofs and Bivalence
We show that Smullyan's analytic tableaux cannot p-simulate the truth-tables. We identify the cause of this computational breakdown and relate it to an underlying semantic diiculty which is common to the whole tradition originating in Gentzen's sequent calculus, namely the dissonance between cut-free proofs and the Principle of Bivalence. Finally we discuss some ways in which this principle can...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997