One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found. Since the inception of da Costa's paraconsistent calculi, an algebraic equivalent for such systems have been searched. It is known that these systems are non self-extensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of Blok-Pigozzi. The same negative results hold (...) for several systems of the hierarchy of paraconsistent logics known as Logics of Formal Inconsistency (LFIs). Because of this, these logics are uniquely characterized by semantics of non-deterministic kind. This paper offers a solution for two open problems in the domain of paraconsistency, in particular connected to algebraization of LFIs, by obtaining several LFIs weaker than C1, each of one is algebraizable in the standard Lindenbaum-Tarski's sense by a suitable variety of Boolean algebras extended with operators. This means that such LFIs satisfy the replacement property. The weakest LFI satisfying replacement presented here is called RmbC, which is obtained from the basic LFI called mbC. Some axiomatic extensions of RmbC are also studied, and in addition a neighborhood semantics is defined for such systems. It is shown that RmbC can be defined within the minimal bimodal non-normal logic E+E defined by the fusion of the non-normal modal logic E with itself. Finally, the framework is extended to first-order languages. RQmbC, the quantified extension of RmbC, is shown to be sound and complete w.r.t. BALFI semantics. (shrink)

Esta enciclopédia abrange, de uma forma introdutória mas desejavelmente rigorosa, uma diversidade de conceitos, temas, problemas, argumentos e teorias localizados numa área relativamente recente de estudos, os quais tem sido habitual qualificar como «estudos lógico-filosóficos». De uma forma apropriadamente genérica, e apesar de o território teórico abrangido ser extenso e de contornos por vezes difusos, podemos dizer que na área se investiga um conjunto de questões fundamentais acerca da natureza da linguagem, da mente, da cognição e do raciocínio humanos, bem (...) como questões acerca das conexões destes com a realidade não mental e extralinguística. A razão daquela qualificação é a seguinte: por um lado, a investigação em questão é qualificada como filosófica em virtude do elevado grau de generalidade e abstracção das questões examinadas (entre outras coisas); por outro, a investigação é qualificada como lógica em virtude de ser uma investigação logicamente disciplinada, no sentido de nela se fazer um uso intenso de conceitos, técnicas e métodos provenientes da disciplina de lógica. O agregado de tópicos que constitui a área de estudos lógico-filosóficos é já visível, pelo menos em parte, no Tractatus Logico-Philosophicus de Ludwig Wittgenstein, uma obra publicada em 1921. E uma boa maneira de ter uma ideia sinóptica do território disciplinar abrangido por esta enciclopédia, ou pelo menos de uma porção substancial dele, é extrair do Tractatus uma lista dos tópicos mais salientes aí discutidos; a lista incluirá certamente tópicos do seguinte género, muitos dos quais se podem encontrar ao longo desta enciclopédia: factos e estados de coisas; objectos; representação; crenças e estados mentais; pensamentos; a proposição; nomes próprios; valores de verdade e bivalência; quantificação; funções de verdade; verdade lógica; identidade; tautologia; o raciocínio matemático; a natureza da inferência; o cepticismo e o solipsismo; a indução; as constantes lógicas; a negação; a forma lógica; as leis da ciência; o número. (shrink)

One of Da Costa’s motives when he constructed the paraconsistent logic C! was to dualise the negation of intuitionistic logic. In this paper I explore a different way of going about this task. A logic is defined by taking the Kripke semantics for intuitionistic logic, and dualising the truth conditions for negation. Various properties of the logic are established, including its relation to C!. Tableau and natural deduction systems for the logic are produced, as are appropriate algebraic structures. The paper (...) then investigates dualising the intuitionistic conditional in the same way. This establishes various connections between the logic, and a logic called in the literature ‘Brouwerian logic’ or ‘closed-set logic’. (shrink)

The propositional calculi $C_{n}$ , $1\leq n\leq \omega $ introduced by N.C.A. da Costa consitute special kinds of paraconsistent logics. A question which remained open for some time concerned whether it was possible to obtain a Lindenbaum's algebra for $C_{n}$ . C. Mortensen settled the problem, proving that no equivalence relation for $C_{n}$ determines a non-trivial quotient algebra. The concept of da Costa algebra, which reflects most of the logical properties of $C_{n}$ , as well as the concept of paraconsistent (...) closure system, are introduced in this paper. We show that every da Costa algebra is isomorphic with a paraconsistent algebra of sets, and that the closure system of all filters of a da Costa algebra is paraconsistent. (shrink)

We study a range of issues connected with the idea of replacing one formula by another in a fixed context. The replacement core of a consequence relation ⊢ is the relation holding between a set of formulas {A1,..., Am,...} and a formula B when for every context C, we have C,..., C,... ⊢ C. Section 1 looks at some differences between which inferences are lost on passing to the replacement cores of the classical and intuitionistic consequence relations. For example, we (...) find that while the inference from A and B to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$A \land B$\end{document}, sanctioned by both these initial consequence relations, is retained on passage to the replacement core in the classical case, it is lost in the intuitionistic case. Further discussion of these two logics occupies Sections 3 and 4. Section 2 looks at the m = 1 case, describing A as replaceable by B according to ⊢ when B is a consequence of A by the replacement core of ⊢, and inquiring as to which choices of ⊢ render this induced replaceability relation symmetric. Section 5 investigates further conceptual refinements— such as a contrast between horizontal and vertical replaceability—suggested by some work of R. B. Angell and R. Harrop in the 1950s and 1960s. Appendix 1 examines a related aspect of term-for-term replacement in connection with identity in predicate logic. Appendix 2 is a repository for proofs which would otherwise clutter up Section 3. (shrink)

