1101 search results - page 38 / 221 » Forcing in proof theory |
TYPES
2000
Springer
13 years 11 months ago
2000
Springer
Higman's lemma has a very elegant, non-constructive proof due to Nash-Williams [NW63] using the so-called minimal-bad-sequence argument. The objective of the present paper is ...
IPL
2006
13 years 7 months ago
2006
We present a Coq-formalised proof that all non-cooperative, sequential games have a Nash equilibrium point. Our proof methodology follows the style advocated by LCFstyle theorem p...
WOLLIC
2010
Springer
13 years 6 months ago
2010
Springer
We provide a formalisation of the theory of pushdown automata (PDAs) using the HOL4 theorem prover. It illustrates how provers such as HOL can be used for mechanising complicated p...
STOC
1994
ACM
13 years 11 months ago
1994
ACM
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandomnumber generators do not exist. This famous result is ...
AISC
2008
Springer
13 years 9 months ago
2008
Springer
Craig's Interpolation Theorem is an important meta-theoretical result for several logics. Here we describe a formalisation of the result for first-order intuitionistic logic w...