Invariants and closures in the theory of rewrite systems

DOI10.1007/BF01213534zbMATH Open0857.68067MaRDI QIDQ1815344FDOQ1815344

Authors: Stefan Rönn 

Publication date: 10 November 1996

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Recommendations

• Infinitary rewriting: closure operators, equivalences and models
• Complete involutive rewriting systems
• Automated Reasoning
• Infinitary rewriting: foundations revisited
• scientific article; zbMATH DE number 1419256
• Existence, Uniqueness, and Construction of Rewrite Systems
• Invariants and well-foundedness in program algebra
• Consistency and Completeness of Rewriting in the Calculus of Constructions
• Consistency and Completeness of Rewriting in the Calculus of Constructions
• scientific article; zbMATH DE number 1754582

zbMATH Keywords

invariantsclosuresrewrite systemsrewrite operator

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Title not available (Why is that?)
• Two Complete Axiom Systems for the Algebra of Regular Events
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complete Sets of Reductions for Some Equational Theories
• A completeness theorem for Kleene algebras and the algebra of regular events
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Rewrite Closure and CF Hedge Automata
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Complete involutive rewriting systems
• Intersection of the reflexive transitive closures of two rewrite relations induced by term rewriting systems
• Title not available (Why is that?)

This page was built for publication: Invariants and closures in the theory of rewrite systems

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