Search for dissertations about: "first-order logic"

Showing result 1 - 5 of 30 swedish dissertations containing the words first-order logic.

  1. 1. First-Order Logic and Classical Theism : Toward Logical Reorientation

    University dissertation from Uppsala : Teologiska institutionen

    Author : Anders Kraal; Uppsala universitet.; [2010]
    Keywords : HUMANIORA; HUMANITIES; classical theism; divine simplicity; divine attributes; God; Augustine; Thomas Aquinas; first-order logic; formalization; argument-function analysis; quantifier analysis; bivalence; natural deduction; truth-bearer; inference; inference rule; logical validity; logical pluralism; logical monism; G. Frege; B. Russell; L. Wittgenstein; R. Carnap; J. Maritain; J. Salamucha; J. Bocheński; W.V.O. Quine.; HUMANITIES and RELIGION Religion Theology; HUMANIORA och RELIGIONSVETENSKAP Religionsvetenskap Teologi;

    Abstract : This inquiry seeks an answer to the question whether classical theistic doctrines about the nature of God are amenable to formal analysis in terms of standard first-order logic. It is argued that due to the conceptual impact of classical theism’s doctrine of divine simplicity there is a good reason for answering this question in the negative. READ MORE

  2. 2. Automated Theorem Proving with Extensions of First-Order Logic

    University dissertation from ; Chalmers tekniska högskola; Gothenburg

    Author : Evgenii Kotelnikov; [2018]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; clausal normal form; Program Verification; automated theorem proving; program analysis; TPTP; Vampire; first-order logic;

    Abstract : Automated theorem provers are computer programs that check whether a logical conjecture follows from a set of logical statements. The conjecture and the statements are expressed in the language of some formal logic, such as first-order logic. READ MORE

  3. 3. Automated Theorem Proving in a First-Order Logic with First class Boolean Sort

    University dissertation from ; Chalmers tekniska högskola; Gothenburg

    Author : Evgenii Kotelnikov; [2016]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; first-order logic; program analysis; program verification; TPTP; automated theorem proving; Vampire;

    Abstract : Automated theorem proving is one of the central areas of computer mathematics. It studies methods and techniques for establishing validity of mathematical problems using a computer. The problems are expressed in a variety of formal logics, including first-order logic. READ MORE

  4. 4. Satisfaction classes in nonstandard models of first-order arithmetic

    University dissertation from Göteborg : Chalmers University of Technology

    Author : Fredrik Engström; Göteborgs universitet.; Gothenburg University.; [2002]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; satisfaction classes; models of arithmetic;

    Abstract : .... READ MORE

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

    University dissertation from Göteborg : Chalmers University of Technology

    Author : Magnus Björk; [2006]
    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