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 20 Next

Displaying 381 – 400 of 728

Showing per page

A spectral theorem for σ MV-algebras

Sylvia Pulmannová (2005)

Kybernetika

MV-algebras were introduced by Chang, 1958 as algebraic bases for multi-valued logic. MV stands for “multi-valued" and MV algebras have already occupied an important place in the realm of nonstandard (mathematical) logic applied in several fields including cybernetics. In the present paper, using the Loomis–Sikorski theorem for σ -MV-algebras, we prove that, with every element a in a σ -MV algebra M , a spectral measure (i. e. an observable) Λ a : ℬ ( [ 0 , 1 ] ) → ℬ ( M ) can be associated, where ℬ ( M ) denotes the Boolean σ -algebra...

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.

A strongly non-Ramsey uncountable graph

Péter Komjáth (1997)

Fundamenta Mathematicae

It is consistent that there exists a graph X of cardinality ℵ 1 such that every graph has an edge coloring with ℵ 1 colors in which the induced copies of X (if there are any) are totally multicolored (get all possible colors).

A survey of hereditary properties of graphs

Mieczysław Borowiecki, Izak Broere, Marietjie Frick, Peter Mihók, Gabriel Semanišin (1997)

Discussiones Mathematicae Graph Theory

In this paper we survey results and open problems on the structure of additive and hereditary properties of graphs. The important role of vertex partition problems, in particular the existence of uniquely partitionable graphs and reducible properties of graphs in this structure is emphasized. Many related topics, including questions on the complexity of related problems, are investigated.

A system for deduction-based formal verification of workflow-oriented software models

Radosław Klimek (2014)

International Journal of Applied Mathematics and Computer Science

The work concerns formal verification of workflow-oriented software models using the deductive approach. The formal correctness of a model's behaviour is considered. Manually building logical specifications, which are regarded as a set of temporal logic formulas, seems to be a significant obstacle for an inexperienced user when applying the deductive approach. A system, along with its architecture, for deduction-based verification of workflow-oriented models is proposed. The process inference is...

Currently displaying 381 – 400 of 728