Sökning: "First-Order Logic"

Visar resultat 1 - 5 av 34 avhandlingar innehållade orden First-Order Logic.

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

    Detta är en avhandling från Uppsala : Teologiska institutionen

    Författare :Anders Kraal; Uppsala universitet.; [2010]
    Nyckelord :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;

    Sammanfattning : 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. LÄS MER

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

    Detta är en avhandling från Gothenburg : Chalmers tekniska högskola

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

    Sammanfattning : 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. LÄS MER

  3. 3. Deductive Program Analysis with First-Order Theorem Provers

    Detta är en avhandling från Gothenburg : Chalmers tekniska högskola

    Författare :Simon Robillard; [2019]
    Nyckelord :HUMANIORA; HUMANITIES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Automated theorem proving; Program semantics; Program Verification; Program analysis; Automated reasoning; First-order logic;

    Sammanfattning : Software is ubiquitous in nearly all aspects of human life, including safety-critical activities. It is therefore crucial to analyze programs and provide strong guarantees that they perform as expected. LÄS MER

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

    Detta är en avhandling från Gothenburg : Chalmers tekniska högskola

    Författare :Evgenii Kotelnikov; [2016]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; first-order logic; program analysis; program verification; TPTP; automated theorem proving; Vampire;

    Sammanfattning : 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. LÄS MER

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

    Detta är en avhandling från Göteborg : Chalmers University of Technology

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

    Sammanfattning : .... LÄS MER