Add to ORKGthis paper. In this paper A, B denote non empty sets and X denotes a set. In this article we present several logical schemes. The scheme Fraenkel5' deals with a non empty set A; a unary functor F yielding a set, and two unary predicates P ; Q; and states that
Six definitions of a finite set are studied; and each implication between the definitions is shown t...
We prove that in the category of sets and relations, it is possible to describe functions in purely ...
AbstractStudied are Kleisli categories of monads of sets which satisfy two properties motivated by f...
this paper. In this paper B is a non empty set and A, C, X are sets. In this article we present seve...
Summary. We deal with a non–empty set of functions and a non– empty set of functions from a set A to...
and terminology for this paper. Let X be a set and let Y be a subset of 2 X. Then � Y is a subset of...
Set domains are intended to give semantics to a data type of sets together with a wide range of usef...
An analysis of the well known paradoxes found in intuitive set theory has led to the reconstruction ...
Several approaches to logical specification of functions are compared. Main attention is paid to LPT...
Summary. In this paper we define binary and unary operations on domains. We also define the followin...
In [2] we proposed the integration of finite domain (FD) constraints into the func-tional logic prog...
In this paper we shall meet the application of Scott domains to nominalisation and explain its probl...
We present a set-theoretic, proof-irrelevant model for Calculus ofConstructions (CC) with predicativ...
Default domain theory is a framework for representing and reasoning about commonsense knowledge. Alt...
An attractive principle about domains of quantification is the analogue of the Separation Axiom in s...
Six definitions of a finite set are studied; and each implication between the definitions is shown t...
We prove that in the category of sets and relations, it is possible to describe functions in purely ...
AbstractStudied are Kleisli categories of monads of sets which satisfy two properties motivated by f...
this paper. In this paper B is a non empty set and A, C, X are sets. In this article we present seve...
Summary. We deal with a non–empty set of functions and a non– empty set of functions from a set A to...
and terminology for this paper. Let X be a set and let Y be a subset of 2 X. Then � Y is a subset of...
Set domains are intended to give semantics to a data type of sets together with a wide range of usef...
An analysis of the well known paradoxes found in intuitive set theory has led to the reconstruction ...
Several approaches to logical specification of functions are compared. Main attention is paid to LPT...
Summary. In this paper we define binary and unary operations on domains. We also define the followin...
In [2] we proposed the integration of finite domain (FD) constraints into the func-tional logic prog...
In this paper we shall meet the application of Scott domains to nominalisation and explain its probl...
We present a set-theoretic, proof-irrelevant model for Calculus ofConstructions (CC) with predicativ...
Default domain theory is a framework for representing and reasoning about commonsense knowledge. Alt...
An attractive principle about domains of quantification is the analogue of the Separation Axiom in s...
Six definitions of a finite set are studied; and each implication between the definitions is shown t...
We prove that in the category of sets and relations, it is possible to describe functions in purely ...
AbstractStudied are Kleisli categories of monads of sets which satisfy two properties motivated by f...