Add to ORKGWe discuss the computational content of various choice principles and theorems using them. As a case study, we describe the computational content of Nash-Williams' proof of Higman's Lemma, which uses the axiom of countable choice in combination with classical logic. Our formal system for the extraction of computational content from proofs is a realizability interpretation of an intuitionistic theory of inductive and coinductive definitions as implemented in the Minlog system
This essay describes an approach to constructive mathematics based on abstract i.e. axiomatic mathem...
We present a possible computational content of the negative translation of classical analysis with t...
Abstract. We present a framework for classical realizability that contains both Krivine’s classical ...
We present a possible computational content of the negative translation of classical analysis with t...
A choice function is a rule that chooses a single alternative from every set of alternatives drawn f...
International audienceThis paper is an introduction to recent works in realizability, mainly Krivine...
In this thesis, we explore three aspects of the computational content of proofs. These are: a compu...
Recently, Coquand and Palmgren considered systems of intuitionistic arithmetic in all finite types t...
Veldman proved that the contrapositive of countable binary choice is a theorem of full-fledged intui...
Abstract—Martin-Löf’s type theory has strong existential elim-ination (dependent sum type) that allo...
This paper is an introduction to recent works in realizability, mainly Krivine’s work to realize the...
In this paper we study a new approach to classify mathematical theorems ac- cording to their comput...
Formally, the orthodox rational agent#s #Olympian# choices ([14], p.19) are made in a static framewo...
Contains fulltext : 13251.pdf (publisher's version ) (Open Access
International audienceWe will give a survey of some results in realizability including: * basic noti...
This essay describes an approach to constructive mathematics based on abstract i.e. axiomatic mathem...
We present a possible computational content of the negative translation of classical analysis with t...
Abstract. We present a framework for classical realizability that contains both Krivine’s classical ...
We present a possible computational content of the negative translation of classical analysis with t...
A choice function is a rule that chooses a single alternative from every set of alternatives drawn f...
International audienceThis paper is an introduction to recent works in realizability, mainly Krivine...
In this thesis, we explore three aspects of the computational content of proofs. These are: a compu...
Recently, Coquand and Palmgren considered systems of intuitionistic arithmetic in all finite types t...
Veldman proved that the contrapositive of countable binary choice is a theorem of full-fledged intui...
Abstract—Martin-Löf’s type theory has strong existential elim-ination (dependent sum type) that allo...
This paper is an introduction to recent works in realizability, mainly Krivine’s work to realize the...
In this paper we study a new approach to classify mathematical theorems ac- cording to their comput...
Formally, the orthodox rational agent#s #Olympian# choices ([14], p.19) are made in a static framewo...
Contains fulltext : 13251.pdf (publisher's version ) (Open Access
International audienceWe will give a survey of some results in realizability including: * basic noti...
This essay describes an approach to constructive mathematics based on abstract i.e. axiomatic mathem...
We present a possible computational content of the negative translation of classical analysis with t...
Abstract. We present a framework for classical realizability that contains both Krivine’s classical ...
