Related papers: On properties of $B$-terms
In this paper, a criterion for a sequence of composition operators defined on the space of holomorphic functions in a complex domain to be frequently hypercyclic is provided. Such criterion improves some already known special cases and, in…
The clone of term operations of an algebraic structure consists of all operations that can be expressed by a term in the language of the structure. We consider bounds for the length and the height of the terms expressing these functions,…
Language theory, symbolic dynamics, modelisation of viral insertion into the genetic code of a host cell motivate the introduction of new types of bialgebras whose coalgebra parts are not necessarily coassociative. One of the aim of this…
In compositional model-theoretic semantics, researchers assemble truth-conditions or other kinds of denotations using the lambda calculus. It was previously observed that the lambda terms and/or the denotations studied tend to follow the…
Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised proof tactics for rewriting. This results in an interleaving…
We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of nonnegative integers whose equational theory has no finite axiomatisation, and show this also holds if…
A serial property is a suitably enumerated sequence $\{F_n\}$ of formulas and is called selector provable in PA if there is a PA-recursive function $s(x)$ such that PA $\vdash \forall x (s(x){:}_{\text{PA}} \ulcorner F_x\urcorner)$ where…
In the general context of computable metric spaces and computable measures we prove a kind of constructive Borel-Cantelli lemma: given a sequence (constructive in some way) of sets $A_{i}$ with effectively summable measures, there are…
We study the properties of the sequence of words $(B_i)$, where $B_1 = 101$ and $B_{i+1} = B_i C_i$ for $i \geq 1$, where $C_i$ is $B_i$ with the first $i$ symbols removed, and the infinite binary sequence ${\bf b} = 10101101011011101…
The paper concerns fractal homeomorphism between the attractors of two bi-affine iterated function systems. After a general discussion of bi-affine functions, conditions are provided under which a bi-affine iterated function system is…
This document presents a combinatorial framework for analyzing assembly systems using generating functions. We explore the theory through concrete examples, such as linear polymers, and develop recursive equations to characterize valid…
The fundamental properties of biquaternions (complexified quaternions) are presented including several different representations, some of them new, and definitions of fundamental operations such as the scalar and vector parts, conjugates,…
We study substitutive systems generated by nonprimitive substitutions and show that transitive subsystems of substitutive systems are substitutive. As an application we obtain a complete characterisation of the sets of words that can appear…
Asymmetric combination of logics is a formal process that develops the characteristic features of a specific logic on top of another one. Typical examples include the development of temporal, hybrid, and probabilistic dimensions over a…
Functional analysis, especially the theory of Hilbert spaces and of operators on these, form an important area in mathematics. We formalized the Isabelle/HOL library Complex_Bounded_Operators containing a large amount of theorems about…
The denotational semantics of the untyped lambda-calculus is a well developed field built around the concept of solvable terms, which are elegantly characterized in many different ways. In particular, unsolvable terms provide a consistent…
Let $X$ be a Banach space with $\dim X>1$ such that $X^{\ast}$, its dual, is separable and $\mathcal{B}(X)$ the algebra of bounded linear operators on $X$. In this paper, we study the passage of property of being supercyclic from an…
We examine when the composition of two entire functions f and g is even, and extend some of our results to cyclic compositions in general. We prove some theorems for the cases when f or g is a polynomial. Two of the key theorems we use are…
This paper begins with a comprehensive overview of combinatorics on words and symbolic dynamics, covering their historical origins, fundamental concepts, and interconnections. Building upon this foundation, we introduce novel mathematical…
We present quantitative analysis of various (syntactic and behavioral) properties of random \lambda-terms. Our main results are that asymptotically all the terms are strongly normalizing and that any fixed closed term almost never appears…