In this paper the logic of broad necessity is explored. Definitions of what it means for one modality to be broader than another are formulated, and it is proven, in the context of higher-order logic, that there is a broadest necessity, settling one of the central questions of this investigation. It is shown, moreover, that it is possible to give a reductive analysis of this necessity in extensional language. This relates more generally to a conjecture that it is not possible (...) to define intensional connectives from extensional notions. This conjecture is formulated precisely in higher-order logic, and concrete cases in which it fails are examined. The paper ends with a discussion of the logic of broad necessity. It is shown that the logic of broad necessity is a normal modal logic between S4 and Triv, and that it is consistent with a natural axiomatic system of higher-order logic that it is exactly S4. Some philosophical reasons to think that the logic of broad necessity does not include the S5 principle are given. (shrink)

We study a range of issues connected with the idea of replacing one formula by another in a fixed context. The replacement core of a consequence relation ⊢ is the relation holding between a set of formulas {A1,..., Am,...} and a formula B when for every context C, we have C,..., C,... ⊢ C. Section 1 looks at some differences between which inferences are lost on passing to the replacement cores of the classical and intuitionistic consequence relations. For example, we (...) find that while the inference from A and B to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$A \land B$\end{document}, sanctioned by both these initial consequence relations, is retained on passage to the replacement core in the classical case, it is lost in the intuitionistic case. Further discussion of these two logics occupies Sections 3 and 4. Section 2 looks at the m = 1 case, describing A as replaceable by B according to ⊢ when B is a consequence of A by the replacement core of ⊢, and inquiring as to which choices of ⊢ render this induced replaceability relation symmetric. Section 5 investigates further conceptual refinements— such as a contrast between horizontal and vertical replaceability—suggested by some work of R. B. Angell and R. Harrop in the 1950s and 1960s. Appendix 1 examines a related aspect of term-for-term replacement in connection with identity in predicate logic. Appendix 2 is a repository for proofs which would otherwise clutter up Section 3. (shrink)

The first part of the paper deals with some subclasses of B-algebras and their applications to the semantics of SCI B , the Boolean strengthening of the sentential calculus with identity (SCI). In the second part a generalization of the McKinsey-Tarski construction of well-connected topological Boolean, algebras to the class of B-algebras is given.

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)

We construct a a system PLRI which is the classical propositional logic supplied with a ternary construction , interpreted as the intensional identity of statements and in the context . PLRI is a refinement of Roman Suszko’s sentential calculus with identity (SCI) whose identity connective is a binary one. We provide a Hilbert-style axiomatization of this logic and prove its soundness and completeness with respect to some algebraic models. We also show that PLRI can be used to give a partial (...) solution to the paradox of analysis. (shrink)

There are logics where necessity is defined by means of a given identity connective: \ is a tautology). On the other hand, in many standard modal logics the concept of propositional identity \ can be defined by strict equivalence \}\). All these approaches to modality involve a principle that we call the Collapse Axiom : “There is only one necessary proposition.” In this paper, we consider a notion of PI which relies on the identity axioms of Suszko’s non-Fregean logic SCI. (...) Then S3 proves to be the smallest Lewis modal system where PI can be defined as SE. We extend S3 to a non-Fregean logic with propositional quantifiers such that necessity and PI are integrated as non-interdefinable concepts. CA is not valid and PI refines SE. Models are expansions of SCI-models. We show that SCI-models are Boolean prealgebras, and vice-versa. This associates non-Fregean logic with research on Hyperintensional Semantics. PI equals SE iff models are Boolean algebras and CA holds. A representation result establishes a connection to Fine’s approach to propositional quantifiers and shows that our theories are conservative extensions of S3–S5, respectively. If we exclude the Barcan formula and a related axiom, then the resulting systems are still complete w.r.t. a simpler denotational semantics. (shrink)

We study the non-Fregean propositional logic with propositional quantifiers, denoted by $\mathsf{SCI}_{\mathsf{Q}}$. We prove that $\mathsf{SCI}_{\mathsf{Q}}$ does not have the finite model property and that it is undecidable. We also present examples of how to interpret in $\mathsf{SCI}_{\mathsf{Q}}$ various mathematical theories, such as the theory of groups, rings, and fields, and we characterize the spectra of $\mathsf{SCI}_{\mathsf{Q}}$-sentences. Finally, we present a translation of $\mathsf{SCI}_{\mathsf{Q}}$ into a classical two-sorted first-order logic, and we use the translation to prove some model-theoretic properties of (...) $\mathsf{SCI}_{\mathsf{Q}}$. (shrink)

