English

Coinductive Uniform Proofs

Logic in Computer Science 2019-03-19 v1

Abstract

Coinduction occurs in two guises in Horn clause logic: in proofs of circular properties and relations, and in proofs involving construction of infinite data. Both instances of coinductive reasoning appeared in the literature before, but a systematic analysis of these two kinds of proofs and of their relation was lacking. We propose a general proof-theoretic framework for handling both kinds of coinduction arising in Horn clause logic. To this aim, we propose a coinductive extension of Miller et al framework of uniform proofs and prove its soundness relative to coinductive models of Horn clause logic.

Keywords

Cite

@article{arxiv.1903.07371,
  title  = {Coinductive Uniform Proofs},
  author = {Ekaterina Komendantskaya and Yue Li},
  journal= {arXiv preprint arXiv:1903.07371},
  year   = {2019}
}
R2 v1 2026-06-23T08:11:17.744Z