Universal Horn Sentences and the Joint Embedding Property

DOI10.46298/DMTCS.7435OpenAlexW3154847826MaRDI QIDQ5038201FDOQ5038201

Authors: Manuel Bodirsky, Jakub Rydval, André Schrottenloher 

Publication date: 30 September 2022

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

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

Recommendations

• Decision problems concerning properties of finite sets of equations
• Model complete universal Horn classes
• Forbidden subgraphs and forbidden substructures
• An undecidable problem in finite combinatorics
• On decidability of the decomposability problem for finite theories

zbMATH Keywords

universalHornjoint embedding property

Mathematics Subject Classification ID

Model theory (03Cxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Foundations of inductive logic programming
• Complexity of infinite-domain constraint satisfaction
• Some useful preservation theorems
• A proof of the CSP dichotomy conjecture
• An algebraic view on p-admissible concrete domains for lightweight description logics
• ASNP: a tame fragment of existential second-order logic
• Title not available (Why is that?)

Cited In (6)

• Deciding atomicity of subword-closed languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the spectra of universal relational sentences
• Smooth approximations and CSPs over finitely bounded homogeneous structures

This page was built for publication: Universal Horn Sentences and the Joint Embedding Property

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