The poset of all copies of the random graph has the 2-localization property
Authors:
- Miloš S. KurilićMKMiloš S. Kurilić
- Stevo TodorčevićSTStevo Todorčević
- 1 August 2016
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 167 (8) , 649-662
Abstract
No abstract availableFunding Information
- Natural Sciences and Engineering Research Council of Canada (455916)
- Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja (174006)
- Centre National de la Recherche Scientifique
This publication has 12 references indexed in Scilit:
- Different similaritiesArchive for Mathematical Logic, 2015
- Forcing with copies of countable ordinalsProceedings of the American Mathematical Society, 2014
- Isomorphic and strongly connected componentsArchive for Mathematical Logic, 2014
- FROM A1 TO D5: TOWARDS A FORCING-RELATED CLASSIFICATION OF RELATIONAL STRUCTURESThe Journal of Symbolic Logic, 2014
- Posets of copies of countable scattered linear ordersAnnals of Pure and Applied Logic, 2014
- Maximally embeddable componentsArchive for Mathematical Logic, 2013
- Forcing by non-scattered setsAnnals of Pure and Applied Logic, 2012
- Set Theory1997
- The ideal determined by the unsymmetric gameProceedings of the American Mathematical Society, 1993
- Asymmetric graphsActa Mathematica Hungarica, 1963