We present a new frame semantics for positive relevant and substructural propositional logics. This frame semantics is both a generalisation of Routley–Meyer ternary frames and a simplification of them. The key innovation of this semantics is the use of a single accessibility relation to relate collections of points to points. Different logics are modeled by varying the kinds of collections used: they can be sets, multisets, lists or trees. We show that collection frames on trees are sound and complete for (...) the basic positive distributive substructural logic $\mathsf {B}^+$, that collection frames on multisets are sound and complete for $\mathsf {RW}^+$ (the relevant logic $\mathsf {R}^+$, without contraction, or equivalently, positive multiplicative and additive linear logic with distribution for the additive connectives), and that collection frames on sets are sound for the positive relevant logic $\mathsf {R}^+$. The completeness of set frames for $\mathsf {R}^+$ is, currently, an open question. (shrink)

In this study two strands of inferentialism are brought together: the philosophical doctrine of Brandom, according to which meanings are generally inferential roles, and the logical doctrine prioritizing proof-theory over model theory and approaching meaning in logical, especially proof-theoretical terms.

In this paper, we show that the implication fragment of classical propositional logic is finitary for unification with parameters.

Just started a new book. The aim is to establish a science of knowledge in the same way that we have a science of physics or a science of materials. This might appear as an overly ambitious, possibly arrogant, objective, but bear with me. On the day I am beginning to write it–June 7th, 2020–, I think I am in possession of a few things that will help me to achieve this objective. Again, bear with me. My aim is well (...) reflected in the title I chose (just now) for this book: Knowledge & Logic: Towards a science of knowledge. Its most important feature is that I shall take logic to be to knowledge science as calculus is to physics or to materials science. I do not intend to reclaim knowledge from the bosom of philosophy, in which, known as epistemology its erudite discussion has hardly progressed since Plato first defined it as true belief with logos. With only a few adjustments, it will actually provide me with the right, science-bound start. More recently, knowledge has been reclaimed by the field of BA, a reclaim that has opened the box of Pandora: Among the evils, and perhaps at the head of the list, is an overly lay, essentially naive, notion of knowledge. But the very idea that one can have something like “knowledge (management) software” puts us on the right track. (shrink)

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)

Presenting the first comprehensive, in-depth study of hyperintensionality, this book equips readers with the basic tools needed to appreciate some of current and future debates in the philosophy of language, semantics, and metaphysics. After introducing and explaining the major approaches to hyperintensionality found in the literature, the book tackles its systematic connections to normativity and offers some contributions to the current debates. The book offers undergraduate and graduate students an essential introduction to the topic, while also helping professionals in related (...) fields get up to speed on open research-level problems. (shrink)

We investigate two different broad traditions in the abstract valuational model theory for nontransitive and nonreflexive logics. The first of these traditions makes heavy use of the natural Galois connection between sets of valuations and sets of arguments. The other, originating with work by Grzegorz Malinowski on nonreflexive logics, and best systematized in Blasio et al. : 233–262, 2017), lets sets of arguments determine a more restricted set of valuations. After giving a systematic discussion of these two different traditions in (...) the valuational model theory for substructural logics, we turn to looking at the ways in which we might try to compare two sets of valuations determining the same set of arguments. (shrink)

In this thesis, I will defend a new kind of compatibilist account of free action, indirect conscious control compatibilism (or indirect compatibilism for short), and argue that some of our actions are free according to it. My argument has three components, and involves the development of a brand new tool for experimental philosophy, and the use of cognitive neuroscience. The first component of the argument shows that compatibilism (of some kind) is a conceptual truth. Contrary to the current orthodoxy in (...) the free will literature, which is that our concept of free will is an incompatibilist concept - a concept according to which we have free will only if determinism is false - I will show that our concept of free will is in fact a compatibilist concept - a concept according to which we can have free will even if determinism is true - and I do so using a new experimental philosophy methodology inspired by two-dimensional semantics. -/- Of course, even if our concept of free will is a compatibilist concept, this does not mean that there are any free actions in the world: the current empirical evidence from the brain sciences appears to show that there might be no, or very few, free actions in the world, even on many compatibilist understandings of what it would take for there to be free will. The second component of the argument addresses this concern by extending our understanding of compatibilism. Agents act freely either when their actions are caused by compatibilistically acceptable psychological processes, or are indirectly caused by those same processes. Hence the name of my account: indirect compatibilism. -/- The final component of the argument defends my new account against some interesting objections and provides evidence from cognitive neuroscience that some of our actions count as free by the lights of indirect compatibilism. (shrink)

