The complexity of isomorphism for complete theories of linear orders with unary predicates (Q527333)

From MaRDI portal
Revision as of 18:00, 22 June 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of isomorphism for complete theories of linear orders with unary predicates
scientific article

    Statements

    The complexity of isomorphism for complete theories of linear orders with unary predicates (English)
    0 references
    0 references
    11 May 2017
    0 references

    Identifiers