Counterexample to cut-elimination in cyclic proof system for first-order logic with inductive definitions

06/22/2021
by   Yukihiro Masuoka, et al.
0

A cyclic proof system is a proof system whose proof figure is a tree with cycles. The cut-elimination in a proof system is fundamental. It is conjectured that the cut-elimination in the cyclic proof system for first-order logic with inductive definitions does not hold. This paper shows that the conjecture is correct by giving a sequent not provable without the cut rule but provable in the cyclic proof system.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/11/2022

A study for recovering the cut-elimination property in cyclic proof systems by restricting the arity of inductive predicates

The framework of cyclic proof systems provides a reasonable proof system...
research
04/30/2018

MacNeille completion and Buchholz' Omega rule for parameter-free second order logics

Buchholz' Omega-rule is a way to give a syntactic, possibly ordinal-free...
research
10/17/2018

Validating Back-links of FOLID Cyclic Pre-proofs

Cyclic pre-proofs can be represented as sets of finite tree derivations ...
research
12/27/2017

Classical System of Martin-Lof's Inductive Definitions is not Equivalent to Cyclic Proofs

A cyclic proof system, called CLKID-omega, gives us another way of repre...
research
11/24/2021

CycleQ: An Efficient Basis for Cyclic Equational Reasoning

We propose a new cyclic proof system for automated, equational reasoning...
research
05/02/2023

On the convergence of reduction-based and model-based methods in proof theory

In the recent past, the reduction-based and the model-based methods to p...
research
12/13/2021

Proof of Steak

We introduce Proof-of-Steak (PoS) as a fundamental net-zero block genera...

Please sign up or login with your details

Forgot password? Click here to reset