Related papers: On repetitive right application of B-terms
Rewriting is a formalism widely used in computer science and mathematical logic. The classical formalism has been extended, in the context of functional languages, with an order over the rules and, in the context of rewrite based languages,…
This paper establishes necessary and sufficient conditions for a bi-amalgamation to inherit the arithmetical property, with applications on the weak global dimension and transfer of the semihereditary property. The new results compare to…
We consider equations arising from rational Lax representations. A general method to construct recursion operators for such equations is given. Several examples are given, including a degenerate bi-Hamiltonian system with a recursion…
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…
Ackermann's function can be expressed using an iterative algorithm, which essentially takes the form of a term rewriting system. Although the termination of this algorithm is far from obvious, its equivalence to the traditional recursive…
The semantic paradoxes are associated with self-reference or referential circularity. However, there are infinitary versions of the paradoxes, such as Yablo's paradox, that do not involve this form of circularity. It remains an open…
In this paper, we provide a finite random iterated function system satisfying the open set condition, for which the random version of Bowen's formula fails to hold. This counterexample shows that analogous results established for random…
In the context of Higman embeddings of recursive groups into finitely presented groups we suggest an algorithm which uses Higman operations to explicitly constructs the specific recursively enumerable sets of integer sequences arising…
Wh-phrases in English can appear both raised and in-situ. However, only in-situ wh-phrases can take semantic scope beyond the immediately enclosing clause. I present a denotational semantics of interrogatives that naturally accounts for…
We study the dynamics of iteration function systems generated by a pair of circle diffeomorphisms close to rotations in the $C^{1+\mathrm{bv}}$-topology. We characterize the obstruction to minimality and describe the limit set. In…
We give a purely combinatorial proof of the Glaisher-Crofton identity which derives from the analysis of discrete structures generated by iterated second derivative. The argument illustrates utility of symbolic and generating function…
This paper proposes a notion of branching bisimilarity for non-deterministic probabilistic processes. In order to characterize the corresponding notion of rooted branching probabilistic bisimilarity, an equational theory is proposed for a…
In this work, Miller Ross function with bicomplex arguments has been introduced. Various properties of this function including recurrence relations, integral representations and differential relations are established. Furthermore, the…
We extend the classical construction of operator colligations and characteristic functions. Consider the group $G$ of finite block unitary matrices of size $\alpha+\infty+...+\infty$ ($k$ times). Consider the subgroup $K=U(\infty)$, which…
A boolean term order is a total order on subsets of [n]={1,...,n} such that \emptyset < alpha for all nonempty alpha contained in [n], and alpha < beta implies alpha \cup gamma < beta \cup gamma for all gamma which do not intersect alpha or…
Most modern libraries for regular expression matching allow back-references (i.e., repetition operators) that substantially increase expressive power, but also lead to intractability. In order to find a better balance between expressiveness…
We study a composition operation on monads, equivalently presented as large equational theories. Specifically, we discuss the existence of tensors, which are combinations of theories that impose mutual commutation of the operations from the…
Boolean circuits abstract away from physical details to focus on the logical structure and computational behaviour of digital components. Although such circuits have been studied for many decades, compositionality has been widely ignored or…
Many automatic theorem-provers rely on rewriting. Using theorems as rewrite rules helps to simplify the subgoals that arise during a proof. LCF is an interactive theorem-prover intended for reasoning about computation. Its implementation of…
Choice functions constitute a simple, direct and very general mathematical framework for modelling choice under uncertainty. In particular, they are able to represent the set-valued choices that typically arise from applying decision rules…