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

The paper begins with a more carefully stated version of ontologically neutral (ON) logic, originally introduced in (Hailperin, 1997). A non-infinitistic semantics which includes a definition of potential infinite validity follows. It is shown, without appeal to the actual infinite, that this notion provides a necessary and sufficient condition for provability in ON logic.

Michael Dummett begins The Logical Basis of Metaphysics by noting that most of the work done in analytic philosophy seems disconcertingly remote from any concern with the “deep questions of great import for an understanding of the world” that the non-professional expects it to answer. In part, he says, this is because modern analytic philosophy is founded upon a more penetrating analysis of the general structure of our thoughts than was available to past ages, namely, the apparatus of modern (...) logic, beginning with Frege’s Begriffsschrift in 1879. Analytic philosophers take for granted the principles of semantic analysis embodied in the notation of modern logic. Even if they do not make use of a technical vocabulary, having taken these principles for granted is itself often enough to render their approach opaque to the layperson. Appearances aside, he claims, analytic philosophy is still concerned with the “deep questions.” And, to his credit, Dummett keeps an eye focused on some of the central questions of philosophy, those concerning metaphysical realism, throughout the book. (shrink)

. This paper aims to highlight some peculiarities of the semiotic square, whose creation is due in particular to Greimas’ works. The starting point is the semiotic notion of complex term, which I regard as one of the main differences between Greimas’ square and Blanché’s hexagon. The remarks on the complex terms make room for a historical survey in Aristotle’s texts, where one can find the philosophical roots of the idea of middle term between two contraries and its relation to (...) notions such as difference, position and motion. In the Stagirite’s non-logical works, the theory of the intermediate, or middle term, represents an important link between opposition issues and ethics: this becomes a privileged perspective from which to reconsider the semiotic use of the square, i.e., its inclusion in the semio-narrative structures articulating the sense of texts. (shrink)

On Gilbert’s multi-modal theory of argumentation, the “logical” is but one among many modes of argument, including the emotional, the visceral (physical), and the kisceral (intuitive). Yet, I argue that, properly understood, the logical is not one mode among many. Rather, it is better understood as the _uber-mode_ of argument. What Gilbert calls the “logical mode” of argument—a linear, orderly, highly verbalizable, way of arguing—is made possible only to the extent that the logic of some space of (...) reasons has been articulated. The “anti-logical” penchant of multi-modal argumentation is not found at the object-level—in its countenancing “non-logical” modes of argument, but at the meta-level—in its resistance, as a mistaken embracing of the “logical” mode, to using the logics governing the different modes to self-regulate the course of our arguings. (shrink)

On Gilbert’s multi-modal theory of argumentation, the “logical” is but one among many modes of argument, including the emotional, the visceral (physical), and the kisceral (intuitive). Yet, I argue that, properly understood, the logical is not one mode among many. Rather, it is better understood as the _uber-mode_ of argument. What Gilbert calls the “logical mode” of argument—a linear, orderly, highly verbalizable, way of arguing—is made possible only to the extent that the logic of some space of (...) reasons has been articulated. The “anti-logical” penchant of multi-modal argumentation is not found at the object-level—in its countenancing “non-logical” modes of argument, but at the meta-level—in its resistance, as a mistaken embracing of the “logical” mode, to using the logics governing the different modes to self-regulate the course of our arguings. (shrink)

On Gilbert’s multi-modal theory of argumentation, the “logical” is but one among many modes of argument, including the emotional, the visceral (physical), and the kisceral (intuitive). Yet, I argue that, properly understood, the logical is not one mode among many. Rather, it is better understood as the _uber-mode_ of argument. What Gilbert calls the “logical mode” of argument—a linear, orderly, highly verbalizable, way of arguing—is made possible only to the extent that the logic of some space of (...) reasons has been articulated. The “anti-logical” penchant of multi-modal argumentation is not found at the object-level—in its countenancing “non-logical” modes of argument, but at the meta-level—in its resistance, as a mistaken embracing of the “logical” mode, to using the logics governing the different modes to self-regulate the course of our arguings. (shrink)

