Results 11 to 20 of about 810,546 (73)
Non-deterministic algebraization of logics by swap structures [PDF]
Logic Journal of the IGPL, 2021 Multialgebras (or hyperalgebras or non-deterministic algebras) have been much studied in mathematics and in computer science. In 2016 Carnielli and Coniglio introduced a class of multialgebras called swap structures, as a semantic framework for dealing ...
Golzio, Ana Claudia +2 more
core +2 more sources
Bounded and multi-adjoint lattice algebraizable logics
International Journal of Approximate ReasoningM Eugenia Cornejo +2 more
exaly +3 more sources
Adding an implication to logics of perfect paradefinite algebras [PDF]
Mathematical Structures in Computer Science, 2023 Perfect paradefinite algebras are De Morgan algebras expanded with an operation that allows for the full behavior of classical negation to be restored. They form a variety that is term-equivalent to the variety of involutive Stone algebras.
Marcos, João +3 more
core +5 more sources
Logics of Formal Inconsistency Enriched with Replacement: An Algebraic and Modal Account [PDF]
The Review of Symbolic Logic, 2021 One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found.
FUENMAYOR PELAEZ, David +4 more
core +3 more sources
Cut elimination and strong separation for substructural logics: An algebraic approach [PDF]
Annals of Pure and Applied Logic, 2010 We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existing work on (associative) substructural logics over the full Lambek Calculus FL.
Ono, Hiroakira, Galatos, Nikolaos
core +2 more sources
Applications to protoalgebraic and algebraizable logics
, 1996 Ramon Jansana, Josep Maria Font
core +3 more sources
On the Algebraizability of Annotated Logics
Studia Logica, 1997 . Annotated logics were introduced by V. S. Subrahmanian as logical foundations for computer programming. One of the difficulties of these systems from the logical point of view is that they are not structural, i.e., their consequence relations are not ...
R. A. Lewin +2 more
core +2 more sources
Applications to Protoalgebraic and Algebraizable Logics
, 2017 Josep Maria Font, Ramon Jansana
exaly +3 more sources
Algebraization of logics defined by literal-paraconsistent or literal-paracomplete matrices
Mathematical Logic Quarterly, 2008 We study the algebraizability of the logics constructed using literal-paraconsistent and literal-paracomplete matrices described by Lewin and Mikenberg in [11], proving that they are all algebraizable in the sense of Blok and Pigozzi in [31 but not ...
Lewin, Renato A. +3 more
exaly +2 more sources
Logic Journal of the IGPLNilpotent Minimum logic (NML) is a substructural algebraizable logic that is a distinguished member of the family of systems of Mathematical Fuzzy logic, and at the same time it is the axiomatic extension with the prelinearity axiom of Nelson and Markov ...
Godo i Lacasa, Lluís +3 more
core +3 more sources