Finitisation for Propositional Linear Time Logic
نویسندگان
چکیده
Currently known sequent systems for propositional linear time temporal logic either include a cut rule in some form or an infinitary rule, which is a rule with infinitely many premises. We strengthen the infinitary rule to require only a finite number of premises and show that this modification preserves soundness. This way we obtain a finitary cut-free sequent system which almost fulfills the subformula property. However, the number of premises of the finitary rule is exponential in the size of its conclusion and the soundness proof relies on the small model property.
منابع مشابه
Equality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملNatural Deduction Calculus for Quantified Propositional Linear-time Temporal Logic. Technical Report
We present a natural deduction calculus for the quantified propositional linear-time temporal logic (QPTL) and prove its correctness. The system extends previous natural deduction constructions for the propositional linear-time temporal logic. These developments extend the applicability of the natural deduction to more sophisticated specifications due to the expressive power of QPTL and, on the...
متن کاملWeak Completeness Theorem for Propositional Linear Time Temporal Logic
We prove weak (finite set of premises) completeness theorem for extended propositional linear time temporal logic with irreflexive version of until-operator. We base it on the proof of completeness for basic propositional linear time temporal logic given in [20] which roughly follows the idea of the Henkin-Hasenjaeger method for classical logic. We show that a temporal model exists for every fo...
متن کاملComplexity of propositional Linear-time Temporal Logic with finitely many variables
We prove that model-checking and satisfiability problems for propositional Linear-time Temporal Logic with a single variable are PSPACE-complete.
متن کامل