Mathematics based on incremental learning -- excluded middle and inductive inference

DOI10.1016/J.TCS.2005.10.019MaRDI QIDQ817838zbMATH OpenOpenAlexFDO

Authors Susumu Hayashi

Publication date 20 March 2006

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2005.10.019

zbMATH Keywords

learning theoryconstructive logicthe law of excluded middle

Mathematics Subject Classification ID

Computational learning theory (68Q32) Metamathematics of constructive systems (03F50) Other constructive mathematics (03F65) Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• scientific article; zbMATH DE number 1966601
• scientific article; zbMATH DE number 1966517
• Toward the interpretation of non-constructive reasoning as non-monotonic learning
• scientific article; zbMATH DE number 2085171
• scientific article; zbMATH DE number 1948150

Cites work

• scientific article; zbMATH DE number 3900744 (Why is no real title available?)
• scientific article; zbMATH DE number 4002093 (Why is no real title available?)
• scientific article; zbMATH DE number 1215498 (Why is no real title available?)
• scientific article; zbMATH DE number 1226875 (Why is no real title available?)
• scientific article; zbMATH DE number 1301799 (Why is no real title available?)
• scientific article; zbMATH DE number 599028 (Why is no real title available?)
• scientific article; zbMATH DE number 1966601 (Why is no real title available?)
• scientific article; zbMATH DE number 1361536 (Why is no real title available?)
• scientific article; zbMATH DE number 2085171 (Why is no real title available?)
• scientific article; zbMATH DE number 6127535 (Why is no real title available?)
• scientific article; zbMATH DE number 3342830 (Why is no real title available?)
• A semantics of evidence for classical arithmetic
• Automata, Languages and Programming
• CT 0 is Stronger than CT 0 !
• Classical logic as limit completion
• Classical recursion theory. Vol. II
• Lifschitz' realizability
• On degrees of unsolvability
• Parsimony hierarchies for inductive inference
• Towards the animation of proofs -- testing proofs by examples

Cited in

(15)

• Fluctuations, effective learnability and metastability in analysis
• Games with 1-backtracking
• Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM 1
• scientific article; zbMATH DE number 1966517 (Why is no real title available?)
• Effectivity questions for Kleene's recursion theorem
• A computable version of Banach's inverse mapping theorem
• A New Translation for Semi-classical Theories — Backtracking without CPS
• Inductive inference and reverse mathematics
• Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
• A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract)
• Effective Choice and Boundedness Principles in Computable Analysis
• Toward the interpretation of non-constructive reasoning as non-monotonic learning
• scientific article; zbMATH DE number 1783013 (Why is no real title available?)
• scientific article; zbMATH DE number 1966601 (Why is no real title available?)
• scientific article; zbMATH DE number 2085171 (Why is no real title available?)

This page was built for publication: Mathematics based on incremental learning -- excluded middle and inductive inference

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