Related papers: Rosser provability and the second incompleteness t…
We consider random coefficient autoregressive models of infinite order (AR($\infty$)) under the assumption of non-negativity of the coefficients. We develop novel methods yielding sufficient or necessary conditions for finiteness of…
The Lueders postulate is reviewed and implications for the distinguishability of observables are discussed. As an example the distinguishability of two similar observables for spin-1/2 particles is described. Implementation issues are…
We collect here various conjectures on congruences made by the author in a series of papers, some of which involve binary quadratic forms and other advanced theories. Part A consists of 100 unsolved conjectures of the author while…
We study the satisfiability problem for the two-variable first-order logic over structures with one transitive relation. % We show that the problem is decidable in 2-NExpTime for the fragment consisting of formulas where existential…
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…
A completeness theorem is proved involving a system of integro-differential equations with some $\lambda$-depending boundary conditions. Also some sufficient conditions for the root functions to form a Riesz basis are established.
We provide a set of conditions that is necessary and sufficient for the $L^{2}$-wellposedness of the Cauchy problem for fifth and sixth order variable-coefficient linear dispersive equations. The necessity of these conditions had been…
We develop a domain-theoretic framework for imprecise probability reasoning and inference on general topological spaces with a countably based continuous lattice of open sets. We address two distinct forms of uncertainty: partial or…
This paper studies controllability properties of recurrent neural networks. The new contributions are: (1) an extension of the result in the previous paper "Complete controllability of continuous-time recurrent neural networks" (Sontag and…
This paper is a follow-up to our joint paper with I. Agol, P. Storm and K. Whyte "Finiteness of arithmetic hyperbolic reflection groups". The main purpose is to investigate the effective side of the method developed there and its possible…
We consider the question of extending propositional logic to a logic of plausible reasoning, and posit four requirements that any such extension should satisfy. Each is a requirement that some property of classical propositional logic be…
We present a simpler way than usual to deduce the completeness theorem for the second-oder classical logic from the first-order one. We also extend our method to the case of second-order intuitionistic logic.
Established frameworks to understand problems with reproducibility in science begin with the relationship between our understanding of the prior probability of a claim and the statistical certainty that should be demanded of it, and explore…
The `Congruence Conjecture' was developed by the second author in a previous paper. It provides a conjectural explicit reciprocity law for a certain element associated to an abelian extension of a totally real number field whose existence…
We use machine learning to provide a tractable measure of the amount of predictable variation in the data that a theory captures, which we call its "completeness." We apply this measure to three problems: assigning certain equivalents to…
The finite satisfiability problem of two-variable logic extended by a linear order successor and a preorder successor is shown to be undecidable.
When the historical data are limited, the conditional probabilities associated with the nodes of Bayesian networks are uncertain and can be empirically estimated. Second order estimation methods provide a framework for both estimating the…
We consider the capability of $p$-groups of class two and odd prime exponent. The question of capability is shown to be equivalent to a statement about vector spaces and linear transformations, and using the equivalence we give proofs of…
We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…
In this paper we briefly review and analyze three published proofs of Chaitin's theorem, the celebrated information-theoretic version of G\"odel's incompleteness theorem. Then, we discuss our main perplexity concerning a key step common to…