scholarly journals A proof of Zhil'tsov's theorem on decidability of equational theory of epigroups

2016 ◽  
Vol Vol. 17 no. 3 (Combinatorics) ◽  
Author(s):  
Inna Mikhaylova
Keyword(s):  
Finite Semigroup ◽  
Equational Theory ◽  
Unary Operation ◽  
Finitely Based ◽  
Infinite Basis ◽  
International Audience

International audience Epigroups are semigroups equipped with an additional unary operation called pseudoinversion. Each finite semigroup can be considered as an epigroup. We prove the following theorem announced by Zhil'tsov in 2000: the equational theory of the class of all epigroups coincides with the equational theory of the class of all finite epigroups and is decidable. We show that the theory is not finitely based but provide a transparent infinite basis for it.

PSEUDORECURSIVE VARIETIES OF SEMIGROUPS — II

2012 ◽  
Vol 22 (05) ◽  
pp. 1250042 ◽  
Author(s):  
BENJAMIN WELLS
Keyword(s):  
Equational Theory ◽  
Unary Operation ◽  
Finitely Based ◽  
New Techniques ◽  
Distinguished Element ◽  
A Chain ◽  
Rewriting Rules ◽  
Semigroup Varieties

Constructions that yield pseudorecursiveness in [I] (Int. J. Algebra Comput.6 (1996) 457–510) are extended in this article. Finitely based varieties of semigroups with increasingly strict expansions by additional unary operation symbols or individual constants are shown to have the pseudorecursive property: the equational theory is undecidable, but the subsets obtained by bounding the number of distinct variables are all recursive. The most stringent case considered here is the single unary operation or distinguished element. New techniques of stratified reducibility and interpretation via rewriting rules are employed to show the property inherits along a chain of theories. Pure semigroup varieties that are both finitely based and pseudorecursive will be discussed in a later paper.

scholarly journals POSITIVE FRAGMENTS OF RELEVANCE LOGIC AND ALGEBRAS OF BINARY RELATIONS

2010 ◽  
Vol 4 (1) ◽  
pp. 81-105 ◽  
Author(s):  
ROBIN HIRSCH ◽  
SZABOLCS MIKULÁS
Keyword(s):  
Equational Theory ◽  
Relevance Logic ◽  
Binary Relations ◽  
Finitely Based ◽  
Similarity Type ◽  
Relation Composition

We prove that algebras of binary relations whose similarity type includes intersection, union, and one of the residuals of relation composition form a nonfinitely axiomatizable quasivariety and that the equational theory is not finitely based. We apply this result to the problem of the completeness of the positive fragment of relevance logic with respect to binary relations.

Equational properties of fixed-point operations in cartesian categories: An overview

2019 ◽  
Vol 29 (06) ◽  
pp. 909-925
Author(s):  
Z Ésik
Keyword(s):  
Fixed Point ◽  
Equational Theory ◽  
Continuous Functions ◽  
Equivalence Classes ◽  
Finitely Based ◽  
Additive Structure ◽  
Complete Lattices ◽  
Finite Base ◽  
Language Equivalence ◽  
Context Free

AbstractSeveral fixed-point models share the equational properties of iteration theories, or iteration categories, which are cartesian categories equipped with a fixed point or dagger operation subject to certain axioms. After discussing some of the basic models, we provide equational bases for iteration categories and offer an analysis of the axioms. Although iteration categories have no finite base for their identities, there exist finitely based implicational theories that capture their equational theory. We exhibit several such systems. Then we enrich iteration categories with an additive structure and exhibit interesting cases where the interaction between the iteration category structure and the additive structure can be captured by a finite number of identities. This includes the iteration category of monotonic or continuous functions over complete lattices equipped with the least fixed-point operation and the binary supremum operation as addition, the categories of simulation, bisimulation, or language equivalence classes of processes, context-free languages, and others. Finally, we exhibit a finite equational system involving residuals, which is sound and complete for monotonic or continuous functions over complete lattices in the sense that it proves all of their identities involving the operations and constants of cartesian categories, the least fixed-point operation and binary supremum, but not involving residuals.

scholarly journals Canonical forms for free κ-semigroups

2014 ◽  
Vol Vol. 16 no. 1 (Automata, Logic and Semantics) ◽  
Author(s):  
José Carlos Costa
Keyword(s):  
Normal Form ◽  
Word Problem ◽  
Canonical Form ◽  
Finite Semigroup ◽  
Finite Alphabet ◽  
Canonical Forms ◽  
Finite Semigroups ◽  
International Audience

Automata, Logic and Semantics International audience The implicit signature κ consists of the multiplication and the (ω-1)-power. We describe a procedure to transform each κ-term over a finite alphabet A into a certain canonical form and show that different canonical forms have different interpretations over some finite semigroup. The procedure of construction of the canonical forms, which is inspired in McCammond\textquoterights normal form algorithm for ω-terms interpreted over the pseudovariety A of all finite aperiodic semigroups, consists in applying elementary changes determined by an elementary set Σ of pseudoidentities. As an application, we deduce that the variety of κ-semigroups generated by the pseudovariety S of all finite semigroups is defined by the set Σ and that the free κ-semigroup generated by the alphabet A in that variety has decidable word problem. Furthermore, we show that each ω-term has a unique ω-term in canonical form with the same value over A. In particular, the canonical forms provide new, simpler, representatives for ω-terms interpreted over that pseudovariety.

scholarly journals The Max-Plus Algebra of the Natural Numbers has no Finite Equational Basis

