Monotone majorizable functionals

Studia Logica 62 (2):283-289 (1999)
  Copy   BIBTEX

Abstract

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.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,130

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Compact and majorizable functionals of finite type.Marc Bezem - 1989 - Journal of Symbolic Logic 54 (1):271-280.
The Computational Power of ℳ.Dag Normann & Christian Rørdam - 2002 - Mathematical Logic Quarterly 48 (1):117-124.
A decidable theory of type assignment.William R. Stirton - 2013 - Archive for Mathematical Logic 52 (5-6):631-658.
Functional interpretation of Aczel's constructive set theory.Wolfgang Burr - 2000 - Annals of Pure and Applied Logic 104 (1-3):31-73.
Positive Monotone Modal Logic.Jim de Groot - 2021 - Studia Logica 109 (4):829-857.
Term rewriting theory for the primitive recursive functions.E. A. Cichon & Andreas Weiermann - 1997 - Annals of Pure and Applied Logic 83 (3):199-223.

Analytics

Added to PP
2009-01-28

Downloads
88 (#237,648)

6 months
5 (#1,035,390)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations