Combinatorial systems with axiom
From MaRDI portal
Publication:5921244
DOI10.1305/NDJFL/1093890999zbMath0214.01704OpenAlexW1995181842WikidataQ114598245 ScholiaQ114598245MaRDI QIDQ5921244
Charles E. Hughes, W. E. Singletary
Publication date: 1973
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1305/ndjfl/1093890999
Decidability of theories and sets of sentences (03B25) Recursively (computably) enumerable sets and degrees (03D25) Turing machines and related notions (03D10) Thue and Post systems, etc. (03D03)
Related Items (3)
Unsolvable algorithmic problems for semigroups, groups and rings ⋮ Combinatorial systems defined over one- and two-letter alphabets ⋮ Diem-Grade Logischer Entscheidungsprobleme
This page was built for publication: Combinatorial systems with axiom