Infinite combinatorics and definability

Annals of Pure and Applied Logic 41 (2):179-203 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 98,316

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Algebraic combinatorics in bounded induction.Joaquín Borrego-Díaz - 2021 - Annals of Pure and Applied Logic 172 (2):102885.
On Gödel incompleteness and finite combinatorics.Akihiro Kanamori & Kenneth McAloon - 1987 - Annals of Pure and Applied Logic 33 (C):23-41.
Foundations of iterated star maps and their use in combinatorics.Mauro Di Nasso & Renling Jin - 2025 - Annals of Pure and Applied Logic 176 (1):103511.
Definability hierarchies of general quantifiers.Lauri Hella - 1989 - Annals of Pure and Applied Logic 43 (3):235.
The definability of E in self-iterable mice.Farmer Schlutzenberg - 2023 - Annals of Pure and Applied Logic 174 (2):103208.
First-order definability on finite structures.M. Ajtai - 1989 - Annals of Pure and Applied Logic 45 (3):211-225.
On the definability of mad families of vector spaces.Haim Horowitz & Saharon Shelah - 2022 - Annals of Pure and Applied Logic 173 (4):103079.
Effective topological spaces I: A definability theory.Iraj Kalantari & Galen Weitkamp - 1985 - Annals of Pure and Applied Logic 29 (1):1-27.

Analytics

Added to PP
2014-01-16

Downloads
38 (#475,267)

6 months
4 (#1,172,474)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Coanalytic ultrafilter bases.Jonathan Schilhan - 2022 - Archive for Mathematical Logic 61 (3-4):567-581.
A Borel maximal eventually different family.Haim Horowitz & Saharon Shelah - forthcoming - Annals of Pure and Applied Logic.
Projective mad families.Sy-David Friedman & Lyubomyr Zdomskyy - 2010 - Annals of Pure and Applied Logic 161 (12):1581-1587.

View all 29 citations / Add more citations

References found in this work

Happy families.A. R. D. Mathias - 1977 - Annals of Mathematical Logic 12 (1):59.
Iterated perfect-set forcing.James E. Baumgartner & Richard Laver - 1979 - Annals of Mathematical Logic 17 (3):271-288.
A new proof that analytic sets are Ramsey.Erik Ellentuck - 1974 - Journal of Symbolic Logic 39 (1):163-165.
Borel sets and Ramsey's theorem.Fred Galvin & Karel Prikry - 1973 - Journal of Symbolic Logic 38 (2):193-198.
Every analytic set is Ramsey.Jack Silver - 1970 - Journal of Symbolic Logic 35 (1):60-64.

View all 8 references / Add more references