The prepositional calculiC n , 1 n introduced by N.C.A. da Costa constitute special kinds of paraconsistent logics. A question which remained open for some time concerned whether it was possible to obtain a Lindenbaum''s algebra forC n . C. Mortensen settled the problem, proving that no equivalence relation forC n . determines a non-trivial quotient algebra.The concept of da Costa algebra, which reflects most of the logical properties ofC n , as well as the concept of paraconsistent closure system, (...) are introduced in this paper. (shrink)

This paper explores early Australasian philosophy in some detail. Two approaches have dominated Western philosophy in Australia: idealism and materialism. Idealism was prevalent between the 1880s and the 1930s, but dissipated thereafter. Idealism in Australia often reflected Kantian themes, but it also reflected the revival of interest in Hegel through the work of ‘absolute idealists’ such as T. H. Green, F. H. Bradley, and Henry Jones. A number of the early New Zealand philosophers were also educated in the idealist tradition (...) and were influential in their communities, but produced relatively little. In Australia, materialism gained prominence through the work of John Anderson, who arrived in Australia in 1927, and continues to be influential. John Anderson had been a student of Henry Jones, who might therefore be said to have influenced both main strands of Australian philosophical thought. (shrink)

It is well-known that da Costa's C-systems of paraconsistent logic do not admit a Blok-Pigozzi algebraization. Still, an algebraic flavored semantics for them has been proposed in the literature, namely using the class of so-called da Costa algebras. However, the precise connection between these semantic structures and the C-systems was never established at the light of the theory of algebraizable logics. In this paper we propose to study the C-systems from an algebraic point of view, and to fill in this (...) gap by using the tools and techniques of the newly developed behavioral approach to abstract algebraic logic. As a by-product of the approach, we also rediscover the bivaluation semantics of the logics. (shrink)

This paper is an attempt to clear some philosophical questions about the nature of logic by setting up a mathematical framework. The notion of congruence in logic is defined. A logical structure in which there is no non-trivial congruence relation, like some paraconsistent logics, is called simple. The relations between simplicity, the replacement theorem and algebraization of logic are studied (including MacLane-Curry’s theorem and a discussion about Curry’s algebras). We also examine how these concepts are related to such notions as (...) semantics, truth-functionality and bivalence. We argue that a logic, which is simple, can deserve the name logic and that the opposite view is connected with a reductionist perspective (reduction of logic to algebra). (shrink)

1 What are the features of a paraconsistent negation? Since paraconsistent logic was launched by da Costa in his seminal paper [4], one of the fundamental problems has been to determine what exactly are the theoretical or metatheoretical properties of classical negation that can have a unary operator not obeying the principle of noncontradiction, that is, a paraconsistent operator. What the result presented here shows is that some of these properties are not compatible with each other, so that in constructing (...) a paraconsistent negation as close as possible to classical negation, we have to make a choice among classical properties compatible with the idea of paraconsistency. In particular, there is no paraconsistent negation more classical than all the others. (shrink)

The notion of an algebraizable logic in the sense of Blok and Pigozzi [3] is generalized to that of a possibly infinitely algebraizable, for short, p.i.-algebraizable logic by admitting infinite sets of equivalence formulas and defining equations. An example of the new class is given. Many ideas of this paper have been present in [3] and [4]. By a consequent matrix semantics approach the theory of algebraizable and p.i.-algebraizable logics is developed in a different way. It is related to the (...) theory of equivalential logics in the sense of Prucnal and Wroski [18], and it is extended to nonfinitary logics. The main result states that a logic is algebraizable (p.i.-algebraizable) iff it is finitely equivalential (equivalential) and the truth predicate in the reduced matrix models is equationally definable. (shrink)

Fibring has been shown to be useful for combining logics endowed withtruth-functional semantics. However, the techniques used so far are unableto cope with fibring of logics endowed with non-truth-functional semanticsas, for example, paraconsistent logics. The first main contribution of thepaper is the development of a suitable abstract notion of logic, that mayalso encompass systems with non-truth-functional connectives, and wherefibring can still be dealt with. Furthermore, it is shown that thisextended notion of fibring preserves completeness under certain reasonableconditions. This completeness transfer (...) result, the second main contributionof the paper, generalizes the one established in Zanardo et al. (2001) butis obtained using new techniques that explore the properties of a suitablemeta-logic (conditional equational logic) where the (possibly)non-truth-functional valuations are specified. The modal paraconsistentlogic of da Costa and Carnielli (1988) is studied in the context of this novel notionof fibring and its completeness is so established. (shrink)

We introduce and study a new approach to the theory of abstract algebraic logic (AAL) that explores the use of many-sorted behavioral logic in the role traditionally played by unsorted equational logic. Our aim is to extend the range of applicability of AAL toward providing a meaningful algebraic counterpart also to logics with a many-sorted language, and possibly including non-truth-functional connectives. The proposed behavioral approach covers logics which are not algebraizable according to the standard approach, while also bringing a new (...) algebraic perspective to logics which are algebraizable using the standard tools of AAL. Furthermore, we pave the way toward a robust behavioral theory of AAL, namely by providing a behavioral version of the Leibniz operator which allows us to generalize the traditional Leibniz hierarchy, as well as several well-known characterization results. A number of meaningful examples will be used to illustrate the novelties and advantages of the approach. (shrink)