Effective operations on partial recursive functions
From MaRDI portal
Publication:3230369
DOI10.1002/malq.19550010407zbMath0068.24706OpenAlexW2161331421MaRDI QIDQ3230369
John Myhill, John C. Shepherdson
Publication date: 1955
Published in: Zeitschrift für Mathematische Logik und Grundlagen der Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19550010407
Related Items
The basic theory of partial \(\alpha\)-recursive operators, Kleene's Amazing Second Recursion Theorem, Recursion theorems and effective domains, Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals, The hereditary partial effective functionals and recursion theory in higher types, Polymorphic type inference and containment, Monotone inductive definitions in a constructive theory of functions and classes, Effective operations in a general setting, A model theoretic characterization of effective operations, Computation on abstract data types. The extensional approach, with an application to streams, An Effective Operator, Continuous but not Partial Recursive, On fixed-point theorems in synthetic computability, Some results related to the continuity problem, Unnamed Item, On the information carried by programs about the objects they compute, How much partiality is needed for a theory of computability?, Computability and the morphological complexity of some dynamics on continuous domains, Bibliography of John Myhill, Effectivity and effective continuity of multifunctions, Stochastic \(\lambda\)-calculi: an extended abstract, Towards Computability over Effectively Enumerable Topological Spaces, On the Continuity of Effective Multifunctions, On effective topological spaces, Total sets and objects in domain theory, Computability in higher types, P\(\omega\) and the completeness of type assignment, Unnamed Item, Topological variants of the continuity theorem for mappings and related theorems, Constructive operators of finite types, Feferman on Computability, Vladimir Andreevich Uspensky (27/11/1930–27/6/2018), The semantics of second-order lambda calculus, Kleene’s Amazing Second Recursion Theorem, The concept of effective method applied to computational problems of linear algebra, Some Theorems on Classes of Recursively Enumerable Sets, La théorie des fonctions récursives et ses applications. (Exposé d'information générale), Theory of representations
