[Agda] termination proofs

Altenkirch Thorsten psztxa at exmail.nottingham.ac.uk
Mon Sep 24 21:55:15 CEST 2012

Nice idea. However, I think that termination of Goodstein sequences is
provable in Agda.

We are far beyond Arithmetic. I am sure Anton can give a better answer but
I'd suspect that inductive-recursive definitions give you Pi_1^2-CA. Are
there natural functions which are not provable total in such a theory?


On 24/09/2012 20:42, "Jacques Carette" <carette at mcmaster.ca> wrote:

>On 12-09-24 03:30 PM, Altenkirch Thorsten wrote:
>> Re: Does there exist an algorithmic map in  Nat -> Nat  for which there
>> is not any Agda program with a termination proof accepted by Agda ?
>> [...]
>> Another question: Is there such a program which we can actually write
>Wouldn't a program based on Goodstein sequences [1] be quite easy to
>write, but with quite a difficult termination proof, at least as far as
>Agda is concerned?
>If that's not fast enough, then one can go up the hierarchy [2] (without
>the need to go all Goedelian) of fast growing functions to Friedman's
>TREE function [3] for something quite frightening (although still
>'predicative' in a certain sense).
>[1] http://en.wikipedia.org/wiki/Goodstein%27s_theorem
>[2] http://en.wikipedia.org/wiki/Fast-growing_hierarchy

This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it.   Please do not use, copy or disclose the information contained in this message or in any attachment.  Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham.

This message has been checked for viruses but the contents of an attachment
may still contain software viruses which could damage your computer system:
you are advised to perform your own checks. Email communications with the
University of Nottingham may be monitored as permitted by UK legislation.

More information about the Agda mailing list