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)

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)

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 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.

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)

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)

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.

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)

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)

In Belnap's useful 4-valued logic, the set 2 = {T, F} of classical truth values is generalized to the set 4 = ������(2) = {Ø, {T}, {F}, {T, F}}. In the present paper, we argue in favor of extending this process to the set 16 = ᵍ (4) (and beyond). It turns out that this generalization is well-motivated and leads from the bilattice FOUR₂ with an information and a truth-and-falsity ordering to another algebraic structure, namely the trilattice SIXTEEN₃ with an (...) information ordering together with a truth ordering and a (distinct) falsity ordering. Interestingly, the logics generated separately by the algebraic operations under the truth order and under the falsity order in SIXTEEN₃ coincide with the logic of FOUR₂, namely first degree entailment. This observation may be taken as a further indication of the significance of first degree entailment. In the present setting, however, it becomes rather natural to consider also logical systems in the language obtained by combining the vocabulary of the logic of the truth order and the falsity order. We semantically define the logics of the two orderings in the extended language and in both cases axiomatize a certain fragment comprising three unary operations: a negation, an involution, and their combination. We also suggest two other definitions of logics in the full language, including a bi-consequence system. In other words, in addition to presenting first degree entailment as a useful 16-valued logic, we define further useful 16-valued logics for reasoning about truth and (non-)falsity. We expect these logics to be an interesting and useful instrument in information processing, especially when we deal with a net of hierarchically interconnected computers. We also briefly discuss Arieli's and Avron's notion of a logical bilattice and state a number of open problems for future research. (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)

Structural reasoning is simply reasoning that is governed exclusively by structural rules. In this context a proof system can be said to be structural if all of its inference rules are structural. A logic is considered to be structuralizable if it can be equipped with a sound and complete structural proof system. This paper provides a general formulation of the problem of structuralizability of a given logic, giving specific consideration to a family of logics that are based on the Dunn–Belnap (...) four-valued semantics. It is shown how sound and complete structural proof systems can be constructed for a spectrum of logics within different logical frameworks. (shrink)

We study the computational complexity of the universal and quasi-equational theories of classes of bounded distributive lattices with a negation operation, i.e., a unary operation satisfying a subset of the properties of the Boolean negation. The upper bounds are obtained through the use of partial algebras. The lower bounds are either inherited from the equational theory of bounded distributive lattices or obtained through a reduction of a global satisfiability problem for a suitable system of propositional modal logic.

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)

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.

The basic quasi-Boolean negation expansions of relevance logics included in Anderson and Belnap’s relevance logic R are defined. We consider two types of QB-negation: H-negation and D-negation. The former one is of paraintuitionistic or superintuitionistic character, the latter one, of dual intuitionistic nature in some sense. Logics endowed with H-negation are paracomplete; logics with D-negation are paraconsistent. All logics defined in the paper are given a Routley-Meyer ternary relational semantics.

In some logics, anything whatsoever follows from a contradiction; call these logics explosive. Paraconsistent logics are logics that are not explosive. Paraconsistent logics have a long and fruitful history, and no doubt a long and fruitful future. To give some sense of the situation, I’ll spend Section 1 exploring exactly what it takes for a logic to be paraconsistent. It will emerge that there is considerable open texture to the idea. In Section 2, I’ll give some examples of techniques for (...) developing paraconsistent logics. In Section 3, I’ll discuss what seem to me to be some promising applications of certain paraconsistent logics. In fact, however, I don’t think there’s all that much to the concept ‘paraconsistent’ itself; the collection of paraconsistent logics is far too heterogenous to be very productively dealt with under a single label. Perhaps that will emerge as we go. (shrink)

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 paper, we evaluate Button’s claim that knot is a nasty connective. Knot’s nastiness is due to the fact that, when one extends the set \ with knot, the connective provides counterexamples to a number of classically valid operational rules in a sequent calculus proof system. We show that just as going non-transitive diminishes tonk’s nastiness, knot’s nastiness can also be reduced by dropping Reflexivity, a different structural rule. Since doing so restores all other rules in the system as (...) validity-preserving, we are inclined to conclude that there, knot is not that nasty. However, since motivating non-reflexivity is harder than motivating non-transitivity, we also acknowledge that disagreement with our conclusion is possible. (shrink)

This paper is a critical response to Andreas Bartels’ sophisticated defense of a structural account of scientific representation. We show that, contrary to Bartels’ claim, homomorphism fails to account for the phenomenon of misrepresentation. Bartels claims that homomorphism is adequate in two respects. First, it is conceptually adequate, in the sense that it shows how representation differs from misrepresentation and non-representation. Second, if properly weakened, homomorphism is formally adequate to accommodate misrepresentation. We question both claims. First, we show that homomorphism (...) is not the right condition to distinguish representation from misrepresentation and non-representation: a “representational mechanism” actually does all the work, and it is independent of homomorphism – as of any structural condition. Second, we test the claim of formal adequacy against three typical kinds of inaccurate representation in science which, by reference to a discussion of the notorious billiard ball model, we define as abstraction, pretence, and simulation. We first point out that Bartels equivocates between homomorphism and the stronger condition of epimorphism, and that the weakened form of homomorphism that Bartels puts forward is not a morphism at all. After providing a formal setting for abstraction, pretence and simulation, we show that for each morphism there is at least one form of inaccurate representation which is not accommodated. We conclude that Bartels’ theory – while logically laying down the weakest structural requirements – is nonetheless formally inadequate in its own terms. This should shed serious doubts on the plausibility of any structural account of representation more generally. (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.

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)

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 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)

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.

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)

