Strictly Monotone Brouwer Trees for Well Founded Recursion Over Multiple Argument...
summary
Claims a refinement called Strictly Monotone Brouwer trees (SMB-trees) that makes Brouwer-tree ordinals algebraically well behaved so the join distributes over successor, enabling strictly monotone maximums and well‑founded recursion over multiple arguments. Implements all definitions and proofs in Agda, builds a recursive max that matches on successors, defines SMB as the subset where that max is a least upper bound, and shows every Brouwer tree maps to an SMB via an infinite self‑join, preserving ordering.
AI-written summary · about