Journal article
Complexity of two-variable logic on finite trees
- Abstract:
-
Verification of properties expressed in the two-variable fragment of first-order logic FO2 has been investigated in a number of contexts. The satisfiability problem for FO2 over arbitrary structures is known to be NEXPTIME-complete, with satisfiable formulas having exponential-sized models. Over words, where FO2 is known to have the same expressiveness as unary temporal logic, satisfiability is again NEXPTIME-complete. Over finite labelled ordered trees, FO2 has the same expressiveness as nav...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Accepted manuscript, pdf, 667.6KB)
-
- Publisher copy:
- 10.1145/2996796
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Bibliographic Details
- Publisher:
- Association for Computing Machinery Publisher's website
- Journal:
- ACM Transactions on Computational Logic Journal website
- Volume:
- 17
- Issue:
- 4
- Pages:
- 1-38
- Publication date:
- 2016-11-01
- Acceptance date:
- 2016-09-01
- DOI:
- EISSN:
-
1557-945X
- ISSN:
-
1529-3785
- Source identifiers:
-
664491
Item Description
- Keywords:
- Pubs id:
-
pubs:664491
- UUID:
-
uuid:4a8207dd-6dad-4a13-a4cf-82ad51f6e822
- Local pid:
- pubs:664491
- Deposit date:
- 2017-01-26
Terms of use
- Copyright holder:
- © 2016 ACM
- Copyright date:
- 2016
- Notes:
- © ACM, 2016.This is the author accepted manuscript following peer review version of the article. The final version is available online from Association for Computing Machinery at: 10.1145/2996796
If you are the owner of this record, you can report an update to it here: Report update to this record