Related papers: Extending Cantor Paradox
We introduce an extension of the propositional calculus to include abstracts of predicates and quantifiers, employing a single rule along with a novel comprehension schema and a principle of extensionality, which are substituted for the…
We prove that a self-similar Cantor set in $\mathbb{Z}_N \times \mathbb{Z}_N$ has a fractal uncertainty principle if and only if it does not contain a pair of orthogonal lines. The key ingredient in our proof is a quantitative form of…
Inconsistency Robustness is performance of information systems with pervasively inconsistent information. Inconsistency Robustness of the community of professional mathematicians is their performance repeatedly repairing contradictions over…
Modern physics proposals present deep tensions between seemingly contradictory descriptions of reality. Views of wave-particle duality, black hole complementarity, and the Unruh effect demand explanations that shift depending on how a…
Possibility theory offers a framework where both Lehmann's "preferential inference" and the more productive (but less cautious) "rational closure inference" can be represented. However, there are situations where the second inference does…
It is generally accepted that the incompleteness of first-order number theory (PA) is established by an application of Godel's proof. This paper shows that the arithmetization of the syntax of PA implies that the hypothesised class of PA…
The paper investigates from a proof-theoretic perspective various non-contractive logical systems circumventing logical and semantic paradoxes. Until recently, such systems only displayed additive quantifiers (Gri\v{s}in, Cantini). Systems…
It is well known that in Zermelo-Fraenkel (ZF) set theory any finite set is decidable. In this paper we discuss an extension of ZF where this result is no longer valid. Such an extension is quasi-set theory and it has its origin on problems…
We are lifting classical problems from single instances to regular sets of instances. The task of finding a positive instance of the combinatorial problem $P$ in a potentially infinite given regular set is equivalent to the so called…
A century ago, discoveries of a serious kind of logical error made separately by several leading mathematicians led to acceptance of a sharply enhanced standard for rigor within what ultimately became the foundation for Computer Science. By…
The famous G\"odel incompleteness theorem states that for every consistent sufficiently rich formal theory T there exist true statements that are unprovable in T. Such statements would be natural candidates for being added as axioms, but…
Mathematical conception of infinite quantities forms a cornerstone of many disciplines of modern mathematics --- from differential calculus to set theory. In fact, it could be argued that the most significant revolutions in mathematics in…
Consider the following story: A teacher announces to her students a test for the following week, such that the test will be ``surprising''. The students use this as the basis for a ``logical derivation'' and reach a contradiction, which…
Cantor's algebraic calculation of the power of the continuum contains an easily repairable error related to Cantor own way of defining the addition of cardinal numbers. The appropriate correction is suggested.
Recently, a delicately designed Gedankenexperiment was proposed to check the self-consistence of quantum theory in the description of the agents who are using this theory. It was demonstrated that the quantum theory is inconsistent. Here a…
The best developed formulation of closed system quantum theory that handles multiple-time statements, is the consistent (or decoherent) histories approach. The most important weaknesses of the approach is that it gives rise to many…
Two types of approximation to the paradoxical Russell Set are presented, one approximating it from below, one from above. It is shown that any lower approximation gives rise to a better approximation containing it, and that any upper…
This paper exploits adjacencies between the orbits of an ordered set P and a consequence of the classification of finite simple groups to, in many cases, exponentially bound the number of automorphisms. Results clearly identify the…
In this paper, we aim to conceptually examine the relationship between logical incompleteness and concrete incompleteness which both study the incompleteness phenomenon. We argue for two main theses. Firstly, the current research on…
I deal with two approaches to proof-theoretic semantics: one based on argument structures and justifications, which I call reducibility semantics, and one based on consequence among (sets of) formulas over atomic bases, called base…