There is no safe pairing function over an arbitrary structure

Mathematical Logic Quarterly 52 (4):362-366 (2006)
  Copy   BIBTEX

Abstract

In [1] the class of safe recursive functions over an arbitrary structure is defined. We prove that in this class, one cannot define a total pairing function independently of the structure

Categories

Keywords

Reprint years

DOI

10.1002/malq.200610003

Links

PhilArchive



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

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

On nested simple recursion.Ján Komara - 2011 - Archive for Mathematical Logic 50 (5-6):617-624.
A minor or a major predicament of physical theory? (Charge and action polarity and their order properties).E. J. Post - 1977 - Foundations of Physics 7 (3-4):255-277.
Safe recursion with higher types and BCK-algebra.Martin Hofmann - 2000 - Annals of Pure and Applied Logic 104 (1-3):113-166.
Non-definability of the Ackermann function with type 1 partial primitive recursion.Karl-Heinz Niggl - 1997 - Archive for Mathematical Logic 37 (1):1-13.
Recursion on the countable functionals.Dag Normann - 1980 - New York: Springer Verlag.
Unary primitive recursive functions.Daniel E. Severin - 2008 - Journal of Symbolic Logic 73 (4):1122-1138.
An application of category-theoretic semantics to the characterisation of complexity classes using higher-order function algebras.Martin Hofmann - 1997 - Bulletin of Symbolic Logic 3 (4):469-486.
Safe formulas in the general theory of stable models (preliminary report).Vladimir Lifschitz - unknown
A theory of rules for enumerated classes of functions.Andreas Schlüter - 1995 - Archive for Mathematical Logic 34 (1):47-63.
Computability, an introduction to recursive function theory.Nigel Cutland - 1980 - New York: Cambridge University Press.
Safe Formulas in the General Theory of Stable Models (Preliminary Report).Joohyung Lee & Vladimir Lifschitz - unknown
Degrees of Relative Provability.Mingzhong Cai - 2012 - Notre Dame Journal of Formal Logic 53 (4):479-489.
Recursion theory for metamathematics.Raymond Merrill Smullyan - 1993 - New York: Oxford University Press.
On Spector's bar recursion.Paulo Oliva & Thomas Powell - 2012 - Mathematical Logic Quarterly 58 (4-5):356-265.
On the physical possibility of ordinal computation (draft).Jeffrey A. Barrett & Wayne Aitken - unknown

Analytics

Added to PP
2013-12-01

Downloads
12 (#1,079,336)

6 months
2 (#1,187,206)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references