I read Stefan Collini’s What are Universities For? last week with very mixed feelings. In the past, I’ve much admired his polemical essays on the REF, “impact”, the Browne Report, etc. in the London Review of Books and elsewhere: they speak to my heart. If you don’t know those essays, you can get some of their flavour from his latest article in the Guardian yesterday. But I found the book a disappointment. Perhaps the trouble is that Collini is too decent, (...) too high-minded, has too unrealistically exalted a view about what actually happens in universities which is too coloured by attitudes appropriate to the traditional humanities. And he is optimistic to the point of fantasy if he thinks that people are so susceptible to “the romance of ideas and the power of beauty” that they will want, or can be brought to want, lots and lots of universities in order to promote the ideas (as if they would suppose that the task of “conserving, understanding, extending and handing on to subsequent generations the intellectual, scientific, and artistic heritage of mankind” was clearly ill-served when there were only forty universities in England, as opposed to a hundred and whatever). (shrink)

Multi-modal versions of propositional logics S5 or S4—commonly accepted as logics of knowledge—are capable of describing static states of knowledge but they do not reflect how the knowledge changes after communications among agents. In the present paper (part of broader research on logics of knowledge and communications) we define extensions of the logic S5 which can deal with public communications. The logics have natural semantics. We prove some completeness, decidability and interpretability results and formulate a general (...) method that solves certain kind of problems involving public communications—among them well known puzzles of Muddy Children and Mr. Sum & Mr. Product. As the paper gives a formal logical treatment of the operation of restriction of the universe of a Kripke model, it contributes also to investigations of semantics for modal logics. (shrink)

The Editors express their gratitude and appreciation to the indi-viduals listed below who served as referees for Informal Logic for Volumes 31 (2011) and 32 (2012).

This mixed-methods case study describes the experiences of a rural health organization in Canada that was a pioneer in undergoing institutionally driven radical change. This change was advocated by senior managers and physicians with the strong backing of the government. The senior managers and physicians made a strong case for the radical change and argued that a focus on efficiency and wellness would lead to improved service and quality of patient-care. However, this radical change initiative was resisted by nurses and (...) support staff who perceived that these changes were being driven by market-based institutional logics and questioned their ethical appropriateness in a public system. They also expressed a lack of trust given the large-scale layoffs in a prior restructuring. These findings run counter to extant theory by highlighting the role of agency despite institutional pressures. Specifically, change implementers not only face the burden of justifying ethical appropriateness of institutional logics, but also are required to engage in persuasive discourse that these institutional logics protect the interests of the members. (shrink)

A common reaction to Hegel’s suggestion that we collapse Kant’s distinction between form and content is that, since such a move would also deprive us of any way of distinguishing the merely logical from the real possibility of our concepts, it is incoherent and ought to be rejected. It is true that these two distinctions are intimately related in Kant, such that if one goes, the other does as well. But it is less obvious that giving them up as Kant (...) conceives them is as incoherent a proposal as many of Hegel’s critics think. It has been the point of a recent account of Hegel’s idealism to demonstrate that his critique of Kant’s dichotomy between form and content or concept and intuition does not commit him to the view that human cognition is materially creative of its content in the manner of a God-like or intuitive intellect—does not, in other words, signify a return to a pre-Critical metaphysics. This is the interpretative stance I adopt here as well, in hope of giving defenders of Kant reasons for taking Hegel more seriously. (shrink)

Sets out the basic theory of normal modal and temporal propositional logics; applies this theory to logics of discrete (integer), dense (rational), and continuous (real) time, to the temporal logic of henceforth, next, and until, and to the propositional dynamic logic of regular programs.

Visser's rules form a basis for the admissible rules of . Here we show that this result can be generalized to arbitrary intermediate logics: Visser's rules form a basis for the admissible rules of any intermediate logic for which they are admissible. This implies that if Visser's rules are derivable for then has no nonderivable admissible rules. We also provide a necessary and sufficient condition for the admissibility of Visser's rules. We apply these results to some specific intermediate (...) class='Hi'>logics and obtain that Visser's rules form a basis for the admissible rules of, for example, De Morgan logic, and that Dummett's logic and the propositional Gödel logics do not have nonderivable admissible rules. (shrink)

