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

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

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

(36)

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

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)