Computability / CONCEPT
Integer decisions by recursive elimination
Recursive Cooper elimination computes the truth of every integer formula.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH3
DOCUMENT LINKS0
Full formula semantics
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
- A structural Nat-to-Int semantic compilerstructural-affinity · Closed
- All Native Trees: Uniform Presburger Descriptor Obstructionstructural-affinity · Closed
- Eliminating one integer coordinatestructural-affinity · Closed
- Executable native decisions and Option solutionsstructural-affinity · Closed
- Native coordinates in integer valuationsstructural-affinity · Closed
- Original Presburger Formula Growthstructural-affinity · Closed
- Periodic integer predicates and finite residuesstructural-affinity · Closed
- Polarity and disjunctive normal formstructural-affinity · Closed
- Uniform descriptor synthesis and literal-table transportstructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance