Definable isomorphism problemArticleAuthors: Khadijeh Keshvardoost ; Bartek Klin

; Sławomir Lasota

; Joanna Ochremiak ; Szymon Toruńczyk

NULL##0000-0001-5793-7425##0000-0001-8674-4470##NULL##0000-0002-1130-9033
Khadijeh Keshvardoost;Bartek Klin;Sławomir Lasota;Joanna Ochremiak;Szymon Toruńczyk
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.
Volume: Volume 15, Issue 4
Published on: December 11, 2019
Accepted on: November 11, 2019
Submitted on: February 27, 2018
Keywords: Computer Science - Logic in Computer Science
Funding:
Source : OpenAIRE Graph- A unified theory of finite-state recognisability; Funder: European Commission; Code: 683080