A proof-theoretic study of abstract termination principles-Reference-Cited by-同舟云学术

A proof-theoretic study of abstract termination principles

Published:2019-12 Issue:8 Volume:29 Page:1345-1366
ISSN:0955-792X
Container-title:Journal of Logic and Computation
language:en
Short-container-title:

Author:

Powell Thomas¹

Affiliation:

1. Fachbereich Mathematik, Technische Universität Darmstadt, Schlossgartenstraße 7, 64289 Darmstadt, Germany

Abstract

Abstract We carry out a proof-theoretic analysis of the wellfoundedness of recursive path orders in an abstract setting. We outline a general termination principle and extract from its wellfoundedness proof subrecursive bounds on the size of derivation trees that can be defined in Gödel’s system T plus bar recursion. We then carry out a complexity analysis of these terms and demonstrate how this can be applied to bound the derivational height of term rewrite systems.

Funder

Austrian Science Fund

Publisher

Oxford University Press (OUP)

Subject

Logic,Hardware and Architecture,Arts and Humanities (miscellaneous),Software,Theoretical Computer Science

Link

http://academic.oup.com/logcom/article-pdf/29/8/1345/32008423/exz026.pdf

Reference31 articles.

1. Polynomial path orders;Avanzini;Logical Methods in Computer Science,2013

2. Gödel’s functional (“Dialectica”) interpretation;Avigad,1998

3. An analysis of the Podelski–Rybalchenko termination theorem via bar recursion;Berardi;Journal of Logic and Computation,2019

4. An intuitionistic version of Ramsey’s theorem and its use in program termination;Berardi;Annals of Pure and Applied Logic,2015

5. Quasi-interpretations: a way to control resources;Bonfante;Theoretical Computer Science,2011

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Dependent choice as a termination principle;Archive for Mathematical Logic;2020-01-16