Add to ORKGDie Eigenschaft von Ramsey wird in der reversen Mathematik genutzt, um die Stärke von Teilsystemen der Zahlentheorie der schwachen zweiten Stufe zu vergleichen. Wir zeigen, dass ein Teilsystem, dessen Stärke durch autonom iterierte Ramseyness bestimmt wird, beweistheoretisch äquivalent ist zu Pi-1-2-Komprehension. The property of Ramsey is used in reverse mathematics to compare the strength of subsystems of second order arithmetic. We show that a subsystem defined by autonomous iterated Ramseyness is prooftheoretically equivalent to Pi-1-2-comprehension
Abstract. In this paper, we propose a weak regularity principle which is similar to both weak König...
The No Counterexample Interpretation (NCI) and other proof-theoretic techniques are applied to a pr...
Abstract. Ramsey quantifiers are a natural object of study not only for logic and computer science, ...
1. Reverse mathematics of the property of Ramsey........... 7 1.1 The property of Ramsey...............
Reverse Mathematics seeks to find the minimal set existence or comprehension axioms needed to prove ...
Reverse Mathematics seeks to find the minimal set existence or comprehension axioms needed to prove ...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
PhD thesis, 268 pagesIn this thesis, we investigate the computational content and the logical streng...
PhD thesis, 268 pagesIn this thesis, we investigate the computational content and the logical streng...
We give the Π^0_2-part, the Π^0_3-part and the Π^0_4-part of RT^2_2 and related combinatorialprincip...
We study, in the context of reverse mathematics, the strength of Ramseyan factorization theorem (RF^...
We produce a first order proof of a famous combinatorial result, Ramsey Theorem for pairs and in two...
In this thesis, we study the proof-theoretical and computational strength of some combinatorial prin...
The computability-theoretic and reverse mathematical aspects of various combinatorial principles, su...
Abstract. In this paper, we propose a weak regularity principle which is similar to both weak König...
The No Counterexample Interpretation (NCI) and other proof-theoretic techniques are applied to a pr...
Abstract. Ramsey quantifiers are a natural object of study not only for logic and computer science, ...
1. Reverse mathematics of the property of Ramsey........... 7 1.1 The property of Ramsey...............
Reverse Mathematics seeks to find the minimal set existence or comprehension axioms needed to prove ...
Reverse Mathematics seeks to find the minimal set existence or comprehension axioms needed to prove ...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
PhD thesis, 268 pagesIn this thesis, we investigate the computational content and the logical streng...
PhD thesis, 268 pagesIn this thesis, we investigate the computational content and the logical streng...
We give the Π^0_2-part, the Π^0_3-part and the Π^0_4-part of RT^2_2 and related combinatorialprincip...
We study, in the context of reverse mathematics, the strength of Ramseyan factorization theorem (RF^...
We produce a first order proof of a famous combinatorial result, Ramsey Theorem for pairs and in two...
In this thesis, we study the proof-theoretical and computational strength of some combinatorial prin...
The computability-theoretic and reverse mathematical aspects of various combinatorial principles, su...
Abstract. In this paper, we propose a weak regularity principle which is similar to both weak König...
The No Counterexample Interpretation (NCI) and other proof-theoretic techniques are applied to a pr...
Abstract. Ramsey quantifiers are a natural object of study not only for logic and computer science, ...