Page 1 Next

Displaying 1 – 20 of 34

Showing per page

Rank of Submodule, Linear Transformations and Linearly Independent Subsets of Z-module

Kazuhisa Nakasho, Yuichi Futa, Hiroyuki Okazaki, Yasunari Shidama (2014)

Formalized Mathematics

In this article, we formalize some basic facts of Z-module. In the first section, we discuss the rank of submodule of Z-module and its properties. Especially, we formally prove that the rank of any Z-module is equal to or more than that of its submodules, and vice versa, and that there exists a submodule with any given rank that satisfies the above condition. In the next section, we mention basic facts of linear transformations between two Z-modules. In this section, we define homomorphism between...

Relative sets and rough sets

Amin Mousavi, Parviz Jabedar-Maralani (2001)

International Journal of Applied Mathematics and Computer Science

In this paper, by defining a pair of classical sets as a relative set, an extension of the classical set algebra which is a counterpart of Belnap's four-valued logic is achieved. Every relative set partitions all objects into four distinct regions corresponding to four truth-values of Belnap's logic. Like truth-values of Belnap's logic, relative sets have two orderings; one is an order of inclusion and the other is an order of knowledge or information. By defining a rough set as a pair of definable...

Remarks on the definitions of main concepts of logic of action

Maria Lewandowska (1991)

Mathématiques et Sciences Humaines

The article presents the definitions of action and of its omission, formulated in some logical theories of action. The concern of the analysis is to point at manifold possibilities of precising the intuitive sense of discussed concepts depending on the theory. The utility of a particular definition may be evaluated when the domain of applicability of the theory is taken into account ; application often becomes justification for the choice of a given definition.

Representation of logic formulas by normal forms

Martina Daňková (2002)

Kybernetika

In this paper, we deal with the disjunctive and conjunctive normal forms in the frame of predicate BL-logic and prove theirs conditional equivalence to appropriate formulas. Our aim is to show approximation ability of special normal forms defined by means of reflexive binary predicate.

Currently displaying 1 – 20 of 34

Page 1 Next