We introduce a general representation of unary hyperintensional modalities and study various hyperintensional modal logics based on the representation. It is shown that the major approaches to hyperintensionality known from the literature, that is state-based, syntactic and structuralist approaches, all correspond to special cases of the general framework. Completeness results pertaining to our hyperintensional modal logics are established.

This paper concerns modal logics appearing from the temporal ordering of domains in two-dimensional Minkowski spacetime. As R. Goldblatt has proved recently, the logic of the whole plane isS4.2. We consider closed or open convex polygons and closed or open domains bounded by simple differentiable curves; this leads to the logics:S4,S4.1,S4.2 orS4.1.2.

This volume examines the concept of falsification as a central notion of semantic theories and its effects on logical laws. The point of departure is the general constructivist line of argument that Michael Dummett has offered over the last decades. From there, the author examines the ways in which falsifications can enter into a constructivist semantics, displays the full spectrum of options, and discusses the logical systems most suitable to each one of them. While the idea of introducing falsifications into (...) the semantic account is Dummett's own, the many ways in which falsificationism departs quite radically from verificationism are here spelled out in detail for the first time. The volume is divided into three large parts. The first part provides important background information about Dummett’s program, intuitionism and logics with gaps and gluts. The second part is devoted to the introduction of falsifications into the constructive account and shows that there is more than one way in which one can do this. The third part details the logical effects of these various moves. In the end, the book shows that the constructive path may branch in different directions: towards intuitionistic logic, dual intuitionistic logic and several variations of Nelson logics. The author argues that, on balance, the latter are the more promising routes to take. "Kapsner’s book is the first detailed investigation of how to incorporate the notion of falsification into formal logic. This is a fascinating logico-philosophical investigation, which will interest non-classical logicians of all stripes." Graham Priest, Graduate Center, City University of New York and University of Melbourne. (shrink)

Once upon a time, modal logic was castigated because it ‘had no semantics.’ Kripke, Hintikka, Kanger, and others changed all that. In a similar way, when Relevant Logic was introduced by Anderson and Belnap, it too was castigated for ‘having no semantics.’ The present overview marks a culmination of that effort. The semantic approach described here brings together a number of hitherto disparate efforts to set out formal systems for logics of relevant implication and entailment. It also makes clear (...) (despite some of our hopes and utterances) that the One True Logic does not exist. This is as true for relevant logics as Kripke et al., showed it to be for modal logics. In both cases, subtle (and not so subtle) variations on semantical postulates produce different logics in the same family. The question of which semantical postulates are correct makes no sense without further context, i.e., the questioner needs to answer the question: Correct for what? The question that does remain is: What motivates the relevant family of logics? And this is the question that is the main job for this chapter to investigate. (shrink)

We obtain modal completeness of the interpretability logics IL $\!\!\textsf {P}_{\textsf {0}}$ and ILR w.r.t. generalised Veltman semantics. Our proofs are based on the notion of full labels [2]. We also give shorter proofs of completeness w.r.t. the generalised semantics for many classical interpretability logics. We obtain decidability and finite model property w.r.t. the generalised semantics for IL $\textsf {P}_{\textsf {0}}$ and ILR. Finally, we develop a construction that might be useful for proofs of completeness of extensions of (...) ILW w.r.t. the generalised semantics in the future, and demonstrate its usage with $\textbf {IL}\textsf {W}^\ast = \textbf {IL}\textsf {WM}_{\textsf {0}}$. (shrink)