This paper intends to further the understanding of the formal properties of (higher-order) vagueness by connecting theories of (higher-order) vagueness with more recent work in topology. First, we provide a “translation” of Bobzien's account of columnar higher-order vagueness into the logic of topological spaces. Since columnar vagueness is an essential ingredient of her solution to the Sorites paradox, a central problem of any theory of vagueness comes into contact with the modern mathematical theory of topology. Second, Rumfitt’s recent topological reconstruction (...) of Sainsbury’s theory of prototypically defined concepts is shown to lead to the same class of spaces that characterize Bobzien’s account of columnar vagueness, namely, weakly scattered spaces. Rumfitt calls these spaces polar spaces. They turn out to be closely related to Gärdenfors’ conceptual spaces, which have come to play an ever more important role in cognitive science and related disciplines. Finally, Williamson’s “logic of clarity” is explicated in terms of a generalized topology (“locology”) that can be considered an alternative to standard topology. Arguably, locology has some conceptual advantages over topology with respect to the conceptualization of a boundary and a borderline. Moreover, in Williamson’s logic of clarity, vague concepts with respect to a notion of a locologically inspired notion of a “slim boundary” are (stably) columnar. Thus, Williamson’s logic of clarity also exhibits a certain affinity for columnar vagueness. In sum, a topological perspective is useful for a conceptual elucidation and unification of central aspects of a variety of contemporary accounts of vagueness. (shrink)

The biennial DEON conferences are designed to promote interdisciplinary cooperation amongst scholars interested in linking the formal-logical study of normative concepts and normative systems with computer science, artificial intelligence, linguistics, philosophy, organization theory and law. In addition to these general themes, DEON 2016 encouraged a special focus on the topic "Reasons, Argumentation and Justification.".

The program put forward in von Wright's last works defines deontic logic as ``a study of conditions which must be satisfied in rational norm-giving activity'' and thus introduces the perspective of logical pragmatics. In this paper a formal explication for von Wright's program is proposed within the framework of set-theoretic approach and extended to a two-sets model which allows for the separate treatment of obligation-norms and permission norms. The three translation functions connecting the language of deontic logic with the language (...) of the extended set-theoretical approach are introduced, and used in proving the correspondence between the deontic theorems, on one side, and the perfection properties of the norm-set and the ``counter-set'', on the other side. In this way the possibility of reinterpretation of standard deontic logic as the theory of perfection properties that ought to be achieved in norm-giving activity has been formally proved. The extended set-theoretic approach is applied to the problem of rationality of principles of completion of normative systems. The paper concludes with a plaidoyer for logical pragmatics turn envisaged in the late phase of Von Wright's work in deontic logic. (shrink)

This paper considers logics which are formally dual to intuitionistic logic in order to investigate a co-constructive logic for proofs and refutations. This is philosophically motivated by a set of problems regarding the nature of constructive truth, and its relation to falsity. It is well known both that intuitionism can not deal constructively with negative information, and that defining falsity by means of intuitionistic negation leads, under widely-held assumptions, to a justification of bivalence. For example, we do not want to (...) equate falsity with the non-existence of a proof since this would render a statement such as “pi is transcendental” false prior to 1882. In addition, the intuitionist account of negation as shorthand for the derivation of absurdity is inadequate, particularly outside of purely mathematical contexts. To deal with these issues, I investigate the dual of intuitionistic logic, co-intuitionistic logic, as a logic of refutation, alongside intuitionistic logic of proofs. Direct proof and refutation are dual to each other, and are constructive, whilst there also exist syntactic, weak, negations within both logics. In this respect, the logic of refutation is weakly paraconsistent in the sense that it allows for statements for which, neither they, nor their negation, are refuted. I provide a proof theory for the co-constructive logic, a formal dualizing map between the logics, and a Kripke-style semantics. This is given an intuitive philosophical rendering in a re-interpretation of Kolmogorov’s logic of problems. (shrink)

