O objetivo geral da pesquisa da qual esse artigo faz parte é investigar o sistema metafísico que emerge dos trabalhos de David Lewis. Esse sistema pode ser decomposto em pelo menos duas teorias. A primeira nomeada como realismo modal genuíno (RMG) e a segunda como mosaico neo-humeano. O RMG é, sem dúvida, mais popular e defende a hipótese metafísica da existência de uma pluralidade de mundos possíveis. A principal razão em favor dessa hipótese é a sua aplicabilidade na discussão de (...) problemas losó cos, esse motivo não será diretamente abordado neste artigo. Pois, o foco está em compreender o mosaico neo-humea- no e como ele relaciona-se com a metafísica de mundos possíveis. Em outras palavras, o meu objetivo é entender as bases losó cas que sus- tentam o realismo modal genuíno. (shrink)

According to Suszko's Thesis,any multi-valued semantics for a logical system can be replaced by an equivalent bivalent one. Moreover: bivalent semantics for families of logics can frequently be developed in a modular way. On the other hand bivalent semantics usually lacks the crucial property of analycity, a property which is guaranteed for the semantics of multi-valued matrices. We show that one can get both modularity and analycity by using the semantic framework of multi-valued non-deterministic matrices. We further show that for (...) using this framework in a constructive way it is best to view "truth-values" as information carriers, or "information-values". (shrink)

Many-valued logics are standardly defined by logical matrices. They are truth-functional. In this paper non truth-functional many-valued semantics are presented, in a philosophical and mathematical perspective.

According to Suszko’s Thesis, there are but two logical values, true and false. In this paper, R. Suszko’s, G. Malinowski’s, and M. Tsuji’s analyses of logical twovaluedness are critically discussed. Another analysis is presented, which favors a notion of a logical system as encompassing possibly more than one consequence relation. [A] fundamental problem concerning many-valuedness is to know what it really is. [13, p. 281].

In this paper, we shall consider the so-called cancellation view of negation and the inferential role of contradictions. We will discuss some of the problematic aspects of negation as cancellation, such as its original presentation by Richard and Valery Routley and its role in motivating connexive logic. Furthermore, we will show that the idea of inferential ineffectiveness of contradictions can be conceptually separated from the cancellation model of negation by developing a system we call qLPm, a combination of Graham Priest’s (...) minimally inconsistent Logic of Paradox with q-entailment as introduced by Grzegorz Malinowski. (shrink)

Suszko's Thesis maintains that many-valued logics do not exist at all. In order to support it, R. Suszko offered a method for providing any structural abstract logic with a complete set of bivaluations. G. Malinowski challenged Suszko's Thesis by constructing a new class of logics (called q-logics by him) for which Suszko's method fails. He argued that the key for logical two-valuedness was the "bivalent" partition of the Lindenbaum bundle associated with all structural abstract logics, while his q-logics were generated (...) by "trivalent" matrices. This paper will show that contrary to these intuitions, logical two-valuedness has more to do with the geometrical properties of the deduction relation of a logical structure than with the algebraic properties embedded on it. (shrink)

According to truth pluralism, sentences from different areas of discourse can be true in different ways. This view has been challenged to make sense of logical validity, understood as necessary truth preservation, when inferences involving different areas are considered. To solve this problem, a natural temptation is that of replicating the standard practice in many-valued logic by appealing to the notion of designated values. Such a simple approach, however, is usually considered a non-starter for strong versions of truth pluralism, since (...) designation seems to embody nothing but a notion of generic truth. In this paper, I explore the analogy with many-valued logic by comparing the problem of mixed inferences with Suszko’s thesis, and argue that the strong pluralist has room to resist the commitment to a generic property of truth by undermining the semantic significance of Suszko’s reduction. (shrink)

A proof-theoretical analysis of finite-valuedness in the domain of cumulative inference systems is presented.

What is the fundamental insight behind truth-functionality ? When is a logic interpretable by way of a truth-functional semantics? To address such questions in a satisfactory way, a formal definition of truth-functionality from the point of view of abstract logics is clearly called for. As a matter of fact, such a definition has been available at least since the 70s, though to this day it still remains not very widely well-known. A clear distinction can be drawn between logics characterizable through: (...) (1) genuinely finite-valued truth-tabular semantics; (2) no finite-valued but only an infinite-valued truthtabular semantics; (3) no truth-tabular semantics at all. Any of those logics, however, can in principle be characterized through non-truth-functional valuation semantics, at least as soon as their associated consequence relations respect the usual tarskian postulates. So, paradoxical as that might seem at first, it turns out that truth-functional logics may be adequately characterized by non-truth-functional semantics . Now, what feature of a given logic would guarantee it to dwell in class (1) or in class (2), irrespective of its circumstantial semantic characterization? (shrink)

Throughout this paper, we are trying to show how and why our Mathematical frame-work seems inappropriate to solve problems in Theory of Computation. More exactly, the concept of turning back in time in paradoxes causes inconsistency in modeling of the concept of Time in some semantic situations. As we see in the first chapter, by introducing a version of “Unexpected Hanging Paradox”,first we attempt to open a new explanation for some paradoxes. In the second step, by applying this paradox, it (...) is demonstrated that any formalized system for the Theory of Computation based on Classical Logic and Turing Model of Computation leads us to a contradiction. We conclude that our mathematical frame work is inappropriate for Theory of Computation. Furthermore, the result provides us a reason that many problems in Complexity Theory resist to be solved.(This work is completed in 2017 -5- 2, it is in vixra in 2017-5-14, presented in Unilog 2018, Vichy). (shrink)