Displaying 21 – 40 of 171

Showing per page

Discriminator varieties of Boolean algebras with residuated operators

Peter Jipsen (1993)

Banach Center Publications

The theory of discriminator algebras and varieties has been investigated extensively, and provides us with a wealth of information and techniques applicable to specific examples of such algebras and varieties. Here we give several such examples for Boolean algebras with a residuated binary operator, abbreviated as r-algebras. More specifically, we show that all finite r-algebras, all integral r-algebras, all unital r-algebras with finitely many elements below the unit, and all commutative residuated...

General operators binding variables in the interpreted modal calculus 𝒞 ν

Aldo Bressan, Alberto Zanardo (1981)

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

Si considera il calcolo modale interpretato 𝒞 ν , che è basato su un sistema di tipi con infiniti livelli, contiene descrizioni, ed è dotato di una semantica di tipo generale - v. [2], o [3], o [4], o [5]. In modo semplice e naturale si introducono in 𝒞 ν operatori vincolanti variabili, di tipo generale. Per teorie basate sul calcolo logico risultante 𝒞 ν vale un teorema di completezza, che si dimostra in modo immediato sulla base dell'estensione del teorema parziale di completezza stabilito in [11], fatta...

How to make your logic fuzzy.

Dov M. Gabbay (1996)

Mathware and Soft Computing

The aim of this paper is to provide a methodology for turning a known crisp logic into a fuzzy system. We require of the methodology that it be meaningful in general terms, using processes which are independent of the notion of fuzziness, and that it yield a considerable number of known fuzzy systems.

Inf-datalog, modal logic and complexities

Eugénie Foustoucos, Irène Guessarian (2009)

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

Inf-Datalog extends the usual least fixpoint semantics of Datalog with greatest fixpoint semantics: we defined inf-Datalog and characterized the expressive power of various fragments of inf-Datalog in [16]. In the present paper, we study the complexity of query evaluation on finite models for (various fragments of) inf-Datalog. We deduce a unified and elementary proof that global model-checking (i.e. computing all nodes satisfying a formula in a given structure) has 1. quadratic data complexity...

Inf-datalog, Modal Logic and Complexities

Eugénie Foustoucos, Irène Guessarian (2007)

RAIRO - Theoretical Informatics and Applications

Inf-Datalog extends the usual least fixpoint semantics of Datalog with greatest fixpoint semantics: we defined inf-Datalog and characterized the expressive power of various fragments of inf-Datalog in [CITE]. In the present paper, we study the complexity of query evaluation on finite models for (various fragments of) inf-Datalog. We deduce a unified and elementary proof that global model-checking (i.e. computing all nodes satisfying a formula in a given structure) has 1. quadratic data complexity...

Information frames, implication systems and modalities.

Marcello D'Agostino, Dov M. Gabbay, Alessandra Russo (1996)

Mathware and Soft Computing

We investigate the logical systems which result from introducing the modalities L and M into the family of substructural implication logics (including relevant, linear and intuitionistic implication). Our results lead to the formulation of a uniform labelled refutation system for these logics.

Interrelation of algebraic, semantical and logical properties for superintuitionistic and modal logics

Larisa Maksimova (1999)

Banach Center Publications

We consider the families 𝓛 of propositional superintuitionistic logics (s.i.l.) and NE(K) of normal modal logics (n.m.l.). It is well known that there is a duality between 𝓛 and the lattice of varieties of pseudo-boolean algebras (or Heyting algebras), and also NE(K) is dually isomorphic to the lattice of varieties of modal algebras. Many important properties of logics, for instance, Craig's interpolation property (CIP), the disjunction property (DP), the Beth property (BP), Hallden-completeness...

Currently displaying 21 – 40 of 171