Keshvardoost, Khadijeh and Klin, Bartek and Lasota, Sławomir and Ochremiak, Joanna and Toruńczyk, Szymon - Definable isomorphism problem

lmcs:4321 - Logical Methods in Computer Science, December 11, 2019, Volume 15, Issue 4
Definable isomorphism problem

Authors: Keshvardoost, Khadijeh and Klin, Bartek and Lasota, Sławomir and Ochremiak, Joanna and Toruńczyk, Szymon

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.


Source : oai:arXiv.org:1802.08500
Volume: Volume 15, Issue 4
Published on: December 11, 2019
Submitted on: February 27, 2018
Keywords: Computer Science - Logic in Computer Science


Share