Pages that link to "Item:Q2402149"
From MaRDI portal
The following pages link to Atomless Boolean algebras computable in polynomial time (Q2402149):
Displaying 6 items.
- Categoricity for primitive recursive and polynomial Boolean algebras (Q1731520) (← links)
- A complete Boolean algebra that has no proper atomless complete subalgebra (Q1922490) (← links)
- Effective categoricity of automatic equivalence and nested equivalence structures (Q2195573) (← links)
- The back-and-forth method and computability without delay (Q2279959) (← links)
- (Q4946095) (← links)
- FOUNDATIONS OF ONLINE STRUCTURE THEORY (Q5226592) (← links)