Analysis in a Formal Predicative Set Theory

In Alexandra Silva, Renata Wassermann & Ruy de Queiroz (eds.), Logic, Language, Information, and Computation: 27th International Workshop, Wollic 2021, Virtual Event, October 5–8, 2021, Proceedings. Springer Verlag. pp. 167-183 (2021)
  Copy   BIBTEX

Abstract

We present correct and natural development of fundamental analysis in a predicative set theory we call PZFU\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf {PZF}^{\mathsf {U}}}$$\end{document}. This is done by using a delicate and careful choice of those Dedekind cuts that are adopted as real numbers. PZFU\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf {PZF}^{\mathsf {U}}}$$\end{document} is based on ancestral logic rather than on first-order logic. Its key feature is that it is definitional in the sense that every object which is shown in it to exist is defined by some closed term of the theory. This allows for a very concrete, computationally-oriented model of it, and makes it very suitable for MKM and ITP. The development of analysis in PZFU\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf {PZF}^{\mathsf {U}}}$$\end{document} does not involve coding, and the definitions it provides for the basic notions are the natural ones, almost the same as one can find in any standard analysis book.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Hard Provability Logics.Mojtaba Mojtahedi - 2021 - In Mojtaba Mojtahedi, Shahid Rahman & MohammadSaleh Zarepour (eds.), Mathematics, Logic, and their Philosophies: Essays in Honour of Mohammad Ardeshir. Springer. pp. 253-312.
Minimal elementary end extensions.James H. Schmerl - 2017 - Archive for Mathematical Logic 56 (5-6):541-553.
Interpretability suprema in Peano Arithmetic.Paula Henk & Albert Visser - 2017 - Archive for Mathematical Logic 56 (5-6):555-584.
Peter Fishburn’s analysis of ambiguity.Mark Shattuck & Carl Wagner - 2016 - Theory and Decision 81 (2):153-165.

Analytics

Added to PP
2022-03-10

Downloads
6 (#1,484,355)

6 months
5 (#711,233)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references