Multiple -conclusion logic extends formal logic by allowing arguments to have a set of conclusions instead of a single one, the truth lying somewhere among the conclusions if all the premises are true. The extension opens up interesting possibilities based on the symmetry between premises and conclusions, and can also be used to throw fresh light on the conventional logic and its limitations. This is a sustained study of the subject and is certain to stimulate further research. Part I reworks (...) the fundamental ideas of logic to take account of multiple conclusions, and investigates the connections between multiple - and single - conclusion calculi. Part II draws on graph theory to discuss the form and validity of arguments independently of particular logical systems. Part III contrasts the multiple - and the single - conclusion treatment of one and the same subject, using many-valued logic as the example; and Part IV shows how the methods of 'natural deduction' can be matched by direct proofs using multiple conclusions. (shrink)

This paper considers some issues to do with valuational presentations of consequence relations, and the Galois connections between spaces of valuations and spaces of consequence relations. Some of what we present is known, and some even well-known; but much is new. The aim is a systematic overview of a range of results applicable to nonreflexive and nontransitive logics, as well as more familiar logics. We conclude by considering some connectives suggested by this approach.

This paper considers some issues to do with valuational presentations of consequence relations, and the Galois connections between spaces of valuations and spaces of consequence relations. Some of what we present is known, and some even well-known; but much is new. The aim is a systematic overview of a range of results applicable to nonreflexive and nontransitive logics, as well as more familiar logics. We conclude by considering some connectives suggested by this approach.

Starting from the notions of q-entailment and p-entailment, a two-dimensional notion of entailment is developed with respect to certain generalized q-matrices referred to as B-matrices. After showing that every purely monotonic singleconclusion consequence relation is characterized by a class of B-matrices with respect to q-entailment as well as with respect to p-entailment, it is observed that, as a result, every such consequence relation has an inferentially four-valued characterization. Next, the canonical form of B-entailment, a two-dimensional multiple-conclusion notion of entailment based (...) on B-matrices, is introduced, providing a uniform framework for studying several different notions of entailment based on designation, antidesignation, and their complements. Moreover, the two-dimensional concept of a B-consequence relation is defined, and an abstract characterization of such relations by classes of B-matrices is obtained. Finally, a contribution to the study of inferential many-valuedness is made by generalizing Suszko’s Thesis and the corresponding reduction to show that any B-consequence relation is, in general, inferentially four-valued. (shrink)

This new edition of Introduction to Lattices and Order presents a radical reorganization and updating, though its primary aim is unchanged. The explosive development of theoretical computer science in recent years has, in particular, influenced the book's evolution: a fresh treatment of fixpoints testifies to this and Galois connections now feature prominently. An early presentation of concept analysis gives both a concrete foundation for the subsequent theory of complete lattices and a glimpse of a methodology for data analysis that is (...) of commercial value in social science. Classroom experience has led to numerous pedagogical improvements and many new exercises have been added. As before, exposure to elementary abstract algebra and the notation of set theory are the only prerequisites, making the book suitable for advanced undergraduates and beginning graduate students. It will also be a valuable resource for anyone who meets ordered structures. (shrink)

It will be an essential resource for philosophers, mathematicians, computer scientists, linguists, or any scholar who finds connectives, and the conceptual issues surrounding them, to be a source of interest.This landmark work offers both ...

Nonclassical logics have played an increasing role in recent years in disciplines ranging from mathematics and computer science to linguistics and philosophy. _Generalized Galois Logics_ develops a uniform framework of relational semantics to mediate between logical calculi and their semantics through algebra. This volume addresses normal modal logics such as K and S5, and substructural logics, including relevance logics, linear logic, and Lambek calculi. The authors also treat less-familiar and new logical systems with equal deftness.

I consider the phenomenon of conflation—treating distinct things as one—and develop logical tools for modeling it. These tools involve a purely consequence-theoretic treatment, independent of any proof or model theory, as well as a four-valued valuational treatment.

This paper considers the question: what becomes of the notion of a logic as a way of codifying valid arguments when the customary assumption is dropped that the premisses and conclusions of these arguments are statements from some single language? An elegant treatment of the notion of a logic, when this assumption is in force, is that provided by Dana Scott's theory of consequence relations; this treatment is appropriately generalized in the present paper to the case where we do not (...) make this assumption of linguistic homogeneity. Several applications of the resulting concept of a heterogeneous logic are suggested, but the main emphasis is on the formal development. One topic touched on is a certain contrast between the boolean and the intensional sentence-connectives in this more general setting. (shrink)

This paper uses the notion of Galois-connection to examine the relation between valuation-spaces and logics. Every valuation-space gives rise to a logic, and every logic gives rise to a valuation space, where the resulting pair of functions form a Galois-connection, and the composite functions are closure-operators. A valuation-space (resp., logic) is said to be complete precisely if it is Galois-closed. Two theorems are proven. A logic is complete if and only if it is reflexive and transitive. A valuation-space is complete (...) if and only if it is closed under formation of super-valuations. (shrink)