Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 73 for “"Proof theory"”.

  1. Proof theory for higher pointclasses

    … is equivalent to comparing proof-theoretic ordinals and comparing the $\Pi^1_1$-version of consistency comparison, namely, $\Pi^1_1$-reflection comparison. In Chapter 1, I will prove that $\Sigma^1_2$-consequence comparison is equivalent to comparing the …

    cornell Repository record for Proof theory for higher pointclasses (opens in a new tab)

  2. Proof Theory of Graph Minors and Tree Embeddings

    … these theorems have been known to have very high proof-theoretic strength, but an upper bound on many of them, including the graph minor theorem, had never been proved. We give such upper bounds, by showing that any proofs in the Graph Minors series can be carried out within a system of …

    whiterose Download PDF for Proof Theory of Graph Minors and Tree Embeddings (opens in a new tab)

  3. Continuous Logic and Proof Theory for First-Order Łukasiewicz Logic

    Continuous model theory traces back to Chang and Keisler (1966) and was recently redeveloped by Yaacov et al. (2008) to study complete metric structures with applications in operator algebras and many other fields. The underlying logic is called continuous logic, which is a natural generalization …

    penn Repository record for Continuous Logic and Proof Theory for First-Order Łukasiewicz Logic (opens in a new tab)

  4. New Foundations for the Proof Theory of Bi-Intuitionistic and Provability Logics Mechanized in Coq

    … back to a fundamental problem in the axiomatic proof theory of propositional and first-order bi-intuitionistic logic: traditional Hilbert calculi are not designed to treat logics as conse- quence relations. They lead to an ambiguous notion of deduction from assumptions that can cause us to …

    anu Repository record for New Foundations for the Proof Theory of Bi-Intuitionistic and Provability Logics Mechanized in Coq (opens in a new tab)

  5. An environment theory with precomplete negation over pairs

    A formal semantics of Voda's Theory of Pairs is given which takes the natural-deduction form of Gilmore's first-order set theory. The complete proof theory corresponding to this semantics is given. Then, a logic programming system is described in the form of a computational proof theory for the …

    ubc Repository record for An environment theory with precomplete negation over pairs (opens in a new tab) Download PDF for An environment theory with precomplete negation over pairs (opens in a new tab)

  6. Hypersequent Calculi for Modal Logics

    … and examines hypersequent approaches to the proof theory of modal logics. Traditional sequent calculi for modal logics often fail to have many of the desirable properties that we expect of a sequent calculus. Cut cannot be eliminated from the system for S5, the axioms of each logic are not …

    calgary Repository record for Hypersequent Calculi for Modal Logics (opens in a new tab)

  7. Proof theoretical issues in Martin-Löf Type Theory and Homotopy Type Theory

    Homotopy Type Theory (HoTT) is a quite recent branch of research in mathematical logic, which provides interesting connections among various areas of mathematics. It was first introduced by Vladimir Voevodsky as a means to develop synthetic homotopy theory, and further advancements suggested that …

    trento Repository record for Proof theoretical issues in Martin-Löf Type Theory and Homotopy Type Theory (opens in a new tab)

  8. Proof-Theoretical Aspects of Well Quasi-Orders and Phase Transitions in Arithmetical Provability

    … well quasi-order, originally developed in order theory but nowadays transversal to many areas, in the over-all context of proof theory - more precisely, in reverse mathematics and constructive mathematics. Reversed mathematics, proposed by Harvey Friedman, aims to classify the strength of …

    trento Repository record for Proof-Theoretical Aspects of Well Quasi-Orders and Phase Transitions in Arithmetical Provability (opens in a new tab)

  9. Dagger Linear Logic and Categorical Quantum Mechanics

    This thesis develops the categorical proof theory for the non-compact multiplicative dagger linear logic, and investigates its applications to Categorical Quantum Mechanics (CQM). The existing frameworks of CQM are categorical proof theories of compact dagger linear logic, and are motivated by the …

    calgary Repository record for Dagger Linear Logic and Categorical Quantum Mechanics (opens in a new tab)

  10. Soundness and Completeness Results for the Logic of Evidence Aggregation and its Probability Semantics

    … In this thesis we do both. We also develop the proof theory for some LEA-related logics and show surprising connections between LEA-related logics and Lax Logic.

    cuny-grad Repository record for Soundness and Completeness Results for the Logic of Evidence Aggregation and its Probability Semantics (opens in a new tab)

  11. Um estudo de lógica linear com subexponenciais

    … an indefinite number of times. For example, the proof of a theorem may use the same lemma several times. However, in physical, chemical and computational systems, the situation is different: a resource cannot be reused after being consumed in one action. In Linear Logic, formulas are seen as …

    brazil-ufrn Repository record for Um estudo de lógica linear com subexponenciais (opens in a new tab)

  12. Prοοf procedure for extensional higher-order logic programming

    … model property. We propose an SLD-resolution proof procedure and we demonstrate that it is sound and complete with respect to this semantics. In this way, we extend the familiar proof theory of first-order logic programming to apply to the more general higher-order case. We then enhance our …

    greece Repository record for Prοοf procedure for extensional higher-order logic programming (opens in a new tab)

  13. Proof theoretic criteria for logical constancy

    … the non-logical. The method used is based on proof theory, and builds on the work of Prawitz, Dummett and Read. Requirements for logicality are developed based on a literature review of common philosophical use of the term, with the key factors being formality, and the absolute generality / …

    glasgow Repository record for Proof theoretic criteria for logical constancy (opens in a new tab) Download PDF for Proof theoretic criteria for logical constancy (opens in a new tab)

  14. Quillen model structures, *-autonomous categories and adherence spaces

    … twenty years ago. Originally introduced as a proof theory, two distinct semantic traditions have evolved around linear logic: the denotational semantics of linear logic, and the Geometry of Interaction. In this thesis we explore how abstract homotopy theory may be used to reconcile these …

    ottawa-retro Repository record for Quillen model structures, *-autonomous categories and adherence spaces (opens in a new tab)

  15. An investigation of logical pluralism and b-entailment

    … and Restall and Paoli’s pluralism based on proof-theory. It will be shown how 𝐵-entailment fits into these varieties of pluralism, and a discussion is presented on how 𝐵-entailment falls short is some aspects. The aim is to contribute to the discussion on logical pluralism as well as to …

    brazil-ufrn Repository record for An investigation of logical pluralism and b-entailment (opens in a new tab)

  16. ΥΠΟΣΥΣΤΗΜΑΤΑ ΤΟΥ ΒΣ1+EXP ΚΑΙ ΚΛΑΣΙΚΑ ΘΕΩΡΗΜΑΤΑ ΤΗΣ ΘΕΩΡΙΑΣ ΑΡΙΘΜΩΝ

    … OF THREE THEOREMS OF ELEMENTARY NUMBER THEORY IN ΙΔ0+EXP AND IΕ2*. WE ALSO PROVE, USING TECHNIQUES OF PROOF THEORY, A KNOWN RESULT CONCERNING END EXTENTIONS OF MODELS OF ΒΣ1+EXP. IN CHAPTER 1 WE PROVE THREE (EQUIVALENT) STATMENTS OF THE PRIME NUMBER THEOREM IN ΙΔO+EXP. THE BASIC STEP FOR …

    greece Repository record for ΥΠΟΣΥΣΤΗΜΑΤΑ ΤΟΥ ΒΣ1+EXP ΚΑΙ ΚΛΑΣΙΚΑ ΘΕΩΡΗΜΑΤΑ ΤΗΣ ΘΕΩΡΙΑΣ ΑΡΙΘΜΩΝ (opens in a new tab)

  17. Constructivisation through Induction and Conservation

    … of this thesis lies in the intersection between proof theory and algebraic logic. The main object of discussion, constructive reasoning, was introduced at the beginning of the 20th century by Brouwer, who followed Kant’s explanation of human intuition of spacial forms and time points: these are …

    trento Repository record for Constructivisation through Induction and Conservation (opens in a new tab)

  18. Some Hypergeometric Identities and Related Leonard Pairs

    … in the Askey-Wilson scheme. Consequently, the theory of Leonard pairs provides a useful framework for understanding their conjecture. In this dissertation, we present our proof of the Kresch-Tamvakis conjecture. To do so, we construct a specific Leonard pair A, A* and a related sequence of …

    portland-state Repository record for Some Hypergeometric Identities and Related Leonard Pairs (opens in a new tab)

  19. Proof Theoretic Approach to Specification Languages

    … the above mentioned features. Further, I use the proof theory of FORUM to study program equivalence for the functional core of UML, augmented with assignable variables. Using my compositional specifications in FORUM, I prove equivalence of programs that have been challenging for other …

    penn Repository record for Proof Theoretic Approach to Specification Languages (opens in a new tab)

  20. Dependently Sorted Theorem Proving for Mathematical Foundations

    … convenient automatic rewriting, and interactive proof support. By formalizing the proof theory of the DiaToM logic, we verified that the most suspicious design, namely the "formula variable", does not break the first-orderness of our logic. We assess our implementation by axiomatizing Lawvere's …

    anu Repository record for Dependently Sorted Theorem Proving for Mathematical Foundations (opens in a new tab)

Page 1 of 4