1999 ◽  
Vol 6 (33) ◽  
Author(s):  
Luca Aceto ◽  
Zoltán Ésik ◽  
Anna Ingólfsdóttir
Keyword(s):  
Equational Theory ◽  
Geometric Characterization ◽  
Independent Interest ◽  
Free Algebras ◽  
Finitely Based ◽  
Natural Numbers ◽  
Equational Basis ◽  
Stepping Stone

This paper shows that the collection of identities which hold in<br />the algebra N of the natural numbers with constant zero, and binary<br />operations of sum and maximum is not finitely based. Moreover, it<br />is proven that, for every n, the equations in at most n variables that<br />hold in N do not form an equational basis. As a stepping stone in<br />the proof of these facts, several results of independent interest are<br />obtained. In particular, explicit descriptions of the free algebras in the<br />variety generated by N are offered. Such descriptions are based upon<br />a geometric characterization of the equations that hold in N, which<br />also yields that the equational theory of N is decidable in exponential<br />time.

A Self-Dual Equational Basis for Boolean Algebras

1983 ◽  
Vol 26 (1) ◽  
pp. 9-12 ◽  
Author(s):  
R. Padmanabhan
Keyword(s):  
Boolean Algebra ◽  
Equational Theory ◽  
Boolean Algebras ◽  
Duality Mapping ◽  
Finitely Based ◽  
Equational Basis ◽  
Cosmic Order ◽  
Principle Of Duality

AbstractThe principle of duality for Boolean algebra states that if an identity ƒ = g is valid in every Boolean algebra and if we transform ƒ = g into a new identity by interchanging (i) the two lattice operations and (ii) the two lattice bound elements 0 and 1, then the resulting identity ƒ = g is also valid in every Boolean algebra. Also, the equational theory of Boolean algebras is finitely based. Believing in the cosmic order of mathematics, it is only natural to ask whether the equational theory of Boolean algebras can be generated by a finite irredundant set of identities which is already closed for the duality mapping. Here we provide one such equational basis.

The existence of finitely based lower covers for finitely based equational theories

1995 ◽  
Vol 60 (4) ◽  
pp. 1242-1250
Author(s):  
Jaroslav Ježek ◽  
George F. McNulty
Keyword(s):  
Equational Theory ◽  
Single Equation ◽  
Isomorphism Type ◽  
Extensive Literature ◽  
Fundamental Operation ◽  
Finitely Based ◽  
Equational Theories ◽  
Set Inclusion ◽  
Universal Quantifiers

By an equational theory we mean a set of equations from some fixed language which is closed with respect to logical consequences. We regard equations as universal sentences whose quantifier-free parts are equations between terms. In our notation, we suppress the universal quantifiers. Once a language has been fixed, the collection of all equational theories for that language is a lattice ordered by set inclusion The meet in this lattice is simply intersection; the join of a collection of equational theories is the equational theory axiomatized by the union of the collection. In this paper we prove, for languages with only finitely many fundamental operation symbols, that any nontrivial finitely axiomatizable equational theory covers some other finitely axiomatizable equational theory. In fact, our result is a little more general.There is an extensive literature concerning lattices of equational theories. These lattices are always algebraic. Compact elements of these lattices are the finitely axiomatizable equational theories. We also call them finitely based. The largest element in the lattice is compact; it is the equational theory based on the single equation x ≈ y. The smallest element of the lattice is the trivial theory consisting of tautological equations. For all but the simplest languages, the lattice of equational theories is intricate. R. McKenzie in [6] was able to prove in essence that the underlying language can be recovered from the isomorphism type of this lattice.

scholarly journals E-unification by means of tree tuple synchronized grammars

1997 ◽  
Vol Vol. 1 ◽  
Author(s):  
Sébastien Limet ◽  
Pierre Réty
Keyword(s):  
Equational Theory ◽  
International Audience ◽  
Infinite Set ◽  
Rewrite System

International audience The goal of this paper is both to give an E-unification procedure that always terminates, and to decide unifiability. For this, we assume that the equational theory is specified by a confluent and constructor-based rewrite system, and that four additional restrictions are satisfied. We give a procedure that represents the (possibly infinite) set of solutions thanks to a tree tuple synchronized grammar, and that can decide upon unifiability thanks to an emptiness test. Moreover, we show that if only three of the four additional restrictions are satisfied then unifiability is undecidable.

NORMAL FORMS FOR FREE APERIODIC SEMIGROUPS

2001 ◽  
Vol 11 (05) ◽  
pp. 581-625 ◽  
Author(s):  
J. P. McCAMMOND
Keyword(s):  
Word Problem ◽  
Normal Forms ◽  
Finite Semigroup ◽  
Unary Operation ◽  
Implicit Operation ◽  
Crucial Step ◽  
Aperiodic Semigroup

The implicit operation ω is the unary operation which sends each element of a finite semigroup to the unique idempotent contained in the subsemigroup it generates. Using ω there is a well-defined algebra which is known as the free aperiodic semigroup. In this article we introduce a specific and rather elementary list of pseudoidentitites, we show that for each n, the n-generated free aperiodic semigroup is defined by this list of pseudoidentities, and then we use this identification to show that it has a decidable word problem. In the language of implicit operations, this shows that the pseudovariety of finite aperiodic semigroups is κ-recursive. This completes a crucial step towards showing that the Krohn–Rhodes complexity of every finite semigroup is decidable.

Sign in / Sign up

Export Citation Format

Share Document