scientific article; zbMATH DE number 3285221

From MaRDI portal
Publication:5567860

zbMath0178.32201MaRDI QIDQ5567860

J. R. Shoenfield, Daniel Lacombe, Georg Kreisel

Publication date: 1959


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (27)

On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysisSemantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionalsPolymorphic extensions of simple type structures. With an application to a bar recursive minimizationWhen is an automatic set an additive basis?An Effective Operator, Continuous but not Partial RecursiveOn Creative Sets and Indices of Partial Recursive FunctionsSome results related to the continuity problemUnnamed ItemMetric spaces in synthetic topologyWhat is a universal higher-order programming language?Algebraic specifiability of data types with minimal computable parametersGeneralizing Computability Theory to Abstract AlgebrasEquational theories for inductive typesNotes on computable analysisRecursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive AnalysisTowards Computability over Effectively Enumerable Topological SpacesComputability of simple games: A characterization and application to the coreTotal sets and objects in domain theoryComputability concepts for programming language semanticsUnnamed ItemTopological variants of the continuity theorem for mappings and related theoremsConstructive operators of finite typesThe concept of effective method applied to computational problems of linear algebraExploring mathematical objects from custom-tailored mathematical universesPoint-free topological spaces, functions and recursive points; filter foundation for recursive analysis. ILa théorie des fonctions récursives et ses applications. (Exposé d'information générale)A Real Number Structure that is Effectively Categorical




This page was built for publication: