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
    A system that can reason about itself but cannot derive c... — Carmelics
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Home/Modality & Possibility
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→Any consistent formal system that contains arithmetic as a subsystem is necessarily incomplete.

    A system that can reason about itself but cannot derive contradictions must leave certain truths unprovable — making it incomplete.

    Modality & PossibilityTruth & Knowledge
    ?Rate how convincing each reason is below to see the overall strength.

    No one has weighed in yet. Be the first to share reasons for or against this statement.

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

    Topics

    Modality & PossibilityTruth & Knowledge

    Connections

    2 topics

    Consciousness & Mind1 linked

    Next step

    Based on where you are in your exploration

    Browse more in Modality & Possibility
    Related propositions within the same area of thought.
    Philosophy of Language
    1 linked

    Related

    A consistent system cannot construct paradoxes within itself.A formal system that contains arithmetic as a subsystem contains an infinite cha...Any consistent formal system that contains arithmetic as a subsystem is necessar...Any deterministic formal system can be represented in terms of elementary arithm...
    +1 moreShow less
    Such a system is capable of reasoning about its own functions and proofs.

    Similar

    A consistent system cannot construct paradoxes within itself.79%Gödel's incompleteness proof reveals fundamental limitations on formal...79%Such a system is capable of reasoning about its own functions and proo...79%Because the system is consistent, such a self-referential statement ca...78%

    Source

    AI-extracted
    SEP: information
    View source passageHide passage
    In the context of philosophy of information the incompleteness of mathematics is a direct consequence of the rich possibilities of the natural numbers to code information. In principle any deterministic formal system can be represented in terms of elementary arithmetical functions. Consequently, If such a system itself contains arithmetic as a sub system, it contains a infinite chain of endomorphisms (i.e., images of itself). Such a system is capable of reasoning about its own functions and proo

    Details

    Type
    premise
    Perspectives
    0 (0 for, 0 against)
    Edits
    1 edit

    Open for perspectives

    This idea is waiting for its first supporting or challenging perspective.

    Share the first perspective