Related papers: Permanence as a Principle of Practice
The view that Peacock's principle of permanence has been invalidated by Hamilton's introduction of non-commutative algebras has always seemed rather odd, in light of Peacock's favorable reception of quaternions and the endorsement of his…
Induction is typically formalized as a rule or axiom extension of the LK-calculus. While this extension of the sequent calculus is simple and elegant, proof transformation and analysis can be quite difficult. Theories with an induction…
We focus on the persistence principle over weak interpretability logic. Our object of study is the logic obtained by adding the persistence principle to weak interpretability logic from several perspectives. Firstly, we prove that this…
Gentzen's 1936 proof of the consistency of Peano Arithmetic was a significant result in the foundations of mathematics. We provide here a modified version of the proof, based on G\"{o}del's reformulation, and including additional details…
At the end of 19th century Peano discerned vector spaces, differentiability, convex sets, limits of families of sets, tangent cones, and many other concepts, in a modern perfect form. He applied these notions to solve numerous problems. The…
No, but the paper argues that Bohr understood his correspondence principle, or at least an aspect of that principle expressed by the notion of rational generalization, as grounded in Hankel's principle of permanence, adapted to new…
An important characteristic of many logics for Artificial Intelligence is their nonmonotonicity. This means that adding a formula to the premises can invalidate some of the consequences. There may, however, exist formulae that can always be…
We present new proofs to four versions of Peano's Existence Theorem for ordinary differential equations and systems. We hope to have gained readability with respect to other usual proofs. We also intend to highlight some ideas due to Peano…
This paper presents new constructions of models of Hume's Principle and Basic Law V with restricted amounts of comprehension. The techniques used in these constructions are drawn from hyperarithmetic theory and the model theory of fields,…
This paper is about the metaphysical debate whether objects persist over time by the selfsame object existing at different times (nowadays called `endurance' by metaphysicians), or by different temporal parts, or stages, existing at…
General mathematical reasoning is computationally undecidable, but humans routinely solve new problems. Moreover, discoveries developed over centuries are taught to subsequent generations quickly. What structure enables this, and how might…
We established order-preserving versions of the basic principles of functional analysis such as Hahn-Banach, Banach-Steinhaus, open mapping and Banach-Alaoglu theorems.
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…
We study reflection principles of Peano Arithmetic PA which are based on both proof and provability. Any such reflection principle in PA is equivalent to either $\Box P\!\rightarrow\! P$ ($\Box P$ stands for `$P$ is provable') or $\Box^k…
In introductory books about natural numbers, a common kind of assertion - often left as exercise to the reader - is that certain forms of induction on $\mathbb{N}$ (regular/ordinary, complete/strong) are equivalent one to each other and to…
There are several extensions of the classical Banach Fixed Point Theorem in technical literature. A branch of generalizations replaces usual contractivity by weaker but still effective assumptions. Our note follows this stream, presenting…
After a brief flirtation with logicism in 1917-1920, David Hilbert proposed his own program in the foundations of mathematics in 1920 and developed it, in concert with collaborators such as Paul Bernays and Wilhelm Ackermann, throughout the…
Argumentation is a promising model for reasoning with uncertain knowledge. The key concept of acceptability enables to differentiate arguments and counterarguments: The certainty of a proposition can then be evaluated through the most…
We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…
We offer a mathematical proof of consistency for Peano Arithmetic PA formalizable in PA. This result is compatible with Goedel's Second Incompleteness Theorem since our consistency proof does not rely on the representation of consistency as…