148 search results - page 18 / 30 » apal 2007 |
110
click to vote
APAL
2006
15 years 18 days ago
2006
By a well-known result of Cook and Reckhow [4, 12], all Frege systems for the Classical Propositional Calculus (CPC) are polynomially equivalent. Mints and Kojevnikov [11] have re...
93
Voted
APAL
2006
15 years 18 days ago
2006
We give a short proof of a lemma which generalizes both the main lemma from the original construction in the author's thesis of a model with no 2-Aronszajn trees, and also th...
99
Voted
APAL
2006
15 years 18 days ago
2006
Given a space X, J in an elementary submodel M of H(), define XM to be X M with the topology generated by {U M : U J M}. It is established, using anti-large-cardinals assumptio...
78
Voted
APAL
2005
15 years 13 days ago
2005
We study the minimal enumeration degree (e-degree) problem in models of fragments of Peano arithmetic (PA) and prove the following results: In any model M of 2 induction, there is ...
69
Voted
APAL
2005
15 years 13 days ago
2005
We prove that if G is a group definable in a saturated o-minimal structure, then G has no infinite descending chain of type-definable subgroups of bounded index. Equivalently, G h...