Sciweavers

351 search results - page 13 / 71
» Classical proof forestry
Sort
View
AML
2006
106views more  AML 2006»
13 years 7 months ago
Upper bounds on complexity of Frege proofs with limited use of certain schemata
The paper considers a commonly used axiomatization of the classical propositional logic and studies how different axiom schemata in this system contribute to proof complexity of th...
Pavel Naumov
LPAR
2007
Springer
14 years 1 months ago
Zenon : An Extensible Automated Theorem Prover Producing Checkable Proofs
Abstract. We present Zenon, an automated theorem prover for first order classical logic (with equality), based on the tableau method. Zenon is intended to be the dedicated prover ...
Richard Bonichon, David Delahaye, Damien Doligez
JAR
2010
123views more  JAR 2010»
13 years 6 months ago
A Framework for Proof Systems
Meta-logics and type systems based on intuitionistic logic are commonly used for specifying natural deduction proof systems. We shall show here that linear logic can be used as a m...
Vivek Nigam, Dale Miller
BSL
2004
100views more  BSL 2004»
13 years 7 months ago
Forcing in proof theory
Paul Cohen's method of forcing, together with Saul Kripke's related semantics for modal and intuitionistic logic, has had profound effects on a number of branches of mat...
Jeremy Avigad
CORR
2010
Springer
113views Education» more  CORR 2010»
13 years 7 months ago
Game semantics for first-order logic
We refine HO/N game semantics with an additional notion of pointer (mu-pointers) and extend it to first-order classical logic with completeness results. We use a Church style exte...
Olivier Laurent