This property of a reduction system states that if an expression can be reduced by zero or more reduction steps to either expression M or expression N then there exists some other expression to which both M and N can be reduced. This implies that there is a unique normal form for any expression since M and N cannot be different normal forms because the theorem says they can be reduced to some other expression and normal forms are irreducible by definition. It does not imply that a normal form is reachable, only that if reduction terminates it will reach a unique normal form. (1995-01-25)

In addition suitable contents:
[ 2 ] [ = ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ at ] [ au ] [ b ] [ be ] [ bo ] [ bot ] [ by ] [ ca ] [ ch ] [ ci ] [ de ] [ diff ] [ do ] [ du ] [ ec ] [ ed ] [ edu ] [ er ] [ es ] [ expression ] [ fi ] [ file ] [ fo ] [ for ] [ forms ] [ h ] [ hat ] [ hr ] [ id ] [ ie ] [ iff ] [ il ] [ implies ] [ in ] [ inc ] [ io ] [ iq ] [ ir ] [ is ] [ it ] [ Lex ] [ li ] [ ly ] [ M ] [ ma ] [ mo ] [ mod ] [ module ] [ mp ] [ ms ] [ N ] [ na ] [ nc ] [ ni ] [ nl ] [ nn ] [ no ] [ norm ] [ normal form ] [ om ] [ op ] [ pe ] [ ph ] [ pl ] [ ply ] [ pr ] [ query ] [ rc ] [ re ] [ reduction ] [ ro ] [ sa ] [ say ] [ se ] [ si ] [ so ] [ st ] [ state ] [ sy ] [ system ] [ T ] [ th ] [ to ] [ us ] [ zero ]