Formalizing finite Ramsey theory in Lean 4
From MaRDI portal
Publication:6648159
DOI10.1007/978-3-031-66997-2_6MaRDI QIDQ6648159
Cruise Song, N. Zhang, David E. Narváez
Publication date: 4 December 2024
Cites Work
- Title not available (Why is that?)
- A lower bound on the size of resolution proofs of the Ramsey theorem
- A new method to construct lower bounds for van der Waerden numbers
- Some applications of Ramsey's theorem to additive number theory
- On the congruence \(x^m+y^m\equiv z^m\pmod p\).
- On a problem of formal logic.
- On a Ramsey type theorem
- The van der Waerden NumberW(2, 6) Is 1132
- Some new van der Waerden numbers and some van der Waerden-type numbers
- Hard examples for resolution
- Proof Technology in Mathematics Research and Teaching
- Some Remarks on Ramsay's Theorem
- Combinatorial Relations and Chromatic Graphs
- Formalising the Kruskal-Katona theorem in Lean
This page was built for publication: Formalizing finite Ramsey theory in Lean 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6648159)
