3353 search results - page 220 / 671 » Laver and set theory |
169
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Hardness results for maximum agreement problems have close connections to hardness results for proper learning in computational learning theory. In this paper we prove two hardnes...
149
click to vote
AML
2006
15 years 6 months ago
2006
Vardanyan's Theorem states that the set of PA-valid principles of Quantified Modal Logic, QML, is complete 0 2. We generalize this result to a wide class of theories. The cru...
141
click to vote
IPL
2008
15 years 6 months ago
2008
The Chernoff-Hoeffding bounds are fundamental probabilistic tools. An elementary approach is presented to obtain a Chernoff-type upper-tail bound for the number of prime factors o...
152
click to vote
JSC
2008
15 years 6 months ago
2008
Abstract. Flat theory with sequence variables and flexible arity symbols has infinitary matching and unification type. Decidability of general unification is shown and a unificatio...
137
click to vote
APAL
2005
15 years 6 months ago
2005
We give a broad discussion of reflection principles in explicit mathematics, thereby addressing various kinds of universe existence principles. The proof-theoretic strength of the...