Related papers: On the Compatibility of Constructive Predicative M…
This paper describes an axiomatic theory BT for constructive mathematics. BT has a predicative comprehension axiom for a countable number of set types and usual combinatorial operations. BT has intuitionistic logic, is consistent with…
A fundamental question is whether Turing machines can model all reasoning processes. We introduce an existence principle stating that the perception of the physical existence of any Turing program can serve as a physical causation for the…
We introduce extensions by rules of the extensional level of the Minimalist Foundation which turn out to be equivalent to constructive and classical axiomatic set theories.
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…
The Dependent Object Types (DOT) calculus incorporates concepts from functional languages (e.g. modules) with traditional object-oriented features (e.g. objects, subtyping) to achieve greater expressivity (e.g. F-bounded polymorphism).…
We conclude from Goedel's Theorem VII of his seminal 1931 paper that every recursive function f(x_{1}, x_{2}) is representable in the first-order Peano Arithmetic PA by a formula [F(x_{1}, x_{2}, x_{3})] which is algorithmically verifiable,…
A multiset consists of elements, but the notion of a multiset is distinguished from that of a set by carrying information of how many times each element occurs in a given multiset. In this work we will investigate the notion of iterative…
In constructive set theory, an ordinal is a hereditarily transitive set. In homotopy type theory (HoTT), an ordinal is a type with a transitive, wellfounded, and extensional binary relation. We show that the two definitions are equivalent…
Bishop's measure theory (BMT) is an abstraction of the measure theory of a locally compact metric space $X$, and the use of an informal notion of a set-indexed family of complemented subsets is crucial to its predicative character. The more…
We study the properties of the constructible universe, L, over intuitionistic theories. We give an extended set of fundamental operations which is sufficient to generate the universe over Intuitionistic Kripke-Platek set theory without…
In this paper we construct a Beth model for intuitionistic functionals of high types and use it to create a relatively strong theory SLP containg intuitionistic principles for functionals, in particular, the theory of the "creating…
In proof theory the notion of canonical proof is rather basic, and it is usually taken for granted that a canonical proof of a sentence must be unique up to certain minor syntactical details (such as, e.g., change of bound variables). When…
A special final coalgebra theorem, in the style of Aczel's, is proved within standard Zermelo-Fraenkel set theory. Aczel's Anti-Foundation Axiom is replaced by a variant definition of function that admits non-well-founded constructions.…
We consider a philosophical question that is implicit in Selmer Bringsjord's paper, "The narrational case against Church's Thesis": If, as Mendelson argues, the classically accepted definitions of foundational concepts such as "partial…
Crispin Wright in his 1982 paper argues for strict finitism, a constructive standpoint that is more restrictive than intuitionism. In its appendix, he proposes models of strict finitistic arithmetic. They are tree-like structures, formed in…
We present quantitative separation logic ($\mathsf{QSL}$). In contrast to classical separation logic, $\mathsf{QSL}$ employs quantities which evaluate to real numbers instead of predicates which evaluate to Boolean values. The connectives…
\textit{Mereological fusion}, also known as \textit{composition} and \textit{sum}, was originally used by me as a primitive notion to axiomatize \textit{Extensional Mereology} wih \textit{atoms} in \cite{Ly22}. Here, I extend this idea to…
Motivated by work of Kac and Lusztig, we define a root system and a Weyl groupoid for a large class of semisimple Yetter-Drinfeld modules over an arbitrary Hopf algebra. The obtained combinatorial structure fits perfectly into an existing…
We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…
Mathematicians still use Naive Set Theory when generating sets without danger of producing any contradiction. Therefore their working method can be considered as a consistent inference system with an experience of over 100 years. My…