A diamond example of an ordinal graph with no infinite paths

Annals of Pure and Applied Logic 47 (1):1-10 (1990)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,102

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

Σ1-separation.Fred G. Abramson - 1979 - Journal of Symbolic Logic 44 (3):374 - 382.
Effective coloration.Dwight R. Bean - 1976 - Journal of Symbolic Logic 41 (2):469-480.
Twilight graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.
Ordinal operations on graph representations of sets.Laurence Kirby - 2013 - Mathematical Logic Quarterly 59 (1-2):19-26.
Finding paths through narrow and wide trees.Stephen Binns & Bjørn Kjos-Hanssen - 2009 - Journal of Symbolic Logic 74 (1):349-360.
Cardinal characteristics on graphs.Nick Haverkamp - 2011 - Journal of Symbolic Logic 76 (1):1 - 33.
Importing Logics.João Rasga, Amílcar Sernadas & Cristina Sernadas - 2012 - Studia Logica 100 (3):545-581.
An ordinal partition avoiding pentagrams.Jean A. Larson - 2000 - Journal of Symbolic Logic 65 (3):969-978.
Generic graph construction.James E. Baumgartner - 1984 - Journal of Symbolic Logic 49 (1):234-240.
Infinite time Turing machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):567-604.

Analytics

Added to PP
2014-01-16

Downloads
23 (#603,412)

6 months
1 (#1,149,473)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Partition relations on a plain product order type.Jean A. Larson - 2006 - Annals of Pure and Applied Logic 144 (1-3):117-125.
In memoriam: James Earl Baumgartner (1943–2011).J. A. Larson - 2017 - Archive for Mathematical Logic 56 (7):877-909.

Add more citations

References found in this work

[Omnibus Review].Thomas Jech - 1992 - Journal of Symbolic Logic 57 (1):261-262.

Add more references