The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions
Journal of Logic and Computation · 08.03.2025 · 35 (2)
DOI: 10.1093/logcom/exad068 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Logic and Computation, online erschienen am 07.12.2023. Verfasst von Yukihiro Oda und 2 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 59 Literaturangaben.
Abstract (Originalsprache)
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.
Zitieren
APA
Oda, Y., Brotherston, J., & Tatsuta, M. (2025). The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions. Journal of Logic and Computation, 35(2). https://doi.org/10.1093/logcom/exad068
Vancouver
Oda Y, Brotherston J, Tatsuta M. The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions. Journal of Logic and Computation. 2025;35(2). doi:10.1093/logcom/exad068
BibTeX
@article{Oda2025,
author = {Oda, Yukihiro and Brotherston, James and Tatsuta, Makoto},
title = {The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions},
journal = {Journal of Logic and Computation},
year = {2025},
volume = {35},
number = {2},
doi = {10.1093/logcom/exad068}
}
EUVIMED