All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 12 Next

Displaying 221 – 240 of 1306

Showing per page

Construction methods for uni-nullnorms and null-uninorms on bounded lattice

Ümit Ertuğrul, M. Nesibe Kesicioğlu, Funda Karaçal (2019)

Kybernetika

In this paper, two construction methods have been proposed for uni-nullnorms on any bounded lattices. The difference between these two construction methods and the difference from the existing construction methods have been demonstrated and supported by an example. Moreover, the relationship between our construction methods and the existing construction methods for uninorms and nullnorms on bounded lattices are investigated. The charactertics of null-uninorms on bounded lattice L are given and a...

Construction of Measure from Semialgebra of Sets1

Noboru Endou (2015)

Formalized Mathematics

In our previous article [22], we showed complete additivity as a condition for extension of a measure. However, this condition premised the existence of a σ-field and the measure on it. In general, the existence of the measure on σ-field is not obvious. On the other hand, the proof of existence of a measure on a semialgebra is easier than in the case of a σ-field. Therefore, in this article we define a measure (pre-measure) on a semialgebra and extend it to a measure on a σ-field. Furthermore, we...

Construction of tree automata from regular expressions

Dietrich Kuske, Ingmar Meinecke (2011)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative proof to this fact that results in smaller tree automata. To this aim, we transfer Antimirov's partial derivatives from regular word expressions to regular tree expressions. For an analysis of the size of the resulting automaton as well as for algorithmic improvements, we also transfer the methods of Champarnaud and Ziadi from words...

Construction of tree automata from regular expressions

Dietrich Kuske, Ingmar Meinecke (2011)

RAIRO - Theoretical Informatics and Applications

Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative proof to this fact that results in smaller tree automata. To this aim, we transfer Antimirov's partial derivatives from regular word expressions to regular tree expressions. For an analysis of the size of the resulting automaton as well as for algorithmic improvements, we also transfer the methods of Champarnaud and Ziadi...

Construction of uninorms on bounded lattices

Gül Deniz Çaylı, Funda Karaçal (2017)

Kybernetika

In this paper, we propose the general methods, yielding uninorms on the bounded lattice ( L , ≤ , 0 , 1 ) , with some additional constraints on e ∈ L ∖ { 0 , 1 } for a fixed neutral element e ∈ L ∖ { 0 , 1 } based on underlying an arbitrary triangular norm T e on [ 0 , e ] and an arbitrary triangular conorm S e on [ e , 1 ] . And, some illustrative examples are added for clarity.

Convergent Filter Bases

Roland Coghetto (2015)

Formalized Mathematics

We are inspired by the work of Henri Cartan [16], Bourbaki [10] (TG. I Filtres) and Claude Wagschal [34]. We define the base of filter, image filter, convergent filter bases, limit filter and the filter base of tails (fr: filtre des sections).

Curry algebras N 1

Jair Minoro Abe (1996)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

In [6] da Costa has introduced a new hierarchy N i , 1 ≤ i ≤ w of logics that are both paraconsistent and paracomplete. Such logics are now known as non-alethic logics. In this article we present an algebraic version of the logics N i and study some of their properties.

Currently displaying 221 – 240 of 1306