论文信息 - Monotone Majorizable Functionals

Monotone Majorizable Functionals

Several properties of monotone functionals (MF) and monotone majorizable functionals (MMF) used in the earlier work by the author and van de Pol are proved. It turns out that the terms of the simply typed lambda-calculus define MF, but adding primitive recursion, and even monotonic primitive recursion changes the situation: already λZ.Z(1 — sg) is not MMF. It is proved that extensionality is not Dialectica-realizable by MMF, and a simple example of a MF which is not hereditarily majorizable is given.

Helmut Schwichtenberg

[1] Alex Simpson. Mathematical Theory of Domains , 1998 .

[2] Viggo Stoltenberg-Hansen,et al. Mathematical theory of domains , 1994, Cambridge tracts in theoretical computer science.

[3] A. Troelstra. Metamathematical investigation of intuitionistic arithmetic and analysis , 1973 .

[4] Helmut Schwichtenberg,et al. Strict Functionals for Termination Proofs , 1995, TLCA.

[5] Jaco van de Pol,et al. Termination Proofs for Higher-order Rewrite Systems , 1993, HOA.

[6] Marc Bezem. Compact and Majorizable Functionals of Finite Type , 1989, J. Symb. Log..