Related papers: Does set theory really ground arithmetic truth?
We consider a set-theoretic version of mereology based on the inclusion relation $\subseteq$ and analyze how well it might serve as a foundation of mathematics. After establishing the non-definability of $\in$ from $\subseteq$, we identify…
The standard axioms of set theory, the Zermelo-Fraenkel axioms (ZFC), do not suffice to answer all questions in mathematics. While this follows abstractly from Kurt G\"odel's famous incompleteness theorems, we nowadays know numerous…
Metaphysical interpretations of set theory are either inconsistent or incoherent. The uses of sets in mathematics actually involve three distinct kinds of collections (surveyable, definite, and heuristic), which are governed by three…
In this paper, we unify the study of classical and non-classical algebra-valued models of set theory, by studying variations of the interpretation functions for identity and set-membership. Although, these variations coincide with the…
We present a novel treatment of set theory in a four-valued paraconsistent and paracomplete logic, i.e., a logic in which propositions can be both true and false, and neither true nor false. Our approach is a significant departure from…
Justification theory is a unifying framework for semantics of non-monotonic logics. It is built on the notion of a justification, which intuitively is a graph that explains the truth value of certain facts in a structure. Knowledge…
There are different meanings of foundation of mathematics: philosophical, logical, and mathematical. Here foundations are considered as a theory that provides means (concepts, structures, methods etc.) for the development of whole…
In this paper we propose an interpretation for self-referential propositions in a "meta-model" N* of ZF. This meta-model N* is considered as an informal model of arithmetic that mathematicians often use when working with number theory.…
G\"odel's second incompleteness theorem is standardly understood as showing that no sufficiently strong, consistent theory of arithmetic can prove its own consistency, a result typically interpreted against a model-theoretic background in…
In this paper a class of languages which are formal enough for mathematical reasoning is introduced. First-order formal languages containing natural numbers and numerals belong to that class. Its languages are called mathematically…
This paper is a contribution to the study of extensions of arbitrary models of ZF (Zermelo-Fraenkel set theory), with no regard to countability or well-foundedness of the models involved. We present some new constructions of certain types…
Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…
The main goal of this paper is to formulate a constructive analogue of Ackermann's observation about finite set theory and arithmetic. We will see that Heyting arithmetic is bi-interpretable with $\mathsf{CZF^{fin}}$, the finitary version…
A key assumption fuelling optimism about the progress of large language models (LLMs) in accurately and comprehensively modelling the world is that the truth is systematic: true statements about the world form a whole that is not just…
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…
Alternative set theory (AST) may be suitable for the ones who try to capture objects or phenomenons with some kind of indefiniteness of a border. While AST provides various notions for advanced mathematical studies, correspondence of them…
It is well known that ZFC, despite its usefulness as a foundational theory for mathematics, has two unwanted features: it cannot be written down explicitly due to its infinitely many axioms, and it has a countable model due to the…
Subset models provide a new semantics for justifcation logic. The main idea of subset models is that evidence terms are interpreted as sets of possible worlds. A term then justifies a formula if that formula is true in each world of the…
Generalised Probabilistic Theories (GPTs) provide a unifying framework encompassing classical theories, quantum theories, as well as hypothetical alternatives. We investigate the problem of extending a system with a finite set of…
Recently, in Axioms 10(2): 119 (2021), a nonclassical first-order theory T of sets and functions has been introduced as the collection of axioms we have to accept if we want a foundational theory for (all of) mathematics that is not weaker…