Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 37 for “"Natural deduction"”.

  1. Computational Natural Deduction

    … of the notion of a logically sound argument as a natural deduction proof offers the prospect of a computer program capable of constructing such arguments for conclusions of interest. We present a constructive definition for a new subclass of natural deduction proofs, called atomic normal form …

    anu Repository record for Computational Natural Deduction (opens in a new tab)

  2. Proof Editor for Natural Deduction

    In this thesis, we present Logan, a proof editor for constructing Fitch-style proofs in first-order logic. This proof editor is intended to be used by students who are taking a course in logic. Compared to other available proof editors Logan aims to be easier to use, both when it comes to getting …

    chalmers Repository record for Proof Editor for Natural Deduction (opens in a new tab)

  3. NATURAL DEDUCTION AND UNIVERSAL VALIDITY

    One of the main studies in a system of logic is concerned with the validity of formulas. By means of interpretations and models, formulas are transformed into statements whose truth values are fixed. Each of these interpretations is with respect to an individual- domain. In general, the validity of …

    nebraska Repository record for NATURAL DEDUCTION AND UNIVERSAL VALIDITY (opens in a new tab)

  4. Natural Deduction, Sharing By Presentation

    Part I of this thesis studies a fragment of natural deduction to which we have added the notion of sharing of subresults. This formalism is called 'deduction graphs'. We show some properties of cut-elimination on deduction graphs, like strong normalisation and confluence. We discuss connections …

    radboud Repository record for Natural Deduction, Sharing By Presentation (opens in a new tab) Download PDF for Natural Deduction, Sharing By Presentation (opens in a new tab)

  5. Applications of a natural deduction set theory

    … in the form of additional axioms or rules of deduction are needed. The thesis demonstrates the ease and directness with which this can be done for the three areas, suggesting that in other, as yet unexplored areas, NaDSet may prove to be equally useful.

    ubc Repository record for Applications of a natural deduction set theory (opens in a new tab) Download PDF for Applications of a natural deduction set theory (opens in a new tab)

  6. A Flexible, Natural Deduction, Automated Reasoner for Quick Deployment of Non-Classical Logic

    … a platform for different proof strategies like deduction and backward reasoning, along with different formal systems such as non-classical logics. It enables users to design their own proof system by selecting from the list of codelets without needing to write an ATP from scratch.

    usf Repository record for A Flexible, Natural Deduction, Automated Reasoner for Quick Deployment of Non-Classical Logic (opens in a new tab)

  7. Proof Editor for Natural Deduction in First-order Logic The Evaluation of an Educational Aiding Tool for Students Learning Logic

    … and evaluation of Conan, an editor for writing natural deduction proofs in first-order logic. The intent is for the editor to serve as a supplementary tool alongside a course in logic. For this reason, emphasis was put on making sure the editor would have a low learning curve, ensuring that …

    chalmers Repository record for Proof Editor for Natural Deduction in First-order Logic The Evaluation of an Educational Aiding Tool for Students Learning Logic (opens in a new tab)

  8. Sistemas de lógica modal em dedução natural

    Formalization of logical systems in natural deduction brings many metatheoretical advantages, which Normalization proof is always highlighted. Modal logic systems, until very recently, were not routinely formalized in natural deduction, though some formulations and Normalization proofs are known. …

    brazil-ufrn Repository record for Sistemas de lógica modal em dedução natural (opens in a new tab)

  9. The Curry-Howard Correspondence

    … simply-typed lambda calculus and intuitionistic natural deduction. Our introduction aims to provide the necessary theoretical background to understand the basic correspondence, which can help bridge the gap between non-specialists and the more advanced literature on the topic. Such an …

    calgary Repository record for The Curry-Howard Correspondence (opens in a new tab)

  10. Automatic Generation of Human Readable Proofs

    … proofs have readability limitations: the deduction process does not conform to human reasoning processes, or the proof tree generated is too complicated. The primary objective of this thesis is to design a program that automatically gen- erates human-readable propositional logic proofs …

    brock Repository record for Automatic Generation of Human Readable Proofs (opens in a new tab)

  11. HOL Metatheory of Relevant Implication Syntax and Semantics

    We mechanise two Hilbert systems, a Natural Deduction system, the Routley-Meyer semantics, and the Cover semantics for the Relevant Logic R in HOL4. We also show equivalence results between one of the Hilbert Systems and the other Hilbert system and the Natural Deduction system. We also show …

    anu Repository record for HOL Metatheory of Relevant Implication Syntax and Semantics (opens in a new tab)

  12. A logic for intersection and union types

    … system with intersection and union types IUT in natural deduction style and also in sequent calculus style. We describe and prove properties of the system, like subject reduction (under a notion of ''parallel'' reduction) and cut elimination. Furthermore, we prove four theorems that characterize …

    greece Repository record for A logic for intersection and union types (opens in a new tab)

  13. Modal and Relevance Logics for Qualitative Spatial Reasoning

    … Modal Relevance Logic (MRL). We have provided a natural deduction system for this logic by defining inference rules for the operators and constants used in our (MRL) logic and shown that our system is correct. Furthermore, we have used the functional programming language and interactive theorem …

    brock Repository record for Modal and Relevance Logics for Qualitative Spatial Reasoning (opens in a new tab)

  14. Automatinio įrodymo sistema laiko logikai /

    Various calculi (Hilbert–type, natural deduction, resolution, sequent) have been created to derive theorems, and based on the calculi algorythms and automated theorem proving systems have been created. In this work, propositional linear temporal logic (PLTL) is considered: syntax, semantics, …

    vilnius Repository record for Automatinio įrodymo sistema laiko logikai / (opens in a new tab)

  15. Aspects of Basic Logic

    … is weakened. His axiomatization of BPL uses natural deduction (see page 8). In his thesis, Visser proved the completeness of BPL with respect to finite Kripke models. He extended BPL to Formal Propositional Logic, FPL, by adding Lob's Rule, "formula", and continued his studies in that …

    marquette Repository record for Aspects of Basic Logic (opens in a new tab)

  16. An environment theory with precomplete negation over pairs

    … Voda's Theory of Pairs is given which takes the natural-deduction form of Gilmore's first-order set theory. The complete proof theory corresponding to this semantics is given. Then, a logic programming system is described in the form of a computational proof theory for the Gilmore semantics. This …

    ubc Repository record for An environment theory with precomplete negation over pairs (opens in a new tab) Download PDF for An environment theory with precomplete negation over pairs (opens in a new tab)

  17. !-Logic

    … the notion of equational reasoning with a natural deduction system based on first order logic.</p> <p>The first major contribution is the syntactic !-tensor formalism, which enriches Penrose’s abstract tensor notation to allow repeated structure via !-boxes. This will allow us to work with …

    oxford Repository record for !-Logic (opens in a new tab)

  18. Proof theoretic criteria for logical constancy

    … These requirements are used to generate natural deduction criteria for logical constancy, resulting in the classification of certain predicates, truth functional propositional operators, first order quantifiers, second order quantifiers in sound and complete formal systems using Henkin …

    glasgow Repository record for Proof theoretic criteria for logical constancy (opens in a new tab) Download PDF for Proof theoretic criteria for logical constancy (opens in a new tab)

Page 1 of 2