Artykuł w czasopiśmie
Brak miniatury
Licencja
CC-BYCC-BY - Uznanie autorstwa
 

Definable isomorphism problem

Uproszczony widok
cris.lastimport.scopus2024-02-12T20:10:00Z
dc.abstract.enWe investigate the isomorphism problem in the setting of definable sets (equiv-alent to sets with atoms): given two definable relational structures, are they related by adefinable isomorphism? Under mild assumptions on the underlying structure of atoms, weprove decidability of the problem. The core result is parameter-elimination: existence ofan isomorphism definable with parameters implies existence of an isomorphism definablewithout parameters.
dc.affiliationUniwersytet Warszawski
dc.contributor.authorLasota, Sławomir
dc.contributor.authorKeshvardoost, Khadijeh
dc.contributor.authorOchremiak, Joanna
dc.contributor.authorKlin, Bartosz
dc.contributor.authorToruńczyk, Szymon
dc.date.accessioned2024-01-24T21:19:18Z
dc.date.available2024-01-24T21:19:18Z
dc.date.copyright2019-12-11
dc.date.issued2019
dc.description.accesstimeAT_PUBLICATION
dc.description.financeNie dotyczy
dc.description.number4
dc.description.versionFINAL_PUBLISHED
dc.description.volume15
dc.identifier.doi10.23638/LMCS-15(4:14)2019
dc.identifier.issn1860-5974
dc.identifier.urihttps://repozytorium.uw.edu.pl//handle/item/104452
dc.identifier.weblinkhttp://www.scopus.com/inward/record.url?eid=2-s2.0-85078708301&partnerID=MN8TOARS
dc.languageeng
dc.pbn.affiliationcomputer and information sciences
dc.relation.ispartofLogical Methods in Computer Science
dc.relation.pages14:1–14:19
dc.rightsCC-BY
dc.sciencecloudnosend
dc.titleDefinable isomorphism problem
dc.typeJournalArticle
dspace.entity.typePublication