AbstractBöhm (1968) conjectured that the range of a combinator is either a singleton or an infinite set. The conjecture was proved independently by Myhill and the author. A proof is presented in Barendregt (1984) in a powerful – but somewhat difficult to understand – topological formulation due to Visser (1980). Dirk van Dalen remarked that the proof of the conjecture is not constructive. In this paper we first present some unsuccessful attempts to prove the conjecture, including the motivation given by Böhm. Then we present the proof as originally given by Barendregt and Myhill and we sketch the topological proof of Visser. After that we give two constructive proofs of the conjecture. The first one closely follows the original motivation b...
We develop general methods to obtain fast (polynomial time) estimates of the cardinality of a combin...
The lifting theorem of Valdivia concerning (pre) compact sets and convergent (respectively, Cauchy) ...
The aim of this paper is to obtain the range set for a given multiobjective linear programming probl...
AbstractBöhm (1968) conjectured that the range of a combinator is either a singleton or an infinite ...
AbstractA sketch of the proof is given for an open problem, the range property for H: the range of a...
Contains fulltext : 13260.pdf (publisher's version ) (Open Access
Calculi, Types and Applications: Essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi D...
International audienceRecently, A. Polonsky has shown that the range property fails for H. We give h...
In set theory [1], two sets are considered to have the same cardinality, if a one-to-one corresponde...
Abstract. The range allocation problem was recently introduced as part of an efficient decision proc...
Recently, A. Polonsky has shown that the range property fails for H. We givehere some conditions on ...
Abstract. H. X. Yi’s construction of unique range sets for entire functions is translated to the num...
We define combinatorial principles which unify and extend the classical results of Steinhaus and Pic...
We define combinatorial principles which unify and extend the classical results of Steinhaus and Pic...
Combinatorics is the branch of mathematics studying the enumeration of sets of elements. It includes...
We develop general methods to obtain fast (polynomial time) estimates of the cardinality of a combin...
The lifting theorem of Valdivia concerning (pre) compact sets and convergent (respectively, Cauchy) ...
The aim of this paper is to obtain the range set for a given multiobjective linear programming probl...
AbstractBöhm (1968) conjectured that the range of a combinator is either a singleton or an infinite ...
AbstractA sketch of the proof is given for an open problem, the range property for H: the range of a...
Contains fulltext : 13260.pdf (publisher's version ) (Open Access
Calculi, Types and Applications: Essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi D...
International audienceRecently, A. Polonsky has shown that the range property fails for H. We give h...
In set theory [1], two sets are considered to have the same cardinality, if a one-to-one corresponde...
Abstract. The range allocation problem was recently introduced as part of an efficient decision proc...
Recently, A. Polonsky has shown that the range property fails for H. We givehere some conditions on ...
Abstract. H. X. Yi’s construction of unique range sets for entire functions is translated to the num...
We define combinatorial principles which unify and extend the classical results of Steinhaus and Pic...
We define combinatorial principles which unify and extend the classical results of Steinhaus and Pic...
Combinatorics is the branch of mathematics studying the enumeration of sets of elements. It includes...
We develop general methods to obtain fast (polynomial time) estimates of the cardinality of a combin...
The lifting theorem of Valdivia concerning (pre) compact sets and convergent (respectively, Cauchy) ...
The aim of this paper is to obtain the range set for a given multiobjective linear programming probl...