Forcing with copies of the Rado and Henson graphs

Annals of Pure and Applied Logic 174 (8):103286 (2023)
  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: 100,665

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

Reducts of the Henson graphs with a constant.András Pongrácz - 2017 - Annals of Pure and Applied Logic 168 (7):1472-1489.
The Ramsey theory of Henson graphs.Natasha Dobrinen - 2022 - Journal of Mathematical Logic 23 (1).
A-computable graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2016 - Annals of Pure and Applied Logic 167 (3):235-246.
Interaction graphs: Graphings.Thomas Seiller - 2017 - Annals of Pure and Applied Logic 168 (2):278-320.

Analytics

Added to PP
2023-05-13

Downloads
13 (#1,312,648)

6 months
4 (#1,234,271)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Set Theory.T. Jech - 2005 - Bulletin of Symbolic Logic 11 (2):243-245.
Iterated perfect-set forcing.James E. Baumgartner & Richard Laver - 1979 - Annals of Mathematical Logic 17 (3):271-288.
Set Theory.Thomas Jech - 1999 - Studia Logica 63 (2):300-300.
Ramsey type properties of ideals.M. Hrušák, D. Meza-Alcántara, E. Thümmel & C. Uzcátegui - 2017 - Annals of Pure and Applied Logic 168 (11):2022-2049.
Multiple Forcing.T. Jech - 1989 - Journal of Symbolic Logic 54 (3):1112-1113.

View all 16 references / Add more references