planetmath / 03_Mathematical_logic_and_foundationsLinks
☆14Updated last year
Alternatives and similar repositories for 03_Mathematical_logic_and_foundations
Users that are interested in 03_Mathematical_logic_and_foundations are comparing it to the libraries listed below
Sorting:
- Probabilistic miniKanren☆65Updated 9 years ago
- My undergradate thesis on coinductive types in univalent type theory☆17Updated 7 years ago
- ☆22Updated 2 years ago
- Choiceless grapher: a common-lisp diagram maker for consequences of the Axiom of Choice. This is a mirror of https://gitlab.common-lisp.n…☆28Updated 3 months ago
- Theorema: A System for Automated Reasoning (Theorem Proving) and Automated Theory Exploration based on Mathematica☆73Updated 4 years ago
- Relational Programming in miniKanren☆52Updated 10 years ago
- Runnable code from Chaitin's "The Limits of Mathematics (in C)"☆18Updated 3 years ago
- A formalization of (homotopy) limits in Homotopy Type Theory☆11Updated 10 years ago
- ☆10Updated 2 years ago
- Julia Implementation of Unums☆42Updated 8 years ago
- QGAME: Quantum Gate and Measurement Emulator, a quantum computer simulator☆32Updated 8 years ago
- A library for intelligently plotting functions from the MIT Scheme REPL.☆21Updated 12 years ago
- All the logic programming code examples from the book "The Reasoned Schemer"☆52Updated 15 years ago
- The eclib package includes mwrank (for 2-descent on elliptic curves over Q) and modular symbol code used to create the elliptic curve dat…☆24Updated this week
- Source of metamath book☆50Updated last year
- Running the code you want to write as fast as the code you have to write☆140Updated 8 years ago
- ☆30Updated 7 years ago
- mmj2 GUI Proof Assistant for the Metamath project☆76Updated 11 months ago
- Description and analysis of some mathematical/physics phenomena by using simulation☆19Updated last year
- PVTS is a visual interpreter for the Scheme programming language writen in Java.☆28Updated 11 years ago
- Reimplementation of Doug Lenat's Automated Mathematician by Bruce Porter's group at the University of Texas at Austin☆58Updated 16 years ago
- nqthm - the original Boyer-Moore theorem prover, from 1992☆56Updated 9 years ago
- ☆68Updated this week
- The People's Verification System☆158Updated last week
- ☆39Updated 2 weeks ago
- Single-spaced version of my dissertation, 'Relational Programming in miniKanren: Techniques, Applications, and Implementations'☆59Updated 6 years ago
- An implementation of Hoare and He's Unifying Theories of Programming in Isabelle☆37Updated last year
- Prover9 is an automated theorem prover for first-order and equational logic, and Mace4 searches for finite models and counterexamples.☆16Updated 7 years ago
- ☆37Updated 7 years ago
- OPS5 Production System☆57Updated 12 years ago