Recursive axiomatisations from separation properties

DOI10.1017/JSL.2021.19MaRDI QIDQ5015731zbMATH OpenOpenAlexFDO

Authors Robert Egrot

Publication date 9 December 2021

Published in Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

disjoint union partial algebrasfirst-order axiomatisabilitygenerating recursive axiomatisationsgraph colouringsharmonious colouringsrepresentable posets

Mathematics Subject Classification ID

Higher-order logic (03B16) Applications of model theory (03C98) Coloring of graphs and hypergraphs (05C15) Partial algebras (08A55)

Recommendations

• Complete axiomatizations of fragments of monadic second-order logic on finite trees
• Where first-order and monadic second-order logic coincide
• Where first-order and monadic second-order logic coincide
• Separating regular languages with first-order logic
• Approximating trees as coloured linear orders and complete axiomatisations of some classes of trees

Cites work

• A Representation Theory for Prime and Implicative Semilattices
• Atomic compactness and graph theory
• Boolean Rings with Isomorphisms Preserving Suprema and Infima
• Closure operators, frames and neatest representations
• Completely representable lattices
• Disjoint-union partial algebras
• Distributive partially ordered sets
• Embedding ordered sets into distributive lattices
• Every two elementarily equivalent models have isomorphic ultrapowers
• Graph Theory and Probability
• 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 3795986 (Why is no real title available?)
• scientific article; zbMATH DE number 3192066 (Why is no real title available?)
• scientific article; zbMATH DE number 3068973 (Why is no real title available?)
• No finite axiomatizations for posets embeddable into distributive lattices
• Non-elementary classes of representable posets
• On the definition of distributive semilattices
• On the Harmonious Coloring of Graphs
• On the representation of Boolean algebras as fields of sets
• On the Representation of α-Complete Boolean Algebras
• On the representation of α-complete lattices
• On the representation of 𝜎-complete Boolean algebras
• Recursive axiomatizations for representable posets
• Reduced direct products
• Relation algebras by games
• Representability is not decidable for finite relation algebras
• Representable posets
• Representation of partially ordered sets
• REPRESENTATION OF POSETS
• Representations of Lattices by Sets
• The class of prime semilattices is not finitely axiomatizable
• The First Order Theory of N-Colorable Graphs
• The Theory of Representation for Boolean Algebras
• Weakly distributive semilattices

Cited in

(4)

• Sheaf recursion and a separation theorem
• scientific article; zbMATH DE number 5812467 (Why is no real title available?)
• scientific article; zbMATH DE number 7564689 (Why is no real title available?)
• Recursive axiomatisations from separation properties

This page was built for publication: Recursive axiomatisations from separation properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5015731)