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 7 of 7 for “"natural deduction"”.

  1. 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)

  2. A Possible and Necessary Consistency Proof

    … shown both in a sequent calculus notation and in natural deduction. The former proof includes a cut elimination theorem for the calculus and a syntactical study of the purely arithmetical part of the system. The latter consistency proof in standard natural deduction has been an open problem since …

    helsinki Repository record for A Possible and Necessary Consistency Proof (opens in a new tab)

  3. Linear Logic and Noncommutativity in the Calculus of Structures

    … in the tradition of Hilbert's formalism, natural deduction, and the sequent calculus. Systems in the calculus of structures are based on two simple principles: deep inference and top-down symmetry. Together they have remarkable consequences for the properties of the logical systems. For …

    qucosa-diss

  4. Investigaciones sobre gramáticas categoriales: Algoritmos de parsing y equivalencia entre formalismos

    … Grammars (CG) for the description and parsing of natural and formal languages.Our work has focused on those aspects we found problematic facing the practical application of CG, such as: (a) a strong equivalence of Context Free Grammars (CFG) and CG, (b) lack of descriptive power of CG, (c) the …

    cadiz Repository record for Investigaciones sobre gramáticas categoriales: Algoritmos de parsing y equivalencia entre formalismos (opens in a new tab)

  5. Proof search issues in some non-classical logics

    … sequents, unlike other logical calculi such as natural deduction. All the calculi for proof search in this thesis are Gentzen sequent calculi. In Chapter 2, permutation of inference rules for Intuitionistic Linear Logic is studied. A focusing calculus, ILLF, in the style of Andreoli ([And92]) is …

    city-london Repository record for Proof search issues in some non-classical logics (opens in a new tab)

  6. TRACTABLE DEPTH-BOUNDED APPROXIMATIONS TO SOME PROPOSITIONAL LOGICS. TOWARDS MORE REALISTIC MODELS OF LOGICAL AGENTS.

    … This Thesis shows that the approach can be naturally extended to useful non-classical logics such as First-Degree Entailment (FDE), the Logic of Paradox (LP), Strong Kleene Logic (K3) and Intuitionistic Propositional Logic (IPL). To do this, we introduce a KE/KI-style system for each of …

    milano Repository record for TRACTABLE DEPTH-BOUNDED APPROXIMATIONS TO SOME PROPOSITIONAL LOGICS. TOWARDS MORE REALISTIC MODELS OF LOGICAL AGENTS. (opens in a new tab)

  7. Polimorfismo atómico e o teorema da normalização forte

    … também a sua formulação no cálculo de dedução natural. O sistema contém apenas dois geradores de tipos (fórmulas): implicação e quantificação universal de segunda-ordem restrita a instanciações atómicas, daí a designação de polimorfismo atómico (Fat). Dois resultados centrais em Fat são …

    aberta Repository record for Polimorfismo atómico e o teorema da normalização forte (opens in a new tab)