𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finite set theory and its application to cryptology

✍ Scribed by Cao Zhenfu

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
240 KB
Volume
51
Category
Article
ISSN
0378-3758

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Substandard models of finite set theory
Substandard models of finite set theory
✍ Laurence Kirby πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 152 KB

## Abstract A survey of the isomorphic submodels of __V__~Ο‰~, the set of hereditarily finite sets. In the usual language of set theory, __V__~Ο‰~ has 2^β„΅^0 isomorphic submodels. But other set‐theoretic languages give different systems of submodels. For example, the language of adjunction allows only

Non Standard Regular Finite Set Theory
Non Standard Regular Finite Set Theory
✍ Stefano Baratella; Ruggero Ferro πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 695 KB

We propose a set theory, called NRFST, in which the Cantorian axiom of infinity is negated, and a new notion of infinity is introduced via non standard methods, i . e . via adequate notions of standard and internal, two unary predicates added to the language of ZF. After some initial results on NRFS

Reduction method for concept lattices ba
Reduction method for concept lattices based on rough set theory and its application
✍ Min Liu; Mingwen Shao; Wenxiu Zhang; Cheng Wu πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 625 KB

Rough set theory and formal concept analysis are two complementary mathematical tools for data analysis. In this paper, we study the reduction of the concept lattices based on rough set theory and propose two kinds of reduction methods for the above concept lattices. First, we present the sufficient