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 3 months ago
- Busy Beaver deciders backed by Coq proof☆57Updated 6 months ago
- mmj2 GUI Proof Assistant for the Metamath project☆76Updated last year
- Metamath-knife can rapidly verify Metamath proofs, providing strong confidence that the proofs are correct.☆34Updated 4 months ago
- Metamath program - source code for the Metamath executable☆86Updated last month
- A collection of lambda calculus interpreters and development tools☆16Updated 2 years ago
- Coq library for verified low-level programming☆60Updated 8 years ago
- Solutions to math olympiad problems in Isabelle/HOL☆11Updated 4 years ago
- distributed revision control system -- historical snapshot☆78Updated 11 years ago
- A formal proof of an exponentially better upper bound on Ramsey numbers☆17Updated last year
- Source of metamath book☆51Updated last year
- A book generator☆28Updated last month
- Textbook on metalogic based on the Open Logic Project☆44Updated 2 months ago
- GitHub copy of the NTS/TeX source code from 2001☆31Updated 4 years ago
- P.D. Magnus' forallx logic textbook☆67Updated 5 months ago
- A revival of the TREE-META compiler-compiler.☆15Updated 7 years ago
- K42 Kernel☆30Updated 13 years ago
- LODA Programs for Integer Sequences☆37Updated this week
- metamath proof enumerators and other things☆94Updated last year
- Open source library to handle integers of any size in C☆14Updated 2 years ago
- Tools for finding and analyzing Busy Beaver programs for Turing machines☆12Updated this week
- Resurrecting PP-BESM☆26Updated 2 years ago
- Intuitionistic Programming Language☆12Updated 11 years ago
- LODA is an assembly language, a computational model and a tool for mining integer sequence programs.☆21Updated 4 years ago
- Lower Size Bounds for Sorting Networks☆46Updated 4 years ago
- Portable high-level assembler with authentic C syntax☆25Updated 3 years ago
- Quipu Programming Language☆20Updated 12 years ago
- A Parallelism Profiler with What-If analyses for Intel Threading Building Blocks (TBB) programs☆13Updated 7 years ago
- Automatically exported from code.google.com/p/ghilbert☆48Updated 7 years ago