Publication: Recursive axiomatizations for representable posets
| dc.contributor.author | Rob Egrot | en_US |
| dc.contributor.other | Mahidol University | en_US |
| dc.date.accessioned | 2020-01-27T09:13:30Z | |
| dc.date.available | 2020-01-27T09:13:30Z | |
| dc.date.issued | 2019-06-01 | en_US |
| dc.description.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. | en_US |
| dc.identifier.citation | International Journal of Algebra and Computation. Vol.29, No.4 (2019), 699-711 | en_US |
| dc.identifier.doi | 10.1142/S021819671950022X | en_US |
| dc.identifier.issn | 02181967 | en_US |
| dc.identifier.other | 2-s2.0-85061753495 | en_US |
| dc.identifier.uri | https://repository.li.mahidol.ac.th/handle/20.500.14594/51220 | |
| dc.rights | Mahidol University | en_US |
| dc.rights.holder | SCOPUS | en_US |
| dc.source.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85061753495&origin=inward | en_US |
| dc.subject | Mathematics | en_US |
| dc.title | Recursive axiomatizations for representable posets | en_US |
| dc.type | Article | en_US |
| dspace.entity.type | Publication | |
| mu.datasource.scopus | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85061753495&origin=inward | en_US |