On learning down-sets in quasi-orders, and ideals in Boolean algebras
From MaRDI portal
Publication:6661766
DOI10.1007/s00224-024-10201-yMaRDI QIDQ6661766
Manat Mustafa, Nikolay Bazhenov
Publication date: 13 January 2025
Published in: Theory of Computing Systems (Search for Journal in Brave)
Theory of computing (68Qxx) Mathematical logic and foundations (03-XX) Computability and recursion theory (03Dxx)
Cites Work
- Unnamed Item
- Unnamed Item
- On the learnability of vector spaces
- Reducibilities among equivalence relations induced by recursively enumerable structures
- 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 algebraic structures from informant
- Learning Families of Closed Sets in Matroids
- Lattice Theory: Foundation
- Toward a mathematical theory of inductive inference
- Computable Structure Theory
- Trial and error predicates and the solution to a problem of Mostowski
- Language identification in the limit
- Scientific discovery on positive data via belief revision
- Learning algebraic structures from text
- On learning families of ideals in lattices and Boolean algebras
This page was built for publication: On learning down-sets in quasi-orders, and ideals in Boolean algebras