This paper provides both a solution and a problem for the account of compositionality in Christopher Peacocke’s modest inferentialism. The immediate issue facing Peacocke’s account is that it looks as if compositionality can only be understood at the level of semantics, which is difficult to reconcile with inferentialism. Here, following up a brief suggestion by Peacocke, I provide a formal framework wherein compositionality occurs the level of the determining relation between inference and semantics. This, in turn provides a “test” for (...) compositionality, which, problematically, Peacocke’s natural deduction framework for classical logic can not meet. To finish, I briefly outline an alternative, bilateralist, framework for modest inferentialism, for which compositionality holds. (shrink)

In [5], Béziau provides a means by which Gentzen’s sequent calculus can be combined with the general semantic theory of bivaluations. In doing so, according to Béziau, it is possible to construe the abstract “core” of logics in general, where logical syntax and semantics are “two sides of the same coin”. The central suggestion there is that, by way of a modification of the notion of maximal consistency, it is possible to prove the soundness and completeness for any normal logic. (...) However, the reduction to bivaluation may be a side effect of the architecture of ordinary sequents, which is both overly restrictive, and entails certain expressive restrictions over the language. This paper provides an expansion of Béziau’s completeness results for logics, by showing that there is a natural extension of that line of thinking to n-sided sequent constructions. Through analogical techniques to Béziau’s construction, it is possible, in this setting, to construct abstract soundness and completeness results for n-valued logics. (shrink)

Following a proposal of Humberstone, this paper studies a semantics for modal logic based on partial “possibilities” rather than total “worlds.” There are a number of reasons, philosophical and mathematical, to find this alternative semantics attractive. Here we focus on the construction of possibility models with a finitary flavor. Our main completeness result shows that for a number of standard modal logics, we can build a canonical possibility model, wherein every logically consistent formula is satisfied, by simply taking each individual (...) finite formula (modulo equivalence) to be a possibility, rather than each infinite maximally consistent set of formulas as in the usual canonical world models. Constructing these locally finite canonical models involves solving a problem in general modal logic of independent interest, related to the study of adjoint pairs of modal operators: for a given modal logic L, can we find for every formula phi a formula f(phi) such that for every formula psi, phi -> BOX psi is provable in L if and only if f(phi) -> psi is provable in L? We answer this question for a number of standard modal logics, using model-theoretic arguments with world semantics. This second main result allows us to build for each logic a canonical possibility model out of the lattice of formulas related by provable implication in the logic. (shrink)

By quoting extensively from unpublished letters written by John von Neumann to Garret Birkhoff during the preparatory phase (in 1935) of their ground-breaking 1936 paper that established quantum logic, the main steps in the thought process leading to the 1936 Birkhoff–von Neumann paper are reconstructed. The reconstruction makes it clear why Birkhoff and von Neumann rejected the notion of quantum logic as the projection lattice of an infinite dimensional complex Hilbert space and why they postulated in their 1936 paper that (...) the quantum propositional system should be isomorphic to an abstract projective geometry. Looking at the paper now I see, that I forgot to say this, which should be said somewhere in the first §: That while common logics did apply to quantum mechanics, if the notion of simultaneous measurability is introduced as an auxiliary notion, we wished to construct a logical system, which applies directly to quantum mechanics – without any extraneous secondary notions like simultaneous measurability. And in order to have such a consequent, one-piece system of logics, we must change the classical class calculus of logics. (J. von Neumann to G. Birkhoff, November 21, 1935). (shrink)

While according to the inferentialists, meaning is always a kind of inferential role, proponents of other approaches to semantics often doubt that actual meanings, as they see them, can be generally reduced to inferential roles. In this paper we propose a formal framework for considering the hypothesis of the.