In this paper, I consider two curious subsystems ofFrege's Grundgesetze der Arithmetik: Richard Heck's predicative fragment H, consisting of schema V together with predicative second-order comprehension (in a language containing a syntactical abstraction operator), and a theory T in monadic second-order logic, consisting of axiom V and 1 1-comprehension (in a language containing anabstraction function). I provide a consistency proof for the latter theory, thereby refuting a version of a conjecture by Heck. It is shown that both Heck and T (...) prove the existence of infinitely many non-logical objects (T deriving,moreover, the nonexistence of the value-range concept). Some implications concerning the interpretation of Frege's proof of referentiality and the possibility of classifying any of these subsystems as logicist are discussed. Finally, I explore the relation of T toCantor's theorem which is somewhat surprising. (shrink)

Multialgebras have been much studied in mathematics and in computer science. In 2016 Carnielli and Coniglio introduced a class of multialgebras called swap structures, as a semantic framework for dealing with several Logics of Formal Inconsistency that cannot be semantically characterized by a single finite matrix. In particular, these LFIs are not algebraizable by the standard tools of abstract algebraic logic. In this paper, the first steps towards a theory of non-deterministic algebraization of logics by swap structures are given. Specifically, (...) a formal study of swap structures for LFIs is developed, by adapting concepts of universal algebra to multialgebras in a suitable way. A decomposition theorem similar to Birkhoff’s representation theorem is obtained for each class of swap structures. Moreover, when applied to the 3-valued algebraizable logics J3 and Ciore, their classes of algebraic models are retrieved, and the swap structures semantics become twist structures semantics. This fact, together with the existence of a functor from the category of Boolean algebras to the category of swap structures for each LFI, suggests that swap structures can be seen as non-deterministic twist structures. This opens new avenues for dealing with non-algebraizable logics by the more general methodology of multialgebraic semantics. (shrink)

A number of authors have objected to the application of non-classical logic to problems in philosophy on the basis that these non-classical logics are usually characterised by a classical metatheory. In many cases the problem amounts to more than just a discrepancy; the very phenomena responsible for non-classicality occur in the field of semantics as much as they do elsewhere. The phenomena of higher order vagueness and the revenge liar are just two such examples. The aim of this paper is (...) to show that a large class of non-classical logics are strong enough to formulate their own model theory in a corresponding non-classical set theory. Specifically I show that adequate definitions of validity can be given for the propositional calculus in such a way that the metatheory proves, in the specified logic, that every theorem of the propositional fragment of that logic is validated. It is shown that in some cases it may fail to be a classical matter whether a given sentence is valid or not. One surprising conclusion for non-classical accounts of vagueness is drawn: there can be no axiomatic, and therefore precise, system which is determinately sound and complete. (shrink)

