Related papers: Rosser provability and the second incompleteness t…
In this paper, the author gives two methods to construct complete Lie algebras. Both methods show that the derivation algebras of some Lie algebras are complete.
Composite likelihoods are a class of alternatives to the full likelihood which are widely used in many situations in which the likelihood itself is intractable. A composite likelihood may be computed without the need to specify the full…
A theory $T$ is said to be relatively decidable if for every model of $T$, one can compute the elementary diagram of that model from its atomic diagram together with $T$. We verify a conjecture of Chubb, Miller, and Solomon by showing that…
We find conditions equivalent to some commutator identities considered in Part I
We introduce the problem of temporal coverability for realizability and synthesis. Namely, given a language of words that must be covered by a produced system, how to automatically produce such a system. We consider the case of coverability…
We give a survey on the theory of representation-finite and certain minimal representation-infinite algebras.The main goals are the existence of multiplicative bases and of coverings with good properties. Both are attained via…
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…
Our main result (Theorem A) shows the incompleteness of any consistent sequential theory T formulated in a finite language such that T is axiomatized by a collection of sentences of bounded quantifier-alternation-depth. Our proof employs an…
This is an introduction to the theory of disconjugacy for a second order linear differential equation. We give new proofs of some of basic results and obtain new sufficient conditions for disconjugacy (in particular, on the whole real…
Work in progress concerning alternative formalizations of arithmetic.
We study provability predicates $\mathrm{Pr}_T(x)$ satisfying the following condition $\mathbf{E}$ from a modal logical perspective: $\mathbf{E}:$ if $ T \vdash \varphi \leftrightarrow \psi$, then $T \vdash \mathrm{Pr}_T(\ulcorner \varphi…
This paper presents four theorems that connect continuity postulates in mathematical economics to solvability axioms in mathematical psychology, and ranks them under alternative supplementary assumptions. Theorem 1 connects notions of…
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 paper puts forward sufficient conditions for local controllability of a control dynamical system. The results obtained are meaningful in the case when the linear approximation to this system is not completely controllable. As a…
We settle the complexity of satisfiability, finite-state satisfiability, and model-checking for several fragments of second-order HyperLTL, which extends HyperLTL with quantification over sets of traces: they are all in the analytical…
We show that a partial-correctness assertion about an iterative program is provable in Hoare Logic iffit is provable in standard second-order logic with comprehension restricted to first-order predicates. This equivalence was claimed twice…
We analyze selected iterated conditionals in the framework of conditional random quantities. We point out that it is instructive to examine Lewis's triviality result, which shows the conditions a conditional must satisfy for its probability…
We give a proof of Cox's Theorem on the product rule and sum rule for conditional plausibility without assuming continuity or differentiablity of plausibility. Instead, we extend the notion of plausibility to apply to unknowns giving them…
In the setting of exponential investors and uncertainty governed by Brownian motions we first prove the existence of an incomplete equilibrium for a general class of models. We then introduce a tractable class of exponential-quadratic…
We study the complexity of satisfiability problems in probabilistic and causal reasoning. Given random variables $X_1, X_2,\ldots$ over finite domains, the basic terms are probabilities of propositional formulas over atomic events $X_i =…