A geometric proof of con uence by decreasing diagrams
نویسندگان
چکیده
The criterion for con uence using decreasing diagrams is a generalization of several well-known con uence criteria in abstract rewriting, such as the strong con uence lemma. We give a new proof of the decreasing diagram theorem based on a geometric study of in nite reduction diagrams, arising from unsuccessful attempts to obtain a con uent diagram by tiling with elementary diagrams. 2000 Mathematics Subject Classi cation: 68Q42, 52C2
منابع مشابه
A geometric proof of confluence by decreasing diagrams
The criterion for con uence using decreasing diagrams is a generalization of several well-known con uence criteria in abstract rewriting, such as the strong con uence lemma. We give a new proof of the decreasing diagram theorem based on a geometric study of in nite reduction diagrams, arising from unsuccessful attempts to obtain a con uent diagram by tiling with elementary diagrams. 2000 Mathem...
متن کاملA Geometric Proof of Con uence by DecreasingDiagramsJan Willem Klop
The criterion for connuence using decreasing diagrams is a generalization of several well-known connuence criteria in abstract rewriting, such as the strong connuence lemma. We give a new proof of the decreasing diagram theorem based on a geometric study of innnite reduction diagrams , arising from unsuccessful attempts to obtain a connuent diagram by tiling with elementary diagrams.
متن کاملVeriication of Diagrammatic Proofs
Mateja Jamnik, Alan Bundy, Ian Green Department of Arti cial Intelligence, 80 South Bridge Edinburgh, EH1 1HN, UK [email protected], [email protected], [email protected] Abstract Human mathematicians often \prove" theorems by the use of diagrams and manipulations on them. We call these diagrammatic proofs. In (Jamnik, Bundy, & Green 1997) we presented how \informal" reasoning with diagrams can...
متن کاملDeveloping Developments Nippon Telegraph and Telephone Corporation
Con uence of orthogonal rewriting systems can be proved using the Finite Developments Theorem. We present, in a general setting, several adaptations of this proof method for obtaining con uence of `not quite' orthogonal systems.
متن کاملMore Church-Rosser Proofs (in Isabelle/HOL)
The proofs of the Church Rosser theorems for and reduction in untyped calculus are formalized in Isabelle HOL an im plementation of Higher Order Logic in the generic theorem prover Isa belle For reduction both the standard proof and the variation by Takahashi are given and compared All proofs are based on a general theory of commutating relations which supports an almost geometric style of con ...
متن کامل