A precise proof of the n-variable Bekic principle
By: Jun Xu
We provide a proof of the $n$-ary Bekič principle, which states that a vectorial fixpoint of size $n$ can be written in terms of nested fixpoints in each coordinate according to lexicographic order. The proof is inductive.
Similar Papers
An abstract fixed-point theorem for Horn formula equations
Logic in Computer Science
Proves computer programs are correct and safe.
Compact Quantitative Theories of Convex Algebras
Logic in Computer Science
Finds math rules for measuring distances.
A Proof of the Schröder-Bernstein Theorem in ACL2
Logic in Computer Science
Proves sets can be matched if they fit inside each other.