首页    期刊浏览 2024年11月30日 星期六
登录注册

文章基本信息

  • 标题:FOUNDATIONS OF REGULAR COINDUCTION
  • 本地全文:下载
  • 作者:Francesco Dagnino
  • 期刊名称:Logical Methods in Computer Science
  • 印刷版ISSN:1860-5974
  • 电子版ISSN:1860-5974
  • 出版年度:2021
  • 卷号:17
  • 期号:4
  • 页码:1-29
  • DOI:10.46298/lmcs-17(4:2)2021
  • 语种:English
  • 出版社:Technical University of Braunschweig
  • 摘要:Inference systems are a widespread framework used to define possibly recursive predicates by means of inference rules. They allow both inductive and coinductive interpretations that are fairly well-studied. In this paper, we consider a middle way interpretation, called regular, which combines advantages of both approaches: it allows non-well-founded reasoning while being finite. We show that the natural proof-theoretic definition of the regular interpretation, based on regular trees, coincides with a rational fixed point. Then, we provide an equivalent inductive characterization, which leads to an algorithm which looks for a regular derivation of a judgment. Relying on these results, we define proof techniques for regular reasoning: the regular coinduction principle, to prove completeness, and an inductive technique to prove soundness, based on the inductive characterization of the regular interpretation. Finally, we show the regular approach can be smoothly extended to inference systems with corules, a recently introduced, generalised framework, which allows one to refine the coinductive interpretation, proving that also this flexible regular interpretation admits an equivalent inductive characterisation.
  • 关键词:coinduction;inference systems;regular trees;fixed points
国家哲学社会科学文献中心版权所有