144 search results - page 4 / 29 » On meta complexity of propositional formulas and proposition... |
LOGCOM
2010
13 years 5 months ago
2010
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...
LATIN
2004
Springer
14 years 25 days ago
2004
Springer
Equality logic with or without uninterpreted functions is used for proving the equivalence or refinement between systems (hardware verification, compiler’s translation, etc). C...
CADE
2001
Springer
14 years 7 months ago
2001
Springer
The STRIP system is a theorem prover for intuitionistic propositional logic with two main characteristics: it deals with the duplication of formulae during proof-search from a fine...
JANCL
2006
13 years 7 months ago
2006
We describe a relational framework that uniformly supports formalization and automated reasoning in various propositional modal logics. The proof system we propose is a relational ...
CSL
2005
Springer
14 years 1 months ago
2005
Springer
The proof system G∗ 0 of the quantified propositional calculus corresponds to NC1 , and G∗ 1 corresponds to P, but no formula-based proof system that corresponds log space rea...