Mathematics based on incremental learning -- excluded middle and inductive inference
type: Item
instance of: scholarly article
title: Mathematics based on incremental learning -- excluded middle and inductive inference
zbMATH Open document ID: 1086.68063
author: Susumu Hayashi
published in: Theoretical Computer Science
publication date: 2006-03-20T00:00:00Z
Mathematics Subject Classification ID: 68Q32
Mathematics Subject Classification ID: 03D20
Mathematics Subject Classification ID: 03F50
Mathematics Subject Classification ID: 03F65
zbMATH DE Number: 5013333
zbMATH Keywords: learning theory
zbMATH Keywords: constructive logic
zbMATH Keywords: the law of excluded middle
MaRDI profile type: Publication
full work available at URL: j.tcs.2005.10.019
OpenAlex ID: W2055924668
cites work: Parsimony hierarchies for inductive inference
cites work: Q4699354
cites work: Q3679172
cites work: Classical logic as limit completion
cites work: Q3754620
cites work: A semantics of evidence for classical arithmetic
cites work: Q5619076
cites work: Q4420735
cites work: Q4736394
cites work: Towards the animation of proofs -- testing proofs by examples
cites work: CT 0 is Stronger than CT 0 !
cites work: Classical recursion theory. Vol. II
cites work: Q4903274
cites work: Q4297316
cites work: On degrees of unsolvability
cites work: Q4220572
cites work: Q4247015
cites work: Automata, Languages and Programming
cites work: Q4215635
cites work: Lifschitz' realizability
DOI: 10.1016/J.TCS.2005.10.019
description: scientific article; zbMATH DE number 5013333