Related papers: Logics for Reversible Regular Languages and Semigr…
Program equivalence is the fulcrum for reasoning about and proving properties of programs. For noninterference, for example, program equivalence up to the secrecy level of an observer is shown. A powerful enabler for such proofs are logical…
Reverse Mathematics is a program in the foundations of mathematics. Its results give rise to an elegant classification of theorems of ordinary mathematics based on computability. In particular, the majority of these theorems fall into only…
Regular synchronization languages can be used to define rational relations of finite words, and to characterize subclasses of rational relations, like automatic or recognizable relations. We provide a systematic study of the decidability of…
Order-invariant formulas access an ordering on a structure's universe, but the model relation is independent of the used ordering. Order invariance is frequently used for logic-based approaches in computer science. Order-invariant formulas…
Morphisms to finite semigroups can be used for recognizing omega-regular languages. The so-called strongly recognizing morphisms can be seen as a deterministic computation model which provides minimal objects (known as the syntactic…
We survey recent results concerning the complexity of regular languages represented by their minimal deterministic finite automata. In addition to the quotient complexity of the language -- which is the number of its (left) quotients, and…
A grammar logic refers to an extension to the multi-modal logic K in which the modal axioms are generated from a formal grammar. We consider a proof theory, in nested sequent calculus, of grammar logics with converse, i.e., every modal…
A new class of languages of infinite words is introduced, called the max-regular languages, extending the class of $\omega$-regular languages. The class has two equivalent descriptions: in terms of automata (a type of deterministic counter…
This paper presents matching logic, a first-order logic (FOL) variant for specifying and reasoning about structure by means of patterns and pattern matching. Its sentences, the patterns, are constructed using variables, symbols, connectives…
We study the Monadic Second Order (MSO) Hierarchy over infinite pictures, that is tilings. We give a characterization of existential MSO in terms of tilings and projections of tilings. Conversely, we characterise logic fragments…
We consider the termination/non-termination property of a class of loops. Such loops are commonly used abstractions of real program pieces. Second-order logic is a convenient language to express non-termination. Of course, such property is…
Characters of rational vertex operator algebras (RVOAs) arising in 2-dimensional conformal field theories often belong (after suitable normalization) to the (multiplicative) semigroup E^+ of modular units whose Fourier expansions are in 1+q…
We introduce the notion of semigroup with a tight ideal series and investigate their closures in semitopological semigroups, particularly inverse semigroups with continuous inversion. As a corollary we show that the symmetric inverse…
Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…
In this paper the concept of local embeddability into finite structures (being LEF) for the class of semigroups is expanded with investigations of non-LEF structures, a closely related generalising property of local wrapping of finite…
In the setting of nonstandard analysis we introduce the notion of flexible sequence. The terms of flexible sequences are external numbers. These are a sort of analogue for the classical \emph{O$ (\cdot ) $} and \emph{o$ (\cdot ) $} notation…
We consider two relations on a $\cap$-semigroup of partial functions of a given set: the inclusion of domains and the semiadjacencity (i.e., the inclusion of the image of the first function into the domain of the second), which…
We consider semigroups of transformations (partial mappings defined on a set $A$) closed under the set-theoretic intersection of mappings treated as subsets of $A\times A$. On such semigroups we define two relations: the relation of…
We develop a relational duality for semilattices with adjunctions (SLatas) based on binary meet-relations. First, we introduce the category of MoS-spaces and establish a dual equivalence with modal semilattices. Then, by means of…
Reversible forms of computations are often interesting from an energy efficiency point of view. When the computation device in question is an automaton, it is known that the minimal reversible automaton recognizing a given language is not…