The poset of all copies of the random graph has the 2-localization property

Annals of Pure and Applied Logic 167 (8):649-662 (2016)
  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: 101,053

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

Posets of copies of countable scattered linear orders.Miloš S. Kurilić - 2014 - Annals of Pure and Applied Logic 165 (3):895-912.
Random generations of the countable random graph.Su Gao & A. Vershik - 2006 - Annals of Pure and Applied Logic 143 (1-3):79-86.
A graph which embeds all small graphs on any large set of vertices.S. Shelah - 1988 - Annals of Pure and Applied Logic 38 (2):171-183.

Analytics

Added to PP
2016-06-30

Downloads
27 (#805,882)

6 months
6 (#807,020)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Forcing with copies of the Rado and Henson graphs.Osvaldo Guzmán & Stevo Todorcevic - 2023 - Annals of Pure and Applied Logic 174 (8):103286.

Add more citations

References found in this work

Set Theory.Keith J. Devlin - 1981 - Journal of Symbolic Logic 46 (4):876-877.
Set Theory.Thomas Jech - 1999 - Studia Logica 63 (2):300-300.
Forcing by non-scattered sets.Miloš S. Kurilić & Stevo Todorčević - 2012 - Annals of Pure and Applied Logic 163 (9):1299-1308.
Posets of copies of countable scattered linear orders.Miloš S. Kurilić - 2014 - Annals of Pure and Applied Logic 165 (3):895-912.

View all 9 references / Add more references