You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Five-slice ω-power infrastructure for the Buchholz `_<ᵇ_`
rank-monotonicity unblock. Closes 9 of 13 constructor cases under
the WfCNF restriction `_<ᵇ⁻_`; 3 cases remain open under documented
structural blockers (ψ-admissibility, joint-bplus).
See `docs/echo-types/buchholz-rank-obstruction.adoc` for the full
analysis (narrowed verdict updated this session).
## Slices
| Slice | Module(s) | What lands |
|-------|-----------|------------|
| 1 | `Ordinal.Brouwer.OmegaPow` | `_·ℕ_`, `ω^_`, basic identifications,
`ω^-strict-mono-suc`, `ω^-step` |
| 2 | `Ordinal.Brouwer.Phase13`, OmegaPow | `⊕-mono-≤-left`,
`·ℕ-mono-≤-left`, `ω^-mono-≤`, `ω^-strict-mono` |
| 3 | Phase13, OmegaPow | `⊕-assoc-≤` / `⊕-assoc-≥` (both funext-free
`≤′` directions), `·ℕ-add-≤`, **`additive-principal`** at `ω^(suc n)` |
| 4 | `Ordinal.Buchholz.RankPow` | `ω-rank-pow` (limit-shaped),
`rank-pow`, `ω-rank-pow-{pos,mono}`, `rank-pow-bplus-right-mono`,
`rank-pow-via-left`, `additive-principal-ω-rank-pow`,
`rank-pow-bplus-into-ω-rank-pow` |
| 5 | RankPow | 9 per-constructor rank-mono primitives
(relation-agnostic): `rank-mono-<ᵇ-0-Ω`, `rank-mono-<ᵇ-0-ψ`,
`rank-mono-<ᵇ-ΩΩ`, `rank-mono-<ᵇ-Ωψ`, `rank-mono-<ᵇ-ψΩ`,
`rank-mono-<ᵇ-Ω+`, `rank-mono-<ᵇ-ψ+`, `rank-mono-<ᵇ-+Ω`,
`rank-mono-<ᵇ-+ψ` |
## Reusable design
The Slice-5 primitives are stated purely in terms of rank inequalities,
not the driving relation. Consumers — whether `_<ᵇ⁻_` (this track) or
`_<ᵇʳᶠ_` (parallel-session track) — pattern-match on their relation's
constructor and apply the matching primitive. No relation-specific
recursion lives in RankPow.
## Open under documented blockers
- `<ᵇ-ψα`, `<ᵇ-ψΩ≤` — provisional `rank-pow (bpsi ν _) = ω-rank-pow ν`
doesn't discriminate on α. Closed by ψ-admissibility predicate
(`WellFormedAdmissible.agda`, ~80 lines).
- `<ᵇ-+1` — `rank-pow (bplus z₁ z₂)` is not additive principal in
general. Needs either a coarser dominator function or richer rank.
- `rank-pow-mono-<ᵇ⁻` umbrella — gated on `<ᵇ-+1`.
## Build invariants
- `agda proofs/agda/All.agda` and `agda proofs/agda/Smoke.agda` exit
0 under `--safe --without-K`.
- No postulates, no escape pragmas, no funext.
- Every headline pinned in `Smoke.agda`.
## Commits (20)
Branched from `8c9ddcb`. Includes prior session work on the WfCNF
predicate (`Ordinal.Buchholz.WellFormedCNF`) and the `_<ᵇ⁻_`
subrelation (`Ordinal.Buchholz.OrderRestricted`); the path-1
foundation those modules established is now operational.
🤖 Generated with [Claude Code](https://claude.com/claude-code)
---------
Co-authored-by: Claude Opus 4.7 (1M context) <noreply@anthropic.com>
Copy file name to clipboardExpand all lines: docs/adjacency/modal-type-theories.adoc
+2Lines changed: 2 additions & 0 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -1,6 +1,8 @@
1
1
= Adjacency: modal type theories
2
2
:toc: macro
3
3
4
+
_Axes engaged: 5 (Comp), 7 (PR/PI); axis 8 (IT/Comp) open — QTT-style quantitative annotations are proxies for resource control (taxonomy §8) but not full computational-access tracking. See `README.adoc` § "Axis coverage matrix"._
5
+
4
6
[.lead]
5
7
*Verdict: co-extensive with QTT-class systems on bare echo.* Not
6
8
distinct from native modal type theories on the type level; the
0 commit comments