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
    The Church–Rosser theorem guarantees that the final resul... — Carmelics
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Home/Philosophy of Language
    HistoryEditSee Inverse

    The Church–Rosser theorem guarantees that the final result of a series of reductions on a term is unique, independently of the order of reduction steps

    Philosophy of LanguageTruth & Knowledge
    ?Rate how convincing each reason is below to see the overall strength.
    1 reason for
    2 reasons against

    Reasons For

    1 perspective
    Reason for
    ?
    • 1.Reduction can be modeled as computing the value of a function
      ?

      Think about whether this reason is strong or weak

    • 2.The Church–Rosser theorem states that reduction results are confluent—different reduction paths lead to the same normal form
      ?

      Think about whether this reason is strong or weak

    Reasons Against

    2 perspectives
    Reason against 1 of 2
    ?
    • 1.Confluence guarantees uniqueness of normal forms when they exist, but does not guarantee that any normal form exists at all for a given term.
      ?

      Think about whether this reason is strong or weak

    • 2.Wittgenstein's rule-following considerations (Philosophical Investigations §201) suggest that the determinacy of a computational rule's outcome cannot be read off the rule itself without presupposing a practice of application.
      ?

      Think about whether this reason is strong or weak

    • 3.The theorem's guarantee of uniqueness is therefore conditional on facts about termination that are undecidable in general, undermining any unconditional epistemic confidence in unique results.
      ?

      Think about whether this reason is strong or weak

    Reason against 2 of 2
    ?
    • 1.The Church–Rosser theorem applies only to normalizing terms; non-terminating reductions (like Ω = (λx.xx)(λx.xx)) have no unique normal form.
      ?

      Think about whether this reason is strong or weak

    • 2.A theorem that guarantees uniqueness only when reduction terminates cannot ground a general claim about uniqueness 'independently of reduction order'.
      ?

      Think about whether this reason is strong or weak

    Sign in or register to share your perspective on this statement.

    Next step

    Based on where you are in your exploration

    Strongest counterpoint
    Explore the most compelling reason on the other side.

    Topics

    Philosophy of LanguageTruth & Knowledge

    Connections

    1 topic

    Causation1 linked

    Related

    A theorem that guarantees uniqueness only when reduction terminates cannot groun...Confluence guarantees uniqueness of normal forms when they exist, but does not g...Reduction can be modeled as computing the value of a functionThe Church–Rosser theorem applies only to normalizing terms; non-terminating red...
    +3 moreShow less
    The Church–Rosser theorem states that reduction results are confluent—different ...The theorem's guarantee of uniqueness is therefore conditional on facts about te...Wittgenstein's rule-following considerations (Philosophical Investigations §201)...

    Similar

    If a unique final term exists, then no infinite sequence of distinct c...84%The claim that the Church–Rosser theorem guarantees a unique final res...78%The Church–Rosser theorem states that reduction results are confluent—...76%Uniqueness of a final term implies that each series of reduction steps...75%

    Source

    AI-extracted1/3 agreementValid
    SEP: logic-combinatory
    View source passageHide passage
    If we think that reduction is like computing the value of a function, then the Church–Rosser theorem—in a first approximation—can be thought to state that the final result of a series of calculations with a term is unique—independently of the order of the steps. This is a slight overstatement though, because uniqueness implies that each series of calculations ends (or “loops” on a term). That is, if there is a unique final term, then only finitely many distinct consecutive calculation steps are
    Extraction notes

    Validity: Extracted via Max plan + API grounding/validity checks

    Details

    Type
    claim
    Perspectives
    3 (1 for, 2 against)
    Edits
    1 edit