Representability op recursively enumerable sets in formal theories-Reference-Cited by-同舟云学术

Representability op recursively enumerable sets in formal theories

Published:1960-03 Issue:1-2 Volume:5 Page:37-41
ISSN:0933-5846
Container-title:Archiv für Mathematische Logik und Grundlagenforschung
language:en
Short-container-title:Arch math Logik

Author:

Ehrenfeucht A.,Feferman S.

Publisher

Springer Science and Business Media LLC

Subject

Logic,Philosophy

Link

http://link.springer.com/content/pdf/10.1007/BF01977641.pdf

Reference7 articles.

1. Craig, W.,On axiomatizability within a system,Journal of Symbolic Logic, vol. 18 (1953), pp. 30–32.

2. Feferman, S.,Degrees of unsolvability associated with classes of formalized theories,Journal of Symbolic Logic, vol. 22 (1957), pp. 161–175.

3. Kleene, S. C.,Introduction to metamathematics, Amsterdam, Groningen, New York and Toronto, 1952, X + 550 pp.

4. Myhill, J.,Creative sets,Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 1 (1955), pp. 97–108.

5. Rogers, Hartley, Jr.,Theory of recursive functions and effective computability, vol. I (mimeographed), Department of Mathematics, Massachusetts Institute of Technology, 1956, xiii + 155 pp.

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Numeral completeness of weak theories of arithmetic;Journal of Logic and Computation;2023-12-12

2. Effective inseparability and some applications in meta-mathematics;Journal of Logic and Computation;2023-06-19

3. Some Observations on the FGH Theorem;Studia Logica;2023-04-26

4. The Early History of Formal Diagonalization;Logic Journal of the IGPL;2022-07-15

5. HIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC;The Review of Symbolic Logic;2021-07-02