Observer / CONCEPT
Exact Residue Fibers and Adaptive Posteriors
Actual longest-congruence queries preserve singleton or sibling states, and conditioning a strictly positive rational prior on the executed history gives exactly those candidates.
Closed
DIRECT PREREQUISITES3
DIRECT CONSEQUENCES2
PROOF DEPTH5
DOCUMENT LINKS1
Complete fibers, execution events, and conditioning
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Affine words and typed local quotient coordinatesstructural-affinity · Closed
- Bounded Integer CRT Completenessstructural-affinity · Closed
- Chronological Child Prefixes for Residue Protocolsstructural-affinity · Closed
- Equality Query Schedule Normal Formstructural-affinity · Closed
- Exact acquisition by positive replacement and graft wordsstructural-affinity · Closed
- Finite CRT Joinstructural-affinity · Closed
- Global affine behavior and joint local realizationstructural-affinity · Closed
- Preserving a continuous competitor's acquired informationstructural-affinity · Closed
- Prime Budget Readout Dichotomystructural-affinity · Closed
- Prime-power Nonadaptive Resolutionstructural-affinity · Closed
- Same Prime Scale Redundancystructural-affinity · Closed
- Terminal Histories and Exact First-Step Costsstructural-affinity · Closed
- The affine valuation identification lower boundstructural-affinity · Closed
- Uniform Height Bound for Residue Identificationstructural-affinity · Closed
- Weighted Identification of Sibling Residue Leavesstructural-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