Fundamental properties of N-valued logics are compared and eleven theorems are presented for their Logic Algebras, including Łukasiewicz–Moisil Logic Algebras represented in terms of categories and functors. For example, the Fundamental Logic Adjunction Theorem allows one to transfer certain universal, or global, properties of the Category of Boolean Algebras,, (which are well-understood) to the more general category \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\cal L}$$\end{document}Mn of Łukasiewicz–Moisil Algebras. Furthermore, the relationships of LMn-algebras to other many-valued logical (...) structures, such as the n-valued Post, MV and Heyting logic algebras, are investigated and several pertinent theorems are derived. Applications of Łukasiewicz–Moisil Algebras to biological problems, such as nonlinear dynamics of genetic networks – that were previously reported – are also briefly noted here, and finally, probabilities are precisely defined over LMn-algebras with an eye to immediate, possible applications in biostatistics. (shrink)

Current dynamic epistemic logics for analyzing effects of informational events often become cumbersome and opaque when common knowledge is added for groups of agents. Still, postconditions involving common knowledge are essential to successful multi-agent communication. We propose new systems that extend the epistemic base language with a new notion of ‘relativized common knowledge’, in such a way that the resulting full dynamic logic of information flow allows for a compositional analysis of all epistemic postconditions via perspicuous ‘reduction axioms’. We (...) also show how such systems can deal with factual alteration, rather than just information change, making them cover a much wider range of realistic events. After a warm-up stage of analyzing logics for public announcements, our main technical results are expressivity and completeness theorems for a much richer logic that we call LCC. This is a dynamic epistemic logic whose static base is propositional dynamic logic (PDL), interpreted epistemically. This system is capable of expressing all model-shifting operations with finite action models, while providing a compositional analysis for a wide range of informational events. This makes LCC a serious candidate for a standard in dynamic epistemic logic, as we illustrate by analyzing some complex communication scenarios, including sending successive emails with both ‘cc’ and ‘bcc’ lines, and other private announcements to subgroups. Our proofs involve standard modal techniques, combined with a new application of Kleene’s theorem on finite automata, as well as new Ehrenfeucht games of model comparison. (shrink)

This article proposes the meeting of fuzzy logic with paraconsistency in a very precise and foundational way. Specifically, in this article we introduce expansions of the fuzzy logic MTL by means of primitive operators for consistency and inconsistency in the style of the so-called Logics of Formal Inconsistency (LFIs). The main novelty of the present approach is the definition of postulates for this type of operators over MTL-algebras, leading to the definition and axiomatization of a family of logics, (...) expansions of MTL, whose degree-preserving counterpart are paraconsistent and moreover LFIs. (shrink)

Retroduction -- Contextualized self-interpretations -- Causal mechanisms -- Ontology -- Logics -- Articulation.

In this article complexity results for adaptive logics using the minimal abnormality strategy are presented. It is proven here that the consequence set of some recursive premise sets is $\Pi _1^1 - complete$ . So, the complexity results in (Horsten and Welch, Synthese 158:41–60,2007) are mistaken for adaptive logics using the minimal abnormality strategy.

A notable early result of David Makinson establishes that every monotone modal logic can be extended to LI, LV, or LF, and every antitone logic can be extended to LN, LV, or LF, where LI, LN, LV, and LF are logics axiomatized, respectively, by the schemas □α↔α, □α↔¬α, □α↔⊤, and □α↔⊥. We investigate logics that are both monotone and antitone (hereafter amphitone). There are exactly three: LV, LF, and the minimum amphitone logic AM axiomatized by the schema □α→□β. (...) These logics, along with LI, LN, and a wider class of “extensional” logics, bear close affinities to classical propositional logic. Characterizing those affinities reveals differences among several accounts of equivalence between logics. Some results about amphitone logics do not carry over when logics are construed as consequence or generalized (“multiple-conclusion”) consequence relations on languages that may lack some or all of the nonmodal connectives. We close by discussing these divergences and conditions under which our results do carry over. (shrink)

We generalize Moss and Parikh's logic of knowledge, effort, and topological reasoning, in two ways. We develop both a multi-agent and a multi-method setting for it. In each of these cases, we prove a corresponding soundness and completeness theorem, and we show that the new logics are decidable. Our methods of proof rely on those for the original system. This might have been expected, since that system is conservatively extended for the given situation. Several technical details are different nevertheless (...) here. (shrink)

