Related papers: A note on the consistency operator
Godelian sentences of a sufficiently strong and recursively enumerable theory, constructed in Godel's 1931 groundbreaking paper on the incompleteness theorems, are unprovable if the theory is consistent; however, they could be refutable.…
We consider the Kirchhoff equation on tori of any dimension and we construct solutions whose Sobolev norms oscillates in a chaotic way on certain long time scales. The chaoticity is encoded in the time between oscillations of the norm,…
Quantum theory makes the most accurate empirical predictions and yet it lacks simple, comprehensible physical principles from which the theory can be uniquely derived. A broad class of probabilistic theories exist which all share some…
An analysis using classical stochastic processes is used to construct a consistent system of quantum counterfactual reasoning. When applied to a counterfactual version of Hardy's paradox, it shows that the probabilistic character of quantum…
Converse optimality theory addresses an optimal control problem conversely where the system is unknown and the value function is chosen. Previous work treated this problem both in continuous and discrete time and non-extensively considered…
This paper presents an elementary introduction to Consistent Quantum Theory (CQT), as developed by Griffiths and others over the past 25 years. The theory is a version of orthodox(Copenhagen) quantum mechanics, based on the notion that the…
Considering classical first-order logic with equality, we give a "fully syntactic" construction of the (weak) syntactic category $\text{Syn}(T)$ associated to a consistent theory $T$; we show it is a consistent coherent category; and we…
Algorithmic stability is a central concept in statistics and learning theory that measures how sensitive an algorithm's output is to small changes in the training data. Stability plays a crucial role in understanding generalization,…
We evoke the idea of representation of the chaotic attractor by the set of unstable periodic orbits and disclose a novel noise-induced ordering phenomenon. For long unstable periodic orbits forming the strange attractor the weights (or…
This paper presents and discusses several methods for reasoning from inconsistent knowledge bases. A so-called argumentative-consequence relation taking into account the existence of consistent arguments in favor of a conclusion and the…
We prove the neo-classical inequality with the optimal constant, which was conjectured by T. J. Lyons [Rev. Mat. Iberoamericana 14 (1998) 215-310]. For the proof, we introduce the fractional order Taylor's series with residual terms. Their…
In Team Semantics, a dependency notion is strongly first order if every sentence of the logic obtained by adding the corresponding atoms to First Order Logic is equivalent to some first order sentence. In this work it is shown that all…
We present a new proof of descent for stably dominated types in any theory, dropping the hypothesis of the existence of global invariant extensions. Additionally, we give a much simpler proof of descent for stably dominated types in…
We develop a technique for normalization for $\infty$-type theories. The normalization property helps us to prove a coherence theorem: the initial model of a given $\infty$-type theory is $0$-truncated. The coherence theorem justifies…
We show that under Dickson's conjecture about the distribution of primes in the natural numbers, the theory Th(Z,+,1,0,Pr) where Pr is a predicate for the prime numbers and their negations is decidable, unstable and supersimple. This is in…
The assumptions needed to prove Cox's Theorem are discussed and examined. Various sets of assumptions under which a Cox-style theorem can be proved are provided, although all are rather strong and, arguably, not natural.
This paper will develop a single framework for unifying, simplifying and extending our prior results about axiom systems that retain a partial knowledge of their own consistency, via an axiomatic declaration of self-consistency. Its perhaps…
In this paper, we describe the formalization of the axiom of choice and several of its famous equivalent theorems in Morse-Kelley set theory. These theorems include Tukey's lemma, the Hausdorff maximal principle, the maximal principle,…
Structured variational inference constitutes a core methodology in modern statistical applications. Unlike mean-field variational inference, the approximate posterior is assumed to have interdependent structure. We consider the natural…
Controller synthesis is the process of constructing a correct system automatically from its specification. This often requires assumptions about the behaviour of the environment. It is difficult for the designer to identify the assumptions…