Related papers: On consistency and existence in mathematics
Quantum theory is formulated as the uniquely consistent way to manipulate probability amplitudes. The crucial ingredient is a consistency constraint: if the amplitude of a quantum process can be computed in two different ways, the two…
In this article, we study g-frames in Hilbert $C^*$-modules and investigate conditions under which the sum of two g-frames (or a g-frame and a g-Bessel sequence) remains a g-frame. We also address the stability of g-frames under certain…
The investigations on higher-order type theories and on the related notion of parametric polymorphism constitute the technical counterpart of the old foundational problem of the circularity (or impredicativity) of second and higher order…
The following offers a new axiomatic basis of mechanics and physics in their most important dynamics domain, i. e. an axiom (principle) of completeness intended to generalize Newton's second law of motion for the case of a non-stationary…
We show that including degrees of a particular kind of provability in the search target for any theorem-prover in sufficiently powerful formal systems over finite-sized statements preserves well-definition and a sufficient consistency while…
We study the implications of model completeness of a theory for the effectiveness of presentations of models of that theory. It is immediate that for a computable model $\mathcal A$ of a computably enumerable, model complete theory, the…
For multi-time wave functions, which naturally arise as the relativistic particle-position representation of the quantum state vector, the analog of the Schr\"odinger equation consists of several equations, one for each time variable. This…
In this paper, we build Fidel-structures valued models following the methodology developed for Heyting-valued models; recall that Fidel structures are not algebras in the universal algebra sense. Taking models that verify Leibniz law, we…
This proof of Godel's first incompleteness theorem doesn't require omega-consistency, nor does it refer to codes of negated sentences as in Rosser's. It begins from where Godel's usual proof ends, and stalks it till it ends proving it.
We give simple and unified proofs of the known stability and rigidity results for Lie algebras, Lie subalgebras and Lie algebra homomorphisms. Moreover, we investigate when a Lie algebra homomorphism is stable under all automorphisms of the…
We prove, for stably computably enumerable formal systems, direct analogues of the first and second incompleteness theorems of G\"odel. A typical stably computably enumerable set is the set of Diophantine equations with no integer…
In this paper we will present a proof of the consistency of Quine's set theory "New Foundations" (hereinafter NF), so-called after the title of the 1937 paper in which it was introduced. This version takes the approach of building a model…
Facts happen at every interaction, but they are not absolute: they are relative to the systems involved in the interaction. Stable facts are those whose relativity can effectively be ignored. In this work, we describe how stable facts…
Necessary and sufficient conditions for the exactness (in the algebraic sense) of certain sequences of continuous group homomorphisms are established.
In this paper we consider the question of whether the doubling character of a measure supported on a subset of $\RR^m$ determines the regularity of its support (in a classical sense). This problem was studied by David, Kenig and Toro for…
The notion of relevance was proposed for stability of justification status of a single argument in incomplete argumentation frameworks (IAFs) in 2024 by Odekerken et al. To extend the notion, we study the relevance for stability of…
In this paper, which is a follow-up to [A. Borobia, R. Canogar, F. De Ter\'an, Mediterr. J. Math. 18, 40 (2021)], we provide a necessary and sufficient condition for the matrix equation $X^\top AX=B$ to be consistent when $B$ is symmetric.…
A quotient of a poset $P$ is a partial order obtained on the equivalence classes of an equivalence relation $\theta$ on $P$; $\theta$ is then called a congruence if it satisfies certain conditions, which vary according to different…
The world of mathematics is often considered abstract, with its symbols, concepts, and topics appearing unrelated to physical objects. However, it is important to recognize that the development of mathematics is fundamentally influenced by…
We extend Berge's Maximum Theorem to allow for incomplete preferences. We first provide a simple version of the Maximum Theorem for convex feasible sets and a fixed preference. Then, we show that if, in addition to the traditional…