Publication: Representable posets
item.page.dc.date.issued
2016-01-13
item.page.dc.type
item.page.dc.identifier.issn
15708683
item.page.dc.identifier.doi
item.page.dc.identifier.other
2-s2.0-84992304894
item.page.dc.rights
Mahidol University
item.page.dc.rights.holder
SCOPUS
item.page.dc.identifier.citation
Journal of Applied Logic. Vol.16, (2016), 60-71
punsarn.item.page.citation
Rob Egrot Representable posets. Journal of Applied Logic. Vol.16, (2016), 60-71. doi:10.1016/j.jal.2016.03.003 Retrieved from: https://repository.li.mahidol.ac.th/handle/123456789/40954
Research Projects
Organizational Units
Authors
Journal Issue
relationships.isThesisOf
item.page.dc.title
Representable posets
item.page.dc.contributor.author
item.page.dc.contributor.other
item.page.dc.description.abstract
© 2016 Elsevier B.V. A poset is representable if it can be embedded in a field of sets in such a way that existing finite meets and joins become intersections and unions respectively (we say finite meets and joins are preserved). More generally, for cardinals α and β a poset is said to be (α,β)-representable if an embedding into a field of sets exists that preserves meets of sets smaller than α and joins of sets smaller than β. We show using an ultraproduct/ultraroot argument that when 2≤α,β≤ω the class of (α,β)-representable posets is elementary, but does not have a finite axiomatization in the case where either α or β=ω. We also show that the classes of posets with representations preserving either countable or all meets and joins are pseudoelementary.
