Sciweavers

JSYML
2010
69views more  JSYML 2010»
13 years 10 months ago
On quasiminimal excellent classes
Jonathan Kirby
JSYML
2010
68views more  JSYML 2010»
13 years 10 months ago
An equiconsistency for universal indestructibility
We obtain an equiconsistency for a weak form of universal indestructibility for strongness. The equiconsistency is relative to a cardinal weaker in consistency strength than a Woo...
Arthur W. Apter, Grigor Sargsyan
JSYML
2010
62views more  JSYML 2010»
13 years 10 months ago
A monotonicity theorem for dp-minimal densely ordered groups
Dp-minimality is a common generalization of weak minimality and weak o-minimality. If T is a weakly o-minimal theory then it is dp-minimal (Fact 2.2), but there are dp-minimal den...
John Goodrick
JSYML
2010
72views more  JSYML 2010»
13 years 10 months ago
A form of feasible interpolation for constant depth Frege systems
Let L be a first-order language and Φ and Ψ two Σ1 1 L-sentences that cannot be satisfied simultaneously in any finite L-structure. Then obviously the following principle Cha...
Jan Krajícek
JSYML
2010
56views more  JSYML 2010»
13 years 10 months ago
A Sacks real out of nowhere
There is a proper countable support iteration of length adding no new reals at finite stages and adding a Sacks real in the limit.
Jakob Kellner, Saharon Shelah
JSYML
2010
107views more  JSYML 2010»
13 years 10 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
JSYML
2010
55views more  JSYML 2010»
13 years 10 months ago
Groups definable in linear o-minimal structures: the non-compact case
Let M = M, +, <, 0, S be a linear o-minimal expansion of an ordered group, and G = G, ⊕, eG an n-dimensional group definable in M. We show that if G is definably connected w...
Pantelis E. Eleftheriou
JSYML
2010
114views more  JSYML 2010»
13 years 10 months ago
The Ackermann functions are not optimal, but by how much?
By taking a closer look at the construction of an Ackermann function we see that between any primitive recursive degree and its Ackermann modification there is a dense chain of p...
Harold Simmons
JSYML
2010
46views more  JSYML 2010»
13 years 10 months ago
Lattice initial segments of the hyperdegrees
Bjørn Kjos-Hanssen, Richard A. Shore