All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 6 Next

Displaying 101 – 120 of 402

Showing per page

Classes of fuzzy filters of residuated lattice ordered monoids

Jiří Rachůnek, Dana Šalounová (2010)

Mathematica Bohemica

The logical foundations of processes handling uncertainty in information use some classes of algebras as algebraic semantics. Bounded residuated lattice ordered monoids (monoids) are common generalizations of BL -algebras, i.e., algebras of the propositional basic fuzzy logic, and Heyting algebras, i.e., algebras of the propositional intuitionistic logic. From the point of view of uncertain information, sets of provable formulas in inference systems could be described by fuzzy filters of the corresponding...

Classes of fuzzy measures and distortion

Ľubica Valášková, Peter Struk (2005)

Kybernetika

Distortion of fuzzy measures is discussed. A special attention is paid to the preservation of submodularity and supermodularity, belief and plausibility. Full characterization of distortion functions preserving the mentioned properties of fuzzy measures is given.

Classification of the regular De Morgan algebras of fuzzy sets.

Francesc Esteva, Núria Piera (1984)

Stochastica

A characterization of regular lattices of fuzzy sets and their isomorphisms is given in Part I. A characterization of involutions on regular lattices of fuzzy sets and the isomorphisms of De Morgan algebras of fuzzy sets is given in Part II. Finally all classes of De Morgan algebras of fuzzy sets with respect to isomorphisms are completely described.

Classification Trees as a Technique for Creating Anomaly-Based Intrusion Detection Systems

Jecheva, Veselina, Nikolova, Evgeniya (2009)

Serdica Journal of Computing

Intrusion detection is a critical component of security information systems. The intrusion detection process attempts to detect malicious attacks by examining various data collected during processes on the protected system. This paper examines the anomaly-based intrusion detection based on sequences of system calls. The point is to construct a model that describes normal or acceptable system activity using the classification trees approach. The created database is utilized as a basis for distinguishing...

Clones on regular cardinals

Martin Goldstern, Saharon Shelah (2002)

Fundamenta Mathematicae

We investigate the structure of the lattice of clones on an infinite set X. We first observe that ultrafilters naturally induce clones; this yields a simple proof of Rosenberg’s theorem: there are 2 2 λ maximal (= “precomplete”) clones on a set of size λ. The clones we construct do not contain all unary functions. We then investigate clones that do contain all unary functions. Using a strong negative partition theorem from pcf theory we show that for cardinals λ (in particular, for all successors of...

Clopen graphs

Stefan Geschke (2013)

Fundamenta Mathematicae

A graph G on a topological space X as its set of vertices is clopen if the edge relation of G is a clopen subset of X² without the diagonal. We study clopen graphs on Polish spaces in terms of their finite induced subgraphs and obtain information about their cochromatic numbers. In this context we investigate modular profinite graphs, a class of graphs obtained from finite graphs by taking inverse limits. This continues the investigation of continuous colorings on Polish spaces and their homogeneity...

Closed discrete subsets of separable spaces and relative versions of normality, countable paracompactness and property ( a )

Samuel Gomes da Silva (2011)

Commentationes Mathematicae Universitatis Carolinae

In this paper we show that a separable space cannot include closed discrete subsets which have the cardinality of the continuum and satisfy relative versions of any of the following topological properties: normality, countable paracompactness and property ( a ) . It follows that it is consistent that closed discrete subsets of a separable space X which are also relatively normal (relatively countably paracompact, relatively ( a ) ) in X are necessarily countable. There are, however, consistent examples of...

Closure Łukasiewicz algebras

Abad Manuel, Cimadamore Cecilia, Díaz Varela José, Rueda Laura, Suardíaz Ana (2005)

Open Mathematics

In this paper, the variety of closure n-valued Łukasiewicz algebras, that is, Łukasiewicz algebras of order n endowed with a closure operator, is investigated. The lattice of subvarieties in the particular case in which the open elements form a three-valued Heyting algebra is obtained.

Club-guessing and non-structure of trees

Tapani Hyttinen (2001)

Fundamenta Mathematicae

We study the possibilities of constructing, in ZFC without any additional assumptions, strongly equivalent non-isomorphic trees of regular power. For example, we show that there are non-isomorphic trees of power ω₂ and of height ω · ω such that for all α < ω₁· ω · ω, E has a winning strategy in the Ehrenfeucht-Fraïssé game of length α. The main tool is the notion of a club-guessing sequence.

Currently displaying 101 – 120 of 402