Publication:
Recursive axiomatizations for representable posets

Issued Date

2019-06-01

Resource Type

Article

ISSN

02181967

DOI

10.1142/S021819671950022X

Other identifier(s)

2-s2.0-85061753495

Rights

Mahidol University

Rights Holder(s)

SCOPUS

Bibliographic Citation

International Journal of Algebra and Computation. Vol.29, No.4 (2019), 699-711

Suggested Citation

Rob Egrot Recursive axiomatizations for representable posets. International Journal of Algebra and Computation. Vol.29, No.4 (2019), 699-711. doi:10.1142/S021819671950022X Retrieved from: https://repository.li.mahidol.ac.th/handle/20.500.14594/51220

Research Projects

Organizational Units

Authors

Journal Issue

Thesis

Title

Recursive axiomatizations for representable posets

Author(s)

Rob Egrot

Other Contributor(s)

Mahidol University

Abstract

© 2019 World Scientific Publishing Company. We use model theoretic techniques and games to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of specified countable cardinalities correspond to intersections and unions, respectively.

Keyword(s)

Mathematics

Availability

URI

https://repository.li.mahidol.ac.th/handle/20.500.14594/51220

Collections

Scopus 2019