This paper combines two classes of generalized logics, one of which is the class of weakly implicative logics introduced by Cintula and the other of which is the class of gaggle logics introduced by Dunn. For this purpose we introduce implicational tonoid logics. More precisely, we first define implicational tonoid logics in general and examine their relation to weakly implicative logics. We then provide algebraic semantics for implicational tonoid logics. Finally, we consider relational semantics, called Routley–Meyer–style semantics, for finitary those (...) logics. (shrink)

Lattice logic, bilattice logic, and paraconsistent quantum logic are investigated based on monosequent systems. Paraconsistent quantum logic is an extension of lattice logic, and bilattice logic is an extension of paraconsistent quantum logic. Monosequent system is a sequent calculus based on the restricted sequent that contains exactly one formula in both the antecedent and succedent. It is known that a completeness theorem with respect to a lattice-valued semantics holds for a monosequent system for lattice logic. A completeness theorem with respect (...) to a lattice-valued semantics is proved for paraconsistent quantum logic, and a completeness theorem with respect to a bilattice-valued semantics is proved for bilattice logic. Some syntactical properties, including cut-elimination and duality, are also investigated for the monosequent systems for these logics. (shrink)

In this paper we introduce a new natural deduction system for the logic of lattices, and a number of extensions of lattice logic with different negation connectives. We provide the class of natural deduction proofs with both a standard inductive definition and a global graph-theoretical criterion for correctness, and we show how normalisation in this system corresponds to cut elimination in the sequent calculus for lattice logic. This natural deduction system is inspired both by Shoesmith and Smiley's multiple conclusion systems (...) for classical logic and Girard's proofnets for linear logic. (shrink)

We continue in this article the abstract algebraic treatment of quantum sentential logics Wil. The Notions borrowed from the field of Model Theory and Abstract Algebraic Logic - AAL (i.e., consequence relation, variety, logical matrix, deductive filter, reduced product, ultraproduct, ultrapower, Frege relation, Leibniz congruence, Suszko congruence, Leibniz operator) are applied to quantum logics. We also proved several equivalences between state property systems (Jauch-Piron-Aerts line of investigations) and AAL treatment of quantum logics (corollary 18 and 19). We show that there (...) exist the uniquely defined correspondence between state property system and consequence relation defined on quantum logics. We also signalize that a metalogical property - Lindenbaum property does not hold for the set of quantum logics. (shrink)

In Philosophical Logic, the Liar Paradox has been used to motivate the introduction of both truth value gaps and truth value gluts. Moreover, in the light of “revenge Liar” arguments, also higher-order combinations of generalized truth values have been suggested to account for so-called hyper-contradictions. In the present paper, Graham Priest's treatment of generalized truth values is scrutinized and compared with another strategy of generalizing the set of classical truth values and defining an entailment relation on the resulting sets of (...) higher-order values. This method is based on the concept of a multilattice. If the method is applied to the set of truth values of Belnap's “useful four-valued logic”, one obtains a trilattice, and, more generally, structures here called Belnap-trilattices. As in Priest's case, it is shown that the generalized truth values motivated by hyper-contradictions have no effect on the logic. Whereas Priest's construction in terms of designated truth values always results in his Logic of Paradox, the present construction in terms of truth and falsity orderings always results in First Degree Entailment. However, it is observed that applying the multilattice-approach to Priest's initial set of truth values leads to an interesting algebraic structure of a “bi-and-a-half” lattice which determines seven-valued logics different from Priest's Logic of Paradox. (shrink)

In this paper we study the interaction between symmetric logic and probability. In particular, we axiomatize the convex hull of the set of evaluations of symmetric logic, yielding the notion of probability in symmetric logic. This answers an open problem of Williams ( 2016 ) and Paris ( 2001 ).

