Related papers: The Creating Subject, the Brouwer-Kripke Schema, a…
We provide a systematic, thorough treatment of the foundations of probability theory and stochastic processes along the lines of E. Bishop's constructive analysis. Every existence result presented shall be a construction; and the input…
The first seeds of mathematical intuitionism germinated in Europe over a century ago in the constructive tendencies of Borel, Baire, Lebesque, Poincar\'e, Kronecker and others. The flowering was the work of one man, Luitzen Egbertus Jan…
In the early twentieth century, L.E.J. Brouwer pioneered a new philosophy of mathematics, called intuitionism. Intuitionism was revolutionary in many respects but stands out -mathematically speaking- for its challenge of Hilbert's formalist…
This work uses mostly model-theoretic methods to establish new proof-theoretic theorems about several axiomatic theories of truth over KP (Kripke-Platek set theory) and stronger theories, especially ZF (Zermelo-Fraenkel set theory).
We provide a universal characterization of the construction taking a scheme $X$ to its stable $\infty$-category $\text{Mot}(X)$ of noncommutative motives, patterned after the universal characterization of algebraic K-theory due to…
In "Object generators, relaxed sets, and a foundation for mathematics", we introduced ``object generators'', a logical environment much more general than set theory. Inside this we found a `relaxed' version of set theory. That paper is…
A theory of recursive definitions has been mechanized in Isabelle's Zermelo-Fraenkel (ZF) set theory. The objective is to support the formalization of particular recursive definitions for use in verification, semantics proofs and other…
In this paper we review many interesting open problems in mathematical physics which may be attacked with the help of tools from constructive field theory. They could give work for future mathematical physicists trained with the…
In this paper I present an argument and a general schema which can be used to construct a problem case for any decision theory, in a way that could be taken to show that one cannot formulate a decision theory that is never outperformed by…
A logic is presented for reasoning on iterated sequences of formulae over some given base language. The considered sequences, or "schemata", are defined inductively, on some algebraic structure (for instance the natural numbers, the lists,…
What is the proper explanation of intuitionistic hypothetical judgment, and thence propositional implication? The answer is unclear from the writings of Brouwer and Heyting, who in their lifetimes propounded multiple (sometimes conflicting)…
In a series of recent papers, W. M. Schmidt and L. Summerer developed a new theory by which they recover all major generic inequalities relating exponents of Diophantine approximation to a point in $\mathbb{R}^n$, and find new ones. Given a…
While automata theory often concerns itself with regular predicates, relations corresponding to acceptance by a finite state automaton, in this article we study the regular functions, such relations which are also functions in the…
In 1967 Herbert Scarf suggested a new proof of Brouwer's fixed point theorem based on a combinatorial analogue of Sperner's lemma. Scarf presented his arguments in very geometric language, even purely combinatorial ones. Recently H. Petri…
The Kripke semantics of various logics arises via categorical dualities between a category of relational frames and their maps, and a category of algebras and logical homomorphisms. When the relational frames are considered as computational…
One of the major problems in the structural theory of skew braces consists in the classification of skew braces of finite order up to isomorphism. In this light, the open question of the existence of a Cauchy theorem for finite skew braces…
A method is suggested for treating those complicated physical problems for which exact solutions are not known but a few approximation terms of a calculational algorithm can be derived. The method permits one to answer the following rather…
We formulate a theory of shape valid for objects of arbitrary dimension whose contours are path connected. We apply this theory to the design and modeling of viable trajectories of complex dynamical systems. Infinite families of…
Brouwer's fixed point theorem states that any continuous function from a closed $n$-dimensional ball to itself has a fixed point. In 1961, Klee showed that if such a function has discontinuities that are bounded, then it has a point that is…
The paper identifies families of quasi-stationary initial conditions for infinite Brownian particle systems within a large class and provides a construction of the particle systems themselves started from such initial conditions. Examples…