English
Related papers

Related papers: A note on derivability conditions

200 papers

We consider the sequential composite binary hypothesis testing problem in which one of the hypotheses is governed by a single distribution while the other is governed by a family of distributions whose parameters belong to a known set…

Information Theory · Computer Science 2022-03-30 Jiachun Pan , Yonglong Li , Vincent Y. F. Tan

The sequential form of a statement $\forall\xi(B(\xi) \rightarrow \exists\zeta A(\xi,\zeta))$ is the statement $\forall\xi(\forall n B(\xi_n) \rightarrow \exists\zeta \forall n A(\xi_n,\zeta_n))$. There are many classically true statements…

Logic · Mathematics 2016-02-10 François G. Dorais

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

Logic in Computer Science · Computer Science 2007-05-23 Viktor Kuncak , Martin Rinard

In this paper, we tell a story about incompleteness in modal logic. The story weaves together a paper of van Benthem, `Syntactic aspects of modal incompleteness theorems,' and a longstanding open question: whether every normal modal logic…

Logic in Computer Science · Computer Science 2019-09-04 Wesley H. Holliday , Tadeusz Litak

We study the complexity of predicate logics based on team semantics. We show that the satisfiability problems of two-variable independence logic and inclusion logic are both NEXPTIME-complete. Furthermore, we show that the validity problem…

Logic in Computer Science · Computer Science 2016-06-21 Juha Kontinen , Antti Kuusisto , Jonni Virtema

In this paper, we consider the problem of learning a first-order theorem prover that uses a representation of beliefs in mathematical claims to construct proofs. The inspiration for doing so comes from the practices of human mathematicians…

Artificial Intelligence · Computer Science 2019-07-01 Daniel Huang

Possibility theory offers a framework where both Lehmann's "preferential inference" and the more productive (but less cautious) "rational closure inference" can be represented. However, there are situations where the second inference does…

Artificial Intelligence · Computer Science 2013-02-18 Salem Benferhat , Didier Dubois , Henri Prade

Let T be an algebraically bounded theory. We consider the $L(\bar\delta)$-expansions of T by a tuple $\bar \delta$ of derivations (which may be commuting or not). We investigate the model completion of either of the above theories, whose…

Logic · Mathematics 2026-05-26 Fornasiero Antongiulio , Terzo Giuseppina

Polymodal provability logic GLP is incomplete w.r.t. Kripke frames. It is known to be complete w.r.t. topological semantics, where the diamond modalities correspond to topological derivative operations. However, the topologies needed for…

Logic · Mathematics 2024-07-16 Lev D. Beklemishev , Yunsong Wang

In this paper, in terms of three types of generalized second-order derivatives of a nonsmooth function, we mainly study the corresponding second-order optimality conditions in a Hilbert space and prove the equivalence among these optimality…

Optimization and Control · Mathematics 2016-07-25 Zhou Wei , Jen-Chih Yao

In two recent papers necessary and sufficient conditions for a given system of second-order ordinary differential equations to be of Lagrangian form with additional dissipative forces were derived. We point out that these conditions are not…

Differential Geometry · Mathematics 2010-05-20 M. Crampin , T. Mestdag , W. Sarlet

In this paper, we provide a fairly general self-reference-free proof of the Second Incompleteness Theorem from Tarski's Theorem of the Undefinability of Truth.

Logic · Mathematics 2018-03-13 Albert Visser

We consider the problems of hypothesis testing on a probability measure of independent sample, on solution of ill-posed problem, on deconvolution problem and on Poisson mean measure. For all these setups necessary conditions and sufficient…

Statistics Theory · Mathematics 2013-10-24 Mikhail Ermakov

We consider particles prepared by the von Neumann-L\"uders projection. For those particles the standard deviation of the momentum is discussed. We show that infinite standard deviations are not exceptions but rather typical. A necessary and…

Quantum Physics · Physics 2010-06-29 Thomas Schürmann , Ingo Hoffmann

Suppose we are given the conditional probability of one variable given some other variables.Normally the full joint distribution over the conditioning variablesis required to determine the probability of the conditioned variable.Under what…

Artificial Intelligence · Computer Science 2013-01-14 Avi Pfeffer

This paper studies the connection between probabilistic conditional independence in uncertain reasoning and data dependency in relational databases. As a demonstration of the usefulness of this preliminary investigation, an alternate proof…

Artificial Intelligence · Computer Science 2013-02-28 Michael S. K. M. Wong , Z. W. Wang

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…

Other Statistics · Statistics 2022-05-30 Maria Chikina , Wesley Pegden

We prove some theorems on decomposable continua. In particular, we prove; (i) the property of being a Wilder continuum is not a Whitney reversible property, (ii) inverse limits of D**-continua with surjective monotone upper semi-continuous…

General Topology · Mathematics 2023-07-13 Hayato Imamura , Eiichi Matsuhashi , Yoshiyuki Oshima

It is argued that Goedel's incompleteness theorem should be seen as self-evident, rather than unexpected or surprising.

General Mathematics · Mathematics 2007-05-23 Elemer E Rosinger

In response to a concern raised by Horty, this paper develops a two-tiered, preference-based semantic framework for modeling defeasible conditional obligations. The paper extends a Hansson-Lewis style preference semantics for dyadic deontic…

Logic in Computer Science · Computer Science 2026-05-01 Xavier Parent