Fred shows how problems with Slater's restriction of the classical propositional logic can be solved.

In 2001, W. Carnielli and Marcos considered a 3-valued logic in order to prove that the schema ϕ ∨ (ϕ → ψ) is not a theorem of da Costa’s logic Cω. In 2006, this logic was studied (and baptized) as G'3 by Osorio et al. as a tool to define semantics of logic programming. It is known that the truth-tables of G'3 have the same expressive power than the one of Łukasiewicz 3-valued logic as well as the one (...) of Gödel 3-valued logic G3. From this, the three logics coincide up-to language, taking into acccount that 1 is the only designated truth-value in these logics. -/- From the algebraic point of view, Canals-Frau and Figallo have studied the 3-valued modal implicative semilattices, where the modal operator is the well-known Moisil-Monteiro-Baaz Δ operator, and the supremum is definable from this. We prove that the subvariety obtained from this by adding a bottom element 0 is term-equivalent to the variety generated by the 3-valued algebra of G'3. The algebras of that variety are called G'3-algebras. From this result, we obtain the equations which axiomatize the variety of G'3-algebras. Moreover, we prove that this variety is semisimple, and the 3-element and the 2-element chains are the unique simple algebras of the variety. Finally an extension of G'3 to first-order languages is presented, with an algebraic semantics based on complete G'3-algebras. The corresponding soundness and completeness theorems are obtained. (shrink)

How to say no less, no more about conditional than what is needed? From a logical analysis of necessary and sufficient conditions (Section 1), we argue that a stronger account of conditional can be obtained in two steps: firstly, by reminding its historical roots inside modal logic and set-theory (Section 2); secondly, by revising the meaning of logical values, thereby getting rid of the paradoxes of material implication whilst showing the bivalent roots of conditional as a speech-act based on affirmations (...) and rejections (Section 3). Finally, the two main inference rules for conditional, viz. Modus Ponens and Modus Tollens, are reassessed through a broader definition of logical consequence that encompasses both a normal relation of truth propagation and a weaker relation of falsity non-propagation from premises to conclusion (Section 3). (shrink)

(1) This paper is about how to build an account of the normativity of logic around the claim that logic is constitutive of thinking. I take the claim that logic is constitutive of thinking to mean that representational activity must tend to conform to logic to count as thinking. (2) I develop a natural line of thought about how to develop the constitutive position into an account of logical normativity by drawing on constitutivism in metaethics. (3) I argue that, while (...) this line of thought provides some insights, it is importantly incomplete, as it is unable to explain why we should think. I consider two attempts at rescuing the line of thought. The first, unsuccessful response is that it is self-defeating to ask why we ought to think. The second response is that we need to think. But this response secures normativity only if thinking has some connection to human flourishing. (4) I argue that thinking is necessary for human flourishing. Logic is normative because it is constitutive of this good. (5) I show that the resulting account deals nicely with problems that vex other accounts of logical normativity. (shrink)

In a recent paper we have defined an analytic tableau calculus PL_16 for a functionally complete extension of Shramko and Wansing's logic based on the trilattice SIXTEEN_3. This calculus makes it possible to define syntactic entailment relations that capture central semantic relations of the logic---such as the relations |=_t, |=_f, and |=_i that each correspond to a lattice order in SIXTEEN_3; and |=, the intersection of |=_t and |=_f,. -/- It turns out that our method of characterising these semantic relations---as (...) intersections of auxiliary relations that can be captured with the help of a single calculus---lends itself well to proving interpolation. All entailment relations just mentioned have the interpolation property, not only when they are defined with respect to a functionally complete language, but also in a range of cases where less expressive languages are considered. For example, we will show that |=, when restricted to L_{tf}, the language originally considered by Shramko and Wansing, enjoys interpolation. This answers a question that was recently posed by M. Takano. (shrink)

One of the most prominent myths in analytic philosophy is the so- called “Fregean Axiom”, according to which the reference of a sentence is a truth value. In contrast to this referential semantics, a use-based formal semantics will be constructed in which the logical value of a sentence is not its putative referent but the information it conveys. Let us call by “Question Answer Semantics” (thereafter: QAS) the corresponding formal semantics: a non-Fregean many-valued logic, where the meaning of any (...) sentence is an ordered n-tupled of yes-no answers to corresponding questions. A sample of philosophical problems will be approached in order to justify the relevance of QAS. These include: (1) illocutionary forces, and the logical analysis of speech-acts; (2) the variety of logical negations, and their characterization in terms of restricted ranges of logical values; (3) change in meaning, and the use of dynamic oppositions for belief sets. (shrink)

Paraconsistent logics are logical systems that reject the classical principle, usually dubbed Explosion, that a contradiction implies everything. However, the received view about paraconsistency focuses only the inferential version of Explosion, which is concerned with formulae, thereby overlooking other possible accounts. In this paper, we propose to focus, additionally, on a meta-inferential version of Explosion, i.e. which is concerned with inferences or sequents. In doing so, we will offer a new characterization of paraconsistency by means of which a logic (...) is paraconsistent if it invalidates either the inferential or the meta-inferential notion of Explosion. We show the non-triviality of this criterion by discussing a number of logics. On the one hand, logics which validate and invalidate both versions of Explosion, such as classical logic and Asenjo–Priest’s 3-valued logic LP. On the other hand, logics which validate one version of Explosion but not the other, such as the substructural logics TS and ST, introduced by Malinowski and Cobreros, Egré, Ripley and van Rooij, which are obtained via Malinowski’s and Frankowski’s q- and p-matrices, respectively. (shrink)

