This paper discusses a generalization of logical expressivism. It is shown that, in the wide sense defined here, the expressivist approach is neutral with respect to different theories of inference and offers a natural framework for understanding logical forms and their function. An expressivist strategy for explaining the development of logical forms is then applied to the analysis of Frege’s Begriffsschrift, Gentzen’s sequent calculus and Belnap’s display logic.

Angell's logic of analytic containment AC has been shown to be characterized by a 9-valued matrix NC by Ferguson, and by a 16-valued matrix by Fine. We show that the former is the image of a surjective homomorphism from the latter, i.e., an epimorphic image. The epimorphism was found with the help of MUltlog, which also provides a tableau calculus for NC extended by quantifiers that generalize conjunction and disjunction.

In classically based modal logic, there are three common conceptions of necessity, the universal conception, the equivalence relation conception, and the axiomatic conception. They provide distinct presentations of the modal logic S5, all of which coincide in the basic modal language. We explore these different conceptions in the context of the relevant logic R, demonstrating where they come apart. This reveals that there are many options for being an S5-ish extension of R. It further reveals a divide between the universal (...) conception of necessity on the one hand, and the axiomatic conception on the other: The latter is consistent with motivations for relevant logics while the former is not. For the committed relevant logician, necessity cannot be the truth in all possible worlds. (shrink)

Formalizations in first-order logic are standardly used to represent logical forms of sentences and to show the validity of ordinary-language arguments. Since every sentence admits of a variety of formalizations, a challenge arises: why should one valid formalization suffice to show validity even if there are other, invalid, formalizations? This paper suggests an explanation with reference to criteria of adequacy which ensure that formalizations are related in a hierarchy of more or less specific formalizations. This proposal is then compared with (...) stronger criteria and assumptions, especially the idea that sentences essentially have just one logical form. (shrink)

In this paper we present a characterization of hyper-connexivity by means of a relating semantics for Boolean connexive logics. We also show that the minimal Boolean connexive logic is Abelardian, strongly consistent, Kapsner strong and antiparadox. We give an example showing that the minimal Boolean connexive logic is not simplificative. This shows that the minimal Boolean connexive logic is not totally connexive.