Order polynomially complete lattices must be large

Algebra Universalis

Volumn 39, Issue 3-4, 1998, Pages 197-209

  Goldstern, M ^a,b   Shelah, S ^c  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Canonization; Inaccessible cardinal; Polynomially complete

Indexed keywords

EID: 0038979678     PISSN: 00025240     EISSN: None     Source Type: Journal    
DOI: 10.1007/s000120050075     Document Type: Article

References (5)

1. ERDOS, P., HAJNAL, A., MATÉ, A. and RADO, R., Combinatorial set theory: Partition Relations for Cardinals, volume 106 of Studies in Logic and the Foundation of Math. North Holland Publ. Co., Amsterdam, 1984.
2. GOLDSTERN, M. and SHELAH, S., A partial order where all monotone maps are definable, Fundamenta Mathematicae 152 (1997), 255-265.
3. JECH, T., Set Theory, Pure and Applied Mathematics, Academic Press, New York, San Francisco, London, 1978.
4. KAISER, H. and SAUER, N., On order polynomially complete lattices, Algebra univers. 30 (1993), 171-176.
5. PLOŠČICA, M. and HAVIAR, M., On order-polynomial completeness of lattices, Algebra univers. 39 (1998), 217-219 (this issue).