RAMSEY’S THEOREM FOR PAIRS ANDKCOLORS AS A SUB-CLASSICAL PRINCIPLE OF ARITHMETIC

DOI10.1017/jsl.2016.41zbMath1419.03055arXiv1601.01891OpenAlexW2964223866MaRDI QIDQ4977228

Stefano Berardi, Silvia Steila

Publication date: 3 August 2017

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.01891

zbMATH Keywords

Ramsey's theoremintuitionistic arithmeticprinciple of omniscience

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Intuitionistic mathematics (03F55)

Related Items (1)

Refining the arithmetical hierarchy of classical principles

Cites Work

• An intuitionistic version of Ramsey's theorem and its use in program termination
• Ramsey's theorem for pairs and provably recursive functions
• Ramsey methods in analysis
• On uniform relationships between combinatorial problems
• Stop When You Are Almost-Full
• Ramsey Theorem for Pairs As a Classical Principle in Intuitionistic Arithmetic
• ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM
• The size-change principle for program termination
• An Intuitionistic Analysis of Size-change Termination
• Ramsey's theorem and recursion theory
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: RAMSEY’S THEOREM FOR PAIRS ANDKCOLORS AS A SUB-CLASSICAL PRINCIPLE OF ARITHMETIC