Skip to content
Carmelics
TopicsThinkersChangesContributorsLoading account…

    Carmelics

    A reasoning platform. Break down any belief into clear reasons, explore both sides, and weigh the evidence honestly.

    Navigate

    • Topics
    • Search
    • Recent Changes
    • Contribute
    • How It Works
    • Glossary
    • Thinkers
    • Contributors
    • About
    • Statistics
    • Terms
    • Privacy

    Database

    Statements
    —
    Perspectives
    —
    Topics
    —

    Press ? for keyboard shortcuts

    LoyalLoyalJusticeJustice
    Made withinDC&Austin
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    John Myhill — Carmelics
    Thinkers/John Myhill
    JM

    John Myhill

    contemporaryMathematical Logic, Philosophy of Mathematics

    1923 – 1987

    John Myhill (1923–1987) was an American mathematician, logician, and philosopher who made foundational contributions to recursion theory, formal language theory, and constructive mathematics. He is best known for the Myhill-Nerode theorem in automata theory and for developing constructive set theory (CST), and he also engaged with philosophical questions concerning language, meaning, and the learnability of grammar. He spent much of his career at the State University of New York at Buffalo.

    WWikipedia

    Notable Achievements

    1

    Co-developed the Myhill-Nerode theorem characterizing regular languages via equivalence classes

    2

    Proved foundational results on creative and productive sets in recursion theory

    3

    Developed Constructive Set Theory (CST), a formal system for intuitionistic mathematics

    4

    Contributed to philosophy of language, including analysis of propositional denotation and sentence meaning

    5

    Worked on the learnability of formal grammars, engaging with Gold-style language acquisition theory

    Positions & Arguments(2)

    Skepticism

    claim

    The inference from premises (1)-(3) to the conclusion that grammar G is unlearnable from the pld (period) involves an equivocation

    Philosophy of Language

    claim

    The inference from premises (1)-(3) to the conclusion that grammar G is unlearnable from the pld (period) involves an equivocation

    claim

    The shared denotation of sentences (1) and (5) cannot be the propositions expressed by each sentence

    At a Glance

    Ideas

    2

    Topics

    2

    Era

    contemporary

    Tradition

    Mathematical Logic, Philosophy of Mathematics

    Topic Influence

    Philosophy of Language2
    Skepticism1

    Related Thinkers

    Immanuel Kant2 sharedDavid Lewis2 sharedStathis Psillos2 sharedBas van Fraassen2 sharedRené Descartes2 sharedAristotle2 sharedPlato2 sharedBertrand Russell2 shared

    Dive Deeper

    Explore Philosophy of Language→See Skepticism→