Sciweavers

JSYML
2008
78views more  JSYML 2008»
13 years 11 months ago
Hierarchies of forcing axioms I
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...
Itay Neeman, Ernest Schimmerling
JSYML
2008
95views more  JSYML 2008»
13 years 11 months ago
Examples of non-locality
free but not Whitehead Abelian groups to construct Abstract Elementary Classes (AEC) which satisfy the amalgamation property but fail various conditions on the locality of Galois-...
John T. Baldwin, Saharon Shelah
JSYML
2008
33views more  JSYML 2008»
13 years 11 months ago
A note on standard systems and ultrafilters
Fredrik Engström
JSYML
2008
73views more  JSYML 2008»
13 years 11 months ago
Examining fragments of the quantified propositional calculus
When restricted to proving q i formulas, the quantified propositional proof system G i is closely related to the b i theorems of Buss's theory Si 2. Namely, G i has polynomial...
Steven Perron
JSYML
2008
72views more  JSYML 2008»
13 years 11 months ago
Perfect trees and elementary embeddings
An important technique in large cardinal set theory is that of extending an elementary embedding j : M N between inner models to an elementary embedding j : M[G] N[G] between ge...
Sy-David Friedman, Katherine Thompson
JSYML
2008
112views more  JSYML 2008»
13 years 11 months ago
On the structure of the Medvedev lattice
We investigate the structure of the Medvedev lattice as a partial order. We prove that every interval in the lattice is either finite, in which case it is isomorphic to a finite B...
Sebastiaan Terwijn
JSYML
2008
108views more  JSYML 2008»
13 years 11 months ago
Randomness, lowness and degrees
We say that A LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real , oracle B can also find patterns on . In o...
George Barmpalias, Andrew E. M. Lewis, Mariya Ivan...