Related papers: Truth, Disjunction, and Induction
In a paper of 1929, Banach and Kuratowski proved, assuming the continuum hypothesis, a combinatorial theorem which implies that there is no non-vanishing sigma-additive finite measure on the real line which is defined for every set of…
This paper is an investigation of the relationship between G\"odel's second incompleteness theorem and the well-foundedness of jump hierarchies. It follows from a classic theorem of Spector's that the relation $\{(A,B) \in \mathbb{R}^2 :…
We formulate a property $P$ on a class of relations on the natural numbers, and formulate a general theorem on $P$, from which we get as corollaries the insolvability of Hilbert's tenth problem, G\"odel's incompleteness theorem, and…
In this article we show that bi-intuitionistic predicate logic lacks the Craig Interpolation Property. We proceed by adapting the counterexample given by Mints, Olkhovikov and Urquhart for intuitionistic predicate logic with constant…
Our approach is basically a coherence approach, but we avoid the well-known pitfalls of coherence theories of truth. Consistency is replaced by reliability, which expresses support and attack, and, in principle, every theory (or agent,…
Many results in probability (most famously, Strassen's theorem on stochastic domination), characterize some relationship between probability distributions in terms of the existence of a particular structured coupling between them. Optimal…
This article rebuilds the parity conservation under the light of Heinsenberg's uncertainty principle and the equivalence among the four space-time coordinates. The lack of equilibrium between matter and antimatter is elucidated; neutrino…
Given a weakly compact cardinal $\kappa$, we give an axiomatization of intuitionistic first-order logic over $\mathcal{L}_{\kappa^+, \kappa}$ and prove it is sound and complete with respect to Kripke models. As a consequence we get the…
We uncover a close relationship between combinatorial and syntactic proofs for first-order logic (without equality). Whereas syntactic proofs are formalized in a deductive proof system based on inference rules, a combinatorial proof is a…
In this paper we present the first-order logic QLETF+, a quantified version of the logic LETF+, introduced in Coniglio and Rodrigues (Studia Logica 112:561-606, 2024). QLETF+ exhibits several properties that are not always enjoyed by logics…
Dependence logic provides an elegant approach for introducing dependencies between variables into the object language of first-order logic. In [1] generalized quantifiers were introduced in this context. However, a satisfactory account was…
This work presents the deductive system Double Propositional Logic, LD, along with the semantics of possible worlds that characterize it. LD includes an alternate affirmation operator and an alternate negation operator and is not valid for…
Conformal prediction (CP) has become a cornerstone of distribution-free uncertainty quantification, conventionally evaluated by its coverage and interval length. This work critically examines the sufficiency of these standard metrics. We…
This paper first shows that the popular axiomatic systems proposed by Nute for Lewis' conditional logics are not equivalent to Lewis' original systems. In particular, the axiom CA which is derivable in Lewis' systems is not derivable in…
We introduce a minimal ZFC-internal axiom system for pre-structural data (X, A, mu, mu^{otimes 2}, R, I, Pi_R, G, E_0, eta), where Pi_R : X -> R is a designated map and G subset X x X is a measurable relation; admissible structural models…
The Einstein, Podolski and Rosen (EPR) argument aiming to prove the incompleteness of quantum mechanics (QM) was opposed by most EPR's contemporary physicists and is not accepted within the standard interpretation of QM, which maintains…
It is known that not only classical semantics but also intuitionistic Kripke semantics can be generalized so that it can treat arbitrary propositional connectives characterized by truth tables, or truth functions. In our previous work, it…
Agreement theorems are no-go results about rational disagreement: if two agents start from a common prior and their posterior beliefs are common knowledge, they cannot assign different probabilities to the same event. Standard treatments of…
Fra\"iss\'e's conjecture (proved by Laver) is implied by the $\Pi^1_1$-comprehension axiom of reverse mathematics, as shown by Montalb\'an. The implication must be strict for reasons of quantifier complexity, but it seems that no better…
What if the paradoxical nature of quantum theory could find its source in some undecidability analog to that of G\"odel's incompleteness theorem ? This essay aims at arguing for such G\"odelian hunch via two case studies. Firstly, using a…