Related papers: Nonstandard Analysis and Constructivism!
We survey the logical structure of constructive set theories and point towards directions for future research. Moreover, we analyse the consequences of being extensible for the logical structure of a given constructive set theory. We…
The book "A Course in Constructive Algebra" (1988) shows the way of understanding classical basic algebra in a constructive style similar to Bishop's Constructive Mathematics. Classical theorems are revisited, with a new flavour, and become…
The semantic paradoxes are associated with self-reference or referential circularity. However, there are infinitary versions of the paradoxes, such as Yablo's paradox, that do not involve this form of circularity. It remains an open…
When dealing with certain kind of complex phenomena the theoretician may face some difficulties -- typically a failure to have access to information for properly characterize the system -- for applying the full power of the standard…
Constructivists (and intuitionists in general) asked what kind of mental construction is needed to convince ourselves (and others) that some mathematical statement is true. This question has a much more practical (and even cynical)…
Evaluation is a critical activity associated with any theory. Yet this has proven to be an exceptionally challenging activity for theories based on cognitive architectures. For an overlapping set of reasons, evaluation can also be…
Structural proof theory is praised for being a symbolic approach to reasoning and proofs, in which one can define schemas for reasoning steps and manipulate proofs as a mathematical structure. For this to be possible, proof systems must be…
Recently, Artemov [4] offered the notion of constructive consistency for Peano Arithmetic and generalized it to constructive truth and falsity in the spirit of Brouwer-Heyting-Kolmogorov semantics and its formalization, the Logic of Proofs.…
We provide a constructive treatment of basic results in the theory of central simple algebras. One main issue is the fact that one starting result, Wedderburn's Theorem stating that a simple algebra is a matrix algebra over a skew field, is…
According to mathematical constructivism, a mathematical object can exist only if there is a way to compute (or "construct") it; so, what is non-computable is non-constructive. In the example of the quantum model, whose Fock states are…
This book is an introductory course to basic commutative algebra with a particular emphasis on finitely generated projective modules, which constitutes the algebraic version of the vector bundles in differential geometry. We adopt the…
Furstenberg--Zimmer structure theory refers to the extension of the dichotomy between the compact and weakly mixing parts of a measure preserving dynamical system and the algebraic and geometric descriptions of such parts to a conditional…
The reconstruction theorem and the multilevel Schauder estimate have central roles in the analytic theory of regularity structures [17]. Inspired by [26], we provide elementary proofs for them by using the semigroup of operators.…
Modelling qualitative uncertainty in formal argumentation is essential both for practical applications and theoretical understanding. Yet, most of the existing works focus on \textit{abstract} models for arguing with uncertainty. Following…
The Loeb measure is one of the cornerstones of Nonstandard Analysis. The traditional development of the Loeb measure makes use of saturation and external sets. Inspired by [13], we give meaning to special cases of the Loeb measure in the…
Throughout the course of mathematical history, generalizations of previously understood concepts and structures have led to the fruitful development of the hierarchy of number systems, non-euclidean geometry, and many other epochal phases…
In this article, we will introduce methods of non-standard analysis into projective geometry. Especially, we will analyze the properties of a projective space over a non-Archimedean field. Non-Archimedean fields contain numbers that are…
There have recently been several developments in synthetic mathematics using extensions of dependent type theory with univalence and higher inductive types: simplicial homotopy type theory, synthetic algebraic geometry and synthetic Stone…
Kohlenbach's proof mining program deals with the extraction of effective information from typically ineffective proofs. Proof mining has its roots in Kreisel's pioneering work on the so-called unwinding of proofs. The proof mining of…
The P versus NP problem is addressed in a context of provability and limitations on the possibility of finding sound axioms for formal theories. It is shown that if the term "constructible theory" is defined in a way which satisfies certain…