Representability of recursively enumerable sets in formal theories

Archive for Mathematical Logic 5 (3-4):119-127 (1961)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1007/bf01974157

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,130

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

Representability op recursively enumerable sets in formal theories.A. Ehrenfeucht & S. Feferman - 1960 - Archive for Mathematical Logic 5 (1-2):37-41.
Shepherdson J. C.. Representability of recursively enumerable sets in formal theories. Archiv für mathematische Logik und Grundlagenforschung. vol. 5 nos. 3-4 . pp. 119–127. [REVIEW]Robert A. DiPaola - 1969 - Journal of Symbolic Logic 34 (1):117-117.
Recursively enumerable classes and their application to recursive sequences of formal theories.Marian Boykan Pour-El & Hilary Putnam - 1965 - Archive for Mathematical Logic 8 (3-4):104-121.
Embedding relations in the lattice of recursively enumerable sets.Donald A. Alton - 1975 - Archive for Mathematical Logic 17 (1-2):37-41.
J. C. E. Dekker. Two notes on recursively enumerable sets. Proceedings of the American Mathematical Society, vol. 4 , pp. 495–501. [REVIEW]Martin Davis - 1955 - Journal of Symbolic Logic 20 (1):73-74.
Dekker J. C. E. and Myhill J.. Some theorems on classes of recursively enumerable sets. Transactions of the American Mathematical Society, vol. 89 , pp. 25–59. [REVIEW]Martin Davis - 1962 - Journal of Symbolic Logic 27 (1):84-84.
On elementary theories of some lattices or α-recursively enumerable sets.Mannel Lerman - 1978 - Annals of Mathematical Logic 14 (3):227-272.
Minimal weak truth table degrees and computably enumerable Turing degrees.R. G. Downey - 2020 - Providence, RI: American Mathematical Society. Edited by Keng Meng Ng & Reed Solomon.
Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets.Manuel Lerman - 1991 - Mathematical Logic Quarterly 37 (19‐22):331-342.

Analytics

Added to PP
2020-12-03

Downloads
11 (#1,415,254)

6 months
5 (#1,035,390)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Effectively extensible theories.Marian Boykan Pour-El - 1968 - Journal of Symbolic Logic 33 (1):56-68.
The early history of formal diagonalization.C. Smoryński - 2023 - Logic Journal of the IGPL 31 (6):1203-1224.
Rosser and mostowski sentences.Franco Montagna & Giovanni Sommaruga - 1988 - Archive for Mathematical Logic 27 (2):115-133.
Non‐Effectiveness in S. Orey's Arithmetical Compactness Theorem.R. G. Jeroslow - 1971 - Mathematical Logic Quarterly 17 (1):285-289.

View all 10 citations / Add more citations

References found in this work

No references found.

Add more references