On learning families of ideals in lattices and Boolean algebras
From MaRDI portal
Publication:6636063
DOI10.1007/978-981-97-2340-9_1MaRDI QIDQ6636063FDOQ6636063
Authors: Nikolay Bazhenov, Mustafa Manat 
Publication date: 12 November 2024
latticeBoolean algebraidealinductive inferencealgorithmic learning theorycomputable structurelinear order
Cites Work
- Lattice Theory: Foundation
- Subsystems of second order arithmetic
- Inductive inference of formal languages from positive data
- Title not available (Why is that?)
- Toward a mathematical theory of inductive inference
- Language identification in the limit
- Learning indexed families of recursive languages from positive data: A survey
- Computable structures and the hyperarithmetical hierarchy
- Title not available (Why is that?)
- Trial and error predicates and the solution to a problem of Mostowski
- Inductive inference and reverse mathematics
- Topological properties of concept spaces (full version)
- Learning recursive functions: A survey
- Classical recursion theory. The theory of functions and sets of natural numbers.
- Learning families of closed sets in matroids
- Learning algebraic structures from text
- On the learnability of vector spaces
- Turing degrees of certain isomorphic images of computable relations
Cited In (1)
This page was built for publication: On learning families of ideals in lattices and Boolean algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636063)
