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)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2023.103286

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,100

External links

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

Through your library

My notes

Similar books and articles

The Ramsey theory of Henson graphs.Natasha Dobrinen - 2022 - Journal of Mathematical Logic 23 (1).
The Ramsey theory of the universal homogeneous triangle-free graph.Natasha Dobrinen - 2020 - Journal of Mathematical Logic 20 (2):2050012.
Rado’s Conjecture and its Baire version.Jing Zhang - 2019 - Journal of Mathematical Logic 20 (1):1950015.
Conjectures of Rado and Chang and special Aronszajn trees.Stevo Todorčević & Víctor Torres Pérez - 2012 - Mathematical Logic Quarterly 58 (4-5):342-347.
Forking and Dividing in Henson Graphs.Gabriel Conant - 2017 - Notre Dame Journal of Formal Logic 58 (4):555-566.
Conjectures of Rado and Chang and special Aronszajn trees.Stevo Todorčević & Víctor Torres Pérez - 2012 - Mathematical Logic Quarterly 58 (4):342-347.
[Omnibus Review].James E. Baumgartner - 1985 - Journal of Symbolic Logic 50 (1):239-240.
omnibus Review. [REVIEW]James Baumgartner - 1995 - Journal of Symbolic Logic 60 (2):698-701.
Reducts of the Henson graphs with a constant.András Pongrácz - 2017 - Annals of Pure and Applied Logic 168 (7):1472-1489.
Maximally embeddable components.Miloš S. Kurilić - 2013 - Archive for Mathematical Logic 52 (7-8):793-808.
Rado's Conjecture and Ascent Paths of Square Sequences.Stevo Todorčević & Víctor Torres Pérez - 2014 - Mathematical Logic Quarterly 60 (1-2):84-90.
Review: Shen Lin, Tibor Rado, Computer Studies of Turing Machine Problems; Allen H. Brady, The Conjectured Highest Scoring Machines for Rado's $sum(k)$ for the Value $K = 4$; Milton W. Green, A Lower Bound on Rado's Sigma Function for Binary Turing Machines. [REVIEW]H. B. Enderton - 1975 - Journal of Symbolic Logic 40 (4):617-617.
Variations of Rado's lemma.Paul Howard - 1993 - Mathematical Logic Quarterly 39 (1):353-356.
Partitions of large Rado graphs.M. Džamonja, J. A. Larson & W. J. Mitchell - 2009 - Archive for Mathematical Logic 48 (6):579-606.
Linguistic Graphs and their Applications.W. B. Vasantha Kandasamy, K. Ilanthenral & Florentin Smarandache - 2022 - Miami, FL, USA: Global Knowledge.

Analytics

Added to PP
2023-05-13

Downloads
8 (#1,320,657)

6 months
3 (#981,027)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

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 15 references / Add more references