Related papers: Mathematical Interpretation of Plato's Third Man A…
The point-to-set principle of J. Lutz and N. Lutz (2018) has recently enabled the theory of computing to be used to answer open questions about fractal geometry in Euclidean spaces $\mathbb{R}^n$. These are classical questions, meaning that…
We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…
Frege's theorem says that second-order Peano arithmetic is interpretable in Hume's Principle and full impredicative comprehension. Hume's Principle is one example of an abstraction principle, while another paradigmatic example is Basic Law…
In this paper, we examine the limit of applicability of G\"{o}del's first incompleteness theorem ($\sf G1$ for short). We first define the notion "$\sf G1$ holds for the theory $T$". This paper is motivated by the following question: can we…
Since the introduction by Hodges, and refinement by V\"a\"an\"anen, team semantic constructions have been used to generate expressively enriched logics still conserving nice properties, such as compactness or decidability. In contrast,…
This paper examines a denumerable version of the nested-set theorem and derives from it a contradiction involving the formal consistency of the actual infinity assumed by the Axiom of Infinity.
Mr. C. Stephanos posed the following question in the Interm\'ediaire des Math\'ematiciens: "Do there exist polyhedra with invariant facets that are susceptible to an infinite family of transformations that only alter solid angles and…
The Pythagorean Theorem has been proved in hundreds of ways, yet it inspires fresh insights through geometry and trigonometry. In this paper, we offer a new proof based on three circles that circumscribe the sides of a right triangle.…
In this work, we aim at understanding incompleteness in an abstract way via metamathematical properties of formal theories. We systematically examine the relationships between the following twelve important metamathematical properties of…
G3-style sequent calculi for the logics in the cube of non-normal modal logics and for their deontic extensions are studied. For each calculus we prove that weakening and contraction are height-preserving admissible, and we give a syntactic…
We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…
A perplexing problem in understanding physical reality is why the universe seems comprehensible, and correspondingly why there should exist physical systems capable of comprehending it. In this essay I explore the possibility that rather…
In the celebrated Theaetetus 147d3-e1 passage Theodorus is giving a lesson to Theaetetus and his companion, proving certain quadratic incommensurabilities. The dominant view on this passage, expressed independently by H. Cherniss and M.…
We show how Leibnitz.s indiscernibility principle and Gentzen's original work lead to extensions of the sequent calculus to first order logic with equality and investigate the cut elimination property. Furthermore we discuss and improve the…
The development of the new logic of partitions (= equivalence relations) dual to the usual Boolean logic of subsets, and its quantitative version as the new logical theory of information provide the basic mathematical concepts to describe…
Being mathematics a natural language to Mankind and to physics, it must be constantly adapted to our necessities and our natural perception. Then, mathematical concepts are not absolute to reality. Although mathematical theories are…
The primary purpose of this article is to show that a certain natural set of axioms yields a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely)…
According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of…
The theory of finitely supported algebraic structures is related to Pitts theory of nominal sets (by equipping finitely supported sets with finitely supported internal algebraic laws). It represents a reformulation of Zermelo Fraenkel set…
A classical reconstruction of Wright's first-order logic of strict finitism is presented. Strict finitism is a constructive standpoint of mathematics that is more restrictive than intuitionism. Wright sketched the semantics of said logic in…