Theorem proving with group presentations: examples and questions

DOI10.1007/3-540-61511-3_100MaRDI QIDQ4647534zbMATH OpenOpenAlexWikidataFDO

Authors Ursula Martin Webb

Publication date 15 January 2019

Published in Automated Deduction — Cade-13 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61511-3_100

zbMATH Keywords

complete systemnormal subgroupquotient groupsymbolic computationword problem

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Grammars and rewriting systems (68Q42) Symbolic computation and algebraic computation (68W30)

Recommendations

• Some group theoretic examples with completion theorem provers
• scientific article; zbMATH DE number 67429
• scientific article; zbMATH DE number 1222454
• Complete semi-Thue systems for abelian groups
• Finite complete rewriting systems for groups

Cites work

• A complete characterization of termination of \(0^p1^q\to 1^r0^s\)
• About the descriptive power of certain classes of finite string-rewriting systems
• Computer proofs in group theory
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• scientific article; zbMATH DE number 4077463 (Why is no real title available?)
• scientific article; zbMATH DE number 43246 (Why is no real title available?)
• scientific article; zbMATH DE number 1348481 (Why is no real title available?)
• scientific article; zbMATH DE number 534859 (Why is no real title available?)
• scientific article; zbMATH DE number 789389 (Why is no real title available?)
• scientific article; zbMATH DE number 794238 (Why is no real title available?)
• scientific article; zbMATH DE number 3299786 (Why is no real title available?)
• Linear interpretations by counting patterns
• On the problem of generating small convergent systems
• Orderings for term-rewriting systems
• Single axioms for odd exponent groups
• Soluble groups with a finite rewriting system
• Some experiments with a completion theorem prover
• Some group theoretic examples with completion theorem provers
• Tame combings, almost convexity and rewriting systems for groups
• Termination of rewriting
• The Gröbner fan of an ideal
• The order types of termination orderings on monadic terms, strings and multisets
• The use of Knuth-Bendix methods to solve the word problem in automatic groups
• Weights for total division orderings on strings
• Word problems and a homological finiteness condition for monoids

Cited in

(2)

• Invariants, patterns and weights for ordering terms
• PATCH graphs: an efficient data structure for completion of finitely presented groups

Describes a project that uses

Uses Software

• GAP
• Magma

This page was built for publication: Theorem proving with group presentations: examples and questions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4647534)