"The complexity of isomorphism for complete theories of linear orders with ..."

Richard Rast (2017)

> Home

Details and statistics

DOI: 10.1007/S00153-017-0525-Z

access: closed

type: Journal Article

metadata version: 2017-07-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/aml/Rast17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/aml/Rast17
Richard Rast:
The complexity of isomorphism for complete theories of linear orders with unary predicates. Arch. Math. Log. 56(3-4): 289-307 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.