The equivalence of definable quantifiers in second order arithmetic
Wojciech Guzicki (1981)
Fundamenta Mathematicae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Wojciech Guzicki (1981)
Fundamenta Mathematicae
Similarity:
J. Malitz, Jan Mycielski, W. Reinhardt (1992)
Fundamenta Mathematicae
Similarity:
Žarko Mijajlović, Dragan Doder, Angelina Ilić-Stepić (2011)
Publications de l'Institut Mathématique
Similarity:
Matt Kaufmann (1984)
Fundamenta Mathematicae
Similarity:
Małgorzata Dubiel (1980)
Fundamenta Mathematicae
Similarity:
Ladislav Rieger (1957)
Czechoslovak Mathematical Journal
Similarity:
Vladimir Kanovei (1997)
Fundamenta Mathematicae
Similarity:
A model is presented in which the equivalence relation xCy iff L[x]=L[y] of equiconstructibility of reals does not admit a reasonable form of the Glimm-Effros theorem. The model is a kind of iterated Sacks generic extension of the constructible model, but with an “ill“founded “length” of the iteration. In another model of this type, we get an example of a non-Glimm-Effros equivalence relation on reals. As a more elementary application of the technique of “ill“founded Sacks iterations,...
Wojciech Guzicki (1974)
Fundamenta Mathematicae
Similarity:
Saharon Shelah (1999)
Fundamenta Mathematicae
Similarity:
For a cardinal μ we give a sufficient condition (involving ranks measuring existence of independent sets) for: if a Borel set B ⊆ ℝ × ℝ contains a μ-square (i.e. a set of the form A × A with |A| =μ) then it contains a -square and even a perfect square, and also for if has a model of cardinality μ then it has a model of cardinality continuum generated in a “nice”, “absolute” way. Assuming for transparency, those three conditions (, and ) are equivalent, and from this we...