AbstractWe analyse here on a concrete combinatorial example the intuitionistic content of an argument which uses classical logic on infinite sequences. This analysis is carried out in the framework of inductive definitions, and provides an alternative proof of one of the main result of Veldman and Bezem (1991). Some connections with Fourman's (1984) constructive analysis of “potentially infinite objects” are sketched
In 1996, Krivine applied Friedman’s A-translation in order to get an intuitionistic version of Gödel...
Intuitive Set Theory (IST) is defined as the theory we get, when we add Axiom of Monotonicity and Ax...
The infinite Ramsey theorem is known to be equivalent to the state-ment ‘for every set X and natural...
AbstractWe analyse here on a concrete combinatorial example the intuitionistic content of an argumen...
We produce a first order proof of a famous combinatorial result, Ramsey Theorem for pairs and in two...
The purpose is to study the strength of Ramsey's Theorem for pairs restricted to recursive assignmen...
The two axioms which define intuitive set theory, Axiom of Combinatorial Sets and Axiom of Infinites...
Reverse mathematics aims to determine which set theoretic axioms are necessary to prove the theorems...
International audienceRamsey's theorem states that for any coloring of the n-element subsets of N wi...
We use the framework of reverse mathematics to address the question of, given a mathematical problem...
In this paper intuitionistic set theory INC# in infinitary set theoretical language is considered. ...
At first sight, the argument which F.P. Ramsey gave for (the infinite case of) his famous theorem f...
International audienceWe present Intuitionistic Combinatorial Proofs (ICPs), a concrete geometric se...
International audienceRamsey's theorem for n-tuples and k-colors (RT n k) asserts that every k-color...
AbstractThis paper presents a soundness and completeness proof for propositional intuitionistic calc...
In 1996, Krivine applied Friedman’s A-translation in order to get an intuitionistic version of Gödel...
Intuitive Set Theory (IST) is defined as the theory we get, when we add Axiom of Monotonicity and Ax...
The infinite Ramsey theorem is known to be equivalent to the state-ment ‘for every set X and natural...
AbstractWe analyse here on a concrete combinatorial example the intuitionistic content of an argumen...
We produce a first order proof of a famous combinatorial result, Ramsey Theorem for pairs and in two...
The purpose is to study the strength of Ramsey's Theorem for pairs restricted to recursive assignmen...
The two axioms which define intuitive set theory, Axiom of Combinatorial Sets and Axiom of Infinites...
Reverse mathematics aims to determine which set theoretic axioms are necessary to prove the theorems...
International audienceRamsey's theorem states that for any coloring of the n-element subsets of N wi...
We use the framework of reverse mathematics to address the question of, given a mathematical problem...
In this paper intuitionistic set theory INC# in infinitary set theoretical language is considered. ...
At first sight, the argument which F.P. Ramsey gave for (the infinite case of) his famous theorem f...
International audienceWe present Intuitionistic Combinatorial Proofs (ICPs), a concrete geometric se...
International audienceRamsey's theorem for n-tuples and k-colors (RT n k) asserts that every k-color...
AbstractThis paper presents a soundness and completeness proof for propositional intuitionistic calc...
In 1996, Krivine applied Friedman’s A-translation in order to get an intuitionistic version of Gödel...
Intuitive Set Theory (IST) is defined as the theory we get, when we add Axiom of Monotonicity and Ax...
The infinite Ramsey theorem is known to be equivalent to the state-ment ‘for every set X and natural...
DOI
Add to ORKG