Feferman on Computability

DOI10.1007/978-3-319-63334-3_2zbMath1429.03009OpenAlexW2795034276MaRDI QIDQ5214780

Jeffery Zucker

Publication date: 5 February 2020

Published in: Outstanding Contributions to Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-63334-3_2

zbMATH Keywords

generalized computabilityFefermanabstract data types computing on streamscomputing on reals

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) History of mathematical logic and foundations (03-03) Higher-type and set recursion theory (03D65) Inductive definability (03D70) Computation over the reals, computable analysis (03D78) Abstract and axiomatic computability and recursion theory (03D75)

Cites Work

• Continuity of operators on continuous and discrete time streams
• Logic colloquium '78. Proceedings of the colloquium held in Mons, August 1978.
• Elementary induction on abstract structures
• Maximal and everywhere-defined functionals
• Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993
• Computable functionals of finite types
• Computation on abstract data types. The extensional approach, with an application to streams
• Translating recursion equations into flow charts
• Computable functionals
• Effective operations on partial recursive functions
• On the definitions of computable real continuous functions
• Recursive Functionals and Quantifiers of Finite Types I
• Theory of Formal Systems. (AM-47)
• The formal language of recursion
• Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
• Finite alogorithmic procedures and computation theories.
• Finite alogorithmic procedures and inductive definability.
• A new approach to abstract data types, I Informal development
• Algorithmic Procedures
• Initial Algebra Semantics and Continuous Algebras
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Toward a constructive theory of unbounded linear operators
• Abstract versus concrete computation on metric partial algebras
• Abstract First Order Computability. I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item