The book presents a thoroughly elaborated logical theory of generalized truth-values understood as subsets of some established set of truth values. After elucidating the importance of the very notion of a truth value in logic and philosophy, we examine some possible ways of generalizing this notion. The useful four-valued logic of first-degree entailment by Nuel Belnap and the notion of a bilattice constitute the basis for further generalizations. By doing so we elaborate the idea of a multilattice, and most notably, (...) a trilattice of truth values – a specific algebraic structure with information ordering and two distinct logical orderings, one for truth and another for falsity. Each logical order not only induces its own logical vocabulary, but determines also its own entailment relation. We consider both semantic and syntactic ways of formalizing these relations and construct various logical calculi. (shrink)

In this paper we present a solution of the axiomatization problem for the Fmla-Fmla versions of the Pietz and Rivieccio exactly true logic and the non-falsity logic dual to it. To prove the completeness of the corresponding binary consequence systems we introduce a specific proof-theoretic formalism, which allows us to deal simultaneously with two consequence relations within one logical system. These relations are hierarchically organized, so that one of them is treated as the basic for the resulting logic, and the (...) other is introduced as an extension of this basic relation. The proposed bi-consequences systems allow for a standard Henkin-style canonical model used in the completeness proof. The deductive equivalence of these bi-consequence systems to the corresponding binary consequence systems is proved. We also outline a family of the bi-consequence systems generated on the basis of the first-degree entailment logic up to the classic consequence. (shrink)

It is well known that the convex hull of the classical truth value functions contains all and only the probability functions. Work by Paris and Williams has shown that this also holds for various kinds of nonclassical logics too. This note summarises the formal details of this topic and extends the results slightly.

It is well known that classical inferentialist semantics runs into problems regarding abnormal valuations. It is equally well known that the issues can be resolved if we construct the inference relation in a multiple-conclusion sequent calculus. The latter has been prominently developed in recent work by Restall, with the guiding interpretation that the valid sequent says that the simultaneous assertion of all of Γ with the denial of all of Δ is incoherent. However, such structures face significant interpretive challenges, and (...) they do not provide an adequate grasp on the machinery of the duality of assertions and denials that could provide an abstract account of inferential semantics; show why the dual treatment is semantically superior. This paper explores a slightly different tack by considering a dual-calculus framework consisting of two, single-conclusion, inference relations dealing with the preservation of assertion and the preservation of denial, respectively. In this context, I develop an abstract inferentialist semantics, before going on to show that the framework is equivalent to Restall’s, whilst providing a better grasp on the underlying proof-structure. (shrink)

We generalize the notion ofconsequence relationstandard in abstract treatments of logic to accommodate intuitions ofrelevance. The guiding idea follows theuse criterion, according to which in order for some premises to have some conclusion(s) as consequence(s), the premises must each beusedin some way to obtain the conclusion(s). This relevance intuition turns out to require not just a failure of monotonicity, but also a move to considering consequence relations as obtaining betweenmultisets. We motivate and state basic definitions of relevant consequence relations, both (...) in single conclusion (asymmetric) and multiple conclusion (symmetric) settings, as well as derivations and theories, guided by the use intuitions, and prove a number of results indicating that the definitions capture the desired results (at least in many cases). (shrink)

In the context of implicational tonoid logics, this paper investigates analogues of Birkhoff’s two theorems, the so-called subdirect representation and varieties theorems, and of Mal’cev’s quasi-varieties theorem. More precisely, we first recall the class of implicational tonoid logics. Next, we establish the subdirect product representation theorem for those logics and then consider some more related results such as completeness. Thirdly, we consider the varieties theorem for them. Finally, we introduce an analogue of Mal’cev’s quasi-varieties theorem for algebras.

We provide a complete binary implicational axiomatization of the positive fragment of propositional dynamic logic. The intended application of this result are completeness proofs for non-classical extensions of positive PDL. Two examples are discussed in this article, namely, a paraconsistent extension with modal De Morgan negation and a substructural extension with the residuated operators of the non-associative Lambek calculus. Informal interpretations of these two extensions are outlined.

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.

