Word problems for bidirectional single-premise Post systems

DOI10.1305/NDJFL/1093883173zbMATH Open0416.03042OpenAlexW2070695821MaRDI QIDQ754190FDOQ754190

Authors: Charles E. Hughes, David W. Straight 

Publication date: 1980

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093883173

zbMATH Keywords

word problemstag systemsbidirectional extensions of Post normal systemsone-letter systemsrecursively enumerable many-one degree of unsolvability

Mathematics Subject Classification ID

Thue and Post systems, etc. (03D03) Other degrees and reducibilities in computability and recursion theory (03D30) Word problems, etc. in computability and recursion theory (03D40)

This page was built for publication: Word problems for bidirectional single-premise Post systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q754190)