133 search results - page 22 / 27 » The basic intuitionistic logic of proofs |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract--Effective complexity measures the information content of the regularities of an object. It has been introduced by M. Gell-Mann and S. Lloyd to avoid some of the disadvant...
WOLLIC
2010
Springer
14 years 13 days ago
2010
Springer
Proof theoretic characterizations of complexity classes are of considerable interest because they link levels of conceptual abstraction to computational complexity. We consider he...
CSL
2007
Springer
13 years 11 months ago
2007
Springer
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
ICFP
2003
ACM
14 years 7 months ago
2003
ACM
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
ESOP
2010
Springer
14 years 4 months ago
2010
Springer
Transient faults are single-shot hardware errors caused by high energy particles from space, manufacturing defects, overheating, and other sources. Such faults can be devastating f...