Teaching a Formalized Logical Calculus

02/28/2020
by   Asta Halkjær From, et al.
0

Classical first-order logic is in many ways central to work in mathematics, linguistics, computer science and artificial intelligence, so it is worthwhile to define it in full detail. We present soundness and completeness proofs of a sequent calculus for first-order logic, formalized in the interactive proof assistant Isabelle/HOL. Our formalization is based on work by Stefan Berghofer, which we have since updated to use Isabelle's declarative proof style Isar (Archive of Formal Proofs, Entry FOL-Fitting, August 2007 / July 2018). We represent variables with de Bruijn indices; this makes substitution under quantifiers less intuitive for a human reader. However, the nature of natural numbers yields an elegant solution when compared to implementations of substitution using variables represented by strings. The sequent calculus considered has the special property of an always empty antecedent and a list of formulas in the succedent. We obtain the proofs of soundness and completeness for the sequent calculus as a derived result of the inverse duality of its tableau counterpart. We strive to not only present the results of the proofs of soundness and completeness, but also to provide a deep dive into a programming-like approach to the formalization of first-order logic syntax, semantics and the sequent calculus. We use the formalization in a bachelor course on logic for computer science and discuss our experiences.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/08/2022

SeCaV: A Sequent Calculus Verifier in Isabelle/HOL

We describe SeCaV, a sequent calculus verifier for first-order logic in ...
research
11/05/2020

Lambek-Grishin Calculus: Focusing, Display and Full Polarization

Focused sequent calculi are a refinement of sequent calculi, where addit...
research
03/05/2018

The Sequent Calculus Trainer with Automated Reasoning - Helping Students to Find Proofs

The sequent calculus is a formalism for proving validity of statements f...
research
04/21/2023

From Tractatus to Later Writings and Back – New Implications from the Nachlass

As a celebration of the Tractatus 100th anniversary it might be worth re...
research
03/21/2023

Überprüfung von Integritätsbedingungen in Deduktiven Datenbanken

Advancements in computer science and AI lead to the development of large...
research
06/14/2022

Integrating deduction and model finding in a language independent setting

Software artifacts are ubiquitous in our lives being an essential part o...
research
02/19/2019

Elementary-base cirquent calculus II: Choice quantifiers

Cirquent calculus is a novel proof theory permitting component-sharing b...

Please sign up or login with your details

Forgot password? Click here to reset