Related papers: Weak and Strong Versions of Effective Transfinite …
This paper considers the computational hardness of computing expected outcomes and deciding almost-sure termination of probabilistic programs. We show that deciding almost-sure termination and deciding whether the expected outcome of a…
Well-founded fixed points have been used in several areas of knowledge representation and reasoning and to give semantics to logic programs involving negation. They are an important ingredient of approximation fixed point theory. We study…
We present and analyze a natural hierarchy of weak theories, develop analysis in them, and show that they are interpretable in bounded quantifier arithmetic $\text{I}\Delta_0$ (and hence in Robinson arithmetic Q). The strongest theories…
For which sets A does there exist a mapping, computed by a total or partial recursive function, such that the mapping, when its domain is restricted to A, is a 1-to-1, onto mapping to $\Sigma^*$? And for which sets A does there exist such a…
In this paper we propose an extension of Defeasible Logic to represent and compute three concepts of defeasible permission. In particular, we discuss different types of explicit permissive norms that work as exceptions to opposite…
We investigate the relationship between (countable) transfinite iteration and ordinal arithmetic. The nice connection between finite iteration and addition, multiplication, and exponentiation is lost when passing to the transfinite. In this…
We provide three new proofs of the strong concavity of the dual function of some convex optimization problems. For problems with nonlinear constraints, we show that the the assumption of strong convexity of the objective cannot be weakened…
We establish a sufficient condition for the ultimate positivity of P-recursive sequences of arbitrary order with a unique dominant root. By additionally verifying finitely many initial terms, the positivity can also be resolved. As an…
We analyze transverse thrust in the framework of Soft Collinear Effective Theory and obtain a factorized expression for the cross section that permits resummation of terms enhanced in the dijet limit to arbitrary accuracy. The factorization…
Productivity is the property that finite prefixes of an infinite constructor term can be computed using a given term rewrite system. Hitherto, productivity has only been considered for orthogonal systems, where non-determinism is not…
We analyze Coquand's game-theoretic interpretation of Peano Arithmetic through the lens of elementary descent recursion. In Coquand's game semantics, winning strategies correspond to infinitary cut-free proofs and cut elimination…
In this paper, we introduce two new forms of the dual Hartwig-Spindelb{\"o}ck decomposition and employ them to derive explicit representations for several classes of dual generalized inverses. Building on these representations, we further…
A simple remark on infinite series is presented. This applies to a particular recursion scenario, which in turn has applications related to a classical theorem on Euler's phi-function and to recent work by Ron Brown on natural density of…
We present a characterization of effective descent morphisms in the lax comma category $\mathsf{Ord}//X$ when $X$ is a locally complete ordered set, as well as in the antisymmetric setting.
We prove two (strong) undefinability results for logics based on inquisitive semantics (or its variant, team semantics). Namely: 1) we show the undefinability of intuitionistic implication in extended propositional inquisitive logic with…
We present a systematic analysis of the $B^{(*)}\to\pi\,\ell\,\nu$ weak decay form factors to order $1/m_b$ in the heavy quark effective theory, including a discussion of renormalization group effects. These processes are described by a set…
We consider the inverse problem of reconstructing an effective model for a prototypical diffusion process in strongly heterogeneous media based on coarse measurements. The approach is motivated by quasi-local numerical effective forward…
Reversible computing models settings in which all processes can be reversed. Applications include low-power computing, quantum computing, and robotics. It is unclear how to represent side-effects in this setting, because conventional…
Soft-Collinear Effective theory is used to perform threshold resummation for W and Z production at large transverse momentum to next-to-next-to-leading logarithmic accuracy including matching to next-to-leading fixed-order results. The…
An element of a group is called \emph{reversible} if it is conjugate to its inverse, and \emph{strongly reversible} if it can be expressed as a product of two involutions. We study strongly reversible elements in the Riordan group and in…