Recommendations
Cites work
- scientific article; zbMATH DE number 3932417 (Why is no real title available?)
- scientific article; zbMATH DE number 67629 (Why is no real title available?)
- scientific article; zbMATH DE number 3536056 (Why is no real title available?)
- A cohesive set which is not high
- Characterizations of monotonic and dual monotonic language learning
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Inductive Inference and Reverse Mathematics
- Inductive inference and unsolvability
- Inductive inference of formal languages from positive data
- Inference of Reversible Languages
- Language identification in the limit
- Mathematics based on incremental learning -- excluded middle and inductive inference
- Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
- On the strength of the finite intersection principle
- Slicing the truth. On the computable and reverse mathematics of combinatorial principles
- Subsystems of second order arithmetic
- The metamathematics of Stable Ramsey’s Theorem for Pairs
- Topological properties of concept spaces (full version)
- Toward a mathematical theory of inductive inference
- \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
- Σ_{𝑛}-bounding and Δ_{𝑛}-induction
Cited in
(5)
This page was built for publication: Inductive inference and reverse mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324252)