Recursive digraphs, splinters and cylinders

DOI10.1007/BF01342904MaRDI QIDQ771093zbMATH OpenFDO

Authors John Myhill

Publication date 1959

Published in Mathematische Annalen (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/160710

zbMATH Keywords

philosophy and foundations of mathematics

Cites work

• scientific article; zbMATH DE number 3131080 (Why is no real title available?)
• scientific article; zbMATH DE number 3394122 (Why is no real title available?)
• Creative sets
• Productive Sets
• Recursively enumerable sets of positive integers and their decision problems
• Retraceable Sets
• The number of functional digraphs
• Two Notes on Recursively Enumerable Sets
• [Russian Text Ignored]

Cited in

(11)

• Linear orderings under one-one reducibility
• Combinatorial systems. I: Cylindrical problems
• Learning algebraic structures from text
• On Reducibility by Recursive Functions
• An unsolved problem in the theory of constructive order types
• On Semi-Cylinders, Splinters, and Bounded-Truth-Table Reducibility
• On sets polynomially enumerable by iteration
• The number of functional digraphs
• Bibliography of John Myhill
• Syntactic complexity of bifix-free regular languages
• Constructive Analogues of the Group of Permutations of the Natural Numbers

This page was built for publication: Recursive digraphs, splinters and cylinders

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