Sciweavers

JSYML
2000
69views more  JSYML 2000»
13 years 5 months ago
Topological Elementary Equivalence of Closed Semi-Algebraic Sets in The Real Plane
We investigate topological properties of subsets S of the real plane, expressed by first-order logic sentences in the language of the reals augmented with a binary relation symbol...
Bart Kuijpers, Jan Paredaens, Jan Van den Bussche
JSYML
2000
48views more  JSYML 2000»
13 years 5 months ago
Two Consistency Results on Set Mappings
It is consistent that there is a set mapping from the four-tuples of n into the finite subsets with no free subsets of size tn for some natural number tn. For any n < it is con...
Péter Komjáth, Saharon Shelah
JSYML
2000
109views more  JSYML 2000»
13 years 5 months ago
Categorical Quasivarieties via Morita Equivalence
We give a new proof of the classification of 0-categorical quasivarieties by using Morita equivalence to reduce to term minimal quasivarieties.
Keith A. Kearnes
JSYML
2000
58views more  JSYML 2000»
13 years 5 months ago
Maharam Spectra of Loeb Spaces
We characterize Maharam spectra of Loeb probability spaces and give some applications of the results.
Renling Jin, H. Jerome Keisler
JSYML
2000
76views more  JSYML 2000»
13 years 5 months ago
Located Sets and Reverse Mathematics
Let X be a compact metric space. A closed set K X is located if the distance function d(x, K) exists as a continuous realvalued function on X; weakly located if the predicate d(x,...
Mariagnese Giusto, Stephen G. Simpson
JSYML
2000
97views more  JSYML 2000»
13 years 5 months ago
Weakly Algebraizable Logics
The class of weakly algebrizable logics is defined as the class of logics having monotonic and injective Leibniz operator. We show that "monotonicity" cannot be discarde...
Janusz Czelakowski, Ramon Jansana
JSYML
2000
77views more  JSYML 2000»
13 years 5 months ago
Formal Topologies on The Set of First-Order Formulae
Thierry Coquand, Sara Sadocco, Giovanni Sambin, Ja...
JSYML
2000
85views more  JSYML 2000»
13 years 5 months ago
The Logic of Choice
The choice construct (choose x : '(x)) is useful in software speci cations. We study extensions of rst-order logic with the choice construct. We prove some results about Hilb...
Andreas Blass, Yuri Gurevich
JSYML
2000
66views more  JSYML 2000»
13 years 5 months ago
After All, There Are Some Inequalities Which Are Provable in ZFC
We address ZFC inequalities between some cardinal invariants of the continuum, which turned to be true in spite of strong expectations given by [10].
Tomek Bartoszynski, Andrzej Roslanowski, Saharon S...