Sciweavers

105 search results - page 1 / 21
» Optimal Proof Systems for Propositional Logic and Complete S...
Sort
View
CSL
2010
Springer
13 years 5 months ago
On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...
Yijia Chen, Jörg Flum
LMCS
2006
126views more  LMCS 2006»
13 years 4 months ago
The Completeness of Propositional Resolution: A Simple and Constructive Proof
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing tha...
Jean H. Gallier
APAL
1999
88views more  APAL 1999»
13 years 4 months ago
A Simple Propositional S5 Tableau System
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
Melvin Fitting
JSYML
2006
85views more  JSYML 2006»
13 years 4 months ago
An alternative semantics for quantified relevant logic
The quantified relevant logic RQ is given a new semantics in which a formula xA is true when there is some true proposition that implies all x-instantiations of A. Formulae are mo...
Robert Goldblatt, Edwin D. Mares