8 citations · 25 across the 15 of their papers we have counts for
18 papers
Equivalence of finite non-deterministic logical matrices is undecidable
Carlos Caleiro, Pedro Filipe, Sérgio Marcelino
The notion of a non-deterministic logical matrix (where connectives are interpreted as multi-functions) extends the traditional semantics for propositional logics based on logical…
Axiomatizing the Logic of Ordinary Discourse
Vitor Greati, Sérgio Marcelino, Umberto Rivieccio
Most non-classical logics are subclassical, that is, every inference/theorem they validate is also valid classically. A notable exception is the three-valued propositional Logic of…
Generating proof systems for three-valued propositional logics
Vitor Greati, Giuseppe Greco, Sérgio Marcelino +2
In general, providing an axiomatization for an arbitrary logic is a task that may require some ingenuity. In the case of logics defined by a finite logical matrix (three-valued log…
Finite Hilbert systems for Weak Kleene logics
Vitor Greati, Sérgio Marcelino, Umberto Rivieccio
Multiple-conclusion Hilbert-style systems allow us to finitely axiomatize every logic defined by a finite matrix. Having obtained such axiomatizations for Paraconsistent Weak Kleen…
Some more theorems on structural entailment relations and non-deterministic semantics
Carlos Caleiro, Sérgio Marcelino, Umberto Rivieccio
We extend classical work by Janusz Czelakowski on the closure properties of the class of matrix models of entailment relations - nowadays more commonly called multiple-conclusion l…
Adding an Implication to Logics of Perfect Paradefinite Algebras
Vitor Greati, Sérgio Marcelino, João Marcos +1
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…