| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 4 hours | Migrate to `Felix` namespaceHEADhotg | adelon | |
| 29 hours | Restore checked set-induction composition | adelon | |
| 31 hours | Confine contradictory status to falsum targets | adelon | |
| 31 hours | Restore exact cases and contradiction | adelon | |
| 5 days | Prepare exact inductive declarations | adelon | |
| 9 days | Fall back after reconstruction exhaustion | adelon | |
| 9 days | Remove obsolete kernel authorization projection | adelon | |
| 9 days | Prepare direct inductive kernel proofs | adelon | |
| 9 days | Define bounded fixed-point kernel rules | adelon | |
| 9 days | Replay scoped HOL derivations independently | adelon | |
| Replay rechecks stored terms against the current global signature and bounds nodes, lexical depth, and conversion. Import-bearing trees remain replay-only until exact transition-inventory authorization alignment lands. | |||
| 9 days | Authorize ground reflexivity through kernel replay | adelon | |
| The first typed fact family is deliberately dependency-free. Its rows remain outside the legacy fact registry, so unmigrated declarations cannot consume or reauthorize them. | |||
| 9 days | Replay equality reflexivity independently | adelon | |
