827 search results - page 31 / 166 » Proof-Theoretic Soundness and Completeness |
APAL
2010
13 years 7 months ago
2010
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the meaning of the new notion and its a...
ENTCS
2008
13 years 7 months ago
2008
Lazy rewriting is a proper restriction of term rewriting that dynamically restricts the reduction of certain arguments of functions in order to obtain termination. In contrast to ...
EMISA
2002
Springer
13 years 7 months ago
2002
Springer
Abstract: This paper presents a new net-reduction methodology to facilitate the analysis of large workflow models. We propose an enhanced algorithm based on reducible subnet identi...
LOGCOM
2002
13 years 7 months ago
2002
We give a categorial characterization of how labelled deduction systems for logics with a propositional basis behave under unconstrained fibring and under fibring that is constrai...
LOGCOM
1998
13 years 7 months ago
1998
A sequent calculus of a new sort is extracted from the Prolog program leanTAP. This calculus is sound and complete, even though it lacks almost all structural rules. Thinking of l...