Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 5

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  logika modalna
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available All splitting logics in the lattice NEXT(KTB:30A)
EN
We examine a special modal logic which is a normal extension of the Brouwer modal logic. It is determined by linearly ordered chains of clusters and the relation between clusters is reflexive and symmetric. The appropriate axiomatization of this logic is proposed in the papers [11] and [12]. There is also proved that all normal extensions of the investigated logic are Kripke complete and have f.m.p. Unfortunately, the cardinality of this family is continuum [13]. One may imagine that the structure of the lattice of these extensions is immensely complex. Then we use the technics of splitting to characterize this lattice and to describe some quite simple fragments. We characterize all the logics that split the lattice.
EN
In this paper the authors propose a method of verifying formulae in normal modal logics. In order to show that a formula α is a thesis of a normal modal logic, a set of decomposition rules for any formula is given. These decomposition rules are based on the symbols of assertion and rejection of formulae.
3
Content available remote Knowledge based optimization
EN
Optimization theory has advanced considerably during the last three decades, as illustrated by a vast number of published books, surveys, and papers concerning this subject. However, for optimization of complex systems that may not be modeled exactly by Ludwig von Bertalanffy's general system theory, we may need a new philosophy based on rather non-conventional logics. It is represented bellow.
5
Content available remote Extensions of the Grzegorczyk Logic Determined by Some Countable Boolean Algebras
EN
It is shown that a chain of type of w + 1 of modal logics: Tr = Grz + B1 ⊃ Grz + B2 ⊃ Grz + B3 ⊃...⊃ Grz (all of them are extensions of the Grzegorczyk logic Grz), contains all and only such modal logics which can be obtained as sets of formulae that are valid in the Stone spaces of countable superatomic Boolean algebras. Some topological conditions which correspond to the Grzegorczyk logic are presented.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.