Algorithmic procedures-Reference-Cited by-同舟云学术

Algorithmic procedures

Published:1992 Issue:1 Volume:332 Page:297-312
ISSN:0002-9947
Container-title:Transactions of the American Mathematical Society
language:en
Short-container-title:Trans. Amer. Math. Soc.

Author:

Friedman Harvey,Mansfield Richard

Abstract

We consider the state of elementary recursion theory when the familiar 0 , 1 , + , × , = , > 0, 1, +, \times , =, > of ordinary arithmetic are replaced by constants, functions, and relations from an arbitrary model.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/tran/1992-332-01/S0002-9947-1992-1055807-7/S0002-9947-1992-1055807-7.pdf

Reference10 articles.

1. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines;Blum, Lenore;Bull. Amer. Math. Soc. (N.S.),1989

2. Studies in Logic and the Foundations of Mathematics;Chang, C. C.,1990

3. Algorithmic procedures, generalized Turing algorithms, and elementary recursion theory;Friedman, Harvey,1971

4. The pebble game and logics of programs;Kfoury, A. J.,1985

5. Addison-Wesley Series in Computer Science and Information Processing;Knuth, Donald E.,1981

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

1. Recursion versus tail recursion over F¯p;Journal of Logical and Algebraic Methods in Programming;2018-01

2. Feferman on Computability;Outstanding Contributions to Logic;2017

3. 23rd Workshop on Logic, Language, Information and Computation (WoLLIC 2016);Logic Journal of IGPL;2016-12-26

4. Computation over algebraic structures and a classification of undecidable problems;Mathematical Structures in Computer Science;2016-06-20

5. A Difference in Complexity Between Recursion and Tail Recursion;Theory of Computing Systems;2016-03-19