This paper offers a short and biased overview of the history of discussion and controversy about the role of different forms of representation in intelligent agents. It repeats and extends some of the criticisms of the `logicist' approach to AI that I first made in 1971, while also defending logic for its power and generality. It identifies some common confusions regarding the role of visual or diagrammatic reasoning including confusions based on the fact that different forms of representation may be (...) used at different levels in an implementation hierarchy. This is contrasted with the way in the use of one form of representation (e.g. pictures) can be {\em controlled} using another (e.g. logic, or programs). Finally some questions are asked about the role of metrical information in biological visual systems. (shrink)

The term "non-monotonic logic" covers a family of formal frameworks devised to capture and represent defeasible inference , i.e., that kind of inference of everyday life in which reasoners draw conclusions tentatively, reserving the right to retract them in the light of further information. Such inferences are called "non-monotonic" because the set of conclusions warranted on the basis of a given knowledge base does not increase (in fact, it can shrink) with the size of the knowledge base itself. This is (...) in contrast to classical (first-order) logic, whose inferences, being deductively valid, can never be "undone" by new information. (shrink)

In order to handle inconsistent knowledge bases in a reasonable way, one needs a logic which allows nontrivial inconsistent theories. Logics of this sort are called paraconsistent. One of the oldest and best known approaches to the problem of designing useful paraconsistent logics is da Costa’s approach, which seeks to allow the use of classical logic whenever it is safe to do so, but behaves completely differently when contradictions are involved. Da Costa’s approach has led to the family of logics (...) of formal (in)consistency (LFIs). In this paper we provide in a modular way simple non-deterministic semantics for 64 of the most important logics from this family. Our semantics is 3-valued for some of the systems, and infinite-valued for the others. We prove that these results cannot be improved: neither of the systems with a three-valued non-deterministic semantics has either a finite characteristic ordinary matrix or a two-valued characteristic non-deterministic matrix, and neither of the other systems we investigate has a finite characteristic non-deterministic matrix. Still, our semantics provides decision procedures for all the systems investigated, as well as easy proofs of important proof-theoretical properties of them. (shrink)

Fibring has been shown to be useful for combining logics endowed withtruth-functional semantics. However, the techniques used so far are unableto cope with fibring of logics endowed with non-truth-functional semanticsas, for example, paraconsistent logics. The first main contribution of thepaper is the development of a suitable abstract notion of logic, that mayalso encompass systems with non-truth-functional connectives, and wherefibring can still be dealt with. Furthermore, it is shown that thisextended notion of fibring preserves completeness under certain reasonableconditions. This completeness transfer (...) result, the second main contributionof the paper, generalizes the one established in Zanardo et al. (2001) butis obtained using new techniques that explore the properties of a suitablemeta-logic (conditional equational logic) where the (possibly)non-truth-functional valuations are specified. The modal paraconsistentlogic of da Costa and Carnielli (1988) is studied in the context of this novel notionof fibring and its completeness is so established. (shrink)

A common response to those who question the Law of Non-Contradiction is that it is impossible to debate such a fundamental law of logic. The reasons for this response vary, but what seems to underlie them is the thought that there is a minimal set of logical resources without which rational debate is impossible. This chapter argues that this response is misguided. First, it defends non-apriorism in logic: the view that logic is in the same epistemic boat as other (...) scientific theories. It then offers an account of logical theory change in terms of this epistemology. The LNC is discussed in terms of this account of logical theory change, and it is shown that rational debate over this law can, and does, proceed. Finally, arguments for and against the LNC are discussed, and how and where non-a priori considerations arise in these arguments are illustrated. (shrink)

Graham Priest presents a ground-breaking account of the semantics of intentional language--verbs such as "believes," "fears," "seeks," or "imagines." Towards Non-Being proceeds in terms of objects that may be either existent or non-existent, at worlds that may be either possible or impossible. The book will be of central interest to anyone who is concerned with intentionality in the philosophy of mind or philosophy of language, the metaphysics of existence and identity, the philosophy of fiction, the philosophy of mathematics, or cognitive (...) representation in AI. (shrink)

n this paper, a non-classical axiomatic system was introduced to classify all moods of Aristotelian syllogisms, in addition to the axiom "Every a is an a" and the bilateral rules of obversion of E and O propositions. This system consists of only 2 definitions, 2 axioms, 1 rule of a premise, and moods of Barbara and Datisi. By adding first-degree propositional negation to this system, we prove that the square of opposition holds without using many of the other rules of (...) classical logic (including double negation elimination). We then show that the Propositional Substructural Logic SLe is the best logic to study Aristotelian Syllogisms. Also, based on the IFLe square of opposition, the rules of conversation and the rules of negation are completely proved in Muzaffar's logic. For this purpose, we used the monadic first-order logic with the same standard deductive apparatus of quantifiers in classical logic, plus the axioms of "some a is an a" and "some not-a is a not-a". Finally, to show that there is no existential commitment to general terms in categorical logic, the Strong Four-Valued Relevant-classical Logic KR4 was used. With the same existential interpretation of the quantifiers and the standard translation of the quarter quantified. (shrink)

In this paper we provide a detailed proof-theoretical analysis of a natural deduction system for classical propositional logic that (i) represents classical proofs in a more natural way than standard Gentzen-style natural deduction, (ii) admits of a simple normalization procedure such that normal proofs enjoy the Weak Subformula Property, (iii) provides the means to prove a Non-contamination Property of normal proofs that is not satisfied by normal proofs in the Gentzen tradition and is useful for applications, especially in formal argumentation, (...) (iv) naturally leads to defining a notion of depth of a proof, to the effect that, for every fixed natural k, normal k-depth deducibility is a tractable problem and converges to classical deducibility as k tends to infinity. (shrink)

A system of logic usually comprises a language for which a model-theory and a proof-theory are defined. The model-theory defines the semantic notion of model-theoretic logical consequence (⊨), while the proof-theory defines the proof- theoretic notion of logical consequence (or logical derivability, ⊢). If the system in question is sound and complete, then the two notions of logical consequence are extensionally equivalent. The concept of full formalization is a more restrictive one and requires in addition the (...) preservation of the standard meanings of the logical terms in all the admissible interpretations of the logical calculus, as it is proof-theoretically defined. Although classical first-order logic is sound and complete, its standard formalizations fall short to be full formalizations since they allow non-intended interpretations. This fact poses a challenge for the logical inferentialism program, whose main tenet is that the meanings of the logical terms are uniquely determined by the formal axioms or rules of inference that govern their use in a logical calculus, i.e., logical inferentialism requires a categorical calculus. This paper is the first part of a more elaborated study which will analyze the categoricity problem from its beginning until the most recent approaches. I will first start by describing the problem of a full formalization in the general framework in which Carnap (1934/1937, 1943) formulated it for classical logic. Then, in sections IV and V, I shall discuss the way in which the mathematicians B.A. Bernstein (1932) and E.V. Huntington (1933) have previously formulated and analyzed it in algebraic terms for propositional logic and, finally, I shall discuss some critical reactions Nagel (1943), Hempel (1943), Fitch (1944), and Church (1944) formulated to these approaches. (shrink)

The categoricity problem for a system of logic reveals an asymmetry between the model-theoretic and the proof-theoretic resources of that logic. In particular, it reveals prima facie that the proof-theoretic instruments are insufficient for matching the envisaged model-theory, when the latter is already available. Among the proposed solutions for solving this problem, some make use of new proof-theoretic instruments, some others introduce new model-theoretic constrains on the proof-systems, while others try to use instruments from both sides. On the proof-theoretical side, (...) two main approaches for solving the categoricity problem for propositional classical logic consist in the enforcement of the formal systems of this logic by introducing rules of inference of a new kind. A multiple-conclusions logic allows rules of inference with more than one conclusion, while a bilateralist system contains rules of inference formulated in terms of assertion and rejection. Both these approaches reveal interesting formal features of logical reasoning. This paper analyses some of the advantages and limitations of these two approaches as solutions for a full formalization of logic, i.e., for a categorical formalization. (shrink)

Logic, in one of the many sense of that term, is a theory about what follows from what and why. Arguably, the correct theory has to be determined by abduction. Over recent years, so called logical anti-exceptionalists have investigated this matter. Current discussions have been restricted to deductive logic. However, there are also, of course, various forms of non-deductive reasoning. Indeed, abduction itself is one of these. What is to be said about the way of choosing the best theory (...) of non-deductive inferences? It would seem clear that an anti-exceptionalist should hold that essentially the same method of choice should apply to non-deductive logic. A number of issues need to be faced in the process, not the least of which is the circularity involved in an abductive justification for a theory of abduction. This paper discusses matters. (shrink)

Our aim is to provide a sequent calculus whose external consequence relation coincides with the three-valued paracomplete logic `of nonsense' introduced by Dmitry Bochvar and, independently, presented as the weak Kleene logic K3W by Stephen C. Kleene. The main features of this calculus are (i) that it is non-reflexive, i.e., Identity is not included as an explicit rule (although a restricted form of it with premises is derivable); (ii) that it includes rules where no variable-inclusion conditions are attached; and (iii) (...) that it is hybrid, insofar as it includes both left and right operational introduction as well as elimination rules. (shrink)

