Sökning: "Informal proof"

Visar resultat 1 - 5 av 7 avhandlingar innehållade orden Informal proof.

  1. 1. Concept Formation in Mathematics

    Författare :Jörgen Sjögren; Högskolan i Skövde; []
    Nyckelord :HUMANIORA; HUMANITIES; Explication; Power of arithmetical theories; Formal proof; Informal proof; Indispensability; Mathematical realism; Naturvetenskap; Natural sciences; Explication; Power of arithmetical theories; Formal Proof; Informal proof; Indispensability; Mathematical Realism;

    Sammanfattning : This thesis consists of three overlapping parts, where the first one centers around the possibility of defining a measure of the power of arithmetical theories. In this part a partial measure of the power of arithmetical theories is constructed, where “power” is understood as capability to prove theorems. LÄS MER

  3. 2. General Metarules for Interactive Modular Construction of Natural Deduction Proofs

    Författare :Agneta Eriksson-Granskog; Tarmo Uustalu; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer science; Datavetenskap; Computer and Systems Sciences; data- och systemvetenskap;

    Sammanfattning : This thesis proposes a set of general metarules for interactive modular construction of natural deduction proofs.Interactive proof support systems are used for the construction of formal proofs in formal program development. LÄS MER

  4. 3. Large deviations for weighted empirical measures and processes arising in importance sampling

    Författare :Pierre Nyquist; Henrik Hult; Ingemar Kaj; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This thesis consists of two papers related to large deviation results associated with importance sampling algorithms. As the need for efficient computational methods increases, so does the need for theoretical analysis of simulation algorithms. This thesis is mainly concerned with algorithms using importance sampling. LÄS MER

  5. 4. Ownership-Based Alias Managemant

    Författare :Tobias Wrigstad; Love Ekenberg; Arnd Poetzsch-Heffter; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer and systems science; Data- och systemvetenskap;

    Sammanfattning : Object-oriented programming relies on sharing and the mutable states of objects for common data structures, patterns and programming idioms. Sharing and mutable state is a powerful but dangerous combination. LÄS MER

  7. 5. Identity of proofs

    Författare :Filip Widebäck; Peter Schroeder-Heister; Stockholms universitet; []
    Nyckelord :Theoretical Philosophy; teoretisk filosofi;

    Sammanfattning : In the early seventies it was conjectured that a certain mathematically well-defined equivalence relation (bh-equivalence) on proofs in natural deduction captures the informal notion of identity of proofs. The conjecture can be divided into two parts, a soundness part and a completeness part. LÄS MER