Related papers: Transcendence Certificates for D-finite Functions
A criterion is established for the transitivity of connectedness in a transfinite graph. Its proof is much shorter than a prior argument published previously for that criterion.
For Hilbert, the consistency of a formal theory T is an infinite series of statements "D is free of contradictions" for each derivation D and a consistency proof is i) an operation that, given D, yields a proof that D is free of…
The disjunctive restricted chase is a sound and complete procedure for solving boolean conjunctive query entailment over knowledge bases of disjunctive existential rules. Alas, this procedure does not always terminate and checking if it…
We prove a uniqueness theorem for a large class of functional equations in the plane, which resembles in form a classical result of Aczel. It is also shown that functional equations in this class are overdetermined in the sense of Paneah.…
Boyer and Moore have discussed a recursive function that puts conditional expressions into normal form [1]. It is difficult to prove that this function terminates on all inputs. Three termination proofs are compared: (1) using a measure…
We show that $n$ is almost perfect if and only if $I(n) - 1 < D(n) \leq I(n)$, where $I(n)$ is the abundancy index of $n$ and $D(n)$ is the deficiency of $n$. This criterion is then extended to the case of integers $m$ satisfying $D(m)>1$.
We prove that the following problem is decidable: given a finite set of relations, decide whether this set admits a near-unanimity function.
In this note, with the help of the boundary classification of diffusions, we derive a criterion of the convergence of perpetual integral functionals of transient real-valued diffusions. In the particular case of transient Bessel processes,…
Requirements are informal and semi-formal descriptions of the expected behavior of a system. They are usually expressed in the form of natural language sentences and checked for errors manually, e.g., by peer reviews. Manual checks are…
We introduce a new algorithm for checking satisfiability based on a calculus of Dependency sequents (D-sequents). Given a CNF formula F(X), a D-sequent is a record stating that under a partial assignment a set of variables of X is redundant…
CeTA was originally developed as a tool for certifying termination proofs which have to be provided as certificates in the CPF-format. Its soundness is proven as part of IsaFoR, the Isabelle Formalization of Rewriting. By now, CeTA can also…
D-finite functions and P-recursive sequences are defined in terms of linear differential and recurrence equations with polynomial coefficients. In this paper, we introduce a class of numbers closely related to D-finite functions and…
For a given transcendental number $\xi$ and for any polynomial $P(X)=: \lambda_0+\cdots+\lambda_k X^k \in \mathbb{Z}[X]$, we know that $ P(\xi) \neq 0.$ Let $k \geq 1$ and $\omega (k, H)$ be the infimum of the numbers $r > 0$ satisfying the…
Does a given a set of polyominoes tile some rectangle? We show that this problem is undecidable. In a different direction, we also consider tiling a cofinite subset of the plane. The tileability is undecidable for many variants of this…
The standard LambdaCDM cosmology passes demanding tests that establish it as a good approximation to reality. It is incomplete, with open questions and anomalies, but the same is true of all our physical theories. The anomalies in the…
We design sequential tests for a large class of nonparametric null hypotheses based on elicitable and identifiable functionals. Such functionals are defined in terms of scoring functions and identification functions, which are ideal…
We derive the necessary and sufficient condition, for a given Polynomial Recurrence Sequence to converge to a given target rational K. By converge, we mean that the Nth term of the sequence, is equal to K, as N tends to positive infinity.…
In this paper, we mainly investigate on the finite order transcendental entire solutions of two Fermat types delay-differential and one Fermat type c-shift equations, as these types were not considered earlier. Our results improve those of…
This paper continues the author's previous study \cite{Kura20}, showing that several weak principles inspired by non-normal modal logic suffice to derive various refined forms of the second incompleteness theorem. Among the main results of…
Precondition inference is a non-trivial problem with important applications in program analysis and verification. We present a novel iterative method for automatically deriving preconditions for the safety and unsafety of programs. Each…