11 August 1923|
Birmingham, United Kingdom
|Died||15 February 1987(aged 63)|
|Alma mater||Harvard University|
|Thesis||A Semantically Complete Foundation for Logic and Mathematics (1949)|
|Doctoral advisor||Willard Van Orman Quine|
|Other academic advisors||Lynn Harold Loomis|
|Known for||Russell–Myhill paradox
Garden of Eden theorem
|Spouse||Akiko Kino (died 1983)|
Myhill received his Ph.D. from Harvard University under Willard Van Orman Quine in 1949. He was professor at SUNY Buffalo from 1966 until his death in 1987. He also taught at several other universities.
His son, also called John Myhill, is a professor of linguistics in the English department of the University of Haifa in Israel.
In the theory of formal languages, the Myhill–Nerode theorem, proven by Myhill with Anil Nerode, characterizes the regular languages as the languages that have only finitely many inequivalent prefixes.
In computability theory, the Rice–Myhill–Shapiro theorem, more commonly known as Rice's theorem, states that, for any nontrivial property P of partial functions, it is undecidable to determine whether a given Turing machine computes a function with property P. The Myhill isomorphism theorem is a computability-theoretic analogue of the Cantor–Bernstein–Schroeder theorem that characterizes the recursive isomorphisms of pairs of sets.
In the theory of cellular automata, Myhill is known for proving (along with E. F. Moore) the Garden of Eden theorem, stating that a cellular automaton has a configuration with no predecessor if and only if it has two different asymptotic configurations which evolve to the same configuration. He is also known for posing the firing squad synchronization problem of designing an automaton that, starting from a single non-quiescent cell, evolves to a configuration in which all cells reach the same non-quiescent state at the same time; this problem was again solved by Moore.
In constructive set theory, Myhill is known for proposing an axiom system that avoids the axiom of choice and the law of the excluded middle, known as intuitionistic Zermelo–Fraenkel. He also developed a constructive set theory based on natural numbers, functions, and sets, rather than (as in many other foundational theories) basing it purely on sets.
The Russell–Myhill paradox or Russell–Myhill antinomy, discovered by Bertrand Russell in 1902 (and discussed in his The Principles of Mathematics, 1903) and rediscovered by Myhill in 1958, concerns systems of logic in which logical propositions can be members of classes, and can also be about classes; for instance, a proposition P can "state the product" of a class C, meaning that proposition P asserts that all propositions contained in class C are true. In such a system, the class of propositions that state the product of classes that do not include them is paradoxical. For, if proposition P states the product of this class, an inconsistency arises regardless of whether P does or does not belong to the class it describes.
- Revue philosophique de Louvain, Volume 85, 1987, p. 603.
- John Myhill at the Mathematics Genealogy Project.
- "Prof. John Myhill". english.haifa.ac.il. Retrieved 2021-04-05.<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>
- Rosenberg, Arnold L. (2009). "9.5 The Rice–Myhill–Shapiro Theorem". The Pillars of Computation Theory. New York: Springer. pp. 165–169. doi:10.1007/978-0-387-09639-1_9.<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>
- "Russell's Paradox". Internet Encyclopedia of Philosophy.<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>
- Irvine, Andrew David (2016). "Russell's Paradox". Stanford Encyclopedia of Philosophy.<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles> "The reason is that in Appendix B Russell also presents another paradox which he thinks cannot be resolved by means of the simple theory of types."
- "Problems Arising in the Formalization of Intensional Logic." Logique et Analyse 1 (1958): 78–83