A partial order where all monotone maps are definable

Martin Goldstern*, Saharon Shelah

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

It is consistent that there is a partial order (P, ≤) of size N1 such that every monotone function f : P → P is first order definable in (P, ≤).

Original languageEnglish
Pages (from-to)255-265
Number of pages11
JournalFundamenta Mathematicae
Volume152
Issue number3
DOIs
StatePublished - 1997

Fingerprint

Dive into the research topics of 'A partial order where all monotone maps are definable'. Together they form a unique fingerprint.

Cite this