6 papers · 1 filter
Agent Hunt: Bounty Based Collaborative Autoformalization With LLM Agents
Chad E. Brown, Cezary Kaliszyk, Josef Urban
We describe an experiment in large-scale autoformalization of algebraic topology in an Interactive Theorem Proving (ITP) environment, where the workload is distributed among multip…
Payment Channels with Proofs
Chad E. Brown, Cezary Kaliszyk, Josef Urban
The fundamental building blocks of the Bitcoin lightning network are bidirectional payment channels. We describe an extension of payment channels in the Proofgold network which all…
Exploring Formal Math on the Blockchain: An Explorer for Proofgold
Chad E. Brown, Cezary Kaliszyk, Josef Urban
Proofgold is a blockchain that supports formalized mathematics alongside standard cryptocurrency functionality. It incorporates logical constructs into the blockchain, including de…
Hammering Higher Order Set Theory
Chad E. Brown, Cezary Kaliszyk, Martin Suda +1
We use automated theorem provers to significantly shorten a formal development in higher order set theory. The development includes many standard theorems such as the fundamental t…
Tableaux for Automated Reasoning in Dependently-Typed Higher-Order Logic (Extended Version)
Johannes Niederhauser, Chad E. Brown, Cezary Kaliszyk
Dependent type theory gives an expressive type system facilitating succinct formalizations of mathematical concepts. In practice, it is mainly used for interactive theorem proving…
Experiments with Choice in Dependently-Typed Higher-Order Logic
Daniel Ranalter, Chad E. Brown, Cezary Kaliszyk
Recently an extension to higher-order logic -- called DHOL -- was introduced, enriching the language with dependent types, and creating a powerful extensional type theory. In this…