In the Organon Aristotle describes some deductive schemata in which inconsistencies do not entail the trivialization of the logical theory involved. This thesis is corroborated by three different theoretical topics by him discussed, which are presented in this paper. We analyse inference schema used by Aristotle in the Protrepticus and the method of indirect demonstration for categorical syllogisms. Both methods exemplify as Aristotle employs classical reductio ad absurdum strategies. Following, we discuss valid syllogisms from opposite premises (contrary and contradictory) studied (...) by the Stagerian in the Analytica Priora (B15). According to him, the following syllogisms are valid from opposite premises, in which small Latin letters stand for terms such as subject and predicate, and capital Latin letters stand for the categorical propositions such as in the traditional notation: (i) in the second figure, Eba,Aba ` Eaa (Cesare), Aba, Eba ` Eaa (Camestres), Eba, I ba ` Oaa (Festino), and Aba,Oba ` Oaa (Baroco); (ii) in the third one, Eab,Aab ` Oaa (Felapton), Oab,Aab ` Oaa (Bocardo) and Eab, Iab ` Oaa (Ferison). Finally, we discuss the passage from the Analytica Posteriora (A11) in which Aristotle states that the Principle of Non-Contradiction is not generally presupposed in all demonstrations (scientific syllogisms), but only in those in which the conclusion must be proved from the Principle; the Stagerian states that if a syllogism of the first figure has the major term consistent, the other terms of the demonstration can be each one separately inconsistent. These results allow us to propose an interpretation of his deductive theory as a broad sense paraconsistent theory. Firstly, we proceed to a hermeneutical analysis, evaluating its logical significance and the interplay of the results with some other points of Aristotle’s philosophy. Secondly, we point to a logical interpretation of the Aristotelian syllogisms from opposite premises in the antilogisms method proposed by Christine Ladd-Franklin in 1883, and we also present a logical treatment of the Aristotelian demonstration with inconsistent material in the paraconsistent logics Cn, 1 _ n _!, introduced by da Costa in 1963. These two issues seem having not yet been analysed in detail in the literature. (shrink)

Inspired by the early Wittgenstein’s concept of nonsense (meaning that which lies beyond the limits of language), we define two different, yet complementary, types of nonsense: formal nonsense and pragmatic nonsense. The simpler notion of formal nonsense is initially defined within Tarski’s semantic theory of truth; the notion of pragmatic nonsense, by its turn, is formulated within the context of the theory of pragmatic truth, also known as quasi-truth, as formalized by da Costa and his collaborators. While an expression will (...) be considered formally nonsensical if the formal criteria required for the assignment of any truth-value (whether true, false, pragmatically true, or pragmatically false) to such sentence are not met, a (well-formed) formula will be considered pragmatically nonsensical if the pragmatic criteria (inscribed within the context of scientific practice) required for the assignment of any truth-value to such sentence are not met. Thus, in the context of the theory of pragmatic truth, any (well-formed) formula of a formal language interpreted on a simple pragmatic structure will be considered pragmatically nonsensical if the set of primary sentences of such structure is not well-built, that is, if it does not include the relevant observational data and/or theoretical results, or if it does include sentences that are inconsistent with such data. (shrink)

In 1999, da Silva, D'Ottaviano and Sette proposed a general definition for the term translation between logics and presented an initial segment of its theory. Logics are characterized, in the most general sense, as sets with consequence relations and translations between logics as consequence-relation preserving maps. In a previous paper the authors introduced the concept of conservative translation between logics and studied some general properties of the co-complete category constituted by logics and conservative translations between them. In this paper we (...) present some conservative translations involving classical logic, Lukasiewicz three-valued system L₃, the intuitionistic system Iⁱ and several para-consistent logics, as for instance Sette's system Pⁱ, the D'Ottaviano and da Costa system J₃ and da Costa's systems $\text{C}_{n}$ , 1 ≤ n ≤ ω. (shrink)

The aim of this paper is to argue about the impossibility of constructing a complete formal theory or a complete Turing machines' algorithm that represent the human capacity of recognizing mathematical truths. More specifically, based on a direct argument from Gödel's First Incompleteness Theorem, we discuss the impossibility of constructing a complete formal theory or a complete Turing machines' algorithm to the human capacity of recognition of first-order arithmetical truths and so of mathematical truths in general.

In this paper we present a new hierarchy of analytical tableaux systems TNDC n, 1≤n (...) and also prove that these systems are logically equivalent to the corresponding systems Cn, 1≤nshrink)