On the one hand, non-reflexive logics are logics in which the principle of identity does not hold in general. On the other hand, quantum mechanics has difficulties regarding the interpretation of ‘particles’ and their identity, also known in the literature as ‘the problem of indistinguishable particles’. In this article, we will argue that non-reflexive logics can be a useful tool to account for such quantum indistinguishability. In particular, we will provide a particular non-reflexive logic that can help us to analyze (...) and discuss this problem. From a more general physical perspective, we will also analyze the limits imposed by the orthodox quantum formalism to consider the existence of indistinguishable particles in the first place, and argue that non-reflexive logics can also help us to think beyond the limits of classical identity. (shrink)

In this paper we study a new operator of strong modality ⊞, related to the non-contingency operator ∆. We then provide soundness and completeness theorems for the minimal logic of the ⊞-operator.

Mathematicians often speak of conjectures as being confirmed by evidence that falls short of proof. For their own conjectures, evidence justifies further work in looking for a proof. Those conjectures of mathematics that have long resisted proof, such as Fermat's Last Theorem and the Riemann Hypothesis, have had to be considered in terms of the evidence for and against them. It is argued here that it is not adequate to describe the relation of evidence to hypothesis as `subjective', `heuristic' or (...) `pragmatic', but that there must be an element of what it is rational to believe on the evidence, that is, of non-deductive logic. (shrink)