We here make preliminary investigations into the model theory of DeMorgan logics. We demonstrate that Łoś's Theorem holds with respect to these logics and make some remarks about standard model-theoretic properties in such contexts. More concretely, as a case study we examine the fate of Cantor's Theorem that the classical theory of dense linear orderings without endpoints is $\aleph_{0}$-categorical, and we show that the taking of ultraproducts commutes with respect to previously established methods of constructing nonclassical structures, namely, (...) Priest's Collapsing Lemma and Dunn's Theorem in 3-Valued Logic. (shrink)

Free logics aim at freeing logic from existence assumptions by making them explicit, e.g., by adding an existence premisse to the antecedence of the classical axiom-schema of Universal Instantiation. Their historical development was motivated by the problem of empty singular terms, and that one of simple statements containing at least one such singular term: what is the referential status of such singular terms and what truth-value, if any, do such statemants have? Free logics can be classified with regard (...) to their respective answers to these problems. Negative free logics assume that non-existent objects cannot have any properties at all; hence, in particular, they cannot be self-identical or rotate. Positive free logics believe that non-existents can be self-identical according to the Leibnizian concept of identity. Neutral free logics think that statements of self-identity are truth-valueless because of the Fregean principle of compositionality. Since only in negative free logic, but not in positive free logic, two statements of the forms "a = a" and "E!a" are logically equivalent, one also can define only for NFL, but not for PFL, existence by self-identity. (shrink)

Boolean-valued models of set theory were independently introduced by Scott, Solovay and Vopěnka in 1965, offering a natural and rich alternative for describing forcing. The original method was adapted by Takeuti, Titani, Kozawa and Ozawa to lattice-valued models of set theory. After this, Löwe and Tarafder proposed a class of algebras based on a certain kind of implication which satisfy several axioms of ZF. From this class, they found a specific 3-valued model called PS3 which satisfies all (...) the axioms of ZF, and can be expanded with a paraconsistent negation *, thus obtaining a paraconsistent model of ZF. The logic (PS3 ,*) coincides (up to language) with da Costa and D'Ottaviano logic J3, a 3-valued paraconsistent logic that have been proposed independently in the literature by several authors and with different motivations such as CluNs, LFI1 and MPT. We propose in this paper a family of algebraic models of ZFC based on LPT0, another linguistic variant of J3 introduced by us in 2016. The semantics of LPT0, as well as of its first-order version QLPT0, is given by twist structures defined over Boolean agebras. From this, it is possible to adapt the standard Boolean-valued models of (classical) ZFC to twist-valued models of an expansion of ZFC by adding a paraconsistent negation. We argue that the implication operator of LPT0 is more suitable for a paraconsistent set theory than the implication of PS3, since it allows for genuinely inconsistent sets w such that [(w = w)] = 1/2 . This implication is not a 'reasonable implication' as defined by Löwe and Tarafder. This suggests that 'reasonable implication algebras' are just one way to define a paraconsistent set theory. Our twist-valued models are adapted to provide a class of twist-valued models for (PS3,*), thus generalizing Löwe and Tarafder result. It is shown that they are in fact models of ZFC (not only of ZF). (shrink)

The logics of formal inconsistency (LFIs, for short) are paraconsistent logics (that is, logics containing contradictory but non-trivial theories) having a consistency connective which allows to recover the ex falso quodlibet principle in a controlled way. The aim of this paper is considering a novel semantical approach to first-order LFIs based on Tarskian structures defined over swap structures, a special class of multialgebras. The proposed semantical framework generalizes previous aproaches to quantified LFIs presented in the literature. The (...) case of QmbC, the simpler quantified LFI expanding classical logic, will be analyzed in detail. An axiomatic extension of QmbC called QLFI1o is also studied, which is equivalent to the quantified version of da Costa and D'Ottaviano 3-valued logic J3. The semantical structures for this logic turn out to be Tarkian structures based on twist structures. The expansion of QmbC and QLFI1o with a standard equality predicate is also considered. (shrink)

Modal logic is one of philosophy’s many children. As a mature adult it has moved out of the parental home and is nowadays straying far from its parent. But the ties are still there: philosophy is important to modal logic, modal logic is important for philosophy. Or, at least, this is a thesis we try to defend in this chapter. Limitations of space have ruled out any attempt at writing a survey of all the work going on in our field—a (...) book would be needed for that. Instead, we have tried to select material that is of interest in its own right or exemplifies noteworthy features in interesting ways. Here are some themes that have guided us throughout the writing: • The back-and-forth between philosophy and modal logic. There has been a good deal of give-and-take in the past. Carnap tried to use his modal logic to throw light on old philosophical questions, thereby inspiring others to continue his work and still others to criticise it. He certainly provoked Quine, who in his turn provided—and continues to provide—a healthy challenge to modal logicians. And Kripke’s and David Lewis’s philosophies are connected, in interesting ways, with their modal logic. Analytic philosophy would have been a lot different without modal logic! • The interpretation problem. The problem of providing a certain modal logic with an intuitive interpretation should not be conflated with the problem of providing a formal system with a model-theoretic semantics. An intuitively appealing model-theoretic semantics may be an important step towards solving the interpretation problem, but only a step. One may compare this situation with that in probability theory, where definitions of concepts like ‘outcome space’ and ‘random variable’ are orthogonal to questions about “interpretations” of the concept of probability. • The value of formalisation. Modal logic sets standards of precision, which are a challenge to—and sometimes a model for—philosophy. Classical philosophical questions can be sharpened and seen from a new perspective when formulated in a framework of modal logic. On the other hand, representing old questions in a formal garb has its dangers, such as simplification and distortion. • Why modal logic rather than classical (first or higher order) logic? The idioms of modal logic—today there are many!—seem better to correspond to human ways of thinking than ordinary extensional logic. (Cf. Chomsky’s conjecture that the NP + VP pattern is wired into the human brain.) In his An Essay in Modal Logic (1951) von Wright distinguished between four kinds of modalities: alethic (modes of truth: necessity, possibility and impossibility), epistemic (modes of being known: known to be true, known to be false, undecided), deontic (modes of obligation: obligatory, permitted, forbidden) and existential (modes of existence: universality, existence, emptiness). The existential modalities are not usually counted as modalities, but the other three categories are exemplified in three sections into which this chapter is divided. Section 1 is devoted to alethic modal logic and reviews some main themes at the heart of philosophical modal logic. Sections 2 and 3 deal with topics in epistemic logic and deontic logic, respectively, and are meant to illustrate two different uses that modal logic or indeed any logic can have: it may be applied to already existing (non-logical) theory, or it can be used to develop new theory. (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)

