97
Voted
MLQ
2007
15 years 4 days ago
2007
Let ω denote the set of natural numbers. For functions f, g : ω → ω, we say that f is dominated by g if f(n) < g(n) for all but finitely many n ∈ ω. We consider the st...
83
Voted
MLQ
2007
15 years 4 days ago
2007
We define two notions for intuitionistic predicate logic: that of a submodel of a Kripke model, and that of a universal sentence. We then prove a corresponding preservation theor...
MLQ
2007
15 years 4 days ago
2007
We compute here the Borel complexity of the relation of isometry between separable Banach spaces, using results of Gao, Kechris [1] and Mayer-Wolf [4]. We show that this relation ...
48
Voted
MLQ
2007
15 years 4 days ago
2007
74
Voted
MLQ
2007
15 years 4 days ago
2007
Let R be the preorder of embeddability between countable linear orders colored with elements of Rado’s partial order (a standard example of a wqo which is not a bqo). We show tha...