Cano-Jorge, Fernando
Main Affiliation
Preferred name
Cano-Jorge, Fernando
Official Name
Cano Jorge, Fernando
ORCID
0000-0003-2835-6394
Researcher ID
OEN-1583-2025
Scopus Author ID
57226375719
5 results
Now showing 1 - 5 of 5
- Some of the metrics are blocked by yourconsent settings
Item type:Publication, - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Connexive arithmetic formulated relevantlyFollowing the strategy in [15] to develop inconsistent models for relevant arithmetics, we formulate a connexive variant of arithmetic by replacing the conditional of RM3 with the Belikov–Loginov conditional. We obtain thus the connexive logic cRM3 which serves as a base logic for arithmetics cRM3, cRM3, cRM, cRMn, and cRM. We compare these with their counterparts RM3, RM and that extend relevant arithmetic. ©The authors ©Oxford University Press. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Gates and circuits via Dunn semanticsComputer hardware is heavily reliant on classical logic, but could we use some non-classical logic instead? In this paper I suggest an alternative model of implementation of logic gates in electronics. In particular, I propose a model that takes descriptions of logical connectives through means of Dunn semantics and implements them as logic gates by using a double current system: one for truth and one for falsity, instead of the classical use of a single current for both values. The outcome of this proposal should pave the way to new models of non-classical and even contra-classical computation based on paraconsistent, paracomplete and paranormal logics. © The author © Oxford University Press. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Inconsistent sets and how to compute themThe idea of a paraconsistent computability theory has been proposed as a way to work effectively with inconsistent sets of numbers. The viability of such a theory, though—the very coherence of the idea of an ‘inconsistent recursive relation’—has been called into doubt, most recently in (Choi, Synthese 200(5):418, 2022). In this paper we remove some doubt, by setting out a simple model of (naïve) set theory in LP, showing how to compute inconsistent sets in terms of extensions and antiextensions, and establishing further representability results. This suggests a way that a longstanding and apparently impossible-to-answer question—how can inconsistency be computed?—can be answered. ©The author ©Springer.