Undecidable propositional bimodal logics and one-variable first-order linear temporal logics with counting
- Submitting institution
-
King's College London
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 86472585
- Type
- D - Journal article
- DOI
-
10.1145/2757285
- Title of journal
- ACM Transactions on Computational Logic
- Article number
- 27
- First page
- -
- Volume
- 16
- Issue
- 3
- ISSN
- 1529-3785
- Open access status
- Out of scope for open access requirements
- Month of publication
- July
- Year of publication
- 2015
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 3
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The paper solves (10) open problems on the computational complexity of first-order linear temporal logics with counting, and on related two-dimensional propositional bimodal logics. It shows that surprisingly ‘mild’ extensions of decidable one-variable fragments with counting capabilities may result in undecidable formalisms. The paper also gives an almost complete complexity classification for one-variable fragments with counting to two. It establishes a new method for proving complexity lower bounds for such logics.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -