Related papers: (Seemingly) Impossible Theorems in Constructive Ma…
Using the notion of existentially closed structures, we obtain embedding theorems for groups and Lie algebras. We also prove the existence of some groups and Lie algebras with prescribed properties.
The almost periodic functions form a natural example of a non-separable normed space. As such, it has been a challenge for constructive mathematicians to find a natural treatment of them. Here we present a simple proof of Bohr's fundamental…
The first examples of exceptional terminal singularities are constructed.
This book is an introductory course to basic commutative algebra with a particular emphasis on finitely generated projective modules. We adopt the constructive point of view, with which all existence theorems have an explicit algorithmic…
The \emph{International Obfuscated C Code Contest} was a programming contest for the most creatively obfuscated yet succinct C code. By \emph{contrast}, an interest herein is in programs which are, \emph{in a sense}, \emph{easily} seen to…
The Implicit and Inverse Function Theorems are special cases of a general Implicit/Inverse Function Theorem which can be easily derived from either theorem. The theorems can thus be easily deduced from each other via the generalized…
We construct a function for almost-complex Riemannian manifolds. Non-vanishing of the function for the almost-complex structure implies the almost-complex structure is not integrable. Therefore the constructed function is an obstruction for…
If the sequent (Gamma entails forall x exists y A) is provable in first order constructive natural deduction, then the theory (Gamma, forall x (f (x)/y)A), where f is a new function symbol, is a conservative extension of Gamma.
A new characterization of provably recursive functions of first-order arithmetic is described. Its main feature is using only terms consisting of 0, the successor S and variables in the quantifier rules, namely, universal elimination and…
Will the cosmological multiverse, when described mathematically, have easily stated properties that are impossible to prove or disprove using mathematical physics? We explore this question by constructing lattice multiverses which exhibit…
Interactive theorem provers based on dependent type theory have the flexibility to support both constructive and classical reasoning. Constructive reasoning is supported natively by dependent type theory and classical reasoning is typically…
In the general context of computable metric spaces and computable measures we prove a kind of constructive Borel-Cantelli lemma: given a sequence (constructive in some way) of sets $A_{i}$ with effectively summable measures, there are…
After highlighting the cases in which the semantics of a language cannot be mechanically reproduced (in which case it is called inherent), the main epistemological consequences of the first incompleteness Theorem for the two fundamental…
By employing certain extended classical summation theorems, several surprising \pi and other formulae are displayed.
In this paper, we present a constructive proof of Herschfeld's Convergence Theorem. Our formulation differs from Herschfeld's in a few ways: We consider radicals that nest transfinitely many times, as these are essential to the proof;…
For a complexity class $C$ and language $L$, a constructive separation of $L \notin C$ gives an efficient algorithm (also called a refuter) to find counterexamples (bad inputs) for every $C$-algorithm attempting to decide $L$. We study the…
We propose a constructive interpretation of truth which resolves the standard semantic paradoxes.
We present axioms for the real numbers by omitting the field axioms and then derive the field properties of the real numbers. We prove all our theorems constructively.
The article proposes a new technique for proving the undefinability of logical connectives through each other and illustrates the technique with several examples. Some of the obtained results are new proofs of the existing theorems, others…
It is well known that the R, the set of real numbers, is an abstract set, where almost all its elements cannot be described in any finite language. We investigate possible approaches to what might be called an epi-constructionist approach…