351 search results - page 21 / 71 » Classical proof forestry |
TPHOL
2008
IEEE
14 years 2 months ago
2008
IEEE
The HOL4 proof assistant supports specification and proof in classical higher order logic. It is the latest in a long line of similar systems. In this short overview, we give an o...
FCT
2007
Springer
14 years 1 months ago
2007
Springer
We give a classification of block-wise symmetric signatures in the theory of matchgate computations. The main proof technique is matchgate identities, a.k.a. useful Grassmann-Pl¨...
CONCUR
1998
Springer
13 years 12 months ago
1998
Springer
The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of universal coalgebr...
LICS
1995
IEEE
13 years 11 months ago
1995
IEEE
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Hartmanis used Kolmogorov complexity to provide an alternate proof of the classical result of Baker, Gill, and Solovay that there is an oracle relative to which P is not NP. We re...