- Journal Details
- Format
- Journal
- eISSN
- 1898-9934
- ISSN
- 1426-2630
- First Published
- 09 Jun 2008
- Publication timeframe
- 4 times per year
- Languages
- English
Search
- Open Access
Dilworth's Decomposition Theorem for Posets
Page range: 223 - 232
Abstract
The following theorem is due to Dilworth [8]: Let
In this article we formalize an elegant proof of the above theorem for finite posets by Perles [13]. The result is then used in proving the case of infinite posets following the original proof of Dilworth [8].
A dual of Dilworth's theorem also holds: a poset with maximum clique
Instead of using posets, we drop reflexivity and state the facts about anti-symmetric and transitive relations.
Abstract
In this article, we defined complex curve and complex integral. Then we have proved the linearity for the complex integral. Furthermore, we have proved complex integral of complex curve's connection is the sum of each complex integral of individual complex curve.
- Open Access
On the Lattice of Intervals and Rough Sets
Page range: 237 - 244
Abstract
Rough sets, developed by Pawlak [6], are an important tool to describe a situation of incomplete or partially unknown information. One of the algebraic models deals with the pair of the upper and the lower approximation. Although usually the tolerance or the equivalence relation is taken into account when considering a rough set, here we rather concentrate on the model with the pair of two definable sets, hence we are close to the notion of an interval set. In this article, the lattices of rough sets and intervals are formalized. This paper, being essentially the continuation of [3], is also a step towards the formalization of the algebraic theory of rough sets, as in [4] or [9].
Abstract
In this article we present definitions, basic properties and some examples of periodic functions according to [5].
Abstract
An epsilon number is a transfinite number which is a fixed point of an exponential map: ωϵ = ϵ. The formalization of the concept is done with use of the tetration of ordinals (Knuth's arrow notation, ↑). Namely, the ordinal indexing of epsilon numbers is defined as follows:
and for limit ordinal λ:
Tetration stabilizes at ω:
Every ordinal number α can be uniquely written as
where κ is a natural number, n1, n2, …, nk are positive integers, and β1 > β2 > … > βκ are ordinal numbers (βκ = 0). This decomposition of α is called the Cantor Normal Form of α.