This paper discusses three relevant logics that obey Component Homogeneity - a principle that Goddard and Routley introduce in their project of a logic of significance. The paper establishes two main results. First, it establishes a general characterization result for two families of logic that obey Component Homogeneity - that is, we provide a set of necessary and sufficient conditions for their consequence relations. From this, we derive characterization results for S*fde, dS*fde, crossS*fde. Second, the paper establishes complete sequent (...) calculi for S*fde, dS*fde, crossS*fde. Among the other accomplishments of the paper, we generalize the semantics from Bochvar, Hallden, Deutsch and Daniels, we provide a general recipe to define containment logics, we explore the single-premise/single-conclusion fragment of S*fde, dS*fde, crossS*fdeand the connections between crossS*fde and the logic Eq of equality by Epstein. Also, we present S*fde as a relevant logic of meaninglessness that follows the main philosophical tenets of Goddard and Routley, and we briefly examine three further systems that are closely related to our main logics. Finally, we discuss Routley's criticism to containment logic in light of our results, and overview some open issues. (shrink)

Inspired by an interesting quotation from the literature, we propose four modalities, called ‘sane belief’, ‘insane belief’, ‘reliable belief’ and ‘unreliable belief’, and introduce logics with each operator as the modal primitive. We show that the four modalities constitute a square of opposition, which indicates some interesting relationships among them. We compare the relative expressivity of these logics and other related logics, including a logic of false beliefs from the literature. The four main logics are all (...) less expressive than the standard modal logic over various model classes, and the logics of sane and insane beliefs are, respectively, equally expressive as the logics of unreliable and reliable beliefs on any class of models. The logics of reliable and unreliable beliefs are then combined into a bimodal logic, which turns out to be equally expressive as the standard modal logic. Despite this, we cannot obtain a complete axiomatization of the minimal bimodal logic, by simply translating the axioms and rules of the minimal modal logic $\textbf{K}$ into the bimodal language. We then introduce a schematic modality which unifies reliable and unreliable beliefs and axiomatize it over the class of all frames and also the class of serial frames. This line of research is finally extended to unify sane and insane beliefs and some axiomatizations are given. (shrink)

The class of equivalential logics comprises all implicative logics in the sense of Rasiowa [9], Suszko's logicSCI and many Others. Roughly speaking, a logic is equivalential iff the greatest strict congruences in its matrices (models) are determined by polynomials. The present paper is the first part of the survey in which systematic investigations into this class of logics are undertaken. Using results given in [3] and general theorems from the theory of quasi-varieties of models [5] we give (...) a characterization of all simpleC-matrices for any equivalential logicC (Theorem I.14). In corollaries we give necessary and sufficient conditions for the class of all simple models for a given equivalential logic to be closed under free products (Theorem I.18). (shrink)

The novel notion of importing logics is introduced, subsuming as special cases several kinds of asymmetric combination mechanisms, like temporalization [8, 9], modalization [7] and exogenous enrichment [13, 5, 12, 4, 1]. The graph-theoretic approach proposed in [15] is used, but formulas are identified with irreducible paths in the signature multi-graph instead of equivalence classes of such paths, facilitating proofs involving inductions on formulas. Importing is proved to be strongly conservative. Conservative results follow as corollaries for temporalization, modalization and (...) exogenous enrichment. (shrink)

Schrödinger logics are logical systems in which the principle of identity is not true in general. The intuitive motivation for these logics is both Erwin Schrödinger's thesis (which has been advanced by other authors) that identity lacks sense for elementary particles of modern physics, and the way which physicists deal with this concept; normally, they understandidentity as meaningindistinguishability (agreemment with respect to attributes). Observing that these concepts are equivalent in classical logic and mathematics, which underly the usual physical (...) theories, we present a higher-order logical system in which these concepts are systematically separated. A classical semantics for the system is presented and some philosophical related questions are mentioned. One of the main characteristics of our system is that Leibniz' Principle of the Identity of Indiscernibles cannot be derived. This fact is in accordance with some authors who maintain that quantum mechanics violates this principle. Furthermore, our system may be viewed as a way of making sense some of Schrödinger's logical intuitions about the nature of elementary particles. (shrink)

