English
Related papers

Related papers: NaDeA: A Natural Deduction Assistant with a Formal…

200 papers

We present the Natural Deduction Assistant (NaDeA) and discuss its advantages and disadvantages as a tool for teaching logic. NaDeA is available online and is based on a formalization of natural deduction in the Isabelle proof assistant. We…

Logic in Computer Science · Computer Science 2019-04-02 Jørgen Villadsen , Andreas Halkjær From , Anders Schlichtkrull

We describe our Natural Deduction Assistant (NaDeA) and the interfaces between the Isabelle proof assistant and NaDeA. In particular, we explain how NaDeA, using a generated prover that has been verified in Isabelle, provides feedback to…

Logic in Computer Science · Computer Science 2018-03-06 Jørgen Villadsen , Andreas Halkjær From , Anders Schlichtkrull

Proof assistants are important tools for teaching logic. We support this claim by discussing three formalizations in Isabelle/HOL used in a recent course on automated reasoning. The first is a formalization of System W (a system of…

Logic in Computer Science · Computer Science 2020-11-02 Asta Halkjær From , Jørgen Villadsen , Patrick Blackburn

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…

Logic in Computer Science · Computer Science 2024-04-09 Simon Tobias Lund , Jørgen Villadsen

We describe a natural deduction formalization of intuitionistic and classical propositional logic in the Isabelle/Pure framework. In contrast to earlier work, where we explored the pedagogical benefits of using a deep embedding approach to…

Logic in Computer Science · Computer Science 2022-02-09 Jørgen Villadsen , Asta Halkjær From , Patrick Blackburn

The Isabelle/PIDE platform addresses the question whether proof assistants of the LCF family are suitable as technological basis for educational tools. The traditionally strong logical foundations of systems like HOL, Coq, or Isabelle have…

Logic in Computer Science · Computer Science 2012-02-23 Makarius Wenzel , Burkhart Wolff

An interactive theorem prover, Isabelle, is under development. In LCF, each inference rule is represented by one function for forwards proof and another (a tactic) for backwards proof. In Isabelle, each inference rule is represented by a…

Logic in Computer Science · Computer Science 2008-02-03 Lawrence C. Paulson

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 logical proof systems…

Logic in Computer Science · Computer Science 2023-03-13 Frederik Krogsdal Jacobsen , Jørgen Villadsen

Software tools of Automated Reasoning are too sophisticated for general use in mathematics education and respective reasoning, while Lucas-Interpretation provides a general concept for integrating such tools into educational software with…

Programming Languages · Computer Science 2020-11-02 Walther Neuper

Interactive proof assistants are computer programs carefully constructed to check a human-designed proof of a mathematical claim with high confidence in the implementation. However, this only validates truth of a formal claim, which may…

Programming Languages · Computer Science 2022-05-17 Colin S. Gordon , Sergey Matskevich

Isabelle is a generic theorem prover with a fragment of higher-order logic as a metalogic for defining object logics. Isabelle also provides proof terms. We formalize this metalogic and the language of proof terms in Isabelle/HOL, define an…

Logic in Computer Science · Computer Science 2021-11-25 Tobias Nipkow , Simon Roßkopf

Isabelle/PIDE has emerged over more than 10 years as the standard Prover IDE for interactive theorem proving in Isabelle. The well-established Archive of Formal Proofs (AFP) testifies the success of such applications of formalized…

Logic in Computer Science · Computer Science 2019-05-07 Makarius Wenzel

The motivation for this paper comes out of our experience with teaching natural deduction (ND) and with the way this formal system is implemented by the \textsc{Coq} proof assistant, namely by means of so-called tactics, which are…

Computers and Society · Computer Science 2015-07-15 Favio E. Miranda-Perea , P. Selene Linares-Arévalo , Atocha Aliseda

Isabelle is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a meta-logic (or `logical framework') in…

Logic in Computer Science · Computer Science 2009-09-25 Lawrence C. Paulson

Interactive proof assistants are computer programs carefully constructed to check a human-designed proof of a mathematical claim with high confidence in the implementation. However, this only validates truth of a formal claim, which may…

Programming Languages · Computer Science 2023-10-09 Colin S. Gordon , Sergey Matskevich

Despite the recent progress in automatic theorem provers, proof engineers are still suffering from the lack of powerful proof automation. In this position paper we first report our proof strategy language based on a meta-tool approach.…

Artificial Intelligence · Computer Science 2017-01-12 Yutaka Nagashima

We report on our journey to develop ProofBuddy, a web application that is powered by a server-side instance of the proof assistant Isabelle, for the teaching and learning of proofs and proving. The journey started from an attempt to use…

Logic in Computer Science · Computer Science 2025-05-21 Nadine Karsten , Kim Jana Eiken , Uwe Nestmann

Isabelle/jEdit is the main application of the Prover IDE (PIDE) framework and the default user-interface of Isabelle, but it is not limited to theorem proving. This paper explores possibilities to use it as a general IDE for formal…

Human-Computer Interaction · Computer Science 2018-12-02 Makarius Wenzel

An approach for encoding abstract dialectical frameworks and their semantics into classical higher-order logic is presented. Important properties and semantic relationships are formally encoded and proven using the proof assistant…

Logic in Computer Science · Computer Science 2026-04-08 Antoine Martina , Alexander Steen

Isabelle is a generic theorem prover, designed for interactive reasoning in a variety of formal theories. At present it provides useful proof procedures for Constructive Type Theory, various first-order logics, Zermelo-Fraenkel set theory,…

Logic in Computer Science · Computer Science 2008-02-03 Lawrence C. Paulson
‹ Prev 1 2 3 10 Next ›