Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

102

Voted

STACS
1998
Springer

87views Theoretical Computer Science» more STACS 1998»

Optimal Proof Systems for Propositional Logic and Complete Sets

15 years 7 months ago

Optimal Proof Systems for Propositional Logic and Complete Sets

Download www.uni-ulm.de

Jochen Meßner, Jacobo Torán

Real-time Traffic

STACS 1998 | Theoretical Computer Science |

claim paper

Related Content

» On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT

» The Completeness of Propositional Resolution A Simple and Constructive Proof

» A Simple Propositional S5 Tableau System

» An alternative semantics for quantified relevant logic

» Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classe...

» On the Meaning of Logical Completeness

» A Proof System and a Decision Procedure for Equality Logic

» A Minimal Propositional Type Theory

» Adding the Everywhere Operator to Propositional Logic

Post Info
More Details (n/a)

Added	06 Aug 2010
Updated	06 Aug 2010
Type	Conference
Year	1998
Where	STACS
Authors	Jochen Meßner, Jacobo Torán

Comments (0)