Related papers: Infinitary Combinatory Reduction Systems: Confluen…
We revisit parallel-innermost term rewriting as a model of parallel computation on inductive data structures and provide a corresponding notion of runtime complexity parametric in the size of the start term. We propose automatic techniques…
We generalize the lexicographic product of first-order structures by presenting a framework for constructions which, in a sense, mimic iterating the lexicographic product infinitely and not necessarily countably many times. We then define…
We investigate the old problem of determining the exact bulk moduli of generic $\mathrm{SU}(3)$-structure flux backgrounds of type II string theory. Using techniques from generalised geometry, we show that the infinitesimal deformations are…
We study the combination of the following already known ideas for showing confluence of unconditional or conditional term rewriting systems into practically more useful confluence criteria for conditional systems: Our syntactical separation…
Part I of the paper considered infinite orthogonal sums of regular subspaces in a Krein space (that is, of subspaces which are themselves Krein spaces). How precisely these sums should be defined and conditions for when such a sum is itself…
We continue the research of the relation $\hspace{1mm}\widetilde{\mid}\hspace{1mm}$ on the set $\beta {\mathbb{N}}$ of ultrafilters on ${\mathbb{N}}$, defined as an extension of the divisibility relation. It is a quasiorder, so we see it as…
In a very recent work, G. E. Andrews defined the combinatorial objects which he called {\it singular overpartitions} with the goal of presenting a general theorem for overpartitions which is analogous to theorems of Rogers--Ramanujan type…
This article describes the *Confluence Framework*, a novel framework for proving and disproving confluence using a divide-and-conquer modular strategy, and its implementation in CONFident. Using this approach, we are able to automatically…
This paper investigates type isomorphism in a lambda-calculus with intersection and union types. It is known that in lambda-calculus, the isomorphism between two types is realised by a pair of terms inverse one each other. Notably,…
We continue the study of non-invertible topological dynamical systems with expanding behavior. We introduce the class of {\em finite type} systems which are characterized by the condition that, up to rescaling and uniformly bounded…
This paper deals with retraction - intended as isomorphic embedding - in intersection types building left and right inverses as terms of a lambda calculus with a bottom constant. The main result is a necessary and sufficient condition two…
We present decidability results for termination of classes of term rewriting systems modulo permutative theories. Termination and innermost termination modulo permutative theories are shown to be decidable for term rewrite systems (TRS)…
There are infinite processes (matrix products, continued fractions, $(r,s)$-matrix continued fractions, recurrence sequences) which, under certain circumstances, do not converge but instead diverge in a very predictable way. We give a…
We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…
In 2010 Schernhammer and Gramlich showed that quasi-decreasingness of a DCTRS R is equivalent to \mu-termination of its context-sensitive unraveling Ucs(R) on original terms. While the direction that quasi-decreasingness of R implies…
We show that if a graded submodule of a Noetherian module cannot be written as a proper intersection of graded submodules, then it cannot be written as a proper intersection of submodules at all. More generally, we show that a natural…
We characterize the corings whose category of comodules has a generating set of small projective comodules in terms of the (non commutative) descent theory. In order to extricate the structure of these corings, we give a generalization of…
We examine properties of generic automorphisms of the random poset, with the goal of explicitly characterizing them. We associate to each automorphism an auxiliary first-order structure, consisting of the random poset equipped with an…
We consider cut-elimination in the sequent calculus for classical first-order logic. It is well known that this system, in its most general form, is neither confluent nor strongly normalizing. In this work we take a coarser (and…
Abstract simulation of one transition system by another is introduced as a means to simulate a potentially infinite class of similar transition sequences within a single transition sequence. This is useful for proving confluence under…