Stefano Berardi, Makoto Tatsuta. Equivalence of inductive definitions and cyclic proofs under arithmetic. In 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017. pages 1-12, IEEE Computer Society, 2017. [doi]
@inproceedings{BerardiT17-0,
title = {Equivalence of inductive definitions and cyclic proofs under arithmetic},
author = {Stefano Berardi and Makoto Tatsuta},
year = {2017},
doi = {10.1109/LICS.2017.8005114},
url = {http://doi.ieeecomputersociety.org/10.1109/LICS.2017.8005114},
researchr = {https://researchr.org/publication/BerardiT17-0},
cites = {0},
citedby = {0},
pages = {1-12},
booktitle = {32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017},
publisher = {IEEE Computer Society},
isbn = {978-1-5090-3018-7},
}