The following pages link to Decidability of Definability (Q5407040):
Displaying 49 items.
- Constraint satisfaction and semilinear expansions of addition over the rationals and the reals (Q269512) (← links)
- Reducts of the random partial order (Q462283) (← links)
- Permutations on the random permutation (Q491556) (← links)
- Reducts of the Henson graphs with a constant (Q526969) (← links)
- Decidability and definability with circumscription (Q579240) (← links)
- On the expression complexity of equivalence and isomorphism of primitive positive formulas (Q692919) (← links)
- Reducts of the generic digraph (Q904153) (← links)
- Infinitely many reducts of homogeneous structures (Q1652879) (← links)
- The wonderland of reflections (Q1709740) (← links)
- Constants and finite unary relations in qualitative constraint reasoning (Q1749385) (← links)
- Deciding open definability via subisomorphisms (Q1799273) (← links)
- Decidability in elementary analysis. I (Q1823233) (← links)
- Generating primitive positive clones (Q1866838) (← links)
- Permutation groups with small orbit growth (Q2037519) (← links)
- Homogeneous structures: model theory meets universal algebra. Abstracts from the workshop held January 3--9, 2021 (online meeting) (Q2131194) (← links)
- Deciding quantifier-free definability in finite algebraic structures (Q2219074) (← links)
- Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem (Q2221799) (← links)
- Fixed points in compactifications and combinatorial counterparts (Q2323060) (← links)
- Decidability of general extensional mereology (Q2377058) (← links)
- Gowers' Ramsey theorem with multiple operations and dynamics of the homeomorphism group of the Lelek fan (Q2397101) (← links)
- Ramsey properties of products and pullbacks of categories and the Grothendieck construction (Q2677649) (← links)
- Topological dynamics of kaleidoscopic groups (Q2687344) (← links)
- Schaefer's theorem for graphs (Q2796406) (← links)
- The 42 reducts of the random ordered graph (Q2949677) (← links)
- When Is Reachability Intrinsically Decidable? (Q3533013) (← links)
- (Q3815280) (← links)
- (Q4249223) (← links)
- PAIRWISE NONISOMORPHIC MAXIMAL-CLOSED SUBGROUPS OF SYM(ℕ) VIA THE CLASSIFICATION OF THE REDUCTS OF THE HENSON DIGRAPHS (Q4579799) (← links)
- A Dichotomy for First-Order Reducts of Unary Structures (Q4643958) (← links)
- (Q4643959) (← links)
- UNIVERSAL MINIMAL FLOWS OF GENERALIZED WAŻEWSKI DENDRITES (Q4647116) (← links)
- (Q4840170) (← links)
- Decidability in Intuitionistic Type Theory is Functionally Decidable (Q4888341) (← links)
- Ticket Entailment is decidable (Q4925031) (← links)
- Permutation groups containing infinite symplectic linear groups and reducts of linear spaces over the two element field (Q4978358) (← links)
- Topological dynamics of unordered Ramsey structures (Q4983476) (← links)
- PROJECTIVE CLONE HOMOMORPHISMS (Q5000252) (← links)
- CORES OVER RAMSEY STRUCTURES (Q5000273) (← links)
- A Dichotomy Theorem for the Inverse Satisfiability Problem (Q5136331) (← links)
- (Q5154970) (← links)
- Constraint Satisfaction Problems for Reducts of Homogeneous Graphs (Q5232325) (← links)
- Definability by turing machines (Q5595160) (← links)
- The lattice of definability: origins, recent developments, and further directions (Q6132481) (← links)
- Decidable and Undecidable Problems for First-Order Definability and Modal Definability (Q6487229) (← links)
- A logic-based framework for characterizing nexus of similarity within knowledge bases (Q6497354) (← links)
- Complexity classification transfer for CSPs via algebraic products (Q6621744) (← links)
- From Ramsey degrees to Ramsey expansions via weak amalgamation (Q6634619) (← links)
- Smooth approximations and CSPs over finitely bounded homogeneous structures (Q6649468) (← links)
- Collapsing the bounded width hierarchy for infinite-domain constraint satisfaction problems: when symmetries are enough (Q6654559) (← links)
