Related papers: On properties of $B$-terms
Conditional term rewriting is an intuitive yet complex extension of term rewriting. In order to benefit from the simpler framework of unconditional rewriting, transformations have been defined to eliminate the conditions of conditional term…
A dynamic logic ${\mathbf B}$ can be assigned to every automaton ${\mathcal A}$ without regard if ${\mathcal A}$ is deterministic or nondeterministic. This logic enables us to formulate observations on ${\mathcal A}$ in the form of composed…
This article aims to be a self-contained account of the history of the B. B. Newman Spelling Theorem, including the historical context in which it arose. First, an account of B. B. Newman and how he came to prove his Spelling Theorem is…
We present an adequacy theorem for a concurrent extension of probabilistic GCL. The underlying denotational semantics is based on the so-called mixed powerdomains, which combine non-determinism with probabilistic behaviour. The theorem…
We introduce and study the notion of hereditary frequent hypercyclicity, which is a reinforcement of the well known concept of frequent hypercyclicity. This notion is useful for the study of the dynamical properties of direct sums of…
The usual Laurent expansion of the analytic tensors on the complex plane is generalized to any closed and orientable Riemann surface represented as an affine algebraic curve. As an application, the operator formalism for the $b-c$ systems…
A prototypical example of categorial grammars are those based on Lambek calculus, i.e. noncommutative intuitionistic linear logic. However, it has been noted that purely noncommutative operations are often not sufficient for modeling even…
Constructor-Based Conditional Rewriting Logic is a general framework for integrating first-order functional and logic programming which gives an algebraic semantics for non-deterministic functional-logic programs. In the context of this…
A numeral system is a sequence of an infinite different closed normal $\lambda$-terms which has closed $\lambda$-terms for successor and zero test. A numeral system is said adequate iff it has a closed $\lambda$-term for predecessor. A…
This work is a part of an ongoing effort to understand the relationships between properties used in theory combination. We here focus on including two properties that are related to shiny theories: the finite model property and stable…
In this paper, we describe necessary and sufficient conditions for a binormal or complex symmetric operator to have the other property. Along the way, we find connections to the Duggal and Aluthge transforms, and give further properties of…
We describe an efficient algorithm to write any element of the alternating group A_n as a product of two n-cycles (in particular, we show that any element of A_n can be so written -- a result of E. A. Bertram). An easy corollary is that…
$n$-cycle permutations with small $n$ have the advantage that their compositional inverses are efficient in terms of implementation. They can be also used in constructing Bent functions and designing codes. Since the AGW Criterion was…
We show that the relational theory of intersection types known as BCD has the finite model property; that is, BCD is complete for its finite models. Our proof uses rewriting techniques which have as an immediate by-product the polynomial…
The standard engineering approach to modelling of complex systems is highly compositional. In order to be able to understand (or to control) the behavior of a complex dynamical systems, it is often desirable, if not necessary, to view this…
$B$ functions are a class of relatively complicated exponentially decaying basis functions. Since the molecular multicenter integrals of the much simpler Slater-type functions are notoriously difficult, it is not at all obvious why $B$…
Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…
We develop a behavioral theory for the untyped call-by-value lambda calculus extended with the delimited-control operators shift and reset. For this calculus, we discuss the possible observable behaviors and we define an applicative…
This work is a study of polynomial compositions having a fixed number of terms. We outline a recursive method to describe these characterizations, give some particular results and discuss the general case. In the final sections, some…
In this note we record a comparison theorem on the B-model variation of semi-infinite Hodge structures. This result is considered a folklore theorem by experts in the field. We only take this opportunity to write it down. Our motivation is…