Decidability of Definability

From MaRDI portal
Publication:5407040

DOI10.2178/jsl.7804020zbMath1327.03008arXiv1012.2381OpenAlexW2078586522MaRDI QIDQ5407040

Todor Tsankov, Manuel Bodirsky, Michael Pinsker

Publication date: 4 April 2014

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

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




Related Items (29)

Constraint satisfaction and semilinear expansions of addition over the rationals and the realsHomogeneous structures: model theory meets universal algebra. Abstracts from the workshop held January 3--9, 2021 (online meeting)Infinitely many reducts of homogeneous structuresGowers' Ramsey theorem with multiple operations and dynamics of the homeomorphism group of the Lelek fanPAIRWISE NONISOMORPHIC MAXIMAL-CLOSED SUBGROUPS OF SYM(ℕ) VIA THE CLASSIFICATION OF THE REDUCTS OF THE HENSON DIGRAPHSThe 42 reducts of the random ordered graphRamsey properties of products and pullbacks of categories and the Grothendieck constructionThe lattice of definability: origins, recent developments, and further directionsTopological dynamics of kaleidoscopic groupsReducts of the generic digraphThe wonderland of reflectionsReducts of the random partial orderComplexity of inverse constraint problems and a dichotomy for the inverse satisfiability problemPermutations on the random permutationUNIVERSAL MINIMAL FLOWS OF GENERALIZED WAŻEWSKI DENDRITESConstants and finite unary relations in qualitative constraint reasoningReducts of the Henson graphs with a constantSchaefer's Theorem for GraphsPermutation groups with small orbit growthPermutation groups containing infinite symplectic linear groups and reducts of linear spaces over the two element fieldTopological dynamics of unordered Ramsey structuresConstraint Satisfaction Problems for Reducts of Homogeneous GraphsFixed points in compactifications and combinatorial counterpartsA Dichotomy for First-Order Reducts of Unary StructuresPROJECTIVE CLONE HOMOMORPHISMSCORES OVER RAMSEY STRUCTURESUnnamed ItemA Dichotomy Theorem for the Inverse Satisfiability ProblemUnnamed Item




This page was built for publication: Decidability of Definability