Inductive inference and reverse mathematics
From MaRDI portal
Publication:324252
DOI10.1016/j.apal.2016.06.002zbMath1403.03017OpenAlexW2461280032MaRDI QIDQ324252
Frank Stephan, Rupert Hölzl, Sanjay Jain
Publication date: 10 October 2016
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2016.06.002
Computational learning theory (68Q32) Formal languages and automata (68Q45) Foundations of classical theories (including reverse mathematics) (03B30)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the strength of the finite intersection principle
- \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
- Mathematics based on incremental learning -- excluded middle and inductive inference
- Topological properties of concept spaces (full version)
- Characterizations of monotonic and dual monotonic language learning
- Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
- Inductive Inference and Reverse Mathematics
- The metamathematics of Stable Ramsey’s Theorem for Pairs
- Slicing the Truth
- Inductive inference of formal languages from positive data
- Inference of Reversible Languages
- Inductive inference and unsolvability
- Toward a mathematical theory of inductive inference
- A cohesive set which is not high
- Σ_{𝑛}-bounding and Δ_{𝑛}-induction
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Language identification in the limit
This page was built for publication: Inductive inference and reverse mathematics