Theoretical Computer Science
Fibring Non-Truth-Functional Logics: Completeness Preservation
Journal of Logic, Language and Information
Combining and representing logical systems using model-theoretic parchments
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Weakly complete axiomatization of exogenous quantum propositional logic
Information and Computation
| Hi-index | 0.00 |
The theory of abstract algebraic logic aims at drawing a strong bridge between logic and universal algebra, namely by generalizing the well known connection between classical propositional logic and Boolean algebras. Despite of its successfulness, the current scope of application of the theory is rather limited. Namely, logics with a many-sorted language simply fall out from its scope. Herein, we propose a way to extend the existing theory in order to deal also with many-sorted logics, by capitalizing on the theory of many-sorted equational logic. Besides showing that a number of relevant concepts and results extend to this generalized setting, we also analyze in detail the examples of first-order logic and the paraconsistent logic C1 of da Costa.