On learning families of ideals in lattices and Boolean algebras
From MaRDI portal
Publication:6636063
DOI10.1007/978-981-97-2340-9_1MaRDI QIDQ6636063
Manat Mustafa, Nikolay Bazhenov
Publication date: 12 November 2024
latticeBoolean algebraidealinductive inferencecomputable structurelinear orderalgorithmic learning theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inductive inference and reverse mathematics
- On the learnability of vector spaces
- Learning recursive functions: A survey
- Learning indexed families of recursive languages from positive data: A survey
- Topological properties of concept spaces (full version)
- Classical recursion theory. The theory of functions and sets of natural numbers.
- Turing degrees of certain isomorphic images of computable relations
- Computable structures and the hyperarithmetical hierarchy
- Learning Families of Closed Sets in Matroids
- Lattice Theory: Foundation
- Inductive inference of formal languages from positive data
- Toward a mathematical theory of inductive inference
- Trial and error predicates and the solution to a problem of Mostowski
- Language identification in the limit
- Learning algebraic structures from text
Related Items (1)
This page was built for publication: On learning families of ideals in lattices and Boolean algebras
