Definability and Interpolation in Decidable Fixpoint Logics
- Submitting institution
-
University of Oxford
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 10411
- Type
- D - Journal article
- DOI
-
10.23638/LMCS-15(3:29)2019
- Title of journal
- Logical Methods in Computer Science
- Article number
- ARTN 29
- First page
- 29:1
- Volume
- 15
- Issue
- 3
- ISSN
- 1860-5974
- Open access status
- Compliant
- Month of publication
- September
- Year of publication
- 2019
- 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
-
2
- Research group(s)
-
-
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- A powerful technique for showing decidability of logics is via the tree-like model property, which allows us to restrict to models that can be described by trees. This paper shows that the tree-like model property can be used to resolve a number of other computational problems in logics, including interpolation and membership in sublanguages. This paper was invited to a special issue of LMCS as an extension of the paper “Characterizing definability in decidable fixpoint logics'', which won the best paper award in Track B of the 44th International Colloquium on Automata Languages and Programming (ICALP 2017).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -