Recursive digraphs, splinters and cylinders

DOI10.1007/BF01342904zbMath0087.25103MaRDI QIDQ771093

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

Related Items

Linear orderings under one-one reducibility, 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, Bibliography of John Myhill, On Reducibility by Recursive Functions, Learning algebraic structures from text, Syntactic complexity of bifix-free regular languages, The number of functional digraphs, Combinatorial systems. I: Cylindrical problems, Constructive Analogues of the Group of Permutations of the Natural Numbers

Cites Work

• Unnamed Item
• Unnamed Item
• The number of functional digraphs
• Retraceable Sets
• Two Notes on Recursively Enumerable Sets
• Recursively enumerable sets of positive integers and their decision problems
• Productive Sets
• Creative sets
• [Russian Text Ignored]