# Formalization of Logic in the Isabelle Proof Assistant

@inproceedings{Schlichtkrull2018FormalizationOL, title={Formalization of Logic in the Isabelle Proof Assistant}, author={Anders Schlichtkrull}, year={2018} }

Isabelle is a proof assistant, i.e. a computer program that helps its user to define concepts in mathematics and computer science as well as to prove properties about them. This process is called formalization. Proof assistants aid their users by ensuring that proofs are constructed correctly and by conducting parts of the proofs automatically. A logical calculus is a set of rules and axioms that can be applied to construct theorems of the calculus. Logical calculi are employed in e.g. tools…

## Figures and Tables from this paper

## 4 Citations

New Formalized Results on the Meta-Theory of a Paraconsistent Logic

- Philosophy, Computer ScienceTYPES
- 2018

This paper presents the meta-theory of a paraconsistent infinite-valued Logic, in particular new results showing that while the question of validity for a given formula can be reduced to a consideration of only finitely many truth values, this does not mean that the logic collapses to a finite-valued logic.

A verified prover based on ordered resolution

- Computer Science, MathematicsCPP
- 2019

This work specifies, using Isabelle/HOL, a purely functional first-order ordered resolution prover and establishes its soundness and refutational completeness, and applies stepwise refinement to obtain, from an abstract nondeterministic specification, a verified deterministic program.

A formalization of forcing and the unprovability of the continuum hypothesis

- Computer Science, MathematicsITP
- 2019

We describe a formalization of forcing using Boolean-valued models in the Lean 3 theorem prover, including the fundamental theorem of forcing and a deep embedding of first-order logic with a…

A formal proof of the independence of the continuum hypothesis

- MathematicsCPP
- 2020

We describe a formal proof of the independence of the continuum hypothesis (CH) in the Lean theorem prover. We use Boolean-valued models to give forcing arguments for both directions, using Cohen…

## References

SHOWING 1-10 OF 205 REFERENCES

Concrete Semantics: With Isabelle/HOL

- Computer Science
- 2014

The book teaches the reader the art of precise logical reasoning and the practical use of a proof assistant as a surgical tool for formal proofs about computer science artefacts.

Formalization of the Resolution Calculus for First-Order Logic

- Computer ScienceITP
- 2016

A formalization in Isabelle/HOL of the resolution calculus for first-order logic with formal soundness and completeness proofs and a thorough overview of formalizations of first- order logic found in the literature is given.

First-Order Logic and Automated Theorem Proving

- Computer ScienceGraduate Texts in Computer Science
- 1996

This monograph on classical logic presents fundamental concepts and results in a rigorous mathematical style and is intended for those interested in computer science and mathematics at the beginning graduate level.

Programming and verifying a declarative first-order prover in Isabelle/HOL

- Computer ScienceAI Commun.
- 2018

This work certifies in the proof assistant Isabelle/HOL the soundness of a declarative first-order prover with equality and shows examples of proofs and how they are made in the prover.

The Resolution Calculus for First-Order Logic

- Computer ScienceArch. Formal Proofs
- 2016

This theory is a formalization of the resolution calculus for firstorder logic which employs Herbrand’s theorem in a formulation which states that an unsatisfiable set of clauses has a finite closed semantic tree and is proven sound and complete.

Constructive Completeness Proofs and Delimited Control

- Philosophy
- 2010

Motivated by facilitating reasoning with logical meta-theory inside the Coq proof assistant, we investigate the constructive versions of some completeness theorems. We start by analysing the proofs…

Automatic Generation of Proof Tactics for Finite-Valued Logics

- Computer ScienceRULE
- 2009

The present contribution discusses the implementation of an algorithm that generates sound and complete tableau systems for a very inclusive class of sufficedly expressive finite-valued propositional logics, and illustrates some of the challenges related to the algorithmic formation of automated theorem proving tactics for such logics.

Isar - A Generic Interpretative Approach to Readable Formal Proof Documents

- Computer ScienceTPHOLs
- 1999

Isar's main aspect is its formal language for natural deduction proofs, which sets out to bridge the semantic gap between internal notions of proof given by state-of-the-art interactive theorem proving systems and an appropriate level of abstraction for user-level work.

A Verified Simple Prover for First-Order Logic

- Computer SciencePAAR@FLoC
- 2018

We present a simple prover for first-order logic with certified soundness and completeness in Isabelle/HOL, taking formalizations by Tom Ridge and others as the starting point, but with the aim of…

Certification of Termination Proofs Using CeTA

- Computer ScienceTPHOLs
- 2009

This paper uses the theorem prover Isabelle/HOL to automatically certify termination proofs and formalized the required theory of term rewriting including three major termination criteria: dependency pairs, dependency graphs, and reduction pairs.