There exist important deductive systems, such as the non-normal modal logics, that are not proper subjects of classical algebraic logic in the sense that their metatheory cannot be reduced to the equational metatheory of any particular class of algebras. Nevertheless, most of these systems are amenable to the methods of universal algebra when applied to the matrix models of the system. In the present paper we consider a wide class of deductive systems of this kind called protoalgebraic logics. (...) These include almost all (non-pathological) systems of prepositional logic that have occurred in the literature. The relationship between the metatheory of a protoalgebraic logic and its matrix models is studied. The following results are obtained for any finite matrix model U of a filter-distributive protoalgebraic logic : (I) The extension U of is finitely axiomatized (provided has only finitely many inference rules); (II) U has only finitely many extensions. (shrink)

It is a classic result (McKinsey & Tarski, 1944; Rasiowa & Sikorski, 1963) that if we interpret modal diamond as topological closure, then the modal logic of any dense-in-itself metric space is the well-known modal system S4. In this paper, as a natural follow-up, we study the modal logic of an arbitrary metric space. Our main result establishes that modal logics arising from metric spaces form the following chain which is order-isomorphic (with respect to the ⊃ relation) to the (...) ordinalω+ 3:$S4.Gr{z_1} \supset S4.Gr{z_2} \supset S4.Gr{z_3} \supset \cdots \,S4.Grz \supset S4.1 \supset S4.$It follows that the modal logic of an arbitrary metric space is finitely axiomatizable, has the finite model property, and hence is decidable. (shrink)

The First International Workshop brings together researchers from the theoretical ends of the logic programming and artificial intelligence communities to discuss their mutual interests. Logic programming deals with the use of models of mathematical logic as a way of programming computers, where theoretical AI deals with abstract issues in modeling and representing human knowledge and beliefs. One common ground is nonmonotonic reasoning, a family of logics that includes room for the kinds of variations that can be found in human (...) reasoning. Topics covered: Stable Semantics. Default Logic. AutoEpistemic Logic. Truth Maintenance Systems. Implementation Issues. Diagnosis. Applications. Inheritance Reasoning. Logics of Belief. Inconsistency and Non-Monotonicity. (shrink)

Intermediate prepositional logics we consider here describe the setI() of regular informational types introduced by Yu. T. Medvedev [7]. He showed thatI() is a Heyting algebra. This algebra gives rise to the logic of infinite problems from [13] denoted here asLM 1. Some other definitions of negation inI() lead to logicsLM n (n ). We study inclusions between these and other systems, proveLM n to be non-finitely axiomatizable (n ) and recursively axiomatizable (n ). We also show that formulas (...) in one variable do not separateLM from Heyting's logicH, andLM n (n ) from Scott's logic (H+S). (shrink)

This article investigates the connections between the logics of being wrong, introduced in Steinsvold (2011, Notre Dame J. Form. Log., 52, 245–253), and factive ignorance, presented in Kubyshkina and Petrolo (2021, Synthese, 198, 5917–5928). The first part of the paper provides a sound and complete axiomatization of the logic of factive ignorance that corrects errors in Kubyshkina and Petrolo (2021, Synthese, 198, 5917–5928) and resolves questions about the expressivity of the language. In the second half, it is shown that (...) the relationship between the two logics suggests an alternative axiomatization for the logic of factive ignorance, the adequacy of which is easily proved via straightforward translations. (shrink)

The main goal of this work is to present the proof-theoretical and model-theoretical approaches to probabilistic logics which allow reasoning about independence and probabilistic support. We extend the existing formalisms [14] to obtain several variants of probabilistic logics by adding the operators for independence and confirmation to the syntax. We axiomatize these logics, provide corresponding semantics, prove that the axiomatizations are sound and strongly complete, and discuss decidability issues.

