Sökning: "first-order logic"

Visar resultat 16 - 20 av 38 avhandlingar innehållade orden first-order logic.

  1. 16. Achieving completeness: from constructive set theory to large cardinals

    Författare :Christian Espíndola; Erik Palmgren; Benno van den Berg; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematics; matematik;

    Sammanfattning : This thesis is an exploration of several completeness phenomena, both in the constructive and the classical settings. After some introductory chapters in the first part of the thesis where we outline the background used later on, the constructive part contains a categorical formulation of several constructive completeness theorems available in the literature, but presented here in an unified framework. LÄS MER

  3. 17. Lightweight verification of functional programs

    Författare :Nicholas Smallbone; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : We have built several tools to help with testing and verifying functional programs. All three tools are based on QuickCheck properties. Our goal is to allow programmers to do more with QuickCheck properties than just test them. LÄS MER

  4. 18. Reasoning with Bounded Cognitive Resources

    Författare :Abdul Rahim Nizamani; Göteborgs universitet; []
    Nyckelord :SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Artificial general intelligence; logical reasoning; inductive learning; proof systems; bounded cognitive resources; cognitive modeling;

    Sammanfattning : Reasoning is an essential element of intelligence. Automated reasoning in formal and symbolic systems is a major topic in computer science and artificial intelligence (AI). Programs for computer-assisted and automated theorem proving are being constructed and used by mathematicians and logicians. LÄS MER

  5. 19. Contributions to the Metamathematics of Arithmetic: Fixed Points, Independence, and Flexibility

    Författare :Rasmus Blanck; Göteborgs universitet; []
    Nyckelord :HUMANIORA; HUMANITIES; NATURVETENSKAP; NATURAL SCIENCES; arithmetic; incompleteness; flexibility; independence; non-standard models; partial conservativity; interpretability;

    Sammanfattning : This thesis concerns the incompleteness phenomenon of first-order arithmetic: no consistent, r.e. theory T can prove every true arithmetical sentence. The first incompleteness result is due to Gödel; classic generalisations are due to Rosser, Feferman, Mostowski, and Kripke. LÄS MER

  7. 20. Stability theory in finite variable logic

    Författare :Marko Djordjevic; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematics; MATEMATIK; MATHEMATICS; MATEMATIK; Mathematics; Matematik;

    Sammanfattning : This thesis studies finite variable theories. To be more precise. complete Ln -theories, where Ln is the set of formulas in a first order language L in which at most n distinct variables occur. These need not be complete in the usual first order sense. LÄS MER