What's in a function?
DOI10.1007/BF00413605zbMATH Open0929.03045OpenAlexW2093551551MaRDI QIDQ1293042FDOQ1293042
Authors: Gian Aldo Antonelli
Publication date: 9 August 1999
Published in: Synthese (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00413605
Recommendations
computable functionsnon-monotone inductive definitionsanalysis of the concept of truthgeneral recursive functionsnon-minimal fixed points of partially defined computing proceduresRevision Rules
Philosophical and critical aspects of logic and foundations (03A05) Recursive functions and relations, subrecursive hierarchies (03D20) Inductive definability (03D70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Truth and paradox
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
- The optimal approach to recursive programs
- Non-well-founded sets via revision rules
- A revision-theoretic analysis of the arithmetical hierarchy
Cited In (7)
- When is length a length function?
- Subfunctionalization: How often does it occur? How long does it take?
- Rethinking revision
- On revision operators
- When is a functional program not a functional program?
- Which notions of function were given by Euler?
- Comparing inductive and circular definitions: Parameters, complexity and games
This page was built for publication: What's in a function?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1293042)