<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <title>DSpace Kolekcja:</title>
  <link rel="alternate" href="http://hdl.handle.net/11320/89" />
  <subtitle />
  <id>http://hdl.handle.net/11320/89</id>
  <updated>2026-06-01T17:16:43Z</updated>
  <dc:date>2026-06-01T17:16:43Z</dc:date>
  <entry>
    <title>Introduction to Formal Preference Spaces</title>
    <link rel="alternate" href="http://hdl.handle.net/11320/3691" />
    <author>
      <name>Niewiadomska, Eliza</name>
    </author>
    <author>
      <name>Grabowski, Adam</name>
    </author>
    <id>http://hdl.handle.net/11320/3691</id>
    <updated>2017-10-05T22:57:30Z</updated>
    <published>2013-01-01T00:00:00Z</published>
    <summary type="text">Tytu&amp;#322;: Introduction to Formal Preference Spaces
Autorzy: Niewiadomska, Eliza; Grabowski, Adam
Abstrakt: In the article the formal characterization of preference spaces [1] is given. As the preference relation is one of the very basic notions of mathematical economics [9], it prepares some ground for a more thorough formalization of consumer theory (although some work has already been done - see [17]). There was an attempt to formalize similar results in Mizar, but this work seems still unfinished [18].&#xD;
&#xD;
There are many approaches to preferences in literature. We modelled them in a rather illustrative way (similar structures were considered in [8]): either the consumer (strictly) prefers an alternative, or they are of equal interest; he/she could also have no opinion of the choice. Then our structures are based on three relations on the (arbitrary, not necessarily finite) set of alternatives. The completeness property can however also be modelled, although we rather follow [2] which is more general [12]. Additionally we assume all three relations are disjoint and their set-theoretic union gives a whole universe of alternatives.&#xD;
&#xD;
We constructed some positive and negative examples of preference structures; the main aim of the article however is to give the characterization of consumer preference structures in terms of a binary relation, called characteristic relation [10], and to show the way the corresponding structure can be obtained only using this relation. Finally, we show the connection between tournament and total spaces and usual properties of the ordering relations.</summary>
    <dc:date>2013-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Representation of the Fibonacci and Lucas Numbers in Terms of Floor and Ceiling</title>
    <link rel="alternate" href="http://hdl.handle.net/11320/3562" />
    <author>
      <name>Jastrzębska, Magdalena</name>
    </author>
    <id>http://hdl.handle.net/11320/3562</id>
    <updated>2017-10-05T22:45:34Z</updated>
    <published>2010-01-01T00:00:00Z</published>
    <summary type="text">Tytu&amp;#322;: Representation of the Fibonacci and Lucas Numbers in Terms of Floor and Ceiling
Autorzy: Jastrzębska, Magdalena
Abstrakt: In the paper we show how to express the Fibonacci numbers and Lucas numbers using the floor and ceiling operations.</summary>
    <dc:date>2010-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>On the Lattice of Intervals and Rough Sets</title>
    <link rel="alternate" href="http://hdl.handle.net/11320/3550" />
    <author>
      <name>Grabowski, Adam</name>
    </author>
    <author>
      <name>Jastrzębska, Magdalena</name>
    </author>
    <id>http://hdl.handle.net/11320/3550</id>
    <updated>2017-10-05T22:56:57Z</updated>
    <published>2009-01-01T00:00:00Z</published>
    <summary type="text">Tytu&amp;#322;: On the Lattice of Intervals and Rough Sets
Autorzy: Grabowski, Adam; Jastrzębska, Magdalena
Abstrakt: 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].</summary>
    <dc:date>2009-01-01T00:00:00Z</dc:date>
  </entry>
</feed>

