Theorem proving with group presentations: examples and questions

DOI10.1007/3-540-61511-3_100zbMATH Open1412.68243OpenAlexW1510239582WikidataQ55393310 ScholiaQ55393310MaRDI QIDQ4647534FDOQ4647534

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

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

zbMATH Keywords

complete systemsymbolic computationword problemquotient groupnormal subgroup

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

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

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)