A Modular First Formalisation of Combinatorial Design Theory-Reference-Cited by-同舟云学术

A Modular First Formalisation of Combinatorial Design Theory

Published:2021 Issue: Volume: Page:3-18
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Edmonds Chelsea^ORCID,Paulson Lawrence C.^ORCID

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-81097-9_1

Reference16 articles.

1. Lecture Notes in Computer Science;C Ballarin,2004

2. Ballarin, C.: Tutorial to locales and locale interpretation. In: Contribuciones Científicas en Honor de Mirian Andrés Gómez, pp. 123–140. University of Rioja (2010). https://dialnet.unirioja.es/servlet/articulo?codigo=3216664

3. Ballarin, C.: Exploring the structure of an algebra text with locales. J. Autom. Reason. 64(6), 1093–1121 (2020)

4. Bentkamp, A.: Latin square. Isabelle Archive of Formal Proofs (Dec 2015). http://isa-afp.org/entries/Latin_Square.html

5. Beth, T., Jungnickel, D., Lenz, H.: Design Theory, Encyclopedia of Mathematics and Its Applications, vol. 1, 2nd edn. Cambridge University Press, Cambridge (1999)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The formal verification of the ctm approach to forcing;Annals of Pure and Applied Logic;2024-05

2. Formal Probabilistic Methods for Combinatorial Structures using the Lovász Local Lemma;Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs;2024-01-09

3. A Formalisation of the Balog–Szemerédi–Gowers Theorem in Isabelle/HOL;Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs;2023-01-11

4. Large-Scale Formal Proof for the Working Mathematician—Lessons Learnt from the ALEXANDRIA Project;Lecture Notes in Computer Science;2023

5. Formalising Szemerédi’s Regularity Lemma and Roth’s Theorem on Arithmetic Progressions in Isabelle/HOL;Journal of Automated Reasoning;2022-12-19