DeepAI AI Chat

Polarized Rewriting and Tableaux in B Set Theory

06/22/2018

∙

by Olivier Hermant, et al.

∙

MINES ParisTech

∙

∙

We propose and extension of the tableau-based first-order automated theorem prover Zenon Modulo to polarized rewriting. We introduce the framework and explain the potential benefits. The first target is an industrial benchmark composed of B Set Theory problems.

page 1

page 2

page 3

page 4

∙ 10/22/2021

A strong version of Cobham's theorem

Let k,ℓ≥ 2 be two multiplicatively independent integers. Cobham's famous...

0 Philipp Hieronymi, et al. ∙

∙ 01/27/2020

Formalization of Forcing in Isabelle/ZF

We formalize the theory of forcing in the set theory framework of Isabel...

0 Emmanuel Gunther, et al. ∙

∙ 10/24/2022

The Entropy Method in Large Deviation Theory

This paper illustrates the power of the entropy method in addressing pro...

0 Lei Yu, et al. ∙

∙ 03/06/2019

GRUNGE: A Grand Unified ATP Challenge

This paper describes a large set of related theorem proving problems obt...

0 Chad E. Brown, et al. ∙

∙ 01/29/2021

An Automated Theorem Proving Framework for Information-Theoretic Results

We present a versatile automated theorem proving framework which is capa...

0 Cheuk Ting Li, et al. ∙

∙ 10/18/2012

Module Theorem for The General Theory of Stable Models

The module theorem by Janhunen et al. demonstrates how to provide a modu...

0 Joseph Babb, et al. ∙

∙ 10/18/2019

Universal Composability is Secure Compilation

Universal composability is a framework for the specification and analysi...

0 Marco Patrignani, et al. ∙