Recursive axiomatizations for representable posets
From MaRDI portal
Publication:4968237
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
- scientific article; zbMATH DE number 3115891 (Why is no real title available?)
- scientific article; zbMATH DE number 3751028 (Why is no real title available?)
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 3192066 (Why is no real title available?)
- A Representation Theory for Prime and Implicative Semilattices
- Disjoint-union partial algebras
- Every two elementarily equivalent models have isomorphic ultrapowers
- No finite axiomatizations for posets embeddable into distributive lattices
- Non-elementary classes of representable posets
- Representable posets
- Subsystems of second order arithmetic
- The class of prime semilattices is not finitely axiomatizable
Cited in
(6)- Axiomatisability problems for \(S\)-posets
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Axiomatizability of free \(S\)-posets
- Catalan recursion on externally ordered bases of unit interval positroids
- Recursive axiomatisations from separation properties
- 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)