We introduce proof nets and sequent calculus for the multiplicative fragment of non-commutative logic, which is an extension of both linear logic and cyclic linear logic. The two main technical novelties are a third switching position for the non-commutative disjunction, and the structure of order variety.

The paper first proposes a new definition of religion which features a novel four-layered element and which does not involve any circularity ; thereby, it allows to clearly distinguish the phenomenon of religion from certain other worldviews, in particular from certain political ideologies. Relying on the findings, the paper develops two structural conceptual models which serve to describe religious and non-religious belief systems. Further, the definition and the conceptual models allow to establish a clear criterion to distinguish pivotal structural differences (...) between religious and non-religious belief systems. The criterion is based on the concept of two kinds of rationality: first-level and second-level rationalities. These will demonstrate to what degree religion can be a rational enterprise, and what role logic can play in it. The result is a clear-cut line in the structures of religious and certain consistent non-religious belief systems. (shrink)

We define a family of intuitionistic non-normal modal logics; they can be seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only Necessity or Possibility. We then consider the more important case of bimodal logics, which contain both modal operators. In this case we define several interactions between Necessity and Possibility of increasing strength, although weaker than duality. We thereby obtain a lattice of 24 distinct bimodal logics. For all logics we provide both a Hilbert (...) axiomatisation and a cut-free sequent calculus, on its basis we also prove their decidability. We then define a semantic characterisation of our logics in terms of neighbourhood models containing two distinct neighbourhood functions corresponding to the two modalities. Our semantic framework captures modularly not only our systems but also already known intuitionistic non-normal modal logics such as Constructive K and the propositional fragment of Wijesekera’s Constructive Concurrent Dynamic Logic. (shrink)

The subject of Labelled Non-Classical Logics is the development and investigation of a framework for the modular and uniform presentation and implementation of non-classical logics, in particular modal and relevance logics. Logics are presented as labelled deduction systems, which are proved to be sound and complete with respect to the corresponding Kripke-style semantics. We investigate the proof theory of our systems, and show them to possess structural properties such as normalization and the subformula property, which we exploit not only to (...) establish advantages and limitations of our approach with respect to related ones, but also to give, by means of a substructural analysis, a new proof-theoretic method for investigating decidability and complexity of (some of) the logics we consider. All of our deduction systems have been implemented in the generic theorem prover Isabelle, thus providing a simple and natural environment for interactive proof development. Labelled Non-Classical Logics is essential reading for researchers and practitioners interested in the theory and applications of non-classical logics. (shrink)

It is well known that every propositional logic which satisfies certain very natural conditions can be characterized semantically using a multi-valued matrix ([Los and Suszko, 1958; W´ ojcicki, 1988; Urquhart, 2001]). However, there are many important decidable logics whose characteristic matrices necessarily consist of an infinite number of truth values. In such a case it might be quite difficult to find any of these matrices, or to use one when it is found. Even in case a logic does have a (...) finite characteristic matrix it might be difficult to discover this fact, or to find such a matrix. The deep reason for these difficulties is that in an ordinary multi-valued semantics the rules and axioms of a system should be considered as a whole, and there is no method for separately determining the semantic effects of each rule alone. (shrink)

