Bezem, M., see Barendsen, E

, , , , , , , , &
Annals of Pure and Applied Logic 79 (1):317 (1996)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(95)00039-9

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,672

External links

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

Through your library

My notes

Similar books and articles

Polymorphic extensions of simple type structures. With an application to a bar recursive minimization.Erik Barendsen & Marc Bezem - 1996 - Annals of Pure and Applied Logic 79 (3):221-280.
Compact and majorizable functionals of finite type.Marc Bezem - 1989 - Journal of Symbolic Logic 54 (1):271-280.
Expressive power of digraph solvability.Marc Bezem, Clemens Grabmayer & Michał Walicki - 2012 - Annals of Pure and Applied Logic 163 (3):200-213.
Computing with dynamic first order logic.Jan van Eijck - unknown
Kamareddine Fairouz, Laan Twan, and Nederpelt Rob. A modern perspective on type theory—From its origins until today. Applied Logic Series, vol. 29. Kluwer Academic Publishers, Dordrecht, 2004, xiv+ 357 pp. [REVIEW]Marc Bezem - 2006 - Bulletin of Symbolic Logic 12 (2):296-297.
Isomorphisms between HEO and HROE, ECF and ICFE.Marc Bezem - 1985 - Journal of Symbolic Logic 50 (2):359 - 371.
Strongly majorizable functionals of finite type: A model for barrecursion containing discontinuous functionals.Marc Bezem - 1985 - Journal of Symbolic Logic 50 (3):652-660.
Isomorphisms Between HEO and $mathrm{HRO}^mathrm{E}$, ECF and $mathrm{ICF}^mathrm{E}$.Marc Bezem - 1985 - Journal of Symbolic Logic 50 (2):359-371.
Some Results on Numeral Systems in $\lambda$ -Calculus.Benedetto Intrigila - 1994 - Notre Dame Journal of Formal Logic 35 (4):523-541.
Equivalence of bar recursors in the theory of functionals of finite type.Marc Bezem - 1988 - Archive for Mathematical Logic 27 (2):149-160.
On the computational content of the axiom of choice.Stefano Berardi, Marc Bezem & Thierry Coquand - 1998 - Journal of Symbolic Logic 63 (2):600-622.
An extended Lachlan splitting theorem.Steffen Lempp & Sui Yuefei - 1996 - Annals of Pure and Applied Logic 79 (1):53-59.
Pointwise hereditary majorization and some applications.Ulrich Kohlenbach - 1992 - Archive for Mathematical Logic 31 (4):227-241.
Saharon Shelah, cardinal arithmetic.Mirna DŽamonja - 1998 - Studia Logica 60 (3):443-448.
On ◁∗-maximality.Mirna Džamonja & Saharon Shelah - 2004 - Annals of Pure and Applied Logic 125 (1-3):119-158.

Analytics

Added to PP
2014-03-25

Downloads
15 (#942,606)

6 months
5 (#626,659)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Was Tarski's Theory of Truth Motivated by Physicalism?Greg Frost-Arnold - 2004 - History and Philosophy of Logic 25 (4):265-280.
On power set in explicit mathematics.Thomas Glass - 1996 - Journal of Symbolic Logic 61 (2):468-489.
The cupping theorem in r/m.Sui Yuefei & Zhang Zaiyue - 1999 - Journal of Symbolic Logic 64 (2):643-650.

Add more citations

References found in this work

A minimal pair of recursively enumerable degrees.C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (2):159-168.
Wtt-degrees and t-degrees of R.e. Sets.Michael Stob - 1983 - Journal of Symbolic Logic 48 (4):921-930.
Highness and bounding minimal pairs.Rodney G. Downey, Steffen Lempp & Richard A. Shore - 1993 - Mathematical Logic Quarterly 39 (1):475-491.
The weak truth table degrees of recursively enumerable sets.R. E. Ladner - 1975 - Annals of Mathematical Logic 8 (4):429.

Add more references