×

zbMATH — the first resource for mathematics

Complete ordered sets with no infinite antichains. (English) Zbl 0466.06002

MSC:
06A06 Partial orders, general
06B23 Complete lattices, completions
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Ranaschewski, B., Hüllensysteme und erweiterungen von quasi-ordnungen, Z. math. logik grundlagen math., 2, 117-130, (1956)
[2] Bonnet, R., Stratifications et extension des genres de chaînes dénombrables, C.R. acad. sc. Paris, 269, 880-882, (1969) · Zbl 0206.28001
[3] Bonnet, R.; Pouzet, M., Extension et stratification d’ensembles dispersés, C.R. acad. sc. Paris, 268, 1512-1515, (1969) · Zbl 0188.04203
[4] Charretton, C.; Pouzet, M., LES chaînes dans LES modeles d’Ehrenfeucht-mostowski, C.R. acad. sc. Paris, 290, 715-717, (1980), See also, Chains in Ehrenfeucht-Motowski models, preprint (1979) · Zbl 0434.03024
[5] Erdös, P.; Hajnal, A., On a classification of denumerable order types and an application to the partition calculus, Fund. math., 51, 117-129, (1962) · Zbl 0111.01201
[6] Erdös, P.; Rado, R., A partition calculus in set theory, Bull. amer. math. soc., 62, 427-489, (1956) · Zbl 0071.05105
[7] Kelly, D.; Rival, I., Certain partially ordered sets of dimension three, J. combinatorial theory, 18, 239-242, (1975), (Ser. A) · Zbl 0308.06003
[8] Laver, R., Well-quasi-orderings and sets of finite sequences, Proc. Cambridge philos. soc., 79, (1976) · Zbl 0405.06001
[9] Pouzet, M., Generalisation d’une construction de ben dushnik-E. W. Miller, C.R. acad. sc. Paris, 269, 877-879, (1969) · Zbl 0206.29601
[10] Rado, R., Partial well ordering of sets of vectors, Mathematika, 1, 89-95, (1954) · Zbl 0057.04302
[11] Ramsey, F.P., On a problem of formal logic, Proc. London math. soc., 30, 264-286, (1930) · JFM 55.0032.04
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.