Logical pluralism is the view that there is more than one correct logic. Most logical pluralists think that logic is normative in the sense that you make a mistake if you accept the premisses of a valid argument but reject its conclusion. Some authors have argued that this combination is self-undermining: Suppose that L1 and L2 are correct logics that coincide except for the argument from Γ to φ, which is valid in L1 but invalid in L2. If (...) you accept all sentences in Γ, then, by normativity, you make a mistake if you reject φ. In order to avoid mistakes, you should accept φ or suspend judgment about φ. Both options are problematic for pluralism. Can pluralists avoid this worry by rejecting the normativity of logic? I argue that they cannot. All else being equal, the argument goes through even if logic is not normative. (shrink)

According to a very widespread interpretation of the metaphysical nature of quantum entities—the so-called Received View on quantum non-individuality—, quantum entities are non-individuals. Still according to this understanding, non-individuals are entities for which identity is restricted or else does not apply at all. As a consequence, it is said, such approach to quantum mechanics would require that classical logic be revised, given that it is somehow committed with the unrestricted validity of identity. In this paper we examine the arguments to (...) the inadequacy of classical logic to deal with non-individuals, as previously defined, and argue that they fail to make a good case for logical revision. In fact, classical logic may accommodate non-individuals in that specific sense too. What is more pressing for the Received View, it seems, is not a revision of logic, but rather a more adequate metaphysical characterization of non-individuals. (shrink)

This monograph presents a general theory of weakly implicative logics, a family covering a vast number of non-classical logics studied in the literature, concentrating mainly on the abstract study of the relationship between logics and their algebraic semantics. It can also serve as an introduction to algebraic logic, both propositional and first-order, with special attention paid to the role of implication, lattice and residuated connectives, and generalized disjunctions. Based on their recent work, the authors develop a powerful uniform framework for (...) the study of non-classical logics. In a self-contained and didactic style, starting from very elementary notions, they build a general theory with a substantial number of abstract results. The theory is then applied to obtain numerous results for prominent families of logics and their algebraic counterparts, in particular for superintuitionistic, modal, substructural, fuzzy, and relevant logics. The book may be of interest to a wide audience, especially students and scholars in the fields of mathematics, philosophy, computer science, or related areas, looking for an introduction to a general theory of non-classical logics and their algebraic semantics. (shrink)

This book discusses the philosophical work of Décio Krause. Non-individuality, as a new metaphysical category, was thought to be strongly supported by quantum mechanics. No one did more to promote this idea than the Brazilian philosopher Décio Krause, whose works on the metaphysics and logic of non-individuality are now widely regarded as part of the consolidated literature on the subject. This volume brings together chapters elaborating on the ideas put forward and defended by Krause, developing them in many different directions, (...) commenting on aspects not completely developed so far, and, more importantly, critically addressing their current formulations and defenses by Krause himself. Given that Krause’s ideas do connect directly and indirectly with a wide array of subjects, such as the philosophy of quantum mechanics, more broadly understood, the philosophy of logic and logical philosophy, non-classical logics, metaphysics, and ontology, this volume contains important material for the research on logic and foundations of science, broadly understood. All the invited contributors have already worked with the ideas developed by Décio (some of them still work with them), being also distinct authors and extremely relevant in their areas of expertise. The volume is aimed at philosophers, including those of physics and quantum mechanics. (shrink)

In this paper I discuss the consistency and accuracy of Husserl’s sketch of a theory about non-declarative sentences in the last chapter of Logical Investigations. Whereas the consistency is acknowledged, the accuracy is denied, because Husserl’s treatment of non-declarative phrases such as questions or orders implies that those phrases contain, in some way, a declarative sentence and an objectifying act. To construct a question like »is A B?« as being equivalent to a declarative sentence such as »I ask whether (...) A is B« is, indeed, a false phenomenological analysis, because to ask or to order or to beg is not to assert. I turn, then, to John Austin’s theory of performative utterances and illocutionary acts in order to find a more accurate approach to the logical-semantic content of non-declarative sentences. Eventually, I show how this Husserlian theory of non-declarative sentences has a negative impact on the phenomenological theory of social acts and communication. (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)

This is the first introductory textbook on non-classical propositional logics.