Sökning: "natural deduction"

Visar resultat 6 - 10 av 27 avhandlingar innehållade orden natural deduction.

  1. 6. Three Studies on Model Transformations - Parsing, Generation and Ease of Use

    Författare :Håkan Burden; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : ABSTRACT Transformations play an important part in both software development and the automatic processing of natural languages. We present three publications rooted in the multi-disciplinary research of Language Technology and Software Engineering and relate their contribution to the literature on syntactical transformations. LÄS MER

  3. 7. Logics of Knowledge and Cryptography : Completeness and Expressiveness

    Författare :Mika Cohen; Mads Dam; Alessio Lomuscio; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; epistemic logic; first-order logic; formal cryptography; static equivalence; security protocols; BAN logic; multi-agent system; completeness; logical omniscience problem; Computer science; Datavetenskap;

    Sammanfattning : An understanding of cryptographic protocols requires that we examine the knowledge of protocol participants and adversaries: When a participant receives a message, does she know who sent it? Does she know that the message is fresh, and not merely a replay of some old message? Does a network spy know who is talking to whom? This thesis studies logics of knowledge and cryptography. Specifically, the thesis addresses the problem of how to make the concept of knowledge reflect feasible computability within a Kripke-style semantics. LÄS MER

  4. 8. Towards a practical programming language based on dependent type theory

    Författare :Ulf Norell; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; dependent types; type theory; metavariables; programming; pattern matching; type checking;

    Sammanfattning : Dependent type theories have a long history of being used for theorem proving. One aspect of type theory which makes it very powerful as a proof language is that it mixes deduction with computation. LÄS MER

  5. 9. Titchmarsh-Weyl M-function asymptotics and some results in the inverse spectral theory for vector-valued Sturm-Liouville equations and a certain higher order ordinary differential equation

    Författare :Erik Andersson; Matematik (naturvetenskapliga fakulteten); []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Functions; differential equations; Funktioner; differentialekvationer; Paley-Wiener.; The generalized Fourier transform; A certain higher order ordinary differential equation; Borg-Marchenko theorems; Vector-valued Sturm-Liouville equations; Inverse spectral theory; Titchmarsh-Weyl M-function asymptotics; Asymptotics of solutions; Spectral measure;

    Sammanfattning : This discourse is constituted by two separate reprots, where the first one offers an elementary deduction of the leading order term asymptotics for the Titchmarsh-Weyl M-function corresponding to a vector-valued Sturm-Liouville equation of the form -(PU')'+QU=zu, xin[0,b), with P^{-1},W,Q being hermitean with locally integrable entries; and under some additional conditions on P^{-1} and W. In the special case of P=W=I, we give some further asymptotic results for the same M-function. LÄS MER

  7. 10. Reflection Principles in Computational Logic

    Författare :Pierangelo Dell'Acqua; Jonas Barklund; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Datalogi; Computing Science;

    Sammanfattning : We introduce the concept of reflection principles as a knowledge representation paradigm in a computational logic setting. Reflection principles are expressed as certain kinds of logic schemata intended to capture the basic properties of the domain knowledge to be modelled. LÄS MER