Recursion theoretic structure for relational systems

Studies in Logic and the Foundations of Mathematics

Volumn 61, Issue C, 1971, Pages 3-17

  Lacombe, Daniel ^a  

^a Institut Protestant de Théologie   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79959389713     PISSN: 0049237X     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0049-237X(08)71223-0     Document Type: Article

References (7)

1. Craig, W., Vaught, R.L., Finite axiomatizability using additional predicates. J. Symbolic Logic 23 (1958), 289–308.
2. Fraissé, R., Une notion de récursivité relative, 1961, Pergamon Press 323-328, Infinitistic methods, Proceedings of the symposium on foundations of mathematics, Warsaw, 1959.
3. Kleene, S.C., Finite axiomatizability of theories in the predicate calculus using additional predicate symbols. Two papers on the predicate calculus. Mem. Am. Math. Soc. 10 (1952), 27–68.
4. Kreisel, G., Model theoretic invariants: applications to recursive and hyper-arithmetic operations, 1965, North-Holland Publ. Co. 190-205, The theory of models, Proceedings of the 1963 international symposium at Berkeley.
5. Rogers, H. Jr., Gödel numberings of partial recursive functions. J. Symbolic Logic 23 (1958), 331–341.
6. Spector, C., Recursive well-orderings. J. Symbolic Logic 20 (1955), 151–163.
7. Spector, C., On degrees of recursive unsolvability. Ann. Math. 64 (1956), 581–592.