The complexity of isomorphism for complete theories of linear orders with unary predicates
Crossref DOI link: https://doi.org/10.1007/s00153-017-0525-z
Published Online: 2017-02-09
Published Print: 2017-05
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Rast, Richard http://orcid.org/0000-0002-9178-5127
License valid from 2017-02-09