Single premise Post canonical forms defined over one-letter alphabets

DOI10.2307/2272891zbMath0298.02029OpenAlexW2076657431MaRDI QIDQ4052094

Charles E. Hughes

Publication date: 1974

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2272891

Mathematics Subject Classification ID

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

Related Items (1)

The reachability problem for Petri nets and decision problems for Skolem arithmetic

Cites Work

• Many-one degrees associated with problems of tag

This page was built for publication: Single premise Post canonical forms defined over one-letter alphabets