Reproduce “Strict Equality in Higher Identity Types: Axioms, Completeness, Decidability” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Keri D'Angelo, Liron Cohen, Luke Serafin, Dexter Kozen

The authors develop SEq, a theory separating strict equality of higher cells from equivalence witnessed by paths. Its 11 axioms yield a strongly normalizing rewrite system for nine axioms and a decision procedure with an exponential-time upper bound. The theory is complete for finite CW-complexes; its presheaf models do not yet interpret dependent types fully.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.