9 papers
Reformalization of the Jordan Curve Theorem
Simon Guilloud, Sankalp Gambhir, Samuel Chassot
We present a case study in reformalization, a variant of autoformalization in which the input proof is not natural language but a formal development in a different proof assistant.…
LeanFlow: A Case Study in Workflow-Driven Lean Autoformalization
Lazar Milikic, Simon Guilloud, Khanh Nguyen +1
We present and evaluate LeanFlow, an LLM agent system specialized for translating mathematical papers into buildable Lean projects. Recent verifier-in-the-loop systems show that la…
Orthologic for SAT Solving
Vladislas de Haldat, Simon Guilloud, Viktor KunÄak
We present a new algorithm for deciding formula entailment in orthologic (a sound approximation of classical logic) that avoids the costly preprocessing phase of prior implementati…
Are Dependent Types in Set Theory Feasible?
Yunsong Yang, Simon Guilloud, Viktor KunÄak
Following the types-as-sets paradigm, we present a mechanized embedding of dependent function types with a hierarchy of universes into schematic first-order logic with equality, wi…
SC-TPTP: An Extension of the TPTP Derivation Format for Sequent-Based Calculus
Julie Cailler, Simon Guilloud
Motivated by the transfer of proofs between proof systems, and in particular from first order automated theorem provers (ATPs) to interactive theorem provers (ITPs), we specify an…
LISA -- A Modern Proof System
Simon Guilloud, Sankalp Gambhir, Viktor KunÄak
We present LISA, a proof system and proof assistant for constructing proofs in schematic first-order logic and axiomatic set theory. The logical kernel of the system is a proof che…