1
EML Registry: Tamari Lattice Contraction
▶
1.1
Core Types
1.2
Lifting Lemmas
1.3
Size Invariants
1.4
Main Contraction Theorem
1.5
Router and Registry
1.6
Witness-Skeptic Game
2
Logic Types: Pluralistic Reasoning Framework
▶
2.1
Logic Type Hierarchy
2.2
Cayley-Dickson Connection
2.3
Normal Forms and Contraction Theorem
2.4
Logic Monad: Self-Contained Self-Reference
2.5
Institutional Closure: Interacting Logic Monads
2.6
Decision Composition API
2.7
Paradox Taxonomy
2.8
The Liar as a Problem Instance
2.9
Liar Wrappers
2.10
Nested Wrappers (Stacked Collapse)
2.11
Temporal Paradox Problem
2.12
Russell’s Paradox Problem
2.13
The Very Big Box
2.14
Sorites as a Problem Instance
2.15
Decomposition: Ontological Underdetermination
2.16
Reverse Contraction: Generating Predecessors
2.17
Decomposition Structure
2.18
The Hypercomputer: Infinite Ancestor Enumeration
▶
Lean 4 Coinductive Limitation
2.19
Boundlessness: The Terminal Regularization
▶
Relation to the Hypercomputer.
2.20
Completed Work
▶
2.20.1
Remaining Work
2.20.2
Liar Cost: Hardness Measure
2.20.3
Friction Lagrangian
Dependency graph
LaserCortex
Tomas Rolin (nos AKA galganzuul)
1
EML Registry: Tamari Lattice Contraction
1.1
Core Types
1.2
Lifting Lemmas
1.3
Size Invariants
1.4
Main Contraction Theorem
1.5
Router and Registry
1.6
Witness-Skeptic Game
2
Logic Types: Pluralistic Reasoning Framework
2.1
Logic Type Hierarchy
2.2
Cayley-Dickson Connection
2.3
Normal Forms and Contraction Theorem
2.4
Logic Monad: Self-Contained Self-Reference
2.5
Institutional Closure: Interacting Logic Monads
2.6
Decision Composition API
2.7
Paradox Taxonomy
2.8
The Liar as a Problem Instance
2.9
Liar Wrappers
2.10
Nested Wrappers (Stacked Collapse)
2.11
Temporal Paradox Problem
2.12
Russell’s Paradox Problem
2.13
The Very Big Box
2.14
Sorites as a Problem Instance
2.15
Decomposition: Ontological Underdetermination
2.16
Reverse Contraction: Generating Predecessors
2.17
Decomposition Structure
2.18
The Hypercomputer: Infinite Ancestor Enumeration
Lean 4 Coinductive Limitation
2.19
Boundlessness: The Terminal Regularization
Relation to the Hypercomputer.
2.20
Completed Work
2.20.1
Remaining Work
2.20.2
Liar Cost: Hardness Measure
2.20.3
Friction Lagrangian