What's in a function?

DOI10.1007/BF00413605zbMath0929.03045OpenAlexW2093551551MaRDI QIDQ1293042

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

zbMATH Keywords

computable functionsnon-monotone inductive definitionsanalysis of the concept of truthgeneral recursive functionsnon-minimal fixed points of partially defined computing proceduresRevision Rules

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Recursive functions and relations, subrecursive hierarchies (03D20) Inductive definability (03D70)

Related Items (1)

Comparing inductive and circular definitions: Parameters, complexity and games

Cites Work

• Unnamed Item
• Unnamed Item
• Non-well-founded sets via revision rules
• A revision-theoretic analysis of the arithmetical hierarchy
• Truth and paradox
• The optimal approach to recursive programs
• Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I

This page was built for publication: What's in a function?