Related papers: A note on derivability conditions
Incomputability results in Formal Logic and the Theory of Computation (i.e., incompleteness and undecidability) have deep implications for the foundations of mathematics and computer science. Likewise, Social Choice Theory, a branch of…
This paper gives a counterexample to the impossibility, by G\"odel's second incompleteness theorem, of proving a formula expressing the consistency of arithmetic in a fragment of arithmetic on the assumption that the latter is consistent.…
We provide an in-depth study of the recently introduced notion of completely incompatible observables and its links to the support uncertainty and to the Kirkwood-Dirac nonclassicality of pure quantum states. The latter notion has recently…
The problem of measuring conditional dependence between two random phenomena arises when a third one (a confounder) has a potential influence on the amount of information between them. A typical issue in this challenging problem is the…
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 :…
A conceptually simpler proof of the separability criterion for two-qubit systems, which is referred to as "Hefei inequality" in literature, is presented. This inequality gives a necessary and sufficient separability criterion for any mixed…
Properties expressed as the provability of a first-order sentence can be disproved by just finding a model of the negation of the sentence. This fact, however, is meaningful in restricted cases only, depending on the shape of the sentence…
The standard state-dependent Heisenberg-Robertson uncertainly-relation lower bound fails to capture the quintessential incompatibility of observables as the bound can be zero for some states. To remedy this problem, we establish a class of…
The Hilbert program was actually a specific approach for proving consistency. Quantifiers were supposed to be replaced by $\epsilon$-terms. $\epsilon{x}A(x)$ was supposed to denote a witness to $\exists{x}A(x)$, arbitrary if there is none.…
In this note we produce generalized versions of the classical inequalities of Hardy and of Hilbert and we establish their equivalence. Our methods rely on the H^1-BMOA duality. We produce a class of examples to establish that the…
We introduce the notion of mean viability for controlled stochastic differential equations and establish counterparts of Nagumo's classical viability theorems (necessary and sufficient conditions for mean viability). As an application, we…
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…
It is proved that if $T$ is a $\Sigma_{n+1}$ Definable theory which is $\Sigma_n$-sound and extends $PA$, then $T$ can not prove the sentence $\Sigma_n-sound(T)$ that expresses the $\Sigma_n$-soundness of $T$. Optimality of this result is…
Working with uncountable structures of fixed cardinality, we investigate the complexity of certain equivalence relations and show that if V = L, then many of them are \Sigma^1_1-complete, in particular the isomorphism relation of dense…
The proof of the Heisenberg uncertainty relation is modified to produce two improvements: (a) the resulting inequality is stronger because it includes the covariance between the two observables, and (b) the proof lifts certain restrictions…
We present an adequacy theorem for a concurrent extension of probabilistic GCL. The underlying denotational semantics is based on the so-called mixed powerdomains, which combine non-determinism with probabilistic behaviour. The theorem…
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…
We formulate the necessary and sufficient conditions for the existence of a pair of maximally incompatible two-outcome measurements in a finite dimensional General Probabilistic Theory. The conditions are on the geometry of the state space,…
It is established that if a time series satisfies the Berman condition, and another related (summability) condition, the result of filtering that series through a certain type of filter also satisfies the two conditions. In particular it…
In the paper it is demonstrated that Bells theorem is an unprovable theorem.