An equational logic sampler
From MaRDI portal
Publication:5055725
DOI10.1007/3-540-51081-8_112zbMath1503.03035OpenAlexW1501789649MaRDI QIDQ5055725
Publication date: 9 December 2022
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-51081-8_112
Mechanization of proofs and logical operations (03B35) Grammars and rewriting systems (68Q42) Equational classes, universal algebra in model theory (03C05)
Related Items (3)
Discriminator varieties and symbolic computation ⋮ A field guide to equational logic ⋮ Which data types have \(\omega\)-complete initial algebra specifications?
Cites Work
- 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
- 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
- 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
- Laws in finite loops
- Structural diversity in the lattice of equational theories
- 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
- Undecidable questions related to Church-Rosser Thue systems
- Bases for equational theories of semi-groups
- 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.
- 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
- Free Modular Lattices
- 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
- The Logic of Equality
- The decision problem for equational bases of algebras
- Word problems
- On homomorphisms onto finite groups
- Recursive Unsolvability of a problem of Thue
- 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
- On Comparison of 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
This page was built for publication: An equational logic sampler