The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic...
Traditionally, the classes in thematic maps have been treated as crisp sets, using classical set theory. In this formulation, map classes are assumed to be mutually exclusive and e...
A DO model (here also referred to a Paris model) is a model M of set theory all of whose ordinals are first order definable in M. Jeffrey Paris (1973) initiated the study of DO mo...
In rough set theory, the problem of feature selection aims to retain the discriminatory power of original features. Many feature selection algorithms have been proposed, however, q...
Motivated by questions in stability theory for hybrid dynamical systems, we establish some fundamental properties of the set of solutions to such systems. Using the notion of a hy...