rzach / incompleteness-computabilityLinks
Textbook on Gödel's incompleteness theorems and computability theory
☆20Updated 2 months ago
Alternatives and similar repositories for incompleteness-computability
Users that are interested in incompleteness-computability are comparing it to the libraries listed below
Sorting:
- Open textbook on modal logic☆23Updated 2 months ago
- Tim Button's open textbook on set theory☆39Updated 2 months ago
- LODA Programs for Integer Sequences☆37Updated this week
- distributed revision control system -- historical snapshot☆78Updated 11 years ago
- mmj2 GUI Proof Assistant for the Metamath project☆76Updated 11 months ago
- Coq library for verified low-level programming☆60Updated 8 years ago
- Busy Beaver deciders backed by Coq proof☆54Updated 6 months ago
- A collection of lambda calculus interpreters and development tools☆16Updated 2 years ago
- P.D. Magnus' forallx logic textbook☆67Updated 5 months ago
- Metamath-knife can rapidly verify Metamath proofs, providing strong confidence that the proofs are correct.☆34Updated 3 months ago
- K42 Kernel☆29Updated 13 years ago
- GitHub copy of the NTS/TeX source code from 2001☆31Updated 4 years ago
- Binary Lambda Calculus evaluation engine written in Malbolge.☆17Updated 3 years ago
- A formal proof of an exponentially better upper bound on Ramsey numbers☆17Updated last year
- Metamath program - source code for the Metamath executable☆84Updated last month
- Solutions to math olympiad problems in Isabelle/HOL☆11Updated 4 years ago
- Source of metamath book☆50Updated last year
- Lower Size Bounds for Sorting Networks