A field guide to equational logic
From MaRDI portal
Publication:1201350
DOI10.1016/0747-7171(92)90013-TzbMath0781.03011OpenAlexW1975646155MaRDI QIDQ1201350
Publication date: 17 January 1993
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0747-7171(92)90013-t
lattices of equational theoriesequational logicdecidabilityfinite axiomatizabilityundecidable properties of finite sets of equations
Symbolic computation and algebraic computation (68W30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Decidability of theories and sets of sentences (03B25) Equational logic, Mal'tsev conditions (08B05) Grammars and rewriting systems (68Q42) Equational classes, universal algebra in model theory (03C05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to general algebraic systems (08-01)
Related Items
An algebraic theory of clones, Varieties of regular semigroups with uniquely defined inversion, Power semigroups of finite groups and the INFB property., Paraconsistent constructive logic with strong negation as a contraction-free relevant logic, Unification of infinite sets of terms schematized by primal grammars, A NONFINITELY BASED FINITE SEMIRING, The existence of finitely based lower covers for finitely based equational theories, Computer Solutions of Problems in Inverse Semigroups, On identities of finite involution semigroups., COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES, Finite bases for flat graph algebras, A finitely axiomatizable undecidable equational theory with recursively solvable word problems, A remark on nonfinitely based semirings., The finite basis problem for endomorphism semirings of finite semilattices with zero., Finitely generated equational classes, The max-plus algebra of the natural numbers has no finite equational basis
Cites Work
- Tarski's theory of definability: Common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic
- Recursive unsolvability of group theoretic problems
- Finite complete rewriting systems and the complexity of word problem
- A new product of algebras and a type reduction theorem
- Basic questions for general algebras
- Equational theory of positive numbers with exponentiation is not finitely axiomatizable
- The undecidability of self-embedding for term rewriting systems
- Nonfinitely based three-element idempotent groupoids
- Termination of rewriting
- Thue systems as rewriting systems
- History and basic features of the critical-pair/completion procedure
- Finite equational bases for congruence modular varieties
- Laws in finite loops
- Congruence varieties
- Structural diversity in the lattice of equational theories
- Rewriting techniques and applications. 3rd international conference, RTA-89, Chapel Hill, NC, USA, April 3--5, 1989. Proceedings
- The structure of decidable locally finite varieties
- Problems and results in tame congruence theory. A survey of the '88 Budapest workshop
- Intervals in the lattice of varieties
- Base-undecidable properties of universal varieties
- Finite equational bases for finite algebras in a congruence-distributive equational class
- Identities satisfied by a finite ring
- On the word problem for the modular lattice with four free generators
- Universal algebra and lattice theory. Proceedings of the Fourth International Conference Held at Puebla, Mexico, 1982
- Undecidable questions related to Church-Rosser Thue systems
- Essentially infinitely based varieties of algebras
- Contributions to mathematical logic. Proceedings of the logic colloquium, Hannover 1966
- Unsolvable problems for equational theories
- Non-recursiveness of the set of finite sets of equations whose theories are one based
- Embedding the dual of \(\Pi^\infty\) in the lattice of equational classes of semigroups.
- Varieties of \(\Omega\)-algebras
- Identical relations in finite groups
- Decision problems concerning properties of finite sets of equations
- PROBLEMS OF BURNSIDE TYPE AND THE FINITE BASIS PROPERTY IN VARIETIES OF SEMIGROUPS
- INHERENTLY NONFINITELY BASED FINITE SEMIGROUPS
- The Laws of Finite Pointed Groups
- Residually Small Varieties with Modular Congruence Lattices
- The lattice of equational theories. Part II: The lattice of full sets of terms
- The structure of finite algebras
- Equational Bases for Lattice Theories.
- On spectra, and the negative solution of the decision problem for identities having a finite nontrivial model
- Definability in lattices of equational theoris
- The Logic of Equality
- The decision problem for equational bases of algebras
- Undecidable properties of finite sets of equations
- Word problems
- A Variety with Solvable, but not Uniformly Solvable, Word Problem
- On homomorphisms onto finite groups
- The word problem for division rings
- Recursive Unsolvability of a problem of Thue
- An equational logic sampler
- Algebras Whose Congruence Lattices are Distributive.
- A Characterization of Modularity for Congruence Lattices of Algebras*
- Some Connections between Residual Finiteness, Finite Embeddability and the Word Problem
- Primitive classes of algebras with unary and nullary operations
- Embedding the Dual of Π m in the Lattice of Equational Classes of Commutative Semigroups
- Identical relations on varieties of quasigroups
- The Lattice of Equational Classes of Algebras with One Unary Operation
- Identities in Two-Valued Calculi
- On Comparison of Finite Algebras
- Identities in Finite Algebras
- The decision problem for some classes of sentences without quantifiers
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
- Elementary properties of Abelian groups
- The word problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
