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
    Transferring computability via model equivalence assumes ... — Carmelics
    Home
    HistoryEditSee Inverse

    Part of a larger discussion

    Challenges→Because this bridge is proven rather than merely conjectured, a function defined by primitive recursion over a computable base inherits computability in any model proven equivalent to the recursive functions, removing the alleged 'a priori' gap.

    Transferring computability via model equivalence assumes the property is *structural* and *model-invariant*; this itself requires justification independent of the equivalence proof.

    ?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.

    Key Terms

    Equivalence proof(in mathematics and formal logic)
    A logical argument that demonstrates two different things are actually the same or equal in some important way.
    Model equivalence(in logic and philosophy of science)
    When two different systems or representations describe the same thing in the same way, even if they look different on the surface.
    Model-invariant(as used in logic and mathematics)
    Something that stays the same and true no matter which system or framework you use to think about it.
    Structural (in logic/philosophy)(in formal logic and mathematics)
    Relating to the underlying framework or pattern of how something is organized, rather than its specific content or materials.
    computability

    Next step

    Based on where you are in your exploration

    Explore a random proposition
    Start fresh with something unrelated.
    (computer science and philosophy of mathematics)
    The study of what problems can or cannot be solved by following a step-by-step procedure (algorithm) on a computer.
    independent justification(Epistemology of justification transmission)
    Justification that appears intuitively independent of the original justification for a proposition q; more precisely, transmitted justification for q that is additional and independent when three counterfactual conditions are met: the subject was already justified in believing q before acquiring the new evidence, remains justified during acquisition, and would have gained a first-time justification via transmission had no prior justification existed

    Connections

    1 linked claim

    Because this bridge is proven rather than merely conjectured, a function defined...

    Related

    Because this bridge is proven rather than merely conjectured, a function defined...

    Details

    Type
    premise
    Perspectives
    0 (0 for, 0 against)

    Open for perspectives

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

    Share the first perspective