paper-with-me

Papers

Teaching Higher-Order Logic Using Isabelle

2024-04-08 · Simon Tobias Lund, Jørgen Villadsen

We present a formalization of higher-order logic in the Isabelle proof assistant, building directly on the foundational framework Isabelle/Pure and developed to be as small and readable as possible. It should therefore serve as a good introduction for someone looking into learning about higher-order logic and proof assistants, without having to study the much more complex Isabelle/HOL with heavier automation. To showcase our development and approach we explain a sample proof, describe the axioms and rules of our higher-order logic, and discuss our experience with teaching the subject in a classroom setting.

📄 PDF Abstract BibTeX arXiv:2404.05458

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Minimal Sequent Calculus for Teaching First-Order Logic: Lessons Learned

2025-05-09 · Jørgen Villadsen

MiniCalc is a web app for teaching first-order logic based on a minimal sequent calculus. As an option the proofs can be verified in the Isabelle proof assistant. We present the lessons learned using the tool in recent y…

Systematic Verification of the Modal Logic Cube in Isabelle/HOL

2015-07-31 · Christoph Benzmüller, Maximilian Claus, Nik Sultana

We present an automated verification of the well-known modal logic cube in Isabelle/HOL, in which we prove the inclusion relations between the cube's logics using automated reasoning tools. Prior work addresses this prob…

On Exams with the Isabelle Proof Assistant

2023-03-10 · Frederik Krogsdal Jacobsen, Jørgen Villadsen

We present an approach for testing student learning outcomes in a course on automated reasoning using the Isabelle proof assistant. The approach allows us to test both general understanding of formal proofs in various lo…

Superposition for Lambda-Free Higher-Order Logic

2020-05-05 · Alexander Bentkamp, Jasmin Blanchette, Simon Cruanes, Uwe Waldmann

We introduce refutationally complete superposition calculi for intentional and extensional clausal $\lambda$-free higher-order logic, two formalisms that allow partial application and applied variables. The calculi are p…

Superposition with Lambdas

2021-01-31 · Alexander Bentkamp, Jasmin Blanchette, Sophie Tourret, Petar Vukmirović 외

We designed a superposition calculus for a clausal fragment of extensional polymorphic higher-order logic that includes anonymous functions but excludes Booleans. The inference rules work on $\beta\eta$-equivalence class…