rzach / boxes-and-diamonds
Open textbook on modal logic
☆22Updated 3 years ago
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☆41Updated last year
- HoTT in Lean 3☆80Updated 4 years ago
- ☆31Updated last year
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆63Updated 7 months ago
- Write formal proofs in natural language and LaTeX.☆36Updated 3 weeks ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆53Updated 8 months ago
- An enhanced unification algorithm for Coq☆56Updated last month
- Research material of Erik Palmgren (1963–2019)☆20Updated last month
- Lecture notes on realizability☆72Updated 2 months ago
- An experimental category theory library for Lean☆51Updated last year
- A formalization of M-types in Agda☆32Updated 5 years ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆49Updated 7 months ago
- A LaTeX package to reproduce (an enhanced version of) the numbered paragraph style from classic French mathematics books.☆19Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆82Updated 4 years ago
- Revised Omega-categorical Typechecker☆26Updated 6 months ago
- ☆15Updated 10 months ago
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated last month
- Meta-programming utilities for Agda.☆19Updated this week
- A repository for material from the reading group on NbE☆17Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- ☆36Updated 3 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆29Updated last year
- Textbook on Gödel's incompleteness theorems and computability theory☆19Updated 3 years ago
- Bicategories of automata, completeness of F-automata in monoidal categories, adjoints between (semi)bicategories; https://arxiv.org/pdf/2…☆18Updated 11 months ago
- A formalisation of the Calculus of Constructions☆69Updated 9 months ago
- An equational theorem prover based on Knuth-Bendix completion☆50Updated last month
- A library of mechanised undecidability proofs in the Coq proof assistant.☆117Updated last month
- Archive of the categories mailling list☆11Updated 4 years ago
- Ground Zero: Lean 4 HoTT Library☆60Updated last month