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

DOI10.1016/J.TCS.2005.10.019zbMATH Open1086.68063OpenAlexW2055924668MaRDI QIDQ817838FDOQ817838

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A semantics of evidence for classical arithmetic
• Title not available (Why is that?)
• Title not available (Why is that?)
• On degrees of unsolvability
• Classical recursion theory. Vol. II
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Automata, Languages and Programming
• Title not available (Why is that?)
• Lifschitz' realizability
• CT 0 is Stronger than CT 0 !
• Classical logic as limit completion
• Parsimony hierarchies for inductive inference
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)