Term rewrite systems for lattice theory

DOI10.1006/JSCO.1993.1046MaRDI QIDQ1314435zbMATH OpenOpenAlexFDO

Authors Ralph Freese, J. B. Nation, Jaroslav Ježek

Publication date 30 June 1994

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/6cbcb28866cb7d73562cc6c1ea77212cec70b146

zbMATH Keywords

equational theoryterm rewrite system

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Equational classes, universal algebra in model theory (03C05) Lattices (06B99)

Recommendations

• Boolean algebra admits no convergent term rewriting system
• Proof systems for lattice theory
• scientific article; zbMATH DE number 3890721
• scientific article; zbMATH DE number 4155899
• TERM REWRITE RULES FOR FINITE FIELDS

Cited in

(8)

• Computers and universal algebra: Some directions
• Boolean algebra admits no convergent term rewriting system
• From multiple sequent for additive linear logic to decision procedures for free lattices
• Structures for abstract rewriting
• Rewrite systems on a lattice of types
• Permutability of rules in lattice theory.
• Formula normalizations in verification
• Further properties of lattices of equational theories

This page was built for publication: Term rewrite systems for lattice theory

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