Feferman on computability

DOI10.1007/978-3-319-63334-3_2zbMATH Open1429.03009OpenAlexW2795034276MaRDI QIDQ5214780FDOQ5214780

Authors: 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

Recommendations

• Publication:4934276
• Computability in special models
• Computability theory. Abstracts from the workshop held February 5--11, 2012.
• scientific article; zbMATH DE number 1955470
• Feferman on foundations. Logic, mathematics, philosophy

zbMATH Keywords

generalized computabilityFefermanabstract data types computing on streamscomputing on reals

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: Feferman on computability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5214780)