Recursive inseparability for residual Bounds of finite algebras

Journal of Symbolic Logic 65 (4):1863-1880 (2000)
  Copy   BIBTEX


We exhibit a construction which produces for every Turing machine T with two halting states μ 0 and μ -1 , an algebra B(T) (finite and of finite type) with the property that the variety generated by B(T) is residually large if T halts in state μ -1 , while if T halts in state μ 0 then this variety is residually bounded by a finite cardinal



    Upload a copy of this work     Papers currently archived: 93,031

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles


Added to PP

43 (#380,703)

6 months
11 (#272,549)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references