Safe Recursive Set Functions
- Submitting institution
-
Swansea University / Prifysgol Abertawe
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 20591
- Type
- D - Journal article
- DOI
-
10.1017/jsl.2015.26
- Title of journal
- The Journal of Symbolic Logic
- Article number
- -
- First page
- 730
- Volume
- 80
- Issue
- 03
- ISSN
- 1943-5886
- 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
-
-
- Research group(s)
-
-
- Citation count
- 4
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The quest for adequate definitions of complexity classes like polynomial-time in set theory is a decades old challenge. Previous approaches are based on extending the Turing machine model to infinite ordinal time. This paper lays the foundation for adapting well-established function algebra characterisations of polynomial-time on finite strings to set theory by (i) inventing a set function algebra that employs typing to restrict its complexity, (ii) establishing its complexity on set encodings of finite strings, and (iii) prove its relation to fine structure definability in set theory. The work is based on successful collaboration between set theorists and computer scientists.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -