32 search results - page 3 / 7 » The Strength of the Besicovitch-Davies Theorem |
JSC
2010
13 years 4 months ago
2010
The topic of this article is decision procedures for satisfiability modulo theories (SMT) of arbitrary quantifier-free formulæ. We propose an approach that decomposes the formu...
LICS
2002
IEEE
13 years 10 months ago
2002
IEEE
We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We...
CADE
2008
Springer
14 years 6 months ago
2008
Springer
We describe a framework with which first order theorem provers can be used for checking formal proofs. The main aim of the framework is to take as much advantage as possible from t...
CIE
2009
Springer
14 years 10 days ago
2009
Springer
We give a combinatorial proof of a tight relationship between the Kanamori-McAloon principle and the Paris-Harrington theorem with a number-theoretic parameter function. We show th...
JSYML
2008
13 years 5 months ago
2008
Abstract. We prove new upper bound theorems on the consistency strengths of SPFA(), SPFA(-linked) and SPFA(+ -cc). Our results are in terms of (, )-subcompactness, which is a new l...