On learning families of ideals in lattices and Boolean algebras

DOI10.1007/978-981-97-2340-9_1MaRDI QIDQ6636063zbMATH OpenFDO

Authors Nikolay Bazhenov, Mustafa Manat

Publication date 12 November 2024

zbMATH Keywords

latticeBoolean algebraidealinductive inferencealgorithmic learning theorycomputable structurelinear order

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 1002913 (Why is no real title available?)
• scientific article; zbMATH DE number 42239 (Why is no real title available?)
• Classical recursion theory. The theory of functions and sets of natural numbers.
• Computable structures and the hyperarithmetical hierarchy
• Inductive inference and reverse mathematics
• Inductive inference of formal languages from positive data
• Language identification in the limit
• Lattice Theory: Foundation
• Learning algebraic structures from text
• Learning families of closed sets in matroids
• Learning indexed families of recursive languages from positive data: A survey
• Learning recursive functions: A survey
• On the learnability of vector spaces
• Subsystems of second order arithmetic
• Topological properties of concept spaces (full version)
• Toward a mathematical theory of inductive inference
• Trial and error predicates and the solution to a problem of Mostowski
• Turing degrees of certain isomorphic images of computable relations

Cited in

(1)

• On learning down-sets in quasi-orders, and ideals in Boolean algebras

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)