154 search results - page 2 / 31 » Proof Complexity of Non-classical Logics |
AML
2006
13 years 5 months ago
2006
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...
CSL
2010
Springer
13 years 6 months ago
2010
Springer
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...
POPL
2012
ACM
12 years 14 days ago
2012
ACM
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...
ECCC
2007
13 years 4 months ago
2007
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
LOGCOM
2010
13 years 3 months ago
2010
The logic of proofs (LP) was proposed as Gödel’s missed link between Intuitionistic and S4-proofs, but so far the tableau-based methods proposed for LPhave not explored this cl...