We study various formulations of the completeness of first-order logic phrased in
constructive type theory and mechanised in the Coq proof assistant. Specifically, we …

We study various formulations of the completeness of first-order logic phrased in
constructive type theory and mechanised in the Coq proof assistant. Specifically, we …

This papers extends the Nuprl proof assistant (a system representative of the class of
extensional type theories a la Martin-Lof) with named exceptions and handlers, as well as a …

Proof assistants like Isabelle/HOL provide the perfect opportunity to develop more than just
one-off formalizations, but frameworks for developing new results within a given area …

This paper extends the Nuprl proof assistant (a system representative of the class of
extensional type theories with dependent types) with named exceptions and handlers, as …

In this thesis, we investigate several key results in the canon of metamathematics, applying
the contemporary perspective of formalisation in constructive type theory and mechanisation …

I succinctly formalize the soundness and completeness of a small Hilbert system for first-
order logic in the proof assistant Isabelle/HOL. The proof combines and details ideas from …

Security protocols are the basis of modern network communication, proving that the security
problem of protocols is one of the hot research topics today. The data in industrial IoT are …

Extending Martín Escardó's effectful forcing technique, we give a new proof of a well-known
result: Brouwer's monotone bar theorem holds for any bar that can be realized by a …

Abstract With Raoult's Open Induction in place of Zorn's Lemma, we do a perhaps more
perspicuous proof of Lindenbaum's Lemma for not necessarily countable languages of first …