Recursive axiomatizations for representable posets
From MaRDI portal
Publication:4968237
DOI10.1142/S021819671950022XOpenAlexW3105221300WikidataQ128564811 ScholiaQ128564811MaRDI QIDQ4968237FDOQ4968237
Authors: 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
Recommendations
- Non-elementary classes of representable posets
- Representable posets
- The Class of Representable Ordered Monoids has a Recursively Enumerable, Universal Axiomatisation but it is Not Finitely Axiomatisable
- Finite axiomatizations for existentially closed posets and semilattices
- A characterization theorem for injective model classes axiomatized by general rules
Cites Work
- Title not available (Why is that?)
- Subsystems of second order arithmetic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Every two elementarily equivalent models have isomorphic ultrapowers
- Representable posets
- A Representation Theory for Prime and Implicative Semilattices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Disjoint-union partial algebras
- Non-elementary classes of representable posets
- The class of prime semilattices is not finitely axiomatizable
- No finite axiomatizations for posets embeddable into distributive lattices
Cited In (6)
- Axiomatisability problems for \(S\)-posets
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Axiomatizability of free \(S\)-posets
- Recursive axiomatisations from separation properties
- Catalan recursion on externally ordered bases of unit interval positroids
- A representation of recursively enumerable sets through Horn formulas in higher recursion theory
This page was built for publication: Recursive axiomatizations for representable posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4968237)
