Sciweavers

247 search results - page 18 / 50
» A Proof System and a Decision Procedure for Equality Logic
Sort
View
AIML
2006
13 years 9 months ago
Deep Sequent Systems for Modal Logic
We see a systematic set of cut-free axiomatisations for all the basic normal modal logics formed by some combination the axioms d, t, b, 4, 5. They employ a form of deep inference ...
Kai Brünnler
CADE
2006
Springer
14 years 7 months ago
Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic
Abstract. Inspired by the Curry-Howard correspondence, we study normalisation procedures in the depth-bounded intuitionistic sequent calculus of Hudelmaier (1988) for the implicati...
Roy Dyckhoff, Delia Kesner, Stéphane Lengra...
POPL
2012
ACM
12 years 3 months ago
Recursive proofs for inductive tree data-structures
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Ste...
WOLLIC
2009
Springer
14 years 2 months ago
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-fr...
Hugo Herbelin, Gyesik Lee
NGC
2000
Springer
124views Communications» more  NGC 2000»
13 years 7 months ago
Temporal Disjunctive Logic Programming
In this paper we introduce the logic programminglanguage Disjunctive Chronolog which combines the programming paradigms of temporal and disjunctive logic programming. Disjunctive C...
Manolis Gergatsoulis, Panos Rondogiannis, Themis P...