| FazBrowse GitHub Viewer | Trending | | Home |
| Tools: [Download Repo ZIP] [Original HTTPS Page] |
An exhaustive condensed detachment formal proof generator for Hilbert systems in proof theory.
A self-verifying proof that the Thiele Machine is a universal model of computation which strictly contains the Turing Machine as a blind, special case. All open source.
LeastNumber is not decision-tree reducible to StrongAvoid: a coefficient-mass size lower bound for Sigma_2-unary Sherali-Adams, formalised in Lean 4. Answers the open problem in Fleming-Gal-Imrek-Marciot, CCC 2026, Section 6.
Code, data, and receipts for Solver-Hard Is Not Model-Hard
Add a description, image, and links to the proof-complexity topic page so that developers can more easily learn about it.
To associate your repository with the proof-complexity topic, visit your repo's landing page and select "manage topics."
| Back | FazBrowse Home | New Git URL |