Recursive axiomatizations for representable posets

DOI10.1142/S021819671950022XOpenAlexW3105221300WikidataQ128564811 ScholiaQ128564811MaRDI QIDQ4968237

Robert Egrot

Publication date: 12 July 2019

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.08328

zbMATH Keywords

posetpartially ordered setposet representationrecursive axiomatizationaxioms from games

Mathematics Subject Classification ID

Algebraic aspects of posets (06A11) Applications of model theory (03C98)

Related Items (1)

RECURSIVE AXIOMATISATIONS FROM SEPARATION PROPERTIES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Representable posets
• The class of prime semilattices is not finitely axiomatizable
• No finite axiomatizations for posets embeddable into distributive lattices
• Every two elementarily equivalent models have isomorphic ultrapowers
• Disjoint-union partial algebras
• Non-elementary classes of representable posets
• A Representation Theory for Prime and Implicative Semilattices

This page was built for publication: Recursive axiomatizations for representable posets