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

Richard Rast. The complexity of isomorphism for complete theories of linear orders with unary predicates. Arch. Math. Log., 56(3-4):289-307, 2017. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.