Related papers: A note on derivability conditions
A bilateralist take on proof-theoretic semantics can be understood as demanding of a proof system to display not only rules giving the connectives' provability conditions but also their refutability conditions. On such a view, then, a…
We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations $R, S$, a componentwise reducibility is defined by $ R\le S \iff \ex f \, \forall x, y \, [xRy…
We study the problem of ignorability in likelihood-based inference from incomplete categorical data. Two versions of the coarsened at random assumption (car) are distinguished, their compatibility with the parameter distinctness assumption…
We study the effective versions of several notions related to incompleteness, undecidability and inseparability along the lines of Pour-El's insights. Firstly, we strengthen Pour-El's theorem on the equivalence between effective essential…
The aim of this article is to generalize logics of formal inconsistency ($\textbf{LFI}$s) to systems dealing with the concept of incompatibility, expressed by means of a binary connective. The basic idea is that having two incompatible…
Complementarity restricts the accuracy with which incompatible quantum observables can be jointly measured. Despite popular conception, the Heisenberg uncertainty relation does not quantify this principle. We report the experimental…
Models of a generalized nondeterminism are defined by limitations on nonde- terministic behavior of a computing device. A regular realizability problem is a problem of verifying existence of a special sort word in a regular language. These…
Deborah Mayo claims to have refuted Birnbaum's argument that the Likelihood Principle is a logical consequence of the Sufficiency and Conditionality Principles. However, this claim fails because her interpretation of the Conditionality…
We prove uniqueness for continuity equations in Hilbert spaces $H$. The corresponding drift $F$ is assumed to be in a first order Sobolev space with respect to some Gaussian measure. As in previous work on the subject, the proof is based on…
We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of…
Hilbert and Ackermann asked for a method to consistently extend incomplete theories to complete theories. G\"odel essentially proved that any theory capable of encoding its own statements and their proofs contains statements that are true…
Building on the recent notion of non-uniform complete observability, and on the fact that this property ensures non-uniform exponential detectability, this paper establishes the converse implication under suitable additional assumptions.…
We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level F_{\omega}^{\omega} of the ordinal-indexed hierarchy of…
In 1994 Jech gave a model theoretic proof of G\"odel's second incompleteness theorem for Zermelo-Fraenkel set theory in the following form: ZF does not prove that ZF has a model. Kotlarski showed that Jech's proof can be adapted to Peano…
We determine a necessary and sufficient condition for the infinitude of primes $p$ such that none of the equations $a_i^x \equiv b_i \pmod{p}, 1 \le i \le n,$ are solvable. We control the insolvability of $a^x \equiv b \pmod{p}$ by power…
We study the consistency strength of Lebesgue measurability for $\Sigma^1_3$ sets over Zermelo set theory ($Z$) in a completely choiceless context. We establish a result analogous to the Solovay-Shelah theorem.
Our main results are in the following three sections: 1. We prove new relations between proof complexity conjectures that are discussed in \cite{pu18}. 2. We investigate the existence of p-optimal proof systems for $\mathsf{TAUT}$, assuming…
We here present a sufficient condition for general arrowing problems to be non definable in first order logic, based in well known tools of finite model theory e.g. Hanf's Theorem and known concepts in finite combinatorics, like senders and…
This paper makes 3 contributions. First, it generalizes the Lindeberg\textendash Feller and Lyapunov Central Limit Theorems to Hilbert Spaces by way of $L^2$. Second, it generalizes these results to spaces in which sample failure and…
Provability logics are modal or polymodal systems designed for modeling the behavior of G\"odel's provability predicate in arithmetical theories and its natural extensions. If \Lambda is any ordinal, the G\"odel-L\"ob calculus GLP(\Lambda)…