basic constructions:
strong axioms
further
constructive mathematics, realizability, computability
propositions as types, proofs as programs, computational trinitarianism
Neutral constructive mathematics is a branch of constructive mathematics which simply removes the axiom of choice and excluded middle from the axioms of the foundations, and does not replace it either with weaker versions of the axiom of choice or with axioms which contradict the axiom of choice. Thus, neutral constructive mathematics is agnostic about the status of the axiom of choice and excluded middle.
As a result, impredicative neutral constructive mathematics is the internal logic of an elementary topos with natural numbers object.
Examples of mathematical foundations which one could do impredicative neutral constructive mathematics include:
Martin-Löf type theory, cubical type theory, or (higher) observational type theory with a type of all propositions.
intuitionistic higher-order logic
intuitionistic ETCS
intuitionistic bounded SEAR
the internal logic of any elementary topos
Examples of mathematical foundations which one could do predicative neutral constructive mathematics include:
Martin-Löf type theory, cubical type theory, or (higher) observational type theory.
the internal logic of any --pretopos.
In general, for any statement which is true in classical mathematics, the statement that “the law of excluded middle implies ” is true in neutral constructive mathematics.
Furthermore, for any statement which is true in classical mathematics with the axiom of choice, the statement that “the axiom of choice implies ” is true in neutral constructive mathematics.
classical sets only form a Heyting pretopos rather than an elementary topos.
inequality spaces only form a Π-pretopos rather than a elementary topos.
In topology, locales are usually better behaved than topological spaces. Thus, in real analysis one usually talks about the localic real numbers rather than the Dedekind real numbers . Many statements, such as the Heine-Borel theorem, the fundamental theorem of algebra, et cetera, are true in the localic real numbers, while they are not provable in the Dedekind real numbers. Nevertheless, the Dedekind real numbers are still of interest, being the spatial points of the localic real numbers, and the two notions coincide with excluded middle.
Similarly, one usually talks about the localic complex numbers or the localic real Clifford algebra , et cetera, instead of the Dedekind complex numbers or the Dedekind real Clifford algebra .
The modulated Cantor real numbers or Eudoxus real numbers are a subset of the Dedekind real numbers, but cannot be proven to be equivalent to the Dedekind real numbers, nor can they be proven to be sequentially Cauchy complete. Nevertheless, the modulated Cantor real numbers are of interest since they are defined using sequences of rational numbers, locators, or almost linear homomorphisms on the integers, and thus are the ones which could be computed with in an algorithm, (see exact real arithmetic).
The HoTT book real numbers are the minimum subset of the Dedekind real numbers for which analytic functions like the exponential function, sine, and cosine are well-defined, as well as the Jordan content and Riemann integration. They are defined as the sequential Cauchy completion of the rational numbers.
Unsigned decimal digits are not sufficient to represent the modulated Cantor real numbers, one has to use signed decimal digits instead.
Continuous functions on the localic real numbers are continuous maps between the locales.
If using the localic real numbers, semidefinite integrals are fundamental and antiderivatives are a derived concept; additionally, the existence of a semidefinite integral must be proven directly in the fundamental theorem of calculus, rather than indirectly through the existence of definite integrals
Not every subset has an injection into the superset. Thus, subsets with an injection are usually better behaved than general subsets.
Not every vector space has a basis. Thus, free vector spaces are usually better behaved than vector spaces in general.
Jason Rute?, What is neutral constructive mathematics, (MathOverflow)
Fred Richman, Constructive Mathematics without Choice,
in: Reuniting the Antipodes – Constructive and Nonstandard Views of the Continuum, Synthese Library 306, Springer (2001) 199-206 [doi:10.1007/978-94-015-9757-9_17]
There was a seminar on neutral constructive mathematics:
Last revised on August 20, 2024 at 19:24:17. See the history of this page for a list of all contributions to it.