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"”.
-
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 …
-
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 …
-
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 …
-
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 …
-
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.
-
Specifying compositional semantic functions for non-hierarchical languages using natural deduction systems
Thesis (M.S.)--Michigan State University. Department of Computer Science, 2004
-
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.
-
A CALCULUS OF NATURAL DEDUCTION FOR PREDICATE LOGIC WITH FUNCTIONAL VARIABLES AND IDENTITY
Abstract not available
-
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 …
-
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. …
-
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 …
-
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 …
-
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 …
-
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 …
-
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 …
-
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, …
-
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 …
-
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 …
-
!-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 …
-
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 …
Page 1 of 2