An invariance notion in recursion theory-Reference-Cited by-同舟云学术

An invariance notion in recursion theory

Published:1982-03 Issue:1 Volume:47 Page:48-66
ISSN:0022-4812
Container-title:Journal of Symbolic Logic
language:en
Short-container-title:J. symb. log.

Author:

Byerly Robert E.

Abstract

AbstractA set of gödel numbers is invariant if it is closed under automorphisms of (ω, ·), where ω is the set of all gödel numbers of partial recursive functions and · is application (i.e., n · m ≃ φn(m)). The invariant arithmetic sets are investigated, and the invariant recursively enumerable sets and partial recursive functions are partially characterized.

Publisher

Cambridge University Press (CUP)

Subject

Logic,Philosophy

Reference12 articles.

1. Byerly R. , Some properties of invariant sets (to appear).

2. Algebraically generalized recursive function theory;Strong;I. B. M. Journal of Research and Development,1968

3. Byerly R. , Invariance in recursion theory on admissible ordinals (to appear).

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

1. Effectivizing Inseparability;Zeitschrift für Mathematische Logik und Grundlagen der Mathematik;1991

2. Mathematical Aspects of Recursive Function Theory;Harvey Friedman's Research on the Foundations of Mathematics;1985

3. Some properties of invariant sets;Journal of Symbolic Logic;1984-03

4. DEFINABILITY OF RECURSIVELY ENUMERABLE SETS IN ABSTRACT COMPUTATIONAL COMPLEXITY THEORY;Zeitschrift für Mathematische Logik und Grundlagen der Mathematik;1984

5. Definability of r. e. sets in a class of recursion theoretic structures;Journal of Symbolic Logic;1983-09