Order polynomially complete lattices must be large

DOI10.1007/S000120050075MaRDI QIDQ1966144zbMATH OpenOpenAlexFDO

Authors S. Shelah, Martin Goldstern

Publication date 27 February 2000

Published in Algebra Universalis (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/9707203

zbMATH Keywords

inaccessible cardinalorder polynomially complete lattice

Mathematics Subject Classification ID

Large cardinals (03E55) Lattices (06B99)

Abstract: If L is an order polynomially complete lattice, (that is: every monotone function from L^n to L is induced by a lattice-theoretic polynomial) then the cardinality of L is a strongly inaccessible cardinal. In particular, the existence of such lattices is not provable in ZFC, nor from ZFC+GCH. Although the problem originates in algebra, the proof is purely set-theoretical. The main tools are partition and canonisation theorems. It is still open if the existence of infinite o.p.c. lattices can be refuted in ZFC.

Recommendations

• On order-polynomial completeness of lattices
• There are no infinite order polynomially complete lattices, after all
• Pre-fixed points of polynomial functions of lattices
• Interpolation of monotone functions in lattices
• scientific article; zbMATH DE number 2223001

Cited in

(4)

• Pre-fixed points of polynomial functions of lattices
• On order polynomially complete lattices
• On order-polynomial completeness of lattices
• There are no infinite order polynomially complete lattices, after all

This page was built for publication: Order polynomially complete lattices must be large

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1966144)