Sökning: "natural deduction"

Visar resultat 1 - 5 av 27 avhandlingar innehållade orden natural deduction.

1. 1. Natural deduction : a proof-theoretical study

   Författare :Dag Prawitz; Stockholms universitet; []
   Nyckelord :;

   Sammanfattning : .... LÄS MER

3. 2. A Natural Interpretation of Classical Proofs

   Författare :Jens Brage; Per Martin-Löf; Sara Negri; Stockholms universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Brouwer-Heyting-Kolmogorov; classical logic; constructive type theory; constructive semantics; proof interpretation; double-negation; continuation-passing-style; natural deduction; sequent calculus; cut elimination; explicit substitution; Mathematical logic; Matematisk logik;

   Sammanfattning : In this thesis we use the syntactic-semantic method of constructive type theory to give meaning to classical logic, in particular Gentzen's LK.We interpret a derivation of a classical sequent as a derivation of a contradiction from the assumptions that the antecedent formulas are true and that the succedent formulas are false, where the concepts of truth and falsity are taken to conform to the corresponding constructive concepts, using function types to encode falsity. LÄS MER

4. 3. 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

5. 4. Tabulation-based Logic Programming : A Multi-level View of Query Answering

   Författare :Lars Degerstedt; Teodor C. Przymusinski; Ulf Nilsson; University of California at Riverside; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Deductive databases; Partial deduction procedure; Tabulated resolution; Programmering; Databashanteringssystem Programspråk;

   Sammanfattning : .... LÄS MER

7. 5. Natural deduction for intuitionistic least and greatest fixedpoint logics : with an application to program construction

   Författare :Tarmo Uustalu; KTH; []
   Nyckelord :;

   Sammanfattning : This thesis discusses intuitionistic least and greatest fixedpoint logics, i.e., intuitionistic systems of logic with primitive predicate-valued operators on predicate transformers that send monotone predicate transformers to their least and greatest fixedpoints, predicates being quasiordered by inclusion. LÄS MER