Definable isomorphism problem

Autor: Khadijeh Keshvardoost, Bartek Klin, Sławomir Lasota, Joanna Ochremiak, Szymon Toruńczyk
Jazyk: angličtina
Rok vydání: 2019
Předmět:
Zdroj: Logical Methods in Computer Science, Vol Volume 15, Issue 4 (2019)
Druh dokumentu: article
ISSN: 1860-5974
DOI: 10.23638/LMCS-15(4:14)2019
Popis: We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying structure of atoms, we prove decidability of the problem. The core result is parameter-elimination: existence of an isomorphism definable with parameters implies existence of an isomorphism definable without parameters.
Databáze: Directory of Open Access Journals