Enumeration Reducibility in Closure Spaces with Applications to Logic and Algebra

zbMath1452.03096arXiv1505.07578MaRDI QIDQ5144632

Emmanuel Jeandel

Publication date: 19 January 2021

Full work available at URL: https://arxiv.org/abs/1505.07578

zbMATH Keywords

symbolic dynamicslogiccomputabilityuniversal algebracomputable mathematics

Mathematics Subject Classification ID

Quasivarieties (08C15) Other degrees and reducibilities in computability and recursion theory (03D30) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (3)

Strong computable type ⋮ PA RELATIVE TO AN ENUMERATION ORACLE ⋮ Unnamed Item

This page was built for publication: Enumeration Reducibility in Closure Spaces with Applications to Logic and Algebra