Combinatorial systems. I: Cylindrical problems

DOI10.1016/S0022-0000(72)80005-9zbMATH Open0256.02018OpenAlexW2038363539MaRDI QIDQ2558862FDOQ2558862

Authors: J. P. Cleave 

Publication date: 1972

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(72)80005-9

Mathematics Subject Classification ID

Thue and Post systems, etc. (03D03) Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory (03D99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Linear orderings under one-one reducibility
• Recursive digraphs, splinters and cylinders
• Machine Configuration and Word Problems of Given Degree of Unsolvability
• The equivalence of some general combinatorial decision problems

Cited In (5)

• European Meeting of the Association for Symbolic Logic, Bristol, England, 1973
• Diem-Grade Logischer Entscheidungsprobleme
• System function languages
• INPUT/OUTPUT CODINGS AND TRANSITION FUNCTIONS IN EFFECTIVE SYSTEMS
• Representation of one-one degrees by decision problems for system functions

This page was built for publication: Combinatorial systems. I: Cylindrical problems

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