In this paper we study an alternative approach to the concept of abstract logic and to connectives in abstract logics. The notion of abstract logic was introduced by Brown and Suszko —nevertheless, similar concepts have been investigated by various authors. Considering abstract logics as intersection structures we extend several notions to their κ -versions, introduce a hierarchy of κ -prime theories, which is important for our treatment of infinite connectives, and study different concepts of κ -compactness. We are particularly interested (...) in non-topped intersection structures viewed as semi-lattices with a minimal meet-dense subset, i.e., with a minimal generator set. We study a chain condition which is sufficient for a minimal generator set, implies compactness of the logic, and in regular logics is equivalent to compactness of the consequence relation together with the existence of a inconsistent set, where κ is the cofinality of the cardinality of the logic. Some of these results are known in a similar form in the context of closure spaces, we give extensions to intersection structures and to big cardinals presenting new proofs based on set-theoretical tools. The existence of a minimal generator set is crucial for our way to define connectives. Although our method can be extended to further non-classical connectives we concentrate here on intuitionistic and infinite ones. Our approach leads us to the concept of the set of complete theories which is stable under all considered connectives and gives rise to the definition of the topological space of the logic. Topological representations of abstract logics by means of this space remain to be further investigated. (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)

Two new multilattice logics called submultilattice logic and indexed multilattice logic are introduced as a monosequent calculus and an indexed monosequent calculus, respectively. The submultilattice logic is regarded as a monosequent calculus version of Shramko’s original multilattice logic, which is also known as the logic of logical multilattices. The indexed multilattice logic is an extension of the submultilattice logic, and is regarded as the logic of multilattices. A completeness theorem with respect to a lattice-valued semantics is proved for the submultilattice (...) logic, and a completeness theorem with respect to a multilattice-valued semantics is proved for the indexed multilattice logic. (shrink)

The paper is a brief survey of the most important semantic constructions founded on the concept of possible world. It is impossible to capture in one short paper the whole variety of the problems connected with manifold applications of possible worlds. Hence, after a brief explanation of some philosophical matters I take a look at possible worlds from rather technical standpoint of logic and focus on the applications in formal semantics. In particular, I would like to focus on the fruitful (...) marriage of possible world semantics and algebra and its evolution leading to very general construction of Wójcicki called referential semantics and some of its refinements. The presentation is informal and sketchy; the main purpose is to put in one place a short, and readable I hope, description of the most important constructions and to point out the main sources of these solutions. (shrink)

A 1-ary sentential context is aggregative (according to a consequence relation) if the result of putting the conjunction of two formulas into the context is a consequence (by that relation) of the results of putting first the one formula and then the other into that context. All 1-ary contexts are aggregative according to the consequence relation of classical propositional logic (though not, for example, according to the consequence relation of intuitionistic propositional logic), and here we explore the extent of this (...) phenomenon, generalized to having arbitrary connectives playing the role of conjunction; among intermediate logics, LC, shows itself to occupy a crucial position in this regard, and to suggest a characterization, applicable to a broader range of consequence relations, in terms of a variant of the notion of idempotence we shall call componentiality. This is an analogue, for the consequence relations of propositional logic, of the notion of a conservative operation in universal algebra. (shrink)

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)

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 ).

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.

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 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.

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 possible-worlds semantics for modality says that a sentence is possibly true if it is true in some possible world. Given classical prepositional logic, one can easily prove that every consistent set of propositions can be embedded in a ‘maximal consistent set’, which in a sense represents a possible world. However the construction depends on the fact that standard modal logics are finitary, and it seems false that an infinite collection of sets of sentences each finite subset of which is (...) intuitively ‘possible’ in natural language has the property that the whole set is possible. The argument of the paper is that the principles needed to shew that natural language possibility sentences involve quantification over worlds are analogous to those used in infinitary modal logic. (shrink)

This paper presents and defends a way to add a transparent truth predicate to classical logic, such that and A are everywhere intersubstitutable, where all T-biconditionals hold, and where truth can be made compositional. A key feature of our framework, called STTT (for Strict-Tolerant Transparent Truth), is that it supports a non-transitive relation of consequence. At the same time, it can be seen that the only failures of transitivity STTT allows for arise in paradoxical cases.

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.

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)

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)

We define dual and symmetric combinatory calculi (inequational and equational ones), and prove their consistency. Then, we introduce algebraic and set theoretical relational and operational - semantics, and prove soundness and completeness. We analyze the relationship between these logics, and argue that inequational dual logics are the best suited to model computation.

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.

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