7 citations · 18 across the 9 of their papers we have counts for
10 papers
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…
Finite two-dimensional proof systems for non-finitely axiomatizable logics
Vitor Greati, João Marcos
The characterizing properties of a proof-theoretical presentation of a given logic may hang on the choice of proof formalism, on the shape of the logical rules and of the sequents…
Proof Search on Bilateralist Judgments over Non-deterministic Semantics
Vitor Greati, Sérgio Marcelino, João Marcos
The bilateralist approach to logical consequence maintains that judgments of different qualities should be taken into account in determining what-follows-from-what. We argue that s…
On Logics of Perfect Paradefinite Algebras
Joel Gomes, Vitor Greati, Sérgio Marcelino +2
The present study shows how to enrich De Morgan algebras with a perfection operator that allows one to express the Boolean properties of negation-consistency and negation-determine…
It ain't necessarily so: Basic sequent systems for negative modalities
Ori Lahav, João Marcos, Yoni Zohar
We look at non-classical negations and their corresponding adjustment connectives from a modal viewpoint, over complete distributive lattices, and apply a very general mechanism in…
Fail better: What formalized math can teach us about learning
João Marcos
Real-life conjectures do not come with instructions saying whether they they should be proven or, instead, refuted. Yet, as we now know, in either case the final argument produced…
TryLogic tutorial: an approach to Learning Logic by proving and refuting
Patrick Terrematte, João Marcos
Aiming to offer a framework for blended learning to the teaching of proof theory, the present paper describes an interactive tutorial, called \textsc{TryLogic}, teaching how to sol…
Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics
Carlos Caleiro, João Marcos, Marco Volpe
The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here o…
Clausal Resolution for Modal Logics of Confluence
Cláudia Nalon, João Marcos, Clare Dixon
We present a clausal resolution-based method for normal multimodal logics of confluence, whose Kripke semantics are based on frames characterised by appropriate instances of the Ch…
Automatic Generation of Proof Tactics for Finite-Valued Logics
João Marcos
A number of flexible tactic-based logical frameworks are nowadays available that can implement a wide range of mathematical theories using a common higher-order metalanguage. Used…