rzach / boxes-and-diamondsLinks
Open textbook on modal logic
☆23Updated last month
Alternatives and similar repositories for boxes-and-diamonds
Users that are interested in boxes-and-diamonds are comparing it to the libraries listed below
Sorting:
- Textbook on metalogic based on the Open Logic Project☆43Updated last month
- Source of metamath book☆49Updated last year
- HoTT in Lean 3☆80Updated 5 years ago
- mmj2 GUI Proof Assistant for the Metamath project☆75Updated 10 months ago
- A library of mechanised undecidability proofs in the Coq proof assistant.☆119Updated 2 weeks ago
- A place to put our 2018 Xena project UROP thoughts and programs.☆25Updated 5 years ago
- A LaTeX package to reproduce (an enhanced version of) the numbered paragraph style from classic French mathematics books.☆19Updated 4 years ago
- ☆47Updated 2 years ago
- Lecture notes on realizability☆74Updated 5 months ago
- A formal consistency proof of Quine's set theory New Foundations☆73Updated last month
- An equational theorem prover based on Knuth-Bendix completion☆52Updated last month
- Coq library for verified low-level programming☆60Updated 8 years ago
- Natty is a natural-language proof assistant with an embedded automatic prover for higher-order logic. It is in an early stage of develop…☆36Updated 2 weeks ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 2 years ago
- A symbolic model checker for Dynamic Epistemic Logic.☆46Updated 2 weeks ago
- Lean theorem prover version 0.2 (it supports standard and HoTT modes)☆122Updated 3 years ago
- ☆36Updated 3 years ago
- Alexander Grothendieck's 1972 talk at CERN, on scientific research☆63Updated 9 months ago
- Course website for Math 721: Homotopy Type Theory, taught at Johns Hopkins in Fall 2021☆47Updated 3 years ago
- Stacks project, from a homotopy type theory point-of-view (hPOV)☆14Updated 4 years ago
- Modeling and Proving in Computational Type Theory☆102Updated 3 weeks ago
- ☆34Updated last week
- Real number computation software☆126Updated 2 years ago
- ☆31Updated 2 years ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆51Updated last month
- The formal proof of the Odd Order Theorem☆31Updated last month
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆67Updated 9 months ago
- Textbook on Gödel's incompleteness theorems and computability theory☆20Updated last month
- Convert Haskell source code to Coq source code.☆86Updated last month
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆85Updated 4 years ago