According to Frege's principle the denotation of a sentence coincides with its truth-value. The principle is investigated within the context of abstract algebraic logic, and it is shown that taken together with the deduction theorem it characterizes intuitionistic logic in a certain strong sense.A 2nd-order matrix is an algebra together with an algebraic closed set system on its universe. A deductive system is a second-order matrix over the formula algebra of some fixed but arbitrary language. A second-order matrix A is (...) Fregean if, for any subset X of A, the set of all pairs a,b such that X{a} and X{b} have the same closure is a congruence relation on A. Hence a deductive system is Fregean if interderivability is compositional. The logics intermediate between the classical and intuitionistic propositional calculi are the paradigms for Fregean logics. Normal modal logics are non-Fregean while quasi-normal modal logics are generally Fregean.The main results of the paper: Fregean deductive systems that either have the deduction theorem, or are protoalgebraic and have conjunction, are completely characterized. They are essentially the intermediate logics, possibly with additional connectives. All the full matrix models of a protoalgebraic Fregean deductive system are Fregean, and, conversely, the deductive system determined by any class of Fregean second-order matrices is Fregean. The latter result is used to construct an example of a protoalgebraic Fregean deductive system that is not strongly algebraizable. (shrink)

In this paper, we introduce a variant of second-order propositional modal logic interpreted on general (or Henkin) frames, \(SOPML^{\mathcal {H}}\), and present a decidable fragment of this logic, \(SOPML^{\mathcal {H}}_{dec}\), that preserves important expressive capabilities of \(SOPML^{\mathcal {H}}\). \(SOPML^{\mathcal {H}}_{dec}\) is defined as a _modal loosely guarded fragment_ of \(SOPML^{\mathcal {H}}\). We demonstrate the expressive power of \(SOPML^{\mathcal {H}}_{dec}\) using examples in which modal operators obtain (a) the epistemic interpretation, (b) the dynamic interpretation. \(SOPML^{\mathcal {H}}_{dec}\) partially satisfies the principle of (...) non-Fregean logic: two different _atomic_ propositions with the same truth value can have different contents. In \(SOPML^{\mathcal {H}}_{dec}\), we also define _relating connectives_ and show that the _weak Boethius’ Thesis_ built using these connectives is a valid formula of \(SOPML^{\mathcal {H}}_{dec}\). (shrink)

With material on his early philosophical views, his contributions to set theory and his work on nominalism and higher-order quantification, this book offers a uniquely expansive critical commentary on one of analytical philosophy’s great ...

This paper focuses on the relation between logic and ontology. In particular, it demonstrates how classical logical theory can clarify the ontological part of Ludwig Wittgenstein’s Tractatus Logico-Philosophicus. To this end, the work examines the adequacy of a formal system that was devised by the Polish logician, mathematician and philosopher Roman Suszko (1919–1979) as a model for the Tractatus. Following a brief explanation of the Tractarian ontology, the main ideas of Suszko’s system and its philosophical significance will be considered. The (...) latter will be illustrated in the context of central Tractarian concepts. Finally, two implications for a better understanding of the Tractarian ontology will be pointed out. (shrink)

A non-Fregean framework aims to provide a formal tool for reasoning about semantic denotations of sentences and their interactions. Extending a logic to its non-Fregean version involves introducing a new connective$$\equiv $$≡that allows to separate denotations of sentences from their logical values. Intuitively,$$\equiv $$≡combines two sentences$$\varphi $$φand$$\psi $$ψinto a true one whenever$$\varphi $$φand$$\psi $$ψhave the same semantic correlates, describe the same situations, or have the same content or meaning. The paper aims to compare non-Fregean paraconsistent Grzegorczyk’s logics (Logic of Descriptions$$\textsf{LD}$$LD, (...) Logic of Descriptions with Suszko’s Axioms$$\textsf{LDS}$$LDS, Logic of Equimeaning$$\textsf{LDE}$$LDE) with non-Fregean versions of certain well-known paraconsistent logics (Jaśkowski’s Discussive Logic$$\textsf{D}_2$$D2, Logic of Paradox$$\textsf{LP}$$LP, Logics of Formal Inconsistency$$\textsf{LFI}{1}$$LFI1and$$\textsf{LFI}{2}$$LFI2). We prove that Grzegorczyk’s logics are either weaker than or incomparable to non-Fregean extensions of$$\textsf{LP}$$LP,$$\textsf{LFI}{1}$$LFI1,$$\textsf{LFI}{2}$$LFI2. Furthermore, we show that non-Fregean extensions of$$\textsf{LP}$$LP,$$\textsf{LFI}{1}$$LFI1,$$\textsf{LFI}{2}$$LFI2, and$$\textsf{D}_2$$D2are more expressive than their original counterparts. Our results highlight that the non-Fregean connective$$\equiv $$≡can serve as a tool for expressing various properties of the ontology underlying the logics under consideration. (shrink)