In the fifth of his John Locke Lectures, Robert Brandom takes up the challenge to define a formal semantics for modelling conceptual contents according to his normative analysis of linguistic practices. The project is to exploit the notion of incompatibility in order to directly define a modally robust relation of entailment. Unfortunately, it can be proved that, in the original definition, the modal system represented by Incompatibility Semantics (IS) collapses into propositional calculus. In this paper I show how IS can (...) be technically amended so to overcome this failure: the required modifications are already known and consist in adapting and including the main notions of Kripke's standard framework of possible worlds. I also show that the modifications do not jeopardize Brandom's original project. (shrink)

Taking the lead from orthodox quantum theory, I will introduce a handy generalization of the Boolean approach to propositions and questions: the orthoalgebraic framework. I will demonstrate that this formalism relates to a formal theory of questions (or ‘observables’ in the physicist’s jargon). This theory allows formulating attitude questions, which normally are non-commuting, i.e., the ordering of the questions affects the answer behavior of attitude questions. Further, it allows the expression of conditional questions such as “If Mary reads the book, (...) will she recommend it to Peter?”, and thus gives the framework the semantic power of raising issues and being informative at the same time. In the case of commuting observables, there are close similarities between the orthoalgebraic approach to questions and the Jäger/Hulstijn approach to question semantics. However, there are also differences between the two approaches even in case of commuting observables. The main difference is that the Jäger/Hulstijn approach relates to a partition theory of questions whereas the orthoalgebraic approach relates to a ‘decorated’ partition theory (i.e. the elements of the partition are decorated by certain semantic values). Surprisingly, the orthoalgebraic approach is able to overcome most of the difficulties of the Jäger/Hulstijn approach. Furthermore, the general approach is suitable to describe the different types of (non-commutative) attitude questions as investigated in modern survey research. Concluding, I will suggest that an active dialogue between the traditional model-theoretic approaches to semantics and the orthoalgebraic paradigm is mandatory. (shrink)

Both I and Belnap, motivated the "Belnap-Dunn 4-valued Logic" by talk of the reasoner being simply "told true" (T) and simply "told false" (F), which leaves the options of being neither "told true" nor "told false" (N), and being both "told true" and "told false" (B). Belnap motivated these notions by consideration of unstructured databases that allow for negative information as well as positive information (even when they conflict). We now experience this on a daily basis with the Web. But (...) the 4-valued logic is deductive in nature, and its matrix is discrete: there are just four values. In this paper I investigate embedding the 4-valued logic into a context of probability. Jøsang's Subjective Logic introduced uncertainty to allow for degrees of belief, disbelief, and uncertainty. We extend this so as to allow for two kinds of uncertainty— that in which the reasoner has too little information (ignorance) and that in which the reasoner has too much information (conflicted). Jøsang's "Opinion Triangle" becomes an "Opinion Tetrahedron" and the 4-values can be seen as its vertices. I make/prove various observations concerning the relation of non-classical "probability" to non-classical logic. (shrink)

The standard notion of formal theory, in logic, is in general biased exclusively towards assertion: it commonly refers only to collections of assertions that any agent who accepts the generating axioms of the theory should also be committed to accept. In reviewing the main abstract approaches to the study of logical consequence, we point out why this notion of theory is unsatisfactory at multiple levels, and introduce a novel notion of theory that attacks the shortcomings of the received notion by (...) allowing one to take both assertions and denials on a par. This novel notion of theory is based on a bilateralist approach to consequence operators, which we hereby introduce, and whose main properties we investigate in the present paper. (shrink)

The Lambek-Grishin calculus is a symmetric version of categorial grammar obtained by augmenting the standard inventory of type-forming operations (product and residual left and right division) with a dual family: coproduct, left and right difference. Interaction between these two families is provided by distributivity laws. These distributivity laws have pleasant invariance properties: stability of interpretations for the Curry-Howard derivational semantics, and structure-preservation at the syntactic end. The move to symmetry thus offers novel ways of reconciling the demands of natural language (...) form and meaning. (shrink)

