Sökning: "logical"

Visar resultat 6 - 10 av 334 avhandlingar innehållade ordet logical.

  1. 6. To infinity and back : Logical limit laws and almost sure theories

    Författare :Ove Ahlman; Vera Koponen; Kerkko Luosto; Uppsala universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; finite model theory; almost sure theories; rigid structures; limit laws; Mathematical Logic; Matematisk logik;

    Sammanfattning : .... LÄS MER

  2. 7. A logical specification of federated information systems

    Författare :Magnus Boman; Stockholms universitet; []
    Nyckelord :SOCIAL SCIENCES; SAMHÄLLSVETENSKAP; SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; Distribuerad databehandling; Logik;

    Sammanfattning : .... LÄS MER

  3. 8. An implementation of Martin-Löf's logical framework

    Författare :Lena Magnusson; Chalmers University of Technology; []
    Nyckelord :;

    Sammanfattning : .... LÄS MER

  4. 9. The Logical Structure of the Moral Concepts : An Essay in Propositional Deontic Logic

    Författare :Karl Pettersson; Erik Carlson; Kent Hurtig; Sven Ove Hansson; Uppsala universitet; []
    Nyckelord :HUMANITIES; HUMANIORA; HUMANIORA; HUMANITIES; deontic logic; standard deontic logic SDL ; deontic paradoxes; non-Kripkean modal logic; moral dilemmas; supererogation; Hector-Neri Castañeda; practitions; dyadic deontic logic; Practical philosophy; Praktisk filosofi; Praktisk filosofi; Practical Philosophy;

    Sammanfattning : In this thesis, the main focus is on deontic logic as a tool for formal representation of moral reasoning in natural language. The simple standard system of deontic logic (SDL), i.e. LÄS MER

  5. 10. Type Theory with First-Order Data Types and Size-Change Termination

    Författare :David Wahlstedt; Chalmers University of Technology; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Pattern-matching; Reducibility; Size-Change Termination; Logical Framework; Lambda-calculus; Term rewriting.; Type Theory; Dependent types; Normalization; Type system;

    Sammanfattning : We prove normalization for a dependently typed lambda-calculus extended with first-order data types and computation schemata for first-order size-change terminating recursive functions. Size-change termination, introduced by C.S. Lee, N. LÄS MER