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 4 Next

Displaying 61 – 80 of 1313

Showing per page

A note on Sugihara algebras.

Josep M. Font, Gonzalo Rodríguez Pérez (1992)

Publicacions Matemàtiques

In [4] Blok and Pigozzi prove syntactically that RM, the propositional calculus also called R-Mingle, is algebraizable, and as a consequence there is a unique quasivariety (the so-called equivalent quasivariety semantics) associated to it. In [3] it is stated that this quasivariety is the variety of Sugihara algebras. Starting from this fact, in this paper we present an equational base for this variety obtained as a subvariety of the variety of R-algebras, found in [7] to be associated in the same...

A principal topology obtained from uninorms

Funda Karaçal, Tuncay Köroğlu (2022)

Kybernetika

We obtain a principal topology and some related results. We also give some hints of possible applications. Some mathematical systems are both lattice and topological space. We show that a topology defined on the any bounded lattice is definable in terms of uninorms. Also, we see that these topologies satisfy the condition of the principal topology. These topologies can not be metrizable except for the discrete metric case. We show an equivalence relation on the class of uninorms on a bounded lattice...

A property of the solvable radical in finitely decidable varieties

Paweł M. Idziak, Matthew Valeriote (2001)

Fundamenta Mathematicae

It is shown that in a finitely decidable equational class, the solvable radical of any finite subdirectly irreducible member is comparable to all congruences of the irreducible if the type of the monolith is 2. In the type 1 case we establish that the centralizer of the monolith is strongly solvable.

A reduction-based theorem prover for 3-valued logic.

Gabriel Aguilera Venegas, Inmaculada Pérez de Guzmán, Manuel Ojeda Aciego (1997)

Mathware and Soft Computing

We present a new prover for propositional 3-valued logics, TAS-M3, which is an extension of the TAS-D prover for classical propositional logic. TAS-M3 uses the TAS methodology and, consequently, it is a reduction-based method. Thus, its power is based on the reductions of the size of the formula executed by the F transformation. This transformation dynamically filters the information contained in the syntactic structure of the formula to avoid as much distributions as possible, in order to improve...

A semantical hierarchy for modal formulas.

Salvatore Guccione, Roberto Tortora (1982)

Stochastica

In this paper a semantical partition, relative to Kripke models, is introduced for sets of formulas. Secondly, this partition is used to generate a semantical hierarchy for modal formulas. In particular some results are given for the propositional calculi T and S4.

A system for deduction-based formal verification of workflow-oriented software models

Radosław Klimek (2014)

International Journal of Applied Mathematics and Computer Science

The work concerns formal verification of workflow-oriented software models using the deductive approach. The formal correctness of a model's behaviour is considered. Manually building logical specifications, which are regarded as a set of temporal logic formulas, seems to be a significant obstacle for an inexperienced user when applying the deductive approach. A system, along with its architecture, for deduction-based verification of workflow-oriented models is proposed. The process inference is...

Currently displaying 61 – 80 of 1313