Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Binary Relations-based Rough Sets – an Automated Approach

100%

Grabowski A.

Formalized Mathematics

2016

tom 24

nr 2

143-155

Rough sets, developed by Zdzisław Pawlak [12], are an important tool to describe the state of incomplete or partially unknown information. In this article, which is essentially the continuation of [8], we try to give the characterization of approximation operators in terms of ordinary properties of underlying relations (some of them, as serial and mediate relations, were not available in the Mizar Mathematical Library [11]). Here we drop the classical equivalence- and tolerance-based models of rough sets trying to formalize some parts of [18]. The main aim of this Mizar article is to provide a formal counterpart for the rest of the paper of William Zhu [18]. In order to do this, we recall also Theorem 3 from Y.Y. Yao’s paper [17]. The first part of our formalization (covering first seven pages) is contained in [8]. Now we start from page 5003, sec. 3.4. [18]. We formalized almost all numbered items (definitions, propositions, theorems, and corollaries), with the exception of Proposition 7, where we stated our theorem only in terms of singletons. We provided more thorough discussion of the property positive alliance and its connection with seriality and reflexivity (and also transitivity). Examples were not covered as a rule as we tried to construct a more general mechanism of finding appropriate models for approximation spaces in Mizar providing more automatization than it is now [10]. Of course, we can see some more general applications of some registrations of clusters, essentially not dealing with the notion of an approximation: the notions of an alliance binary relation were not defined in the Mizar Mathematical Library before, and we should think about other properties which are also absent but needed in the context of rough approximations [9], [5]. Via theory merging, using mechanisms described in [6] and [7], such elementary constructions can be extended to other frameworks.

Calculus using proximities: a mathematical approach in which students can actually prove theorems

68%

O’Donovan R.

Open Mathematics

2017

tom 15

nr 1

30-36

Teaching and learning calculus are notoriously difficult and the didactic solutions may involve resorting to intuitive but vague definitions or informal gestures offered as proofs. The teaching literature is rife with examples of metaphors, adverb manipulations and descriptions of what happens “just before” the limit. It is then difficult to leave the domain of the mental image, thus losing the training in rigour. The author (with Karel Hrbacek and Olivier Lessmann) has endeavoured a radically different approach with the objective of training students to prove theorems while preserving both intuition and mathematical rigour. Hence we change the mathematical setting rather than the didactic setting. The result (which is a by-product of nonstandard analysis) has been used in several high schools in Geneva – Switzerland – for over ten years.

Ograniczanie wyników

1 Formalized Mathematics

1 Open Mathematics

1 Grabowski A.

1 O’Donovan R.

1 2017

1 2016

Wyniki wyszukiwania

Binary Relations-based Rough Sets – an Automated Approach

Calculus using proximities: a mathematical approach in which students can actually prove theorems