Dynamics / CONCEPT
Recursive Definitions as Selected Fixed Points
Recursive definitions are fixed points with explicit extremal selections.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH1
DOCUMENT LINKS1
A recursive equation is a fixed-point equation
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- Controlled Distinguishing Depthstructural-affinity · Closed
- Controlled Finite Stabilitystructural-affinity · Closed
- Controlled Pair-Edge Complexitystructural-affinity · Closed
- Finite Future Congruencestructural-affinity · Closed
- Knaster-Tarski Extremal Fixed Pointsstructural-affinity · Closed
- Knaster–Tarski Witnessstructural-affinity · Closed
- Maximal Forward-Invariant Subkernelstructural-affinity · Closed
- Naive Refinement Complexitystructural-affinity · Closed
- Reverse Search for First Separationstructural-affinity · Closed
- Three-Cycle Fixed-Point Gapstructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance