LIPIcs.CSL.2011.20.pdf
- Filesize: 0.52 MB
- 15 pages
Document
Transfinite Update Procedures for Predicative Systems of Analysis
Author
-
Part of:
Volume:
Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL (CSL 2011)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Computer Science Logic (CSL) - License:
Creative Commons Attribution-NoDerivs 3.0 Unported license
- Publication Date: 2011-08-31
Cite As Get BibTex
Federico Aschieri. Transfinite Update Procedures for Predicative Systems of Analysis. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 20-34, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/LIPIcs.CSL.2011.20
Abstract
We present a simple-to-state, abstract computational problem, whose solution implies the 1-consistency of various systems of predicative Analysis and offers a way of extracting witnesses from classical proofs. In order to state the problem, we formulate the concept of transfinite update procedure, which extends Avigad's notion of update procedure to the transfinite and can be seen as an axiomatization of learning as it implicitly appears in various computational interpretations of predicative Analysis. We give iterative and bar recursive solutions to the problem.
Subject Classification
Keywords
- update procedure
- epsilon substitution method
- predicative classical analysis
- bar recursion
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads