Journal
JOURNAL OF LOGIC AND COMPUTATION
Volume -, Issue -, Pages -Publisher
OXFORD UNIV PRESS
DOI: 10.1093/logcom/exad068
Keywords
Cyclic proof; cut-elimination; inductive definition
Categories
Ask authors/readers for more resources
This paper investigates the cut-elimination in cyclic proof systems, focusing on the case of first-order logic with inductive definitions. By providing a specific example, it demonstrates that the use of cut rule is not possible in the cyclic proof system.
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available