Trivalence is quite natural for deontic action logic, where actions are treated as good, neutral or bad.We present the ideas of trivalent deontic logic after J. Kalinowski and its realisation in a 3-valued logic of M. Fisher and two systems designed by the authors of the paper: a 4-valued logic inspired by N. Belnap’s logic of truth and information and a 3-valued logic based on nondeterministic matrices. Moreover, we combine Kalinowski’s idea of trivalence with deontic action logic (...) based on boolean algebra. (shrink)

Description Logics (DLs) are a family of well-known terminological knowledge representation formalisms in modern semantics-based systems. This research focuses on analysing how our developed Occurrence Logic (OccL) can conceptually and logically support the development of a description logic. OccL is integrated into the alternative theory of natural language syntax in `Deviational Syntactic Structures' under the label `EFA(X)3' (or the third version of Epi-Formal Analysis in Syntax, EFA(X), which is a radical linguistic theory). From the logical point of view, OccL (...) is a formal logic that mainly deals with the occurrences of symbols as well as with their priorities within linguistic descriptions, i.e. natural language syntax, semantics and phonology. In this article---based on our OccL-based definitions of the concepts of `strong implication' and `occurrence value' as well as of the logical concept `identical occurrence constructor (IDOC)' that is the most fundamental logical concept in our formalism---we will model Occurrence Description Logic ($\mathcal{ODL}$). Accordingly, we will formally-logically analyse `occurrence(s) of symbol(s)' within descriptions of the world in $\mathcal{ODL}$. In addition, we will analyse and assess the logical concepts of `occurrence' and `occurrence priority' in $\mathcal{ODL}$. This research can make a strong logical background for our future research in the development of a Modal Occurrence Description Logic. (shrink)

The endeavour to locate value in moral progress faces various substantive as well as more formal challenges. This paper focuses on challenges of the latter kind. After some preliminaries, Section 3 introduces two general kinds of “evaluative moral progress-claims”, and outlines a possible novel analysis of a descriptive notion of moral progress. While Section 4 discusses certain logical features of betterness in light of recent work in value theory which are pertinent to the notion of moral progress, Sections 5 and (...) 6 outline the ambiguous character of “making moral progress”. (shrink)

