Society Semantics, introduced by W. Carnielli and M. Lima-Marques, is a method for obtaining new logics from the combination of agents of a given logic. The goal of this paper is to present several generalizations of this method, as well as to show some applications to many-valued logics. After a reformulation of Society Semantics in a wider setting, we develop in detail two examples of application of the new formalism, characterizing a hierarchy of paraconsistent logics called Pn and a hierarchy (...) of paracomplete logics In. We also propose three further generalizations, obtaining Society Semantics for several many-valued logics, including a hierarchy of logics called In Pk which are both paraconsistent and paracomplete. (shrink)

I offer you some theories of intellectual obligations and rights (virtue Ethics): initially, RBT (a Right to Believe Truth, if something is true it follows one has a right to believe it), and, NDSM (one has no right to believe a contradiction, i.e., No right to commit Doxastic Self-Mutilation). Evidence for both below. Anthropology, Psychology, computer software, Sociology, and the neurosciences prove things about human beliefs, and History, Economics, and comparative law can provide evidence of value about theories of rights. (...) However, insofar as we have methods within Philosophy to help us formulate precise concepts of 'belief' and 'rights', methods that also help us to prove links (or absence thereof) amongst families of concepts of rights and belief, our discipline is in and of itself capable of sound reasoning about issues as puzzling as the following. Suppose a Jane who does not believe in God yet who believes she ought to so believe: Jane is undergoing doxastic moral regret (moral regret for lack of faith). We have all known such Janes and perhaps at one time or another even been one. Paradox: given RBT and NDSM, Jane as described not only does not exist, Jane cannot exist. Thus, to enrich the ways in which Philosophy need not get all its evidence from other academic disciplines, I present a brief introduction to what I call Neutral Universal Frames (NUFs). NUFs solve hard puzzles about interactions among modal concepts of belief and rights, concepts that occur in RBT, NDSM and the description of our Janes. NUFs for theories precisely articulated via any two or more modal concepts are a powerful and immensely general set of tools enabling us to define rich theories of truth ("models on frames") to test philosophical theories for internal consistency and to prove the existence of connections (or absence thereof) amongst alternative articulations of philosophical theories. NUFs thereby add to the constructive knowledge producing way Logics intersect with Philosophy of Religion. And we will soon see why Jane, be she named 'Jane' or known simply as you: cannot exist. Read on at your own risk. (shrink)

A completeness theorem is established for logics with congruence endowed with general semantics (in the style of general frames). As a corollary, completeness is shown to be preserved by fibring logics with congruence provided that congruence is retained in the resulting logic. The class of logics with equivalence is shown to be closed under fibring and to be included in the class of logics with congruence. Thus, completeness is shown to be preserved by fibring logics with equivalence and general semantics. (...) An example is provided showing that completeness is not always preserved by fibring ligics endowed with standard (non general) semantics. A categorial characterization of fibring is provided using coproducts and cocartesian liftings. (shrink)

The transference of preservation results between importing and unconstrained fibring is investigated. For that purpose, a new formulation of fibring, called biporting, is introduced, and importing is shown to be subsumed by biporting. In consequence, particular cases of importing, like temporalization, modalization and globalization are subsumed by fibring. Capitalizing on these results, the preservation of the finite model property by fibring is transferred to importing and then carried over to globalization.

Fibring is recognized as one of the main mechanisms in combining logics, with great signicance in the theory and applications of mathematical logic. However, an open challenge to bring is posed by the collapsing problem: even when no symbols are shared, certain combinations of logics simply collapse to one of them, indicating that bring imposes unwanted interconnections between the given logics. Modulated bring allows a ner control of the combination, solving the collapsing problem both at the semantic and deductive levels. (...) Main properties like soundness and completeness are shown to be preserved, comparison with bring is discussed, and some important classes of examples are analyzed with respect to the collapsing problem. (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 a general recipe for presenting non-classical logics in a modular and uniform way as labelled deduction systems. Our recipe is based on a labelling mechanism where labels are general entities that are present, in one way or another, in all logics, namely truth-values. More specifically, the main idea underlying our approach is the use of algebras of truth-values, whose operators reflect the semantics we have in mind, as the labelling algebras of our labelled deduction systems. The “truth-values as (...) labels” approach allows us to give generalized systems for multiple-valued logics within the same formalism: since we can take multiple-valued logics as meaning not only finitely or infinitely many-valued logics but also power-set logics, i.e. logics for which the denotation of a formula can be seen as a set of worlds, our recipe allows us to capture also logics such as modal, intuitionistic and relevance logics, thus providing a first step towards the fibring of these logics with many-valued ones. (shrink)