Applicable mathematics in a minimal computational theory of sets

DOI10.23638/LMCS-14(4:1)2018MaRDI QIDQ4553281zbMATH OpenFDO

Publication date 2 November 2018

Full work available at URL https://arxiv.org/abs/1801.02387

Mechanization of proofs and logical operations (03B35) Axiomatics of classical set theory and its fragments (03E30)

Abstract: In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored. In this work we first improve that framework by enriching it with means for coherently extending by definitions its theories, without destroying its static nature or violating any of the principles on which it is based. Then we turn to investigate within the enriched framework the power of the minimal (predicatively acceptable) theory in it that proves the existence of infinite sets. We show that that theory is a computational theory, in the sense that every element of its minimal transitive model is denoted by some of its closed terms. (That model happens to be the second universe in Jensen's hierarchy.) Then we show that already this minimal theory suffices for developing very large portions (if not all) of scientifically applicable mathematics. This requires treating the collection of real numbers as a proper class, that is: a unary predicate which can be introduced in the theory by the static extension method described in the first part of the paper.

Recommendations

Cites work

Cited in

(6)

Describes a project that uses

Uses Software

This page was built for publication: Applicable mathematics in a minimal computational theory of sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4553281)