Page 1

Displaying 1 – 4 of 4

Showing per page

Definition of Flat Poset and Existence Theorems for Recursive Call

Kazuhisa Ishida, Yasunari Shidama, Adam Grabowski (2014)

Formalized Mathematics

This text includes the definition and basic notions of product of posets, chain-complete and flat posets, flattening operation, and the existence theorems of recursive call using the flattening operator. First part of the article, devoted to product and flat posets has a purely mathematical quality. Definition 3 allows to construct a flat poset from arbitrary non-empty set [12] in order to provide formal apparatus which eanbles to work with recursive calls within the Mizar langauge. To achieve this...

Directoids with sectionally switching involutions

Ivan Chajda (2006)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

It is shown that every directoid equipped with sectionally switching mappings can be represented as a certain implication algebra. Moreover, if the directoid is also commutative, the corresponding implication algebra is defined by four simple identities.

Discriminator order algebras

Ivan Chajda (2008)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

We prove that an order algebra assigned to a bounded poset with involution is a discriminator algebra.

Currently displaying 1 – 4 of 4

Page 1