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
    Stephen Kleene — Carmelics
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Thinkers/Stephen Kleene
    Stephen Kleene

    Stephen Kleene

    contemporaryMathematical Logic / Foundations of Mathematics

    1909 – 1994

    Stephen Cole Kleene (1909–1994) was an American mathematical logician and a principal founder of recursion theory. A student of Alonzo Church, he made foundational contributions to computability theory, formal language theory, and the metamathematics of intuitionistic logic. His work established core concepts underlying theoretical computer science and the study of the limits of mechanical computation.

    WWikipedia

    Notable Achievements

    1

    Proved Kleene's recursion theorem, a fundamental result in computability theory

    2

    Introduced Kleene's T-predicate and the universal function, formalizing the notion of a computable function

    3

    Developed the Kleene star and foundational work on regular expressions and finite automata

    4

    Established Kleene's three-valued logic (strong and weak) for formalization of partial functions

    5

    Authored Introduction to Metamathematics (1952), a standard graduate text in mathematical logic

    Positions & Arguments(4)

    Skepticism

    claim

    Turing's thesis is not susceptible to mathematical proof

    claim

    There is a fundamental tension between treating logical knowledge as a priori and the computational intractability of deciding logical validity.

    Truth & Knowledge

    claim

    Turing's thesis is not susceptible to mathematical proof

    claim

    There is a fundamental tension between treating logical knowledge as a priori and the computational intractability of deciding logical validity.

    claim

    The universal function u_1(i,x) = g_i(x) for unary primitive recursive functions cannot itself be primitive recursive

    Philosophy of Language

    claim

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

    Modality & Possibility

    claim

    The universal function u_1(i,x) = g_i(x) for unary primitive recursive functions cannot itself be primitive recursive

    At a Glance

    Ideas

    4

    Topics

    4

    Era

    contemporary

    Tradition

    Mathematical Logic / Foundations of Mathematics

    Topic Influence

    Truth & Knowledge3
    Skepticism2
    Modality & Possibility1
    Philosophy of Language1

    Related Thinkers

    David Lewis4 sharedImmanuel Kant4 sharedAristotle4 sharedBertrand Russell4 sharedBrian Skyrms4 sharedDavid Hume4 sharedPlato4 shared

    Dive Deeper

    Explore Truth & Knowledge→See Skepticism→
    René Descartes4 shared