Boolean algebra approximations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 722611 (Why is no real title available?)
- scientific article; zbMATH DE number 2154086 (Why is no real title available?)
- Computable Boolean algebras
- Computable structures and the hyperarithmetical hierarchy
- Every Low 2 Boolean Algebra has a Recursive Copy
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- Minimally generated Boolean algebras
- Notes on the Jump of a Structure
- On the n-back-and-forth types of Boolean algebras
Cited in
(13)- Approximation of Boolean functions to Schaefer's classes
- scientific article; zbMATH DE number 5852793 (Why is no real title available?)
- On almost bad Boolean bases
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- scientific article; zbMATH DE number 44570 (Why is no real title available?)
- Algorithms for Boolean Function Query Properties
- Approximating Boolean functions by OBDDs
- Algebraically degenerate approximations of Boolean functions
- Mathematical Foundations of Computer Science 2004
- Cuts of linear orders
- Computable Boolean algebras
- \(\text{Low}_5\) Boolean subalgebras and computable copies
- On a computable presentation of low linear orderings
This page was built for publication: Boolean algebra approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3190798)