A partial order where all monotone maps are definable

2Citations
Citations of this article
73Readers
Mendeley users who have this article in their library.

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, ≤).

Cite

CITATION STYLE

APA

Goldstern, M., & Shelah, S. (1997). A partial order where all monotone maps are definable. Fundamenta Mathematicae, 152(3), 255–265. https://doi.org/10.4064/fm-152-3-255-265

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free