Performing an inference involves irreducibly dynamic cognitive procedures. The article proposes that a non-associative information frame, corresponding to a residuated pogroupoid, underpins the information structure involved. The argument proceeds by expounding the informational turn in logic, before outlining the cognitive actions at work in deductive inference. The structural rules of Weakening, Contraction, Commutation, and Association are rejected on the grounds that they cause us to lose track of the information flow in inferential procedures. By taking the operation of information application (...) as the primary operation, the fusion connective is retained, with commutative failure generating a double implication. The other connectives are rejected. (shrink)

The Aristotelian square of oppositions is a well-known diagram in logic and linguistics. In recent years, several extensions of the square have been discovered. However, these extensions have failed to become as widely known as the square. In this paper we argue that there is indeed a fundamental difference between the square and its extensions, viz., a difference in informativity. To do this, we distinguish between concrete Aristotelian diagrams and, on a more abstract level, the Aristotelian geometry. We then introduce (...) two new logical geometries, and develop a formal, well-motivated account of their informativity. This enables us to show that the square is strictly more informative than many of the more complex diagrams. (shrink)

An account of scientific representation in terms of partial structures and partial morphisms is further developed. It is argued that the account addresses a variety of difficulties and challenges that have recently been raised against such formal accounts of representation. This allows some useful parallels between representation in science and art to be drawn, particularly with regard to apparently inconsistent representations. These parallels suggest that a unitary account of scientific and artistic representation is possible, and our article can be viewed (...) as laying the groundwork for such an account—although, as we shall acknowledge, significant differences exist between these two forms of representation. (shrink)

In this paper we introduce canonical extensions of partially ordered sets and monotone maps and a corresponding discrete duality. We then use these to give a uniform treatment of completeness of relational semantics for various substructural logics with implication as the residual(s) of fusion.

Bertrand Russell’s 1906 article ‘The Theory of Implication’ contains an algebraic weak completeness proof for classical propositional logic. Russell did not present it as such. We give an exposition of the proof and investigate Russell’s view of what he was about, whether he could have appreciated the proof for what it is, and why there is no parallel of the proof in Principia Mathematica.

This article addresses and resolves some issues of relational, Kripke-style, semantics for the logics of bounded lattice expansions with operators of well-defined distribution types, focusing on the case where the underlying lattice is not assumed to be distributive. It therefore falls within the scope of the theory of Generalized Galois Logics, introduced by Dunn, and it contributes to its extension. We introduce order-dual relational semantics and present a semantic analysis and completeness theorems for non-distributive lattice logic with n -ary additive (...) or multiplicative operators, with negation operators modally interpreted as impossibility and unnecessity, as well as with implication connectives. Order-dual relational semantics shares with the generalized Kripke frames, or the bi-approximation semantics approach, the use of both a satisfaction and a co-satisfaction relation, but it also responds to the recently voiced concerns of Craig, Haviar and Conradie about the relative non-intuitiveness of the 2-sorted semantics of the aforementioned approaches. In this article, we provide a standard interpretation of modalities and natural interpretations of both negation and implication, despite the absence of distribution. Thereby, our results contribute in creating the necessary background for research in non-distributive logics with modalities variously interpreted as dynamic, temporal etc, by analogy to the classical case. (shrink)

The paper defends the structural concept of representation, defined by homomorphisms, against the main objections that have been raised against it: Logical objections, the objection from misrepresentation, the objection from failing necessity, and the copy theory objection. Homomorphic representations are not necessarily ‘copies’ of their representanda, and thus can convey scientific insight.

The entire development of modern logic is characterized by various forms of confrontation of what has come to be called proof theory with what has earned the label of model theory. For a long time the widely accepted view was that while model theory captures directly what logical formalisms are about, proof theory is merely our technical means of getting some incomplete grip on this; but in recent decades the situation has altered. Not only did proof theory expand into new (...) realms, generalizing the concept of proof in various directions; many philosophers also realized that meaning may be seen as primarily consisting in certain rules rather than in language-world links. However, the possibility of construing meaning as an inferential role is often seen as essentially compromised by the limits of prooftheoretical means. The aim of this paper is to sort out the cluster of problems besetting logical inferentialism by disentangling and clarifying one of them, namely determining the power of various inferential frameworks as measured by that of explicitly semantic ones. (shrink)