Results 41 to 50 of about 84,544 (73)

A categorial foundation for a representation theory of logics

, 2016
Neste trabalho estabelecemos uma base teórica para a construção de uma teoria de rep- resentação de lógicas proposicionais. Iniciamos identificando uma relação precisa entre a categoria das lógicas (Blok-Pigozzi) algebrizáveis e a categoria de suas ...
Pinto, Darllan Conceição
core  

Distributed Description Logics - Preliminary investigations

, 2002
Information integration has been, and remains one of the majour challenges of information processing, and is well supported by description logics. We illustrate the need for a more refined approach in those cases where the original sources form a loosely
Serafini, Luciano, Borgida, Alex
core  

ALGEBRAS AND MATRICES FOR ANNOTATED LOGICS ∗

, 2008
We study the matrices, reduced matrices and algebras associated to the systems SALτ of structural annotated logics. In previous papers, these systems were proven algebraizable in the finitary case and the class of matrices analyzed here was proven to be ...
R. A. Lewin, I. F. Mikenberg, M. G. Schwarze, Católica Chile   +3 more
core  

Erratum to “Definitional equivalence and algebraizability of generalized logical systems” Annals of Pure and Applied Logic 98 (1999) 1–68

Annals of Pure and Applied Logic, 2000
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Implicit connectives of algebraizable logics

Studia Logica, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Caicedo Xavier
exaly   +2 more sources

Equivalential and algebraizable logics

Studia Logica, 1996
The author investigates the process of algebraization of the so-called equivalential and finitely equivalential logics. His approach is based on matrix semantics. In the paper, a logic need not be finitary (i.e., have only finitary rules). As to algebraizability, the author distinguishes between finitely algebraizable logics (i.e.
Burghard Herrmann
exaly   +3 more sources

An Approach to Glivenko’s Theorem in Algebraizable Logics

Studia Logica, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Antoni Torrens, Torrens Antoni
exaly   +3 more sources

Regularly Algebraizable Logics

Trends in Logic, 2001
A sentential logic (S, C) is regularly algebraizable (alias 1-algebraizable) if it possesses a non-empty system E(p, q) of equivalence sentences such that E(p, q) ⊆ C(p, q).
Janusz Czelakowski, Czelakowski Janusz
exaly   +2 more sources

A survey on categories of logics and algebraizable logics

Sao Paulo Journal of Mathematical Sciences, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly   +3 more sources