33 search results - page 4 / 7 » Naming Proofs in Classical Propositional Logic |
TLCA
2009
Springer
14 years 9 days ago
2009
Springer
G¨odel’s completeness theorem is concerned with provability, while Girard’s theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proo...
ECCC
2007
13 years 5 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...
CORR
2011
Springer
13 years 23 days ago
2011
Springer
We give a calculus for reasoning about the first-order fragment of classical logic that is adequate for giving the truth conditions of intuitionistic Kripke frames, and outline a...
CADE
2004
Springer
14 years 6 months ago
2004
Springer
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...
VL
2007
IEEE
14 years 1 days ago
2007
IEEE
Interval-valued computation is an unconventional computing paradigm. It is an idealization of classical 16-, 32-, 64- etc. bit based computations. It represents data as specific ...