RECURSIVE AXIOMATISATIONS FROM SEPARATION PROPERTIES
From MaRDI portal
Publication:5015731
DOI10.1017/jsl.2021.19OpenAlexW3128130048MaRDI QIDQ5015731
Publication date: 9 December 2021
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.00202
graph colouringsharmonious colouringsrepresentable posetsdisjoint union partial algebrasfirst-order axiomatisabilitygenerating recursive axiomatisations
Coloring of graphs and hypergraphs (05C15) Partial algebras (08A55) Applications of model theory (03C98) Higher-order logic (03B16)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Representable posets
- Completely representable lattices
- Relation algebras by games
- The class of prime semilattices is not finitely axiomatizable
- No finite axiomatizations for posets embeddable into distributive lattices
- Embedding ordered sets into distributive lattices
- Every two elementarily equivalent models have isomorphic ultrapowers
- On the definition of distributive semilattices
- Representability is not decidable for finite relation algebras
- On the Representation of α-Complete Boolean Algebras
- Graph Theory and Probability
- On the Harmonious Coloring of Graphs
- Distributive partially ordered sets
- Reduced direct products
- On the representation of α-complete lattices
- The First Order Theory of N-Colorable Graphs
- REPRESENTATION OF POSETS
- CLOSURE OPERATORS, FRAMES AND NEATEST REPRESENTATIONS
- Recursive axiomatizations for representable posets
- Disjoint-union partial algebras
- Non-elementary classes of representable posets
- A Representation Theory for Prime and Implicative Semilattices
- Atomic compactness and graph theory
- Boolean Rings with Isomorphisms Preserving Suprema and Infima
- The Theory of Representation for Boolean Algebras
- Representations of Lattices by Sets
- On the representation of 𝜎-complete Boolean algebras
- On the representation of Boolean algebras as fields of sets
- Representation of partially ordered sets
- Weakly distributive semilattices
This page was built for publication: RECURSIVE AXIOMATISATIONS FROM SEPARATION PROPERTIES