The best known algebraizable logics with a conjunction and an implication have the property that the conjunction defines a meet semi-lattice in the algebras of their algebraic counterpart. This property makes it possible to associate with them a semi-lattice based deductive system as a companion. Moreover, the order of the semi-lattice is also definable using the implication. This makes that the connection between the properties of the logic and the properties of its semi-lattice based companion is strong. We introduce (...) a class of algebraizable deductive systems that includes those systems, and study some of their properties and of their semi-lattice based companions. We also study conditions which, when satisfied by a deductive system in the class, imply that it is strongly algebraizable. This brings some information on the open area of research of Abstract Algebraic Logic which consists in finding interesting characterizations of classes of algebraizable logics that are strongly algebraizable. (shrink)

Various four- and three-valued modal propositional logics are studied. The basic systems are modal extensions BK and BS4 of Belnap and Dunn's four-valued logic of firstdegree entailment. Three-valued extensions of BK and BS4 are considered as well. These logics are introduced semantically by means of relational models with two distinct evaluation relations, one for verification and the other for falsification. Axiom systems are defined and shown to be sound and complete with respect to the relational semantics and with (...) respect to twist structures over modal algebras. Sound and complete tableau calculi are presented as well. Moreover, a number of constructive non-modal logics with strong negation are faithfully embedded into BS4, into its three-valued extension B3S4, or into temporal BS4, BtS4. These logics include David Nelson's three-valued logic N3, the four-valued logic N4 bottom, the connexive logic C, and several extensions of bi-intuitionistic logic by strong negation. (shrink)

Contemporary feminist theory is at an impasse: the project of reformulating concepts of self and social identity is thwarted by an association between identity and oppression and victimhood. In Sacrificial Logics, Allison Weir proposes a way out of this impasse through a concept of identity which depends on accepting difference. Weir argues that the equation of identity with repression and domination links "relational" feminists like Nancy Chodorow, who equate self-identity with the repression of connection to others, and poststructuralist feminists (...) like Judith Butler, who view any identity as a repression of nonidentity and difference. Through readings of Chodorow, Butler, Jessica Benjamin, Luce Irigaray, Jacqueline Rose and Julia Kristeva, Weir analyzes the relation of theories of self-identity to theories of women's identity, social identity, the identity of meaning in language and feminist solidarity. Drawing particularly on the work of Julia Kristeva, she argues for a reformulation of self-identity as a capacity to participate in a social world, and sketches a model of a self-identity which depends on a capacity to accept nonidentity, difference and connections to others. (shrink)

A wide family of many-valued logics—for instance, those based on the weak Kleene algebra—includes a non-classical truth-value that is ‘contaminating’ in the sense that whenever the value is assigned to a formula φ⁠, any complex formula in which φ appears is assigned that value as well. In such systems, the contaminating value enjoys a wide range of interpretations, suggesting scenarios in which more than one of these interpretations are called for. This calls for an evaluation of systems with multiple (...) contaminating values. In this paper, we consider the countably infinite family of multiple-conclusion consequence relations in which classical logic is enriched with one or more contaminating values whose behavior is determined by a linear ordering between them. We consider some motivations and applications for such systems and provide general characterizations for all consequence relations in this family. Finally, we provide sequent calculi for a pair of four-valued logics including two linearly ordered contaminating values before defining two-sided sequent calculi corresponding to each of the infinite family of many-valued logics studied in this paper. (shrink)

Provability logics with many modal operators for progressions of theories obtained by iterating their consistency statements are introduced. The corresponding arithmetical completeness theorem is proved.

(2012). Modal logics for reasoning about infinite unions and intersections of binary relations. Journal of Applied Non-Classical Logics: Vol. 22, No. 4, pp. 275-294. doi: 10.1080/11663081.2012.705960.

We define prenormal modal logics and show that S1, S1, S0.9, and S0.9 are Lewis versions of certain prenormal logics, determination and decidability for which are immediate. At the end we characterize Cresswell logics and ponder C. I. Lewis's idea of strict implication in S1.