Sökning: "first-order logic"

Visar resultat 6 - 10 av 38 avhandlingar innehållade orden first-order logic.

  1. 6. Satisfaction classes in nonstandard models of first-order arithmetic

    Författare :Fredrik Engström; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; satisfaction classes; models of arithmetic; models of arithmetic;

    Sammanfattning : .... LÄS MER

  3. 7. A First Order Extension of Stålmarck's Method

    Författare :Magnus Björk; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Tableaux; Automated Theorem Proving; Stålmarck s Method;

    Sammanfattning : Stålmarck's method is an algorithm that decides validity of formulae in propositional logic. It resembles many tableaux method, but uses a special branch-and-merge-rule, called the dilemma rule. The dilemma rule creates two branches, where a formula (called the dilemma formula) is assumed to be false in one branch and true in the other one. LÄS MER

  4. 8. 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

  5. 9. Dependent Type Theory with Parameterized First-Order Data Types and Well-Founded Recursion

    Författare :David Wahlstedt; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : We present a variation of Martin-Löf's logical framework with "beta-iota-equality", extended with first-order parameterized algebraic data types and recursive pattern-matching definitions. Our contribution is a proof of normalization for the proposed system, from which we obtain decidable type-correctness. LÄS MER

  7. 10. New techniques for handling quantifiers in Boolean and first-order logic

    Författare :Peter Backeman; Philipp Rümmer; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Datavetenskap med inriktning mot inbyggda system; Computer Science with specialization in Embedded Systems;

    Sammanfattning : The automation of reasoning has been an aim of research for a long time. Already in 17th century, the famous mathematician Leibniz invented a mechanical calculator capable of performing all four basic arithmetic operators. LÄS MER