Displaying 3361 – 3380 of 5989

Showing per page

Ordinal remainders of classical ψ-spaces

Alan Dow, Jerry E. Vaughan (2012)

Fundamenta Mathematicae

Let ω denote the set of natural numbers. We prove: for every mod-finite ascending chain T α : α < λ of infinite subsets of ω, there exists [ ω ] ω , an infinite maximal almost disjoint family (MADF) of infinite subsets of the natural numbers, such that the Stone-Čech remainder βψ∖ψ of the associated ψ-space, ψ = ψ(ω,ℳ ), is homeomorphic to λ + 1 with the order topology. We also prove that for every λ < ⁺, where is the tower number, there exists a mod-finite ascending chain T α : α < λ , hence a ψ-space with Stone-Čech remainder...

Ordinal ultrafilters versus P-hierarchy

Andrzej Starosolski (2014)

Open Mathematics

An earlier paper [Starosolski A., P-hierarchy on βω, J. Symbolic Logic, 2008, 73(4), 1202–1214] investigated the relations between ordinal ultrafilters and the so-called P-hierarchy. The present paper focuses on the aspects of characterization of classes of ultrafilters of finite index, existence, generic existence and the Rudin-Keisler-order.

Ordinary differential equations and descriptive set theory: uniqueness and globality of solutions of Cauchy problems in one dimension

Alessandro Andretta, Alberto Marcone (1997)

Fundamenta Mathematicae

We study some natural sets arising in the theory of ordinary differential equations in one variable from the point of view of descriptive set theory and in particular classify them within the Borel hierarchy. We prove that the set of Cauchy problems for ordinary differential equations which have a unique solution is 2 0 -complete and that the set of Cauchy problems which locally have a unique solution is 3 0 -complete. We prove that the set of Cauchy problems which have a global solution is 0 4 -complete...

Orthocomplemented difference lattices with few generators

Milan Matoušek, Pavel Pták (2011)

Kybernetika

The algebraic theory of quantum logics overlaps in places with certain areas of cybernetics, notably with the field of artificial intelligence (see, e. g., [19, 20]). Recently an effort has been exercised to advance with logics that possess a symmetric difference ([13, 14]) - with so called orthocomplemented difference lattices (ODLs). This paper further contributes to this effort. In [13] the author constructs an ODL that is not set-representable. This example is quite elaborate. A main result...

Orthomodular lattices with almost orthogonal sets of atoms

Sylvia Pulmannová, Vladimír Rogalewicz (1991)

Commentationes Mathematicae Universitatis Carolinae

The set A of all atoms of an atomic orthomodular lattice is said to be almost orthogonal if the set { b A : b a ' } is finite for every a A . It is said to be strongly almost orthogonal if, for every a A , any sequence b 1 , b 2 , of atoms such that a b 1 ' , b 1 b 2 ' , contains at most finitely many distinct elements. We study the relation and consequences of these notions. We show among others that a complete atomic orthomodular lattice is a compact topological one if and only if the set of all its atoms is almost orthogonal.

Ovchinnikov's automorphisms revisited.

Enric Trillas, Adolfo Rodríguez de Soto, Susana Cubillo (1994)

Mathware and Soft Computing

In [6] an approach to the representation of synonyms and antonyms via the automorphisms of the De Morgan Algebra [0,1]X was suggested. In [3], Ovchinnikov established a representation theorem for automorphisms of the function's complete and completely distributive lattice [0,1]X with the pointwise extension of Min and Max operations in [0,1]. Ovchinnikov results are now inmediately generalized by using a positive t-norm T and its dual eta-dual t-conorm T*. These results are applied to study the...

OWA operators for discrete gradual intervals: implications to fuzzy intervals and multi-expert decision making

Zdenko Takáč (2016)

Kybernetika

A new concept in fuzzy sets theory, namely that of gradual element, was introduced recently. It is known that the set of gradual real numbers is not ordered linearly. We restrict our attention to a discrete case and propose a class of linear orders for discrete gradual real numbers. Then, using idea of the so-called admissible order of intervals, we present a class of linear orders for discrete gradual intervals. Once we have the linear orders it is possible to define OWA operator for discrete gradual...

p -sequential like properties in function spaces

Salvador García-Ferreira, Angel Tamariz-Mascarúa (1994)

Commentationes Mathematicae Universitatis Carolinae

We introduce the properties of a space to be strictly WFU ( M ) or strictly SFU ( M ) , where M ω * , and we analyze them and other generalizations of p -sequentiality ( p ω * ) in Function Spaces, such as Kombarov’s weakly and strongly M -sequentiality, and Kocinac’s WFU ( M ) and SFU ( M ) -properties. We characterize these in C π ( X ) in terms of cover-properties in X ; and we prove that weak M -sequentiality is equivalent to WFU ( L ( M ) ) -property, where L ( M ) = { λ p : λ < ω 1 and p M } , in the class of spaces which are p -compact for every p M ω * ; and that C π ( X ) is a WFU ( L ( M ) ) -space iff X satisfies...

p -symmetric bi-capacities

Pedro Miranda, Michel Grabisch (2004)

Kybernetika

Bi-capacities have been recently introduced as a natural generalization of capacities (or fuzzy measures) when the underlying scale is bipolar. They allow to build more flexible models in decision making, although their complexity is of order 3 n , instead of 2 n for fuzzy measures. In order to reduce the complexity, the paper proposes the notion of p -symmetric bi- capacities, in the same spirit as for p -symmetric fuzzy measures. The main idea is to partition the set of criteria (or states of nature,...

Currently displaying 3361 – 3380 of 5989