R. Suszko’s Sentential Calculus with Identity \( SCI \) results from classical propositional calculus \( CPC \) by adding a new connective \(\equiv \) and axioms for identity \(\varphi \equiv \psi \) (which we interpret here as ‘propositional identity’). We reformulate the original semantics of \( SCI \) using Boolean prealgebras which, introduced in different ways, are known in the literature as structures for the modeling of (hyper-) intensional semantics. We regard intensionality here as a measure for the discernibility of (...) propositions (and hyperintensionality as a high degree of intensionality). As concrete examples of \( SCI \) -based intensional modeling, we review and study algebraic semantics of some Lewis-style modal logics in the vicinity of \( S3 \) and present conditions under which those modal systems can be restored, in a precise sense, as certain axiomatic extensions of \( SCI \). This generalizes work of Suszko which is focused on the modal systems \( S4 \) and \( S5 \). Our approach is particularly intended as a proposal to consider and to further study \( SCI \) (and its extensions) as a general framework for the modeling of (hyper-) intensional semantics. (shrink)

The identity connective is usually interpreted in non-Fregean logic as an operator representing the identity of situations. This interpretation is related to the modal criterion of the identity of sentence correlates, characteristic of the WT system and some stronger systems. However, this connective can also be interpreted in a different way – as an operator representing the identity of propositions. The “propositional” interpretation is in turn associated with the modal-contents criterion of the identity of sentence correlates. This begs the question (...) of whether there is a system of non-Fregean logic, providing an adequate formalization of this criterion. The aim of the paper is to systematize the metalogical and philosophical context of the issue and to point to a system that provides its solution. (shrink)

We show that there are continuum many different extensions of SCI (the basic theory of non-Fregean propositional logic) that lie below WF (the Fregean extension) and are closed under substitution. Moreover, continuum many of them are independent from WB (the Boolean extension), continuum many lie above WB and are independent from WH (the Boolean extension with only two values for the equality relation), and only countably many lie between WH and WF.

This paper deals with Boolean algebras supplied with an additional binary operation, calledB-algebras for short.The aim of the paper is to generalize some theorems concerning topological Boolean algebras to more comprehensive classes ofB-algebras, to formulate fundamental properties ofB-algebras, and to find more important relationships of these algebras to other known algebras.

A 1971 paper by Roman Suszko, ‘Identity Connective and Modality’, claimed that a certain identity-free schema expressed the condition that there are at most two objects in the domain. Section 1 here gives that schema and enough of the background to this claim to explain Suszko’s own interest in it and related conditions—via non-Fregean logic, in which the objects in question are situations and the aim is to refrain from imposing this condition. Section 3 shows that the claim is false, (...) and suggests a diagnosis as to why it might have been made, in terms of quantifier scope distinctions as they bear on schematic formulations. In between, Section 2 discusses an issue brought up by this discussion but not involving the mistaken claim itself, and shows that Suszko was familiar with two different ways to set an upper or lower finite bound to the domain—a contrast which some contemporary readers may associate with David Lewis. (shrink)

The aim of the paper is twofold. First, we want to recapture the genesis of the logics of order. The origin of this notion is traced back to the work of Jerzy Kotas, Roman Suszko, Richard Routley and Robert K. Meyer. A further development of the theory of logics of order is presented in the papers of Jacek K. Kabziński. Quite contemporarily, this notion gained in significance in the papers of Carles Noguera and Petr Cintula. Logics of order are named (...) there _logics of weak implications_. They play a crucial role in their monograph (Noguera and Cintula _Logic and Implication. An Introduction to the General Algebraic Study of Non-Classical Logics_, Trends in Logic 57, Springer, Berlin, 2021). But, more importantly, the other goal is to define some subclasses of the logics of order in reference to later results of Jacek K. Kabziński and Michael Dunn. The original conception of implication is due to Kabziński. Implication is a stronger notion than the notion of the connective of order aka weak implication. As a result, the three subclasses of logics of order are isolated: logics of implication, logics of symmetry, and tonoidal logics. These notions are uniformly defined and investigated from various viewpoints in terms of consequence operations. The emphasis is put on their semantics. (shrink)