Commit 2026-02-23 13:33 25e9ac67
View on Github →feat(Computability): add FinEncodings for List Bool and pairs of types (#32367)
This PR contains finEncodings relevant to developing complexity theory in downstream libraries. It is adapted from this#maths > Formalise the proposition P ≠NP @ 💬 comment.