no code implementations • 10 Aug 2020 • Jeremy Avigad, Floris van Doorn
We consider a perimeter surveillance problem introduced by Kingston, Beard, and Holt in 2008 and studied by Davis, Humphrey, and Kingston in 2019.
1 code implementation • 23 Apr 2019 • Jesse Michael Han, Floris van Doorn
We describe a formalization of forcing using Boolean-valued models in the Lean 3 theorem prover, including the fundamental theorem of forcing and a deep embedding of first-order logic with a Boolean-valued soundness theorem.
Logic in Computer Science Logic 03-04, 03E35, 03E40
1 code implementation • 12 Feb 2018 • Ulrik Buchholtz, Floris van Doorn, Egbert Rijke
We present a development of the theory of higher groups, including infinity groups and connective spectra, in homotopy type theory.
Logic in Computer Science Algebraic Topology Logic 03B15 F.4.1
no code implementations • 22 Apr 2017 • Floris van Doorn, Jakob von Raumer, Ulrik Buchholtz
We discuss the homotopy type theory library in the Lean proof assistant.
Logic in Computer Science Logic 03B70, 03B15, 55U35
no code implementations • 7 Dec 2015 • Floris van Doorn
In homotopy type theory, we construct the propositional truncation as a colimit, using only non-recursive higher inductive types (HITs).
Logic 03B15 F.4.1
