Studia Logica 62 (2):283-289 (1999)
|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.|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
Douglas Cenzer (1984). Monotone Reducibility and the Family of Infinite Sets. Journal of Symbolic Logic 49 (3):774-782.
William C. Calhoun (2006). Degrees of Monotone Complexity. Journal of Symbolic Logic 71 (4):1327 - 1341.
Dag Normann (2000). Computability Over the Partial Continuous Functionals. Journal of Symbolic Logic 65 (3):1133-1142.
Simon Thompson (1985). Axiomatic Recursion Theory and the Continuous Functionals. Journal of Symbolic Logic 50 (2):442-450.
G. Longo & E. Moggi (1984). The Hereditary Partial Effective Functionals and Recursion Theory in Higher Types. Journal of Symbolic Logic 49 (4):1319-1332.
Ralph Matthes (2002). Tarski's Fixed-Point Theorem and Lambda Calculi with Monotone Inductive Types. Synthese 133 (1-2):107 - 129.
Dag Normann (1980). Recursion on the Countable Functionals. Springer-Verlag.
Marc Bezem (1989). Compact and Majorizable Functionals of Finite Type. Journal of Symbolic Logic 54 (1):271-280.
Marc Bezem (1985). Strongly Majorizable Functionals of Finite Type: A Model for Barrecursion Containing Discontinuous Functionals. Journal of Symbolic Logic 50 (3):652-660.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #274,652 of 549,041 )
Recent downloads (6 months)0
How can I increase my downloads?