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: 93,642

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

A diamond example of an ordinal graph with no infinite paths.J. E. Baumgartner - 1990 - Annals of Pure and Applied Logic 47 (1):1.
An example of an automatic graph of intermediate growth.Alexei Miasnikov & Dmytro Savchuk - 2015 - Annals of Pure and Applied Logic 166 (10):1037-1048.
More on the weak diamond.Saharon Shelah - 1985 - Annals of Pure and Applied Logic 28 (3):315-318.
Partition relations for κ-normal ideals on Pκ(λ).Pierre Matet - 2003 - Annals of Pure and Applied Logic 121 (1):89-111.
Ordinals and graph decompositions.Stephen Flood - 2017 - Annals of Pure and Applied Logic 168 (4):824-839.
The countable admissible ordinal equivalence relation.William Chan - 2017 - Annals of Pure and Applied Logic 168 (6):1224-1246.

Analytics

Added to PP
2014-01-16

Downloads
4 (#1,644,260)

6 months
26 (#116,274)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

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

Add more citations

References found in this work

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

Add more references