The combinatorial degrees of proofs and equations

DOI10.1007/BF01197185zbMath0860.20043OpenAlexW2073951277MaRDI QIDQ1918969

Sherman Stein

Publication date: 13 April 1997

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01197185

zbMATH Keywords

wordsidentitiesfree semigroupscongruenceslengthdegreesequationsoperationsvalleysproofsminimal reductionstroughsmountain proofsnumber of peaks

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Equational logic, Mal'tsev conditions (08B05) Equational classes, universal algebra in model theory (03C05) Complexity of proofs (03F20)

Related Items (1)

Semigroup identities and proofs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semigroups satisfying \(xy=yg(x,y)x\)
• Semigroups satisfying identity xy=f(x,y)
• Unsolvable problems for equational theories
• On theories with a combinatorial definition of 'equivalence'
• Unending chess, symbolic dynamics and a problem in semi-groups
• Undecidable properties of finite sets of equations
• Idempotent Semigroups

This page was built for publication: The combinatorial degrees of proofs and equations