Results 1 -
2 of
2
On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the µ-Calculus
- IN PROCEEDINGS OF FOSSACS 2003
, 2003
"... In this paper we study induction in the context of the first-order µ-calculus with explicit approximations. We present and compare two Gentzen-style proof systems each using a different type of induction. The first is ..."
Abstract
-
Cited by 16 (2 self)
- Add to MetaCart
In this paper we study induction in the context of the first-order µ-calculus with explicit approximations. We present and compare two Gentzen-style proof systems each using a different type of induction. The first is
Free-variable tableaux for propositional modal logics
- Studia Logica
"... Abstract. Free-variable semantic tableaux are a well-established technique for first-order theorem proving where free variables act as a meta-linguistic device for tracking the eigenvariables used during proof search. We present the theoretical foundations to extend this technique to propositional m ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
Abstract. Free-variable semantic tableaux are a well-established technique for first-order theorem proving where free variables act as a meta-linguistic device for tracking the eigenvariables used during proof search. We present the theoretical foundations to extend this technique to propositional modal logics, including non-trivial rigorous proofs of soundness and completeness, and also present various techniques that improve the efficiency of the basic naive method for such tableaux.
