Related papers: Acceptable Complexity Measures of Theorems
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…
After shortly reviewing the fundamentals of approach theory as introduced by R. Lowen in 1989, we show that this theory is intimately related with the well-known Wasserstein metric on the space of probability measures with a finite first…
Every theory of information, including classical and quantum, can be studied in the framework of operational probabilistic theories--where the notion of test generalizes that of quantum instrument, namely a collection of quantum operations…
The idea of fully accepting statements when the evidence has rendered them probable enough faces a number of difficulties. We leave the interpretation of probability largely open, but attempt to suggest a contextual approach to full belief.…
G{\"o}del's completeness theorem for classical first-order logic is one of the most basic theorems of logic. Central to any foundational course in logic, it connects the notion of valid formula to the notion of provable formula.We survey a…
We consider basic conceptual questions concerning the relationship between statistical estimation and causal inference. Firstly, we show how to translate causal inference problems into an abstract statistical formalism without requiring any…
It is argued that recent claims by A. Hobson that standard quantum theory has no measurement problem cannot be sustained. Moreover, it is pointed out that taking the reduced density operator of a component system as an epistemic…
We initiate a quantitative study of measure equivalence (and orbit equivalence) between finitely generated groups, which extends the classical setting of $\mathrm L^p$ measure equivalence. In this paper, our main focus will be on amenable…
Advancements in mathematical programming have made it possible to efficiently tackle large-scale real-world problems that were deemed intractable just a few decades ago. However, provably optimal solutions may not be accepted due to the…
Given a countable o-minimal theory T, we characterize the Borel complexity of isomorphism for countable models of T up to two model-theoretic invariants. If T admits a nonsimple type, then it is shown to be Borel complete by embedding the…
How does the mathematical community accept that a given proof is correct? Is objective verification based on explicit axioms feasible, or must the reviewer's experiences and prejudices necessarily come into play? Can automated provers avoid…
The constraint satisfaction probem (CSP) is a well-acknowledged framework in which many combinatorial search problems can be naturally formulated. The CSP may be viewed as the problem of deciding the truth of a logical sentence consisting…
Non-compact proofs are a class of reasoning that is used in mathematics but overlooked in the analysis of (un)provability of consistency. We focus on proofs of arithmetical statements (*) "for any natural number n, F(n)." A proof of (*) is…
Over extended systems of finite type arithmetic, we utilize a formal representation of the outer measure to define a translation which allows for the systematic formalization of probabilistic statements. As a main result, this translation…
In this short note we have proved an enhanced version of a theorem of Lorentz [1] and its generalization to the multivariate case which gives a non- uniform estimate of degree of approximation by a polynomial with positive coefficients. The…
This paper is an extended version of our work in \cite{Ca2025}. We extend the concept of effective reducibility between statements of set theory with ordinal Turing machines (OTMs) explored in \cite{Ca2018} for $\Pi_{2}$-statements to…
The discrete data encoded in the power moments of a positive measure, fast decaying at infinity on euclidean space, is incomplete for recovery, leading to the concept of moment indeterminateness. On the other hand, classical integral…
We define the notion of {\em rational presentation of a complete metric space} in order to study metric spaces from the algorithmic complexity point of view. In this setting, we study some presentations of the space $\czu$ of uniformly…
Various measures can be used to estimate bias or unfairness in a predictor. Previous work has already established that some of these measures are incompatible with each other. Here we show that, when groups differ in prevalence of the…
Standard interpretations of Goedel's "undecidable" proposition, [(Ax)R(x)], argue that, although [~(Ax)R(x)] is PA-provable if [(Ax)R(x)] is PA-provable, we may not conclude from this that [~(Ax)R(x)] is PA-provable. We show that such…