Sciweavers

JSYML
2008
112views more  JSYML 2008»
13 years 3 months ago
Internal consistency for embedding complexity
In a previous paper with M. Dzamonja, class forcings were given which fixed the complexity (a universality covering number) for certain types of structures of size together with ...
Sy-David Friedman, Katherine Thompson
JSYML
2008
86views more  JSYML 2008»
13 years 3 months ago
On Skolemization in constructive theories
In this paper a method for the replacement, in formulas, of strong quantifiers by functions is introduced that can be considered as an alternative to Skolemization in the setting ...
Matthias Baaz, Rosalie Iemhoff
JSYML
2008
52views more  JSYML 2008»
13 years 3 months ago
Hierarchies of forcing axioms II
Itay Neeman
JSYML
2008
66views more  JSYML 2008»
13 years 3 months ago
Flat algebras and the translation of universal Horn logic to equational logic
We describe which subdirectly irreducible flat algebras arise in the variety generated by an arbitrary class of flat algebras with absorbing bottom element. This is used to give an...
Marcel Jackson
JSYML
2008
56views more  JSYML 2008»
13 years 3 months ago
On metric types that are definable in an o-minimal structure
Abstract. In this paper we study the metric spaces that are definable in a polynomially bounded ominimal structure. We prove that the family of metric spaces definable in a given p...
Guillaume Valette
JSYML
2008
105views more  JSYML 2008»
13 years 3 months ago
Finite state automata and monadic definability of singular cardinals
We define a class of finite state automata acting on transfinite sequences, and use these automata to prove that no singular cardinal can be defined by a monadic second order formu...
Itay Neeman
JSYML
2008
53views more  JSYML 2008»
13 years 3 months ago
On very high degrees
In this paper we show that there is a pair of superhigh r.e. degree that forms a minimal pair. An analysis of the proof shows that a critical ingredient is the growth rates of cert...
Keng Meng Ng
JSYML
2008
82views more  JSYML 2008»
13 years 3 months ago
The number of openly generated Boolean algebras
This article is devoted to two different generalizations of projective Boolean algebras: openly generated Boolean algebras and tightly -filtered Boolean algebras. We show that for ...
Stefan Geschke, Saharon Shelah