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 19 of 19 for “"reverse mathematics"”.

  1. Reverse Mathematics of Ramsey's Theorem

    Reverse mathematics aims to determine which set theoretic axioms are necessary to prove the theorems outside of the set theory. Since the 1970’s, there has been an interest in applying reverse mathematics to study combinatorial principles like Ramsey’s theorem to analyze its strength and relation …

    csusb Repository record for Reverse Mathematics of Ramsey's Theorem (opens in a new tab)

  2. Well-Ordering Principles across Reverse Mathematics

    In this thesis, we use the means of reverse mathematics in order to study the proof-theoretic strength of several principles involving well orders and well partial orders. The strengths of our considered statements cover each of the Big Five, the most prominent systems of reverse mathematics, as …

    wurz-thes Repository record for Well-Ordering Principles across Reverse Mathematics (opens in a new tab)

  3. Classical Theorems in Reverse Mathematics and Higher Recursion Theory

    … classical theorems from the view point of reverse mathematics and higher recursion theory. These classical theorems include the existence of a proper d-r.e. degree, Friedberg numbering and the Kechris-Woodin rank of everywhere differentiable functions.

    nus Repository record for Classical Theorems in Reverse Mathematics and Higher Recursion Theory (opens in a new tab) Download file for Classical Theorems in Reverse Mathematics and Higher Recursion Theory (opens in a new tab)

  4. TURNING DEGREES CONSTRUCTIONS AND THEIR INDUCTION STRENGTH IN REVERSE MATHEMATICS

    … computability theory (recursion Theory) and reverse recursion theory. In the first part, we prove that P + \Sigma_1 Induction proves the existence of isolated d.c.e. degrees and upper isolated d.c.e. degrees. We also prove that P + \Sigma_3 Induction verifies the existence of \Omega-c.e. …

    nus Repository record for TURNING DEGREES CONSTRUCTIONS AND THEIR INDUCTION STRENGTH IN REVERSE MATHEMATICS (opens in a new tab) Download file for TURNING DEGREES CONSTRUCTIONS AND THEIR INDUCTION STRENGTH IN REVERSE MATHEMATICS (opens in a new tab)

  5. SOME RESULTS ABOUT HINDMAN'S THEOREM AND GOWERS' THEOREM IN REVERSE MATHEMATICS.

    This thesis focuses on two theorems related to combinatorics: Hindman's Theorem and Gowers' Theorem (which can be regarded as a generalization of Hindman's Theorem). They are both about the coloring on a semigroup: giving a coloring function on a certain semigroup, there exists an infinite subset …

    nus Repository record for SOME RESULTS ABOUT HINDMAN'S THEOREM AND GOWERS' THEOREM IN REVERSE MATHEMATICS. (opens in a new tab) Download file for SOME RESULTS ABOUT HINDMAN'S THEOREM AND GOWERS' THEOREM IN REVERSE MATHEMATICS. (opens in a new tab)

  6. At the limits of predicativity: the reverse mathematics of ordering relations

    … We analyse those statements using methods from reverse mathematics and ordinal analysis: in most situations, we work in subsystems that are at least strong enough to prove arithmetical transfinite recursion. One example is that of a theorem by Dushnik and Miller, which states that a countable …

    wurz-thes Repository record for At the limits of predicativity: the reverse mathematics of ordering relations (opens in a new tab)

  7. On The Complexity Of Mathematical Problems: Medvedev Degrees And Reverse Mathematics

    … from two perspectives: Medvedev degrees and reverse mathematics. In the Medvedev degrees, we calculate the complexity of its first-order theory, and we also calculate the complexities of the first-order theories of several related structures. We characterize the join-irreducible Medvedev …

    cornell Repository record for On The Complexity Of Mathematical Problems: Medvedev Degrees And Reverse Mathematics (opens in a new tab)

  8. An Introduction to Reverse Mathematics Through the Weakened Base System RCA_0^*.

    The purpose of reverse mathematics, a field of mathematical logic, is to determine which axioms are required to prove particular mathematical theorems. Gödel's first incompleteness theorem states that within any standard consistent formal system of mathematics, there are statements for which …

    boise Repository record for An Introduction to Reverse Mathematics Through the Weakened Base System RCA_0^*. (opens in a new tab)

  9. The reverse mathematics of elementary recursive nonstandard analysis: a robust contribution to the foundations of mathematics

    Reverse Mathematics (RM) is a program in the Foundations of Mathematics founded by Harvey Friedman in the Seventies ([17, 18]). The aim of RM is to determine the minimal axioms required to prove a certain theorem of ‘ordinary’ mathematics. In many cases one observes that these minimal axioms are …

    ghent Repository record for The reverse mathematics of elementary recursive nonstandard analysis: a robust contribution to the foundations of mathematics (opens in a new tab)

  10. Calibrating the complexity of combinatorics: reverse mathematics and Weihrauch degrees of some principles related to Ramsey’s theorem

    … these principles from the points of view of reverse mathematics and Weihrauch complexity. We start by studying a combinatorial principle concerning graphs, introduced by Bill Rival and Ivan Sands as a form of ``inside-outside'' Ramsey's theorem: we will determine its reverse mathematical …

    whiterose Download PDF for Calibrating the complexity of combinatorics: reverse mathematics and Weihrauch degrees of some principles related to Ramsey’s theorem (opens in a new tab)

  11. Formalizing constructive analysis: A comparison of minimal systems and a study of uniqueness principles

    … of the relatively new field of constructive reverse mathematics. This work contributes to a clearer picture. Part 1 contains a precise comparison of the two most widely used systems which formalize the common core of constructive, intuitionistic, recursive and classical analysis, namely …

    greece Repository record for Formalizing constructive analysis: A comparison of minimal systems and a study of uniqueness principles (opens in a new tab)

  12. Type-Two Well-Ordering Principles, Admissible Sets, and Pi^1_1-Comprehension

    … from ordinal analysis to "abstract" notions from reverse mathematics and set theory. A type-one well-ordering principle is a map T which transforms each well-order X into another well-order T[X]. If T is particularly uniform then it is called a dilator (due to Girard). Our Bachmann-Howard …

    whiterose Download PDF for Type-Two Well-Ordering Principles, Admissible Sets, and Pi^1_1-Comprehension (opens in a new tab)

  13. Decidability in the Hyperdegrees and a Theorem of Hyperarithmetic Analysis

    … of the theory of the hyperdegrees, and the reverse mathematics of a result in graph theory. For the first, we show the $\Sigma_{2}$ theory of the hyperdegrees as an upper-semilattice is decidable, as is the $\Sigma_{2}$ theory of the hyperdegrees below Kleene's $\mathcal{O}$ as an …

    cornell Repository record for Decidability in the Hyperdegrees and a Theorem of Hyperarithmetic Analysis (opens in a new tab)

  14. Measuring the Relative Complexity of Mathematical Constructions and Theorems

    … the frameworks of computable reducibilities and reverse mathematics. First, we study the computational content of various theorems with reverse mathematical strength around Arithmetical Transfinite Recursion ($\mathsf{ATR}_0$) from the point of view of computable reducibilities, in particular …

    cornell Repository record for Measuring the Relative Complexity of Mathematical Constructions and Theorems (opens in a new tab)

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

    … context of proof theory - more precisely, in reverse mathematics and constructive mathematics. Reversed mathematics, proposed by Harvey Friedman, aims to classify the strength of mathematical theorems by identifying the required axioms. In this framework, we focus on two classical results …

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

  16. Connecting the two worlds: well-partial-orders and ordinal notation systems

    … of orders: computer science, proof theory, reverse mathematics, algebra, combinatorics, etc. The maximal order type of a well-partial-order characterizes that order’s strength. Moreover, in many natural cases, a well-partial-order’s maximal order type can be represented by an ordinal …

    ghent Repository record for Connecting the two worlds: well-partial-orders and ordinal notation systems (opens in a new tab)

  17. Semilinear order property and infinite games

    … orden y el programa de la Matemática inversa (Reverse Mathematics). En primer lugar, se obtienen pruebas directas, formalizables en la Aritmética de segundo orden, de la determinación de los juegos de Lipschitz y Wadge para los primeros niveles de la Jerarquía de diferencias de Hausdorff. A …

    sevilla Repository record for Semilinear order property and infinite games (opens in a new tab)

  18. Sets, Models, And Proofs: Topics In The Theory Of Recursive Functions

    … in work spanning two chapters, we calibrate the reverse-mathematical strength of a number of theorems of basic model theory, such as the Ryll-Nardzewski atomic-model theorem, Vaught's no-two-model theorem, Ehrenfeucht's three-model theorem, and the existence theorems for homogeneous and saturated …

    cornell Repository record for Sets, Models, And Proofs: Topics In The Theory Of Recursive Functions (opens in a new tab)