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
    Moses Schönfinkel — Carmelics
    Thinkers/Moses Schönfinkel
    MS

    Moses Schönfinkel

    modernMathematical Logic

    1888 – 1942

    Moses Schönfinkel was a Russian logician and mathematician who pioneered combinatory logic, a formal system that eliminates the need for bound variables in mathematical logic. His 1924 paper 'Über die Bausteine der mathematischen Logik' laid the groundwork for both lambda calculus and functional programming, making him one of the most influential yet underrecognized figures in the foundations of computation.

    WWikipediaSEPStanford Encyclopedia

    Notable Achievements

    1

    Invented combinatory logic, eliminating bound variables from formal logic

    2

    Introduced the technique of transforming multi-argument functions into chains of single-argument functions (later called 'currying')

    3

    Defined the S and K combinators, proven sufficient to express any computable function

    4

    Influenced Haskell Curry and the subsequent development of lambda calculus and functional programming

    Positions & Arguments

    (2)

    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.

    At a Glance

    Ideas

    2

    Topics

    2

    Era

    modern

    Tradition

    Mathematical Logic

    Topic Influence

    Truth & Knowledge2
    Skepticism2

    Related Thinkers

    David Lewis2 sharedImmanuel Kant2 sharedBoyd2 sharedBrian Skyrms2 sharedStathis Psillos2 sharedBertrand Russell2 sharedDavid Hume2 sharedAristotle2 shared

    Dive Deeper

    Explore Truth & Knowledge→See Skepticism→