Cores of Countably Categorical Structures

DOI10.2168/LMCS-3(1:2)2007MaRDI QIDQ5310678zbMATH OpenFDO

Authors Manuel Bodirsky

Publication date 11 October 2007

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/LMCS-3(1:2)2007

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Categoricity and completeness of theories (03C35)

Recommendations

• STACS 2005
• Core-like properties of infinite graphs and structures
• Homomorphisms and amalgamation
• Equations in oligomorphic clones and the constraint satisfaction problem for \(\omega \)-categorical structures
• Computer Science Logic

Cited in

(34)

• A survey of homogeneous structures
• A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP
• Action of endomorphism semigroups on definable sets
• New Ramsey classes from old
• PROJECTIVE CLONE HOMOMORPHISMS
• Maximal digraphs with respect to primitive positive constructability
• CORES OVER RAMSEY STRUCTURES
• Smooth approximations: an algebraic approach to CSPs over finitely bounded homogeneous structures
• On a stronger reconstruction notion for monoids and clones
• Constants and finite unary relations in qualitative constraint reasoning
• Homogeneous structures: model theory meets universal algebra. Abstracts from the workshop held January 3--9, 2021 (online meeting)
• Circuit satisfiability and constraint satisfaction around Skolem arithmetic
• On the Zariski topology on endomorphism monoids of omega-categorical structures
• A complexity dichotomy in spatial reasoning via Ramsey theory
• Towards a Ryll-Nardzewski-type theorem for weakly oligomorphic structures
• A dichotomy for first-order reducts of unary structures
• Homomorphism order of connected monounary algebras
• Permutation groups with small orbit growth
• \( \omega \)-categorical structures avoiding height 1 identities
• Constraint satisfaction problems over numeric domains
• Generalized completion problems with forbidden tournaments
• An algebraic proof of the dichotomy for graph orientation problems with forbidden tournaments
• STACS 2005
• Equations in oligomorphic clones and the constraint satisfaction problem for \(\omega \)-categorical structures
• Smooth approximations and CSPs over finitely bounded homogeneous structures
• Polish topologies on endomorphism monoids of relational structures
• The wonderland of reflections
• Collapsing the bounded width hierarchy for infinite-domain constraint satisfaction problems: when symmetries are enough
• The language of stratified sets is confluent and strongly normalising
• Countably Categorical Structures with n-Degenerate Algebraic Closure
• Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems)
• Constraint Satisfaction Problems with Infinite Templates
• Solving equation systems in ω-categorical algebras
• Constraint satisfaction problems for reducts of homogeneous graphs

This page was built for publication: Cores of Countably Categorical Structures

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