Elementary formal systems as a framework for relative recursion theory

Notre Dame Journal of Formal Logic 23 (1):39-52 (1982)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093883564

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,888

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

Cresswell M. J.. A Henkin completeness theorem for T. Notre Dame journal of formal logic, vol. 8 no. 3 , pp. 186–190.Cresswell M. J.. Alternative completeness theorems for modal systems. Notre Dame journal of formal logic, vol. 8 no. 4 , pp. 339–345.Cresswell M. J.. Some proofs of relative completeness in modal logic. Notre Dame journal of formal logic, vol. 9 no. 1 , pp. 62–66. [REVIEW]David Makinson - 1970 - Journal of Symbolic Logic 35 (4):581-582.
Diagonalization and the recursion theorem.James C. Owings - 1973 - Notre Dame Journal of Formal Logic 14 (1):95-99.
On the theory of inconsistent formal systems.Newton C. A. da Costa - 1974 - Notre Dame Journal of Formal Logic 15 (4):497-510.
Functionals defined by recursion.Luis Elpidio Sanchis - 1967 - Notre Dame Journal of Formal Logic 8 (3):161-174.
On new theorems for elementary number theory.Albert A. Mullin - 1967 - Notre Dame Journal of Formal Logic 8 (4):353-356.
Alternative axiomatizations of elementary probability theory.William K. Goosens - 1979 - Notre Dame Journal of Formal Logic 20 (1):227-239.
Corrigendum to: ``Diagonalization and the recursion theorem''.James C. Owings - 1988 - Notre Dame Journal of Formal Logic 30 (1):153-153.
Erratum: ``On the theory of inconsistent formal systems''.Newton C. A. da Costa - 1975 - Notre Dame Journal of Formal Logic 16 (4):608-608.
The elementary theory of the natural lattice is finitely axiomatizable.Patrick Cegielski - 1988 - Notre Dame Journal of Formal Logic 30 (1):138-150.
A note on Turing machine regularity and primitive recursion.Nicholas J. De Lillo - 1978 - Notre Dame Journal of Formal Logic 19 (2):289-294.

Analytics

Added to PP
2010-08-24

Downloads
29 (#773,918)

6 months
7 (#704,497)

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