Towards a Verified Prover for a Ground Fragment of Set Theory

09/28/2022
by   Lukas Stevens, et al.
0

Using Isabelle/HOL, we verify the state-of-the-art decision procedure for multi-level syllogistic with singleton (MLSS for short), which is a ground fragment of set theory. We formalise the syntax and semantics of MLSS as well as a sound and complete tableau calculus for it. We also provide an abstract specification of a decision procedure that applies the rules of the calculus exhaustively and prove its termination.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/02/2014

A Superposition Calculus for Abductive Reasoning

We present a modification of the superposition calculus that is meant to...
research
04/27/2021

A Verified Decision Procedure for Orders in Isabelle/HOL

We present the first verified implementation of a decision procedure for...
research
07/24/2021

Case Studies in Formal Reasoning About Lambda-Calculus: Semantics, Church-Rosser, Standardization and HOAS

We have previously published the Isabelle/HOL formalization of a general...
research
03/10/2020

SCL with Theory Constraints

We lift the SCL calculus for first-order logic without equality to the S...
research
03/27/2013

Selecting Uncertainty Calculi and Granularity: An Experiment in Trading-Off Precision and Complexity

The management of uncertainty in expert systems has usually been left to...
research
12/31/2018

A modal aleatoric calculus for probabilistic reasoning: extended version

We consider multi-agent systems where agents actions and beliefs are det...
research
07/16/2020

Probabilistic Programming Semantics for Name Generation

We make a formal analogy between random sampling and fresh name generati...

Please sign up or login with your details

Forgot password? Click here to reset