Search for dissertations about: "Tableaux"

Showing result 1 - 5 of 14 swedish dissertations containing the word Tableaux.

  2. 1. Monodrama, attitudes, tableaux vivants : ‡b studies on some trends of theatrical fashion 1770-1815

    Author : Kirsten Gram Holmström; Stockholms universitet; []
    Keywords : ;

    Abstract : .... READ MORE

  4. 2. Stålmarck's Method for Automated Theorem Proving in First Order Logic

    Author : Magnus Björk; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; automated theorem proving; Stålmarck s method; tableaux; first order logic;

    Abstract : We present an extension of Stålmarck's method to classical first order predicate logic. Stålmarck's method is a satisfiability checking method for propositional logic, and it resembles tableaux and KE. Its most distinctive feature is the dilemma rule, which is an extended branching rule, that allows branches to be recombined. READ MORE

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

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

    Abstract : 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. READ MORE

  6. 4. Truth and Proof in the Long Run: Essays on Trial and-Error Logics

    Author : Martin Kaså; Göteborgs universitet; []
    Keywords : HUMANIORA; HUMANITIES; NATURVETENSKAP; NATURAL SCIENCES; convergence; dynamic meaning; experimental logics; knowable consistency; tableaux systems; trial-and-error;

    Abstract : The theme of this book is convergence. For many philosophical representations of the evolution of theories, as well as representations of the meaning of the language used to express these theories, it has been essential that there exists some kind of convergence. READ MORE

  7. 5. Limit shapes of standard Young tableaux and sorting networks via the Edelman-Greene correspondence

    Author : Samu Potka; Svante Linusson; Niklas Eriksen; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Mathematics; Matematik;

    Abstract : This thesis consists of the following two articles.New properties of the Edelman–Greene bijection. Edelman and Greene constructed a correspondence between reduced words of the reverse permutation and standard Young tableaux. READ MORE