The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Currently displaying 1 – 8 of 8

Showing per page

Order by Relevance | Title | Year of publication

Lattical token systems.

Sergei Ovchinnikov — 2000

Mathware and Soft Computing

Stochastic token theory is a new branch of mathematical psychology. In this paper we investigate algebraic properties of token systems defined on finite lattices.

A stochastic model of choice.

Sergei V. Ovchinnikov — 1985

Stochastica

An approach to choice function theory is suggested which is probabilistic and non-deterministic. In the framework of this approach fuzzy choice functions are introduced and a number of necessary and sufficient conditions for a fuzzy choice function to be a fuzzy rational choice function of a certain type are established.

Convexity in subsets of lattices.

Sergei V. Ovchinnikov — 1980

Stochastica

The notion of convex set for subsets of lattices in one particular case was introduced in [1], where it was used to study Paretto's principle in the theory of group choice. This notion is based on a betweenness relation due to Glivenko [2]. Betweenness is used very widely in lattice theory as basis for lattice geometry (see [3], and, especially [4 part 1]). In the present paper the relative notions of convexity are considered for subsets of an arbitrary lattice. In section...

Topological automorphism groups of chains.

Sergei V. Ovchinnikov — 2001

Mathware and Soft Computing

It is shown that any set-open topology on the automorphism group A(X) of a chain X coincides with the pointwise topology and that A(X) is a topological group with respect to this topology. Topological properties of connectedness and compactness in A(X) are investigated. In particular, it is shown that the automorphism group of a doubly homogeneous chain is generated by any neighborhood of the identity element.

On fuzzy binary relations.

A binary relation language is an important tool of the theory of measurements (see, for example, book [5]). Specifically, the theory of nominal and ordinal scales is based on theories of equivalent relations and weak orderings. These binary relations have a simple structure which can be described as follows (bearing in mind a context of the measurement theory).

Extensions of set functions.

Sergei V. OvchinnikovJean Claude Falmagne — 2003

Mathware and Soft Computing

We establish a necessary and sufficient condition for a function defined on a subset of an algebra of sets to be extendable to a positive additive function on the algebra. It is algo shown that this condition is necessary and sufficient for a regular function defined on a regular subset of the Borel algebra of subsets of a given compact Hausdorff space to be extendable to a measure.

Page 1

Download Results (CSV)