Mathematical Logic Quarterly 48 (4):525-532 (2002)

A partially ordered set is called k-homogeneous if any isomorphism between k-element subsets extends to an automorphism of . Assuming the set-theoretic assumption ⋄, it is shown that for each k, there exist partially ordered sets of size ϰ1 which embed each countable partial order and are k-homogeneous, but not -homogeneous. This is impossible in the countable case for k ≥ 4
Keywords homogeneous partial order  diamond
Categories (categorize this paper)
DOI 10.1002/1521-3870(200211)48:4
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 70,214
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Coloring Linear Orders with Rado's Partial Order.Riccardo Camerlo & Alberto Marcone - 2007 - Mathematical Logic Quarterly 53 (3):301-305.
On Notions of Genericity and Mutual Genericity.J. K. Truss - 2007 - Journal of Symbolic Logic 72 (3):755 - 766.
Interval Orders and Reverse Mathematics.Alberto Marcone - 2007 - Notre Dame Journal of Formal Logic 48 (3):425-448.
Morley Rank in Homogeneous Models.Alexei Kolesnikov & G. V. N. G. Krishnamurthi - 2006 - Notre Dame Journal of Formal Logic 47 (3):319-329.
On Countable Homogeneous 3-Hypergraphs.Reza Akhtar & Alistair H. Lachlan - 1995 - Archive for Mathematical Logic 34 (5):331-344.


Added to PP index

Total views
14 ( #732,190 of 2,507,563 )

Recent downloads (6 months)
1 ( #416,983 of 2,507,563 )

How can I increase my downloads?


My notes