This paper examines the philosophical significance of the consequence relation defined in the $\Omega$-logic for set-theoretic languages. I argue that, as with second-order logic, the hyperintensional profile of validity in $\Omega$-Logic enables the property to be epistemically tractable. Because of the duality between coalgebras and algebras, Boolean-valued models of set theory can be interpreted as coalgebras. In Section \textbf{2}, I demonstrate how the hyperintensional profile of $\Omega$-logical validity can be countenanced within a coalgebraic logic. Finally, in Section \textbf{3}, the (...) philosophical significance of the characterization of the hyperintensional profile of $\Omega$-logical validity for the philosophy of mathematics is examined. I argue (i) that $\Omega$-logical validity is genuinely logical, and (ii) that it provides a hyperintensional account of formal grasp of the concept of `set'. Section \textbf{4} provides concluding remarks. (shrink)

Chapter 3 surveys objectivity in the natural sciences. Thomas Kuhn problematized the logicist understanding of the objectivity or rationality of scientific change, providing a very different picture than that of the cumulative or step-wise progress of theoretical science. Theories often compete, and when consensus builds around one competitor it may be for a variety of reasons other than just the direct logical implications of experimental successes and failures. Kuhn pitted the study of the actual history of science against what Hans (...) Reichenbach referred to as the “logical substitutes” logicists used to reconstruct the rationality of theory change. Such substitutes were promoted to show that theory confirmation is a purely epistemic affair, where purely epistemic implies purely inferential. But where the positivists saw logical compulsion as the reason for theory change, Kuhn saw psychology in values as relevant to how theories are actually confirmed or accepted by the scientific community. (shrink)

By and large, the conditional connective in three-valued logic has two different functions. First, by means of a deduction theorem, it can express a specific relation of logical consequence in the logical language itself. Second, it can represent natural language structures such as "if/then'' or "implies''. This chapter surveys both approaches, shows why none of them will typically end up with a three-valued material conditional, and elaborates on connections to probabilistic reasoning.

Desires matter. How are we to understand the intentionality of desire? According to the two classical views, desire is either a positive evaluation or a disposition to act: to desire a state is to positively evaluate it or to be disposed to act to realize it. This Ph.D. Dissertation examines these conceptions of desire and proposes a deontic alternative inspired by Meinong. On this view, desiring is representing a state of affairs as what ought to be or, if one prefers, (...) as what should be. Desire involves a deontic manner of representing: a norm of the ought-to-be type features in desire’s intentional mode, as opposed to content. The dissertation is structured in three parts. In order to defend this conception, I formulate three main desiderata for a promising theory of the intentionality of desire in the introduction (§0). The first concerns desire’s direction of fit, i.e. the intuition that the world should conform to our desires. The second concerns the death of desire principle, i.e. the intuition that one cannot desire what one represents as actual. The last pertains to desire’s role in psychological explanations, i.e. the intuition that desires can explain some mental states and be explained by other mental states. The first part examines the main conceptions of desire in light of these desiderata. I argue that the classical pictures of desire do not adequately meet our desiderata. The first chapter is devoted to the evaluative conception (§1), while the second examines the motivational approach (§2). Following these criticisms, I then present the deontic view of desire (§3). In the second part, I defend this conception with the help of three arguments. The main idea is that appealing to norms of the ought-to-be type can satisfy our chief desiderata: the world should conform to norms (world-to-mind direction of fit, §4), norms are grounded on values and in turn ground obligations (explanation, §5), and norms are about non-actual states of affairs (death of desire principle, §6). In the last part, I develop the deontic view to draw a cartography of the various types of desire. Some desires are correct, while others are inappropriate. This distinction is explained by the deontic conception, as it matches that between states of affairs that ought to obtain and states that should not obtain (§7). Two study cases are examined: caprice and the impermissibility of desire aggregation. Intuitively, hopes, wishes, or urges are types of desire. The next chapter presents a typology inspired by the deontic view and the type of norms there are (§8). The last chapter discusses the main objections to the deontic approach (§9). In conclusion, I show the relevance of the deontic view for several debates in philosophy of mind and ethics. Desires are crucial because they are the ‘eye’ of what should be. (shrink)

Knowledge is good, ignorance is bad. So it seems, anyway. But in this dissertation, I argue that some ignorance is epistemically valuable. Sometimes, we should suspend judgment even though by believing we would achieve knowledge. In this apology for ignorance (ignorance, that is, of a certain kind), I defend the following four theses: 1) Sometimes, we should continue inquiry in ignorance, even though we are in a position to know the answer, in order to achieve more than mere knowledge (e.g. (...) understanding) while minimizing the effects of confirmation bias. 2) It’s false that we should believe every proposition such that we are guaranteed to be right about it (and even such that we are guaranteed to know it) if we believe it. 3) Being in a position to know is the norm of assertion: importantly, this does not require belief or (thereby) knowledge, and so proper assertion can survive speaker-ignorance. 4) It can be permissible and conversationally useful to tell audiences things that it is logically impossible for them to come to know: Proper assertion can survive (necessary) audience-side ignorance. Cumulatively, this project suggests that, properly understood, ignorance has an important role to play in the good epistemic life. (shrink)

We examine the set of formula-to-formula valid inferences of Classical Logic, where the premise and the conclusion share at least a propositional variable in common. We review the fact, already proved in the literature, that such a system is identical to the first-degree entailment fragment of R. Epstein's Relatedness Logic, and that it is a non-transitive logic of the sort investigated by S. Frankowski and others. Furthermore, we provide a semantics and a calculus for this logic. The semantics is defined (...) in terms of a \-matrix built on top of a 5-valued extension of the 3-element weak Kleene algebra, whereas the calculus is defined in terms of a Gentzen-style sequent system where the left and right negation rules are subject to linguistic constraints. (shrink)

Abstract Introduction Logically valid deductive arguments are clear examples of abstract recursive computational proce‐ dures on propositions or on probabilities. However, it is not known if the cortical time‐consuming inferential pro‐ cesses in which logical arguments are eventually realized in the brain are in fact physically different from other kinds of inferential processes. Methods In order to determine whether an electrical EEG discernible pattern of logical deduction exists or not, a new experimental paradigm is proposed contrasting logically valid and invalid (...) inferences with exactly the same content (same premises and same relational variables) and distinct logical complexity (propositional truth‐functional operators). Electroencephalographic signals from 19 subjects (24.2 ± 3.3 years) were acquired in a two‐condition para‐ digm (100 trials for each condition). After the initial general analysis, a trial‐by‐trial approach in beta‐2 band allowed to uncover not only evoked but also phase asynchronous activity between trials. Results showed that (i) deductive inferences with the same content evoked the same response pattern in logically valid and invalid conditions, (ii) mean response time in logically valid inferences is 61.54% higher, (iii) logically valid inferences are subjected to an early (400 ms) and a late reprocessing (600 ms) verified by two distinct beta‐2 activa‐ tions (p‐value < 0,01, Wilcoxon signed rank test). Conclusion We found evidence of a subtle but measurable electrical trait of logical validity. Results put forward the hypothesis that some logically valid deductions are recursive or computational cortical events. Keywords Beta‐2 band, Evoked potentials, Induced potentials, Deductive inference, Logical validity, Cortical bases of logical reasoning. (shrink)

CAT4 is proposed as a general method for representing information, enabling a powerful programming method for large-scale information systems. It enables generalised machine learning, software automation and novel AI capabilities. This is Part 3 of a five-part introduction. The focus here is on explaining the semantic model for CAT4. Points in CAT4 graphs represent facts. We introduce all the formal (data) elements used in the classic semantic model: sense or intension (1st and 2nd joins), reference (3rd join), functions (4th join), (...) time and truth (logical fields), and symbolic content (name/value fields). Concepts are introduced through examples alternating with theoretical discussion. Some concepts are assumed from Part 1 and 2, but key ideas are re-introduced. The purpose is to explain the CAT4 interpretation, and why the data structure and CAT4 axioms have been chosen: to make the semantic model consistent and complete. We start with methods to translate information from database tables into graph DBs and into CAT4. We conclude with a method for translating natural language into CAT4. We conclude with a comparison of the system with an advanced semantic logic, the hyper-intensional logic TIL, which also aims to translate NL into a logical calculus. The CAT4 Natural Language Translator is discussed in further detail in Part 4, when we introduce functions more formally. Part 5 discusses software design considerations. (shrink)

2nd edition. Many-valued logics are those logics that have more than the two classical truth values, to wit, true and false; in fact, they can have from three to infinitely many truth values. This property, together with truth-functionality, provides a powerful formalism to reason in settings where classical logic—as well as other non-classical logics—is of no avail. Indeed, originally motivated by philosophical concerns, these logics soon proved relevant for a plethora of applications ranging from switching (...) theory to cognitive modeling, and they are today in more demand than ever, due to the realization that inconsistency and vagueness in knowledge bases and information processes are not only inevitable and acceptable, but also perhaps welcome. The main modern applications of (any) logic are to be found in the digital computer, and we thus require the practical knowledge how to computerize—which also means automate—decisions (i.e. reasoning) in many-valued logics. This, in turn, necessitates a mathematical foundation for these logics. This book provides both these mathematical foundation and practical knowledge in a rigorous, yet accessible, text, while at the same time situating these logics in the context of the satisfiability problem (SAT) and automated deduction. The main text is complemented with a large selection of exercises, a plus for the reader wishing to not only learn about, but also do something with, many-valued logics. (shrink)

Plato’s attitude towards drunkenness (μέθη) is surprisingly positive in the Laws, especially as compared to his negative treatment of intoxication in the Republic. In the Republic, Plato maintains that intoxication causes cowardice and intemperance (3.398e-399e, 3.403e, and 9.571c-573b), while in the Laws, Plato holds that it can produce courage and temperance (1.635b, 1.645d-650a, and 2.665c-672d). This raises the question: Did Plato change his mind, and if he did, why? Ultimately, this paper answers affirmatively and argues that this marks a substantive (...) shift in Plato’s attitude towards anti-rational desires. More precisely, this paper argues that in the Republic, Plato holds that anti-rational desires are always detrimental to health and virtue, while in the Laws, Plato maintains that anti-rational desires can be instrumental to health and virtue. (shrink)

1971. Discourse Grammars and the Structure of Mathematical Reasoning II: The Nature of a Correct Theory of Proof and Its Value, Journal of Structural Learning 3, #2, 1–16. REPRINTED 1976. Structural Learning II Issues and Approaches, ed. J. Scandura, Gordon & Breach Science Publishers, New York, MR56#15263. -/- This is the second of a series of three articles dealing with application of linguistics and logic to the study of mathematical reasoning, especially in the setting of a concern for improvement of (...) mathematical education. The present article presupposes the previous one. Herein we develop our ideas of the purposes of a theory of proof and the criterion of success to be applied to such theories. In addition we speculate at length concerning the specific kinds of uses to which a successful theory of proof may be put vis-a-vis improvement of various aspects of mathematical education. The final article will deal with the construction of such a theory. The 1st is the 1971. Discourse Grammars and the Structure of Mathematical Reasoning I: Mathematical Reasoning and Stratification of Language, Journal of Structural Learning 3, #1, 55–74. https://www.academia.edu/s/fb081b1886?source=link . (shrink)

The passionate and staunch defence of logic of the controversial thinker Ibn Ḥazm, Abū Muḥammad ʿAlī b. Aḥmad b. Saʿīd of Córdoba (384-456/994-1064), had lasting consequences in the Islamic world. Indeed, his book Facilitating the Understanding of the Rules of Logic and Introduction Thereto, with Common Expressions and Juristic Examples (Kitāb al-Taqrīb li-ḥadd al-manṭiq wa-l-mudkhal ilayhi bi-l-alfāẓ al-ʿāmmiyya wa-l-amthila al-fiqhiyya), composed in 1025-1029, was well known and discussed during and after his time; and it paved the way for the studies (...) of his compatriots Ibn Bājjah (d. 1138), Ibn Ṭufayl (1185), and Ibn Rushd (1198), who each gave demonstrative reasoning a privileged place within the methods of attaining knowledge. Unfortunately, as too often in the history of science, Ibn Ḥazm’s innovative perspectives and contributions in logic have been overlooked or considered with an attitude of contempt. On the one hand, his work has been seen, at best, as promulgating the benefits of studying Aristotle’s logic, so that his contribution is assessed as more didactical than conceptual. And on the other hand, those who do examine his innovations often consider them to be mistaken. As indicated by Chejne (1984, p. 2) contempt towards the logical work of Ibn Ḥazm was also present in its reception by the Eastern philosophers who accused him of deviating from Aristotelian logic and of dabbling in things beyond his capability. However, a reassessment of his work on logic has since begun, by delving into the ways the thinker of Córdoba studied the links between deontic and modal qualification of propositions. In this context Lameer’s (2013) paper on the logical sources of Ibn Ḥazm is worth mentioning; the author (p. 417, footnote 1) observes that, although, strictly speaking, it was al-Fārābī who first drew the parallelism between deontic and modal concepts, it was Ibn Ḥazm who developed it and worked it out in a more precise manner. A primary aim of this paper is to help fill some of these gaps by stressing the role of the work of Ibn Ḥazm in developing a notion of deontic necessity deeply rooted in legal normativity, and in explicitly discussing the transference between deontic and modal concepts. According to our view; the basic units of Islamic deontic logic are what we might call, indulging in terminological anachronism, heteronomous imperatives. As it turns out, the heteronomy of imperatives within Islamic legal systems contrasts with those of the purely moral realm, which seem to be closer to an autonomous conception of moral law. There it concurs again with Leibniz’s proposal to define obligatory as “what is necessary for a good person to do”. In the present paper, we will focus on the heteronomous imperatives of legal systems rather than on the imperatives of the purely moral realm. In this context, the work of Ibn Ḥazm extends the parallelism between the necessity of events and that of human actions stressed by his predecessors. According to our understanding, Ibn Ḥazm’s parallelism can be rendered explicit formally by means of a conditional (or hypothetical) structure shared by both deontic and modal propositions. Moreover, this structure makes apparent that this parallelism displays an underlying system of “degrees”. Indeed, while in the domain of events, given some conditions, it makes sense to distinguish between an event that is more likely to happen than another. Ibn Ḥazm speaks of near and distant possibility (such as the higher degree of likelihood of rain, given the condensation of clouds in December, and its lower degree, when the condensation occurs in summer); and, in the domain of actions, the Islamic notion of weighting actions determines degrees of virtue (or of legal and moral value). So whereas the degree of virtue of performing a forbidden act as determined by the distribution of sanction and reward is 0, we obtain the same value by pondering the likelihood of an impossible event to take place. Furthermore, as discussed in section II.3.2, the system of values at work in the parallelism can be seen as opening the way to a more direct correspondence. Thus, while in the realm of nature, likelihood of occurrence of an event is dependent upon the conditions specific to the occurrence of that event; while, in the realm of jurisprudence, likelihood of performing an action is dependent upon the distribution of reward and sanction specific to that action (being that, given the choice to perform or not perform a given action, those that will be rewarded are more likely to be performed than those that are not). According to this perspective, the point of the parallelism is that both deontic and modal qualifications measure the degree of an action or event to become actual; that is – indulging once more in anachronism (but this time from the Leibnizian background) – the degree measures how feasible (facile) an action or event may be. This suggests that Ibn Ḥazm’s perspectives already herald the links to probability and possibility explored by Leibniz six centuries later – see for example Leibniz’s (1671, A VI, I, p. 424-26) use of probability in the context of conditional right. Nevertheless, it also shows a crucial difference to the approach developed in the Elementa Jura Naturalis: whereas Leibniz’s studies seek to define what is to be just or virtuous, the logical system of deontic imperatives within Islamic jurisprudence presupposes that what is to be virtuous has already been settled. Determining what is to be virtuous is not achieved by logical reasoning within the system of legal jurisprudence, but by delving into the higher objectives of the Sharīʿa. While developing our point, we will delve into the logical structure of the heteronomous imperatives. This distinguishes our contribution from the existing literature, such as the papers of Chejne (1984), Lameer (2014), and Guerrero (1997, 2010, 2014), which do not provide a logical analysis of the deontic concepts put into work by Ibn Ḥazm. The true antecedent to the present paper is the work of Farid Zidani (2007, 2015), who, so far as we know, was the first to undertake such a task. Some of our own developments and general epistemological thoughts go beyond Ibn Ḥazm’s framework and motivations; mainly those contained in sections II.3.2 and IV. However, according to our view, these reflections suggest that Ibn Ḥazm’s approach has the substance for a broader and deeper exploration of the logic of norms. The paper is structured as follows:I.Ibn Ḥazm’s Logic of Heteronomous Imperatives. After presenting some extracts of the relevant text, we proceed by providing a formal reconstruction of the five forms of deontic modalities. II. A Landmark in the History of the Logical Analysis of Norms. Duties and Modalities. In this section, we study the transferences from deontic to modal necessity and possibility. We briefly compare the deontic system of Islamic Jurisprudence with that of Leibniz.III. Leibniz and Hypothetical Imperatives in Law.IV. Beyond Ibn Ḥazm: Conclusions and the Work Ahead. We will conclude the paper by discussing briefly some conceptual points that distinguish the logic of heteronomous imperatives from contemporary deontic logic. Our final words will discuss deontic-modal parallelism in the context of Ibn Ḥazm’s rejection of reasoning by conjecture and what we call “the internalization of nature.”. (shrink)

This paper is an original attempt to understand the foundations of economic reasoning. It endeavors to rigorously define the relationship between subjective interpretations and objective valuations of such interpretations in the context of theoretical economics. This analysis is substantially expanded through a dynamic approach, where the truth of a valuation results in an updated interpretation or changes in the agent's subjective belief regarding the effectiveness of the selected action as well as the objective reality of the effectiveness of all other (...) possible actions (i.e. consequence realization). Complications arise when the economic agent is presented with a set of actions that render ambiguous preference, or when the effectiveness of an action cannot be perceived upon its selection, thereby necessitating a different theory of choice and consequence realization. (shrink)

The proof theory of many-valued systems has not been investigated to an extent comparable to the work done on axiomatizatbility of many-valued logics. Proof theory requires appropriate formalisms, such as sequent calculus, natural deduction, and tableaux for classical (and intuitionistic) logic. One particular method for systematically obtaining calculi for all finite-valued logics was invented independently by several researchers, with slight variations in design and presentation. The main aim of this report is to develop the proof (...) theory of finite-valued first order logics in a general way, and to present some of the more important results in this area. In Systems covered are the resolution calculus, sequent calculus, tableaux, and natural deduction. This report is actually a template, from which all results can be specialized to particular logics. (shrink)

The main thesis of this paper is directed against the traditional (cognitivetheoretical) definition of the concept which claims that the concept is the '' thought about the essence of the object being thought'', i.e. that it is “a set of essential features or essential characteristics of an object''. But the '' set of essential features or essential characteristics of an object of thought'' is a '' content’’ of the thought. The thought about the essence of an object is definition and (...) the concept is not definition but the part of definition! Besides as the part of formal structure of thought, the concept possesses calculative logical properties that in formal logic (be it syllogistics, or the logic of propositions, or the logic of predicates) come to the front place of formal logical computation. Without the calculative properties of the concept, there would be no calculative properties of propositions which express the thought (thought structures). The calculative properties of a concept include the (1) degree of its logical generality (degree of variability), the (2) logical relations it can establish within the whole of the conceptual content, the (3) operability of the concept in structure of affirmation and negation, the (4) deducibility of either axiomatic or probabilistic systems. Therefore, I believe that, from the logical point of view, the definition of a concept should be applied in favor of its calculative properties that it possesses. (shrink)

A general class of labeled sequent calculi is investigated, and necessary and sufficient conditions are given for when such a calculus is sound and complete for a finite -valued logic if the labels are interpreted as sets of truth values. Furthermore, it is shown that any finite -valued logic can be given an axiomatization by such a labeled calculus using arbitrary "systems of signs," i.e., of sets of truth values, as labels. The number of labels needed is logarithmic (...) in the number of truth values, and it is shown that this bound is tight. (shrink)

Łukasiewicz has often been criticized for his motive for inventing his three-valued logic, namely the avoidance of determinism. First of all, I want to show that almost all of the critcism along this line was wrong. Second I will indicate that he made mistakes, however, in constructing his system, because he had other motives at the same time. Finally I will propose some modification of his system and its interpretation which can attain his original purpose in some sense.

Does it make sense to employ modern logical tools for ancient philosophy? This well-known debate2 has been re-launched by the indologist Piotr Balcerowicz, questioning those who want to look at the Eastern school of Jainism with Western glasses. While plainly acknowledging the legitimacy of Balcerowicz's mistrust, the present paper wants to propose a formal reconstruction of one of the well-known parts of the Jaina philosophy, namely: the saptabhangi, i.e. the theory of sevenfold predication. Before arguing for this formalist approach to (...) philosophy, let us return to the reasons to be reluctant at it. (shrink)

I apply Kooi and Tamminga's (2012) idea of correspondence analysis for many-valued logics to strong three-valued logic (K3). First, I characterize each possible single entry in the truth-table of a unary or a binary truth-functional operator that could be added to K3 by a basic inference scheme. Second, I define a class of natural deduction systems on the basis of these characterizing basic inference schemes and a natural deduction system for K3. Third, I show that each of (...) the resulting natural deduction systems is sound and complete with respect to its particular semantics. Among other things, I thus obtain a new proof system for Lukasiewicz's three-valued logic. (shrink)

هو أول كتاب باللغة العربية يعرض لمراحل وآليات تطور المنطق الرمزي المعاصر متعدد القيم بأنساقه المختلفة، مركزًا على مشكلة الغموض المعرفي للإنسان بأبعادها اللغوية والإبستمولوجية والأنطولوجية، والتي تتجلى – على سبيل المثال – فيما تحفل به الدراسات الفلسفية والمنطقية والعلمية من مفارقات تمثل تحديًا قويًا لثنائية الصدق والكذب الكلاسيكية، وكذلك في اكتشاف «هيزنبرج» لمبدأ اللايقين، وتأكيده وعلماء الكمّ على ضرورة التفسيرات الإحصائية في المجال دون الذري، الأمر الذي يؤكد عدم فعالية قانون الثالث المرفوع في التعامل مع معطيات الواقع الفعلي، واستحالة (...) مشروع إقامة لغة مثالية أو اصطناعية أو كاملة منطقيًا تتجاوز عيوب ونقائص اللغة العادية التي نفكر ونتعامل بها. وينتهي الكتاب إلى نتيجة مؤداها أن ما واجهه المنطق الكلاسيكي – ثنائي القيم – من مشكلات أدت إلى تطويره، لاسيما مشكلة الغموض، لابد وأن يواجهه بالمثل المنطق متعدد القيم، ذلك أن الغموض ظاهرة إبستمولوجية في المحل الأول، مردودها إلى الذات العارفة وقصور إمكاناتها الإدراكية والقياسية، لا إلى الوجود ذاته. وأننا حتى لو سمحنا لأية قضية منطقية بقيمة صدق ثالثة، أو بأكثر من قيمة تتوسط بين الصدق التام والكذب التام، فسوف تظل القضية – كتمثيل لغوي لإحدى وقائع العالم – صادقة أو كاذبة، سواء أدركنا ذلك أو لم ندركه، وذلك تأكيد لنزعة أفلاطون الواقعية القائلة بوجود أزلي وثابت للحقائق في عالم المثل، تحول دون معرفتنا الظنية بظلالها في عالم الحس المتغير. ويعني ذلك بعبارة أخرى أن الشك في قانون الثالث المرفوع هو إسقاط من الذات على الموضوع، مبعثه عدم اكتمال العملية المعرفية ومحدوديتها، وأن ظهور الأنساق المنطقية ذات القيم المتعددة ما هو إلا حلقة من حلقات العلاقة الجدلية اللامنتهية بين الإنسان والطبيعة، أو بيم ما هو مُدرك وما هو موجود بالفعل. والكتاب بصفة عامة هو أول كتاب باللغة العربية يعرض لأنساق المنطق متعدد القيم بعد مرحلة البرينكيبيا ماثيماتيكا. (shrink)

Intuitionistic Propositional Logic is proved to be an infinitely many valued logic by Gödel (Kurt Gödel collected works (Volume I) Publications 1929–1936, Oxford University Press, pp 222–225, 1932), and it is proved by Jaśkowski (Actes du Congrés International de Philosophie Scientifique, VI. Philosophie des Mathématiques, Actualités Scientifiques et Industrielles 393:58–61, 1936) to be a countably many valued logic. In this paper, we provide alternative proofs for these theorems by using models of Kripke (J Symbol Logic 24(1):1–14, 1959). Gödel’s (...) proof gave rise to an intermediate propositional logic (between intuitionistic and classical), that is known nowadays as Gödel or the Gödel-Dummett Logic, and is studied by fuzzy logicians as well. We also provide some results on the inter-definability of propositional connectives in this logic. (shrink)

The aim of this paper is to emphasize the fact that for all finitely-many-valued logics there is a completely systematic relation between sequent calculi and tableau systems. More importantly, we show that for both of these systems there are al- ways two dual proof sytems (not just only two ways to interpret the calculi). This phenomenon may easily escape one’s attention since in the classical (two-valued) case the two systems coincide. (In two-valued logic the assignment of (...) a truth value and the exclusion of the opposite truth value describe the same situation.). (shrink)

A uniform construction for sequent calculi for finite-valued first-order logics with distribution quantifiers is exhibited. Completeness, cut-elimination and midsequent theorems are established. As an application, an analog of Herbrand’s theorem for the four-valued knowledge-representation logic of Belnap and Ginsberg is presented. It is indicated how this theorem can be used for reasoning about knowledge bases with incomplete and inconsistent information.

The problem of approximating a propositional calculus is to find many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few tautologies as possible. This has potential applications for representing (computationally complex) logics used in AI by (computationally easy) many-valued logics. It is investigated how far this method can be carried using (1) one or (2) an infinite sequence of many-valued logics. It is shown that (...) the optimal candidate matrices for (1) can be computed from the calculus. (shrink)

This document presents a Gentzen-style deductive calculus and proves that it is complete with respect to a 3-valued semantics for a language with quantifiers. The semantics resembles the strong Kleene semantics with respect to conjunction, disjunction and negation. The completeness proof for the sentential fragment fills in the details of a proof sketched in Arnon Avron (2003). The extension to quantifiers is original but uses standard techniques.

Recently, Bourne constructed a system of three-valued logic that he supposed to replace Łukasiewicz’s three-valued logic in view of the problems of future contingents. In this paper, I will show first that Bourne’s system makes no improvement to Łukasiewicz’s system. However, finding some good motivations and lessons in his attempt, next I will suggest a better way of achieving his original goal in some sense. The crucial part of my way lies in reconsidering the significance of the intermediate (...) truth-value so as to reconstruct Łukasiewicz’s three-valued logic as a kind of extensional modal logic based on partial logic. (shrink)

A construction principle for natural deduction systems for arbitrary, finitely-many-valued first order logics is exhibited. These systems are systematically obtained from sequent calculi, which in turn can be automatically extracted from the truth tables of the logics under consideration. Soundness and cut-free completeness of these sequent calculi translate into soundness, completeness, and normal-form theorems for natural deduction systems.

FDE is a logic that captures relevant entailment between implication-free formulae and admits of an intuitive informational interpretation as a 4-valued logic in which “a computer should think”. However, the logic is co-NP complete, and so an idealized model of how an agent can think. We address this issue by shifting to signed formulae where the signs express imprecise values associated with two distinct bipartitions of the set of standard 4 values. Thus, we present a proof system which consists (...) of linear operational rules and only two branching structural rules, the latter expressing a generalized rule of bivalence. This system naturally leads to defining an infinite hierarchy of tractable depth-bounded approximations to FDE. Namely, approximations in which the number of nested applications of the two branching rules is bounded. (shrink)

Etude de l'extension par la negation semi-intuitionniste de la logique positive des propositions appelee logique C, developpee par A. Urquhart afin de definir une semantique relationnelle valable pour la logique des valeurs infinies de Lukasiewicz (Lw). Evitant les axiomes de contraction et de reduction propres a la logique classique de Dummett, l'A. propose une semantique de type Routley-Meyer pour le systeme d'Urquhart (CI) en tant que celle-la ne fournit que des theories consistantes pour la completude de celui-ci.

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

Formal systems are standardly envisaged in terms of a grammar specifying well-formed formulae together with a set of axioms and rules. Derivations are ordered lists of formulae each of which is either an axiom or is generated from earlier items on the list by means of the rules of the system; the theorems of a formal system are simply those formulae for which there are derivations. Here we outline a set of alternative and explicitly visual ways of envisaging and analyzing (...) at least simple formal systems using fractal patterns of infinite depth. Progressively deeper dimensions of such a fractal can be used to map increasingly complex wffs or increasingly complex 'value spaces', with tautologies, contradictions, and various forms of contingency coded in terms of color. This and related approaches, it turns out, offer not only visually immediate and geometrically intriguing representations of formal systems as a whole but also promising formal links (1) between standard systems and classical patterns in fractal geometry, (2) between quite different kinds of value spaces in classical and infinite-valued logics, and (3) between cellular automata and logic. It is hoped that pattern analysis of this kind may open possibilities for a geometrical approach to further questions within logic and metalogic. (shrink)

The thesis that the two-valued system of classical logic is insufficient to explanation the various intermediate situations in the entity, has led to the development of many-valued and fuzzy logic systems. These systems suggest that this limitation is incorrect. They oppose the law of excluded middle (tertium non datur) which is one of the basic principles of classical logic, and even principle of non-contradiction and argue that is not an obstacle for things both to exist and to not (...) exist at the same time. However, contrary to these claims, there is no inadequacy in the two-valued system of classical logic in explanation the intermediate situations in existence. The law of exclusion and the intermediate situations in the external world are separate things. The law of excluded middle has been inevitably accepted by other logic systems which are considered to reject this principle. The many-valued and the fuzzy logic systems do not transcend the classical logic. Misconceptions from incomplete information and incomplete research are effective in these criticisms. In addition, it is also effective to move the discussion about the intellectual conception (tasawwur) into the field of judgmental assent (tasdiq) and confusion of the mawhum (imaginable) with the ma‘kûl (intellegible). (shrink)

In this paper we re-assess the philosophical foundation of Exactly True Logic ($$\mathcal {ET\!L}$$ ET L ), a competing variant of First Degree Entailment ($$\mathcal {FDE}$$ FDE ). In order to do this, we first rebut an argument against it. As the argument appears in an interview with Nuel Belnap himself, one of the fathers of $$\mathcal {FDE}$$ FDE, we believe its provenance to be such that it needs to be taken seriously. We submit, however, that the argument ultimately fails, (...) and that $$\mathcal {ET\!L}$$ ET L cannot easily be dismissed. We then proceed to give an overview of the research that was inspired by this logic over the last decade, thus providing further motivation for the study of $$\mathcal {ET\!L}$$ ET L and, more generally, of $$\mathcal {FDE}$$ FDE -related logics that result from semantical analyses alternative to Belnap’s canonical one. We focus, in particular, on philosophical questions that these developments raise. (shrink)