rzach / incompleteness-computabilityLinks
Textbook on Gödel's incompleteness theorems and computability theory
☆22Updated 4 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☆24Updated 4 months ago
- Tim Button's open textbook on set theory☆40Updated 5 months ago
- LODA Programs for Integer Sequences☆37Updated this week
- Busy Beaver deciders backed by Coq proof☆58Updated 8 months ago
- Textbook on non-classical logics☆13Updated 5 months ago
- Source of metamath book☆51Updated last year
- P.D. Magnus' forallx logic textbook☆68Updated 7 months ago
- A formal proof of an exponentially better upper bound on Ramsey numbers☆18Updated 2 years ago
- mmj2 GUI Proof Assistant for the Metamath project☆75Updated last year
- Textbook on metalogic based on the Open Logic Project☆44Updated 4 months ago
- Metamath program - source code for the Metamath executable☆89Updated 4 months ago
- Solutions to math olympiad problems in Isabelle/HOL☆11Updated 4 years ago
- We compute the Brumer-Stark units and the polynomial required to generate the Hilbert class field of some real quadratic fields, as compu…☆32Updated 4 years ago
- GitHub copy of the NTS/TeX source code from 2001☆32Updated 4 years ago
- A book generator☆28Updated last week
- UCalgary version of forallx, an introduction to formal logic☆114Updated 2 months ago
- A collection of lambda calculus interpreters and development tools☆16Updated 3 years ago
- metamath proof enumerators and other things☆91Updated 2 weeks ago
- Implementations of the Are-we-fast-yet benchmark suite in Oberon, C++, C, Pascal, Micron and Luon☆66Updated last month
- ☆22Updated 2 years ago
- Coq library for verified low-level programming☆60Updated 8 years ago
- SymPy Documentation repository☆37Updated this week
- Terminal CLI to Mathics3☆60Updated 3 months ago
- A C11 compiler for the discrete logic computer☆21Updated last year
- Resurrecting PP-BESM☆27Updated last week
- Tokenizer, and operator and character tables, and conversion routines for the Wolfram Language.☆22Updated 3 months ago
- Applied Discrete Structures using PreTeXt☆45Updated last week
- Metamath-knife can rapidly verify Metamath proofs, providing strong confidence that the proofs are correct.☆36Updated 6 months ago
- Java implementations of sequences in the OEIS☆67Updated this week
- K42 Kernel☆31Updated 13 years ago