Complementation: a bridge between finite and infinite proofs

04/11/2023
by   Gilles Dowek, et al.
0

When a proposition has no proof in an inference system, it is sometimes useful to build a counter-proof explaining, step by step, the reason of this non-provability. In general, this counter-proof is a (possibly) infinite co-inductive proof in a different inference system. In this paper, we show that, for some decidable inference systems, this (possibly) infinite proof has a representation as a finite proof in yet another system, equivalent to the previous one.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/24/2023

Tight infinite matrices

We give a simple proof of a recent result of Gollin and Joó: if a possib...
research
05/29/2023

The characterization of infinite Eulerian graphs, a short and computable proof

In this paper we present a short proof of a theorem by Erdős, Grünwald a...
research
11/30/2021

Undecidability in Finite Transducers, Defense Systems and Finite Substitutions

In this manuscript we present a detailed proof for undecidability of the...
research
01/08/2021

Irrationality and Transcendence Criteria for Infinite Series in Isabelle/HOL

We give an overview of our formalizations in the proof assistant Isabell...
research
05/05/2022

Automating Reasoning with Standpoint Logic via Nested Sequents

Standpoint logic is a recently proposed formalism in the context of know...
research
03/01/2018

Memoryless Determinacy of Infinite Parity Games: Another Simple Proof

The memoryless determinacy of infinite parity games was proven independe...
research
12/04/2017

Generalizing inference systems by coaxioms

After surveying classical results, we introduce a generalized notion of ...

Please sign up or login with your details

Forgot password? Click here to reset