Mathematical logic and foundations

The Lean Pool projects whose card's first MSC2020 code is in class 03, Mathematical logic and foundations: 21 articles, one per card.

A 21-state Turing machine for… to Strengthened V0 Bounded…

• A 21-state Turing machine for Goldbach's conjecture
• A formalization of Borel determinacy in Lean
• Craig interpolation and Beth definability for propositional dynamic logic
• Craig Interpolation for Gödel-Löb logic via coalgebraic proofs
• DomainTheory
• First Order Language of ZF Set Theory
• Global completeness of one-sorted definedness-free matching logic
• Gödel's First and Second Incompleteness Theorems
• Infinitary logic and countable model theory
• The Kunen inconsistency theorem
• Lentil: Temporal Logic of Actions in Lean 4
• Nash-Williams fronts and 2-better-quasi-orders
• New Foundations refutes the Weak Partition Principle
• The nonmeagre lower bound for the rearrangement number
• Oracle Computability and Turing Degrees
• Ordered resource algebras and the Iris recursive domain model
• Partial Combinatory Algebras
• PCF Theory
• Pointwise provable equality and the failure of composition
• Strengthened V0 Bounded Arithmetic Interfaces

ZFLean

• ZFLean

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.