Degrees of partial functions

Notre Dame Journal of Formal Logic 19 (1):152-154 (1978)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093888219

Links

PhilArchive



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

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

Kleene index sets and functional m-degrees.Jeanleah Mohrherr - 1983 - Journal of Symbolic Logic 48 (3):829-840.
On the t-degrees of partial functions.Paolo Casalegno - 1985 - Journal of Symbolic Logic 50 (3):580-588.
Reasoning about partial functions with the aid of a computer.William M. Farmer - 1995 - Erkenntnis 43 (3):279 - 294.
Degrees of continuous functionals.Peter G. Hinman - 1973 - Journal of Symbolic Logic 38 (3):393-395.
A tableau calculus for partial functions.Manfred Kerber Michael Kohlhase - unknown
A set theory with support for partial functions.William M. Farmer & Joshua D. Guttman - 2000 - Studia Logica 66 (1):59-78.
A Mechanization of Strong Kleene Logic for Partial Functions.Manfred Kerber Michael Kohlhase - unknown
Degrees of Unsolvability of Continuous Functions.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (2):555 - 584.
Partial monotonic protothetics.François Lepage - 2000 - Studia Logica 66 (1):147-163.
Partial degrees and the density problem. Part 2: The enumeration degrees of the ∑2 sets are dense.S. B. Cooper - 1984 - Journal of Symbolic Logic 49 (2):503 - 513.
Partial Combinatory Algebras of Functions.Jaap van Oosten - 2011 - Notre Dame Journal of Formal Logic 52 (4):431-448.
A partial functions version of church's simple theory of types.William M. Farmer - 1990 - Journal of Symbolic Logic 55 (3):1269-1291.
Time polynomial in input or output.Yuri Gurevich & Saharon Shelah - 1989 - Journal of Symbolic Logic 54 (3):1083-1088.
The addition of bounded quantification and partial functions to a computational logic and its theorem prover.Robert Boyer - manuscript
Combinatorics for the dominating and unsplitting numbers.Jason Aubrey - 2004 - Journal of Symbolic Logic 69 (2):482-498.

Analytics

Added to PP
2010-08-24

Downloads
19 (#753,814)

6 months
6 (#431,022)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jan A. Bergstra
University of Amsterdam

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references