In 1986, Mikenberg et al. introduced the semantic notion of quasi-truth defined by means of partial structures. In such structures, the predicates are seen as triples of pairwise disjoint sets: the set of tuples which satisfies, does not satisfy and can satisfy or not the predicate, respectively. The syntactical counterpart of the logic of partial truth is a rather complicated first-order modal logic. In the present article, the notion of predicates as triples is recursively extended, in a natural way, to (...) any complex formula of the first-order object language. From this, a new definition of quasi-truth is obtained. The proof-theoretic counterpart of the new semantics is a first-order paraconsistent logic whose propositional base is a 3-valued logic belonging to hierarchy of paraconsistent logics known as Logics of Formal Inconsistency, which was proposed by Carnielli and Marcos in 2002. (shrink)

This paper introduces new logical systems which axiomatize a formal representation of inconsistency (here taken to be equivalent to contradictoriness) in classical logic. We start from an intuitive semantical account of inconsistent data, fixing some basic requirements, and provide two distinct sound and complete axiomatics for such semantics, LFI1 and LFI2, as well as their first-order extensions, LFI1* and LFI2*, depending on which additional requirements are considered. These formal systems are examples of what we dub Logics of Formal Inconsistency (LFI) (...) and form part of a much larger family of similar logics. We also show that there are translations from classical and paraconsistent first-order logics into LFI1* and LFI2*, and back. Hence, despite their status as subsystems of classical logic, LFI1* and LFI2* can codify any classical or paraconsistent reasoning. (shrink)

The object of this paper is to show how one is able to construct a paraconsistent theory of models that reflects much of the classical one. In other words the aim is to demonstrate that there is a very smooth and natural transition from the model theory of classical logic to that of certain categories of paraconsistent logic. To this end we take an extension of da Costa''sC 1 = (obtained by adding the axiom A A) and prove for it (...) results which correspond to many major classical model theories, taken from Shoenfield [5]. In particular we prove counterparts of the theorems of o-Tarski and Chang-o-Suszko, Craig-Robinson and the Beth definability theorem. (shrink)

There are several conceptions of truth, such as the classical correspondence conception, the coherence conception and the pragmatic conception. The classical correspondence conception, or Aristotelian conception, received a mathematical treatment in the hands of Tarski (cf. Tarski [1935] and [1944]), which was the starting point of a great progress in logic and in mathematics. In effect, Tarski's semantic ideas, especially his semantic characterization of truth, have exerted a major influence on various disciplines, besides logic and mathematics; for instance, linguistics, the (...) philosophy of science, and the theory of knowledge. The importance of the Tarskian investigations derives, among other things, from the fact that they constitute a mathematical, formal mark to serve as a reference for the philosophical (informal) conceptions of truth. Today the philosopher knows that the classical conception can be developed and that it is free from paradoxes and other difficulties, if certain precautions are taken. We believe that is not an exaggeration if we assert that Tarski's theory should be considered as one of the greatest accomplishments of logic and mathematics of our time, an accomplishment which is also of extraordinary relevance to philosophy, as we have already remarked. In this paper we show that the pragmatic conception of truth, at least in one of its possible interpretations, has also a mathematical formulation, similar in spirit to that given by Tarski to the classical correspondence conception. (shrink)

The Joint Non-Trivialization Theorem, two Definability Theorems and the generalized Quantifier Elimination Theorem are proved for J 3-theories. These theories are three-valued with more than one distinguished truth-value, reflect certain aspects of model type logics and can. be paraconsistent. J 3-theories were introduced in the author's doctoral dissertation.