General recursive functions of natural numbers
From MaRDI portal
Publication:2645094
DOI10.1007/BF01565439zbMath0014.19402WikidataQ56037875 ScholiaQ56037875MaRDI QIDQ2645094
Publication date: 1936
Published in: Mathematische Annalen (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/159849
Related Items
Step by Recursive Step: Church's Analysis of Effective Calculability, Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic, The Mathematical Work of S.C.Kleene, Computability and Recursion, Extensions of some theorems of Gödel and Church, Gödel Theorems for Non-Constructive Logics, On derivability, On the reduction of the decision problem. First paper. Ackermann prefix, a single binary predicate, On notation for ordinal numbers, Bemerkungen zum Begriff der inhaltlichen Widerspruchsfreiheit, An informal exposition of proofs of Gödel's theorems and Church's theorem, Constructible falsity, Nicht konstruktiv beweisbare Sätze der Analysis, Zusammenhang der mehrfachen und transfiniten Rekursionen, A note on nominalism and recursive functions, Contributions to the reduction theory of the decision problem, Arithmetical problems and recursively enumerable predicates, Representations of calculi, On the interpretation of intuitionistic number theory, Recursive Functions and Intuitionistic Number Theory, Classes of Recursively Enumerable Sets and Their Decision Problems, Recursive Functions and Intuitionistic Number Theory, Recursive Predicates and Quantifiers, A closed-form evaluation for Datalog queries with integer (gap)-order constraints, Closure functions and general iterates as reflectors, Informal versus formal mathematics, Introduction to the concept of recursiveness of fuzzy functions, A universal machine without change of state, Unsolvable algorithmic problems for semigroups, groups and rings, Pre-recursive categories, General iteration and unary functions, Conditional rewriting logic as a unified model of concurrency, On the metamathematics of the P vs. NP question, How much can analog and hybrid systems be proved (super-)Turing, Hierarchies of number-theoretic predicates, Remarks on the development of computability, Proof of a Conjecture of Routledge, Schemata: The Concept of Schema in the History of Logic, On automorphisms of arbitrary mathematical systems, The theory of recursive functions, approaching its centennial, The work of Kurt Gödel, Recursively enumerable sets and degrees
Cites Work
