Is Gold-Putnam diagonalization complete?

DOI10.1007/BF01048528zbMath0811.03040OpenAlexW1987182888MaRDI QIDQ1346214

Cory F. Juhl

Publication date: 22 March 1995

Published in: Journal of Philosophical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01048528

zbMATH Keywords

philosophy of scienceZermelo-Fraenkel set theoryaxiom of determinacyformal learning theoryCartesian demoncompleteness of diagonalizationundetermined inductive gameswadge determinacy

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Games involving topology, set theory, or logic (91A44) Applications of set theory (03E75)

Cites Work

• Comparison of identification criteria for machine inductive inference
• Descriptive set theory
• Inductive inference of formal languages from positive data
• Trial and error predicates and the solution to a problem of Mostowski
• Limiting recursion

This page was built for publication: Is Gold-Putnam diagonalization complete?