Sciweavers

1101 search results - page 14 / 221
» Forcing in proof theory
Sort
View
ITP
2010
163views Mathematics» more  ITP 2010»
13 years 11 months ago
Fast LCF-Style Proof Reconstruction for Z3
Abstract. The Satisfiability Modulo Theories (SMT) solver Z3 can generate proofs of unsatisfiability. We present independent reconstruction of these proofs in the theorem provers...
Sascha Böhme, Tjark Weber
CORR
2007
Springer
177views Education» more  CORR 2007»
13 years 7 months ago
Another Proof of Wright's Inequalities
We present a short way of proving the inequalities obtained by Wright in [Journal of Graph Theory, 4: 393 – 407 (1980)] concerning the number of connected graphs with ℓ edges m...
Vlady Ravelomanana
APAL
2010
123views more  APAL 2010»
13 years 5 months ago
Classical descriptive set theory as a refinement of effective descriptive set theory
The (effective) Suslin-Kleene Theorem is obtained as a corollary of a standard proof of the classical Suslin Theorem, by noticing that it is mostly constructive and applying to it...
Yiannis N. Moschovakis
JSYML
2002
63views more  JSYML 2002»
13 years 7 months ago
Wellordering Proofs for Metapredicative Mahlo
In this article we provide wellordering proofs for metapredicative systems of explicit mathematics and admissible set theory featuring suitable axioms about the Mahloness of the u...
Thomas Strahm
JOLLI
1998
78views more  JOLLI 1998»
13 years 7 months ago
Proof Nets and the Complexity of Processing Center Embedded Constructions
This paper shows how proof nets can be used to formalize the notion of “incomplete dependency” used in psycholinguistic theories of the unacceptability of center-embedded const...
Mark Johnson