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)

Among recent objections to Pascal's Wager, two are especially compelling. The first is that decision theory, and specifically the requirement of maximizing expected utility, is incompatible with infinite utility values. The second is that even if infinite utility values are admitted, the argument of the Wager is invalid provided that we allow mixed strategies. Furthermore, Hájek has shown that reformulations of Pascal's Wager that address these criticisms inevitably lead to arguments that are philosophically unsatisfying and historically unfaithful. Both (...) the objections and Hájek's philosophical worries disappear, however, if we represent our preferences using relative utilities rather than a one-place utility function. Relative utilities provide a conservative way to make sense of infinite value that preserves the familiar equation of rationality with the maximization of expected utility. They also provide a means of investigating a broader class of problems related to the Wager. (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 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)

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)

Supererogatory acts are those that lie “beyond the call of duty.” There are two standard ways to define this idea more precisely. Although the definitions are often seen as equivalent, I argue that they can diverge when options are infinite, or when there are cycles of better options; moreover, each definition is acceptable in only one case. I consider two ways out of this dilemma.

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)

The purpose of this paper is to open for investigation a range of phenomena familiar from dynamical systems or chaos theory which appear in a simple fuzzy logic with the introduction of self-reference. Within that logic, self-referential sentences exhibit properties of fixed point attractors, fixed point repellers, and full chaos on the [0, 1] interval. Strange attractors and fractals appear in two dimensions in the graphing of pairs of mutually referential sentences and appear in three dimensions in the graphing of (...) mutually referential triples. (shrink)

Any intermediate propositional logic can be extended to a calculus with epsilon- and tau-operators and critical formulas. For classical logic, this results in Hilbert’s $\varepsilon $ -calculus. The first and second $\varepsilon $ -theorems for classical logic establish conservativity of the $\varepsilon $ -calculus over its classical base logic. It is well known that the second $\varepsilon $ -theorem fails for the intuitionistic $\varepsilon $ -calculus, as prenexation is impossible. The paper investigates the effect of adding critical $\varepsilon $ - (...) and $\tau $ -formulas and using the translation of quantifiers into $\varepsilon $ - and $\tau $ -terms to intermediate logics. It is shown that conservativity over the propositional base logic also holds for such intermediate ${\varepsilon \tau }$ -calculi. The “extended” first $\varepsilon $ -theorem holds if the base logic is finite-valued Gödel–Dummett logic, and fails otherwise, but holds for certain provable formulas in infinite-valued Gödel logic. The second $\varepsilon $ -theorem also holds for finite-valued first-order Gödel logics. The methods used to prove the extended first $\varepsilon $ -theorem for infinite-valued Gödel logic suggest applications to theories of arithmetic. (shrink)

Entailment in propositional Gödel logics can be defined in a natural way. While all infinite sets of truth values yield the same sets of tautologies, the entailment relations differ. It is shown that there is a rich structure of infinite-valued Gödel logics, only one of which is compact. It is also shown that the compact infinite-valued Gödel logic is the only one which interpolates, and the only one with an r.e. entailment relation.

Quantum information is discussed as the universal substance of the world. It is interpreted as that generalization of classical information, which includes both finite and transfinite ordinal numbers. On the other hand, any wave function and thus any state of any quantum system is just one value of quantum information. Information and its generalization as quantum information are considered as quantities of elementary choices. Their units are correspondingly a bit and a qubit. The course of time is what generates choices (...) by itself, thus quantum information and any item in the world in final analysis. The course of time generates necessarily choices so: The future is absolutely unorderable in principle while the past is always well-ordered and thus unchangeable. The present as the mediation between them needs the well-ordered theorem equivalent to the axiom of choice. The latter guarantees the choice even among the elements of an infinite set, which is the case of quantum information. The concrete and abstract objects share information as their common base, which is quantum as to the formers and classical as to the latters. The general quantities of matter in physics, mass and energy can be considered as particular cases of quantum information. The link between choice and abstraction in set theory allows of “Hume’s principle” to be interpreted in terms of quantum mechanics as equivalence of “many” and “much” underlying quantum information. Quantum information as the universal substance of the world calls for the unity of physics and mathematics rather than that of the concrete and abstract objects and thus for a form of quantum neo-Pythagoreanism in final analysis. (shrink)

It is shown that the infinite-valued first-order Gödel logic G° based on the set of truth values {1/k: k ε w {0}} U {0} is not r.e. The logic G° is the same as that obtained from the Kripke semantics for first-order intuitionistic logic with constant domains and where the order structure of the model is linear. From this, the unaxiomatizability of Kröger's temporal logic of programs (even of the fragment without the nexttime operator O) and of the (...) authors' temporal logic of linear discrete time with gaps follows. (shrink)

A common argument for atheism runs as follows: God would not create a world worse than other worlds he could have created instead. However, if God exists, he could have created a better world than this one. Therefore, God does not exist. In this paper I challenge the second premise of this argument. I argue that if God exists, our world will continue without end, with God continuing to create value-bearers, and sustaining and perfecting the value-bearers he has already created. (...) Given this, if God exists, our world—considered on the whole—is infinitely valuable. I further contend that this theistic picture makes our world's value unsurpassable. In support of this contention, I consider proposals for how infinitely valuable worlds might be improved upon, focusing on two main ways—adding value-bearers and increasing the value in present value-bearers. I argue that neither of these can improve our world. Depending on how each method is understood, either it would not improve our world, or our world is unsurpassable with respect to it. I conclude by considering the implications of my argument for the problem of evil more generally conceived. (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.

In ancient philosophy, there is no discipline called “logic” in the contemporary sense of “the study of formally valid arguments.” Rather, once a subfield of philosophy comes to be called “logic,” namely in Hellenistic philosophy, the field includes (among other things) epistemology, normative epistemology, philosophy of language, the theory of truth, and what we call logic today. This entry aims to examine ancient theorizing that makes contact with the contemporary conception. Thus, we will here emphasize the theories of the “syllogism” (...) in the Aristotelian and Stoic traditions. However, because the context in which these theories were developed and discussed were deeply epistemological in nature, we will also include references to the areas of epistemological theorizing that bear directly on theories of the syllogism, particularly concerning “demonstration.” Similarly, we will include literature that discusses the principles governing logic and the components that make up arguments, which are topics that might now fall under the headings of philosophy of logic or non-classical logic. This includes discussions of problems and paradoxes that connect to contemporary logic and which historically spurred developments of logical method. For example, there is great interest among ancient philosophers in the question of whether all statements have truth-values. Relevant themes here include future contingents, paradoxes of vagueness, and semantic paradoxes like the liar. We also include discussion of the paradoxes of the infinite for similar reasons, since solutions have introduced sophisticated tools of logical analysis and there are a range of related, modern philosophical concerns about the application of some logical principles in infinite domains. Our criterion excludes, however, many of the themes that Hellenistic philosophers consider part of logic, in particular, it excludes epistemology and metaphysical questions about truth. Ancient philosophers do not write treatises “On Logic,” where the topic would be what today counts as logic. Instead, arguments and theories that count as “logic” by our criterion are found in a wide range of texts. For the most part, our entry follows chronology, tracing ancient logic from its beginnings to Late Antiquity. However, some themes are discussed in several eras of ancient logic; ancient logicians engage closely with each other’s views. Accordingly, relevant publications address several authors and periods in conjunction. These contributions are listed in three thematic sections at the end of our entry. (shrink)

This study is basically an investigation into the probabilities of place and how such probabilities affect concepts and propositions as they travel through time. I develop the concept of time as a place and argue that time is an infinite phenomenon, which is neither fixed, static, monolithic nor objective. I show that when concepts cross ontological jurisdictions they loss their truth-values because their formative meanings are radicalized by the time zone through which they travelled. The dynamicism of time itself (...) implies that concepts should not be employed in absolute sense at any circumstance. Truth-value is a travelling concept. As a travelling concept it is historical – it depends on what happened. What this demonstrates is that the determinant of truth-value of a concept or proposition is not merely the rules of logic but time constellations. I have demonstrated this in the context of intercultural philosophy by showing the pitfalls that should be avoided when one deals with concepts that travel through time. Truth is a continuous rather than a discreet variable. (shrink)

Some environmental ethicists and economists argue that attributing infinite value to the environment is a good way to represent an absolute obligation to protect it. Others argue against modelling the value of the environment in this way: the assignment of infinite value leads to immense technical and philosophical difficulties that undermine the environmentalist project. First, there is a problem of discrimination: saving a large region of habitat is better than saving a small region; yet if both outcomes have (...) infinite value, then decision theory prescribes indifference. Second, there is a problem of swamping probabilities: an act with a small but positive probability of saving an endangered species appears to be on par with an act that has a high probability of achieving this outcome, since both have infinite expected value. Our paper shows that a relative concept of infinite value can be meaningfully defined, and provides a good model for securing the priority of the natural environment while avoiding the failures noted by sceptics about infinite value. Our claim is not that the relative infinity utility model gets every detail correct, but rather that it provides a rigorous philosophical framework for thinking about decisions affecting the environment. (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)

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.

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)

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)

A theory of truth is usually demanded to be consistent, but -consistency is less frequently requested. Recently, Yatabe has argued in favour of -inconsistent first-order theories of truth, minimising their odd consequences. In view of this fact, in this paper, we present five arguments against -inconsistent theories of truth. In order to bring out this point, we will focus on two very well-known -inconsistent theories of truth: the classical theory of symmetric truth FS and the non-classical theory of naïve truth (...) based on ᴌukasiewicz infinitely valued logic: PAᴌT. (shrink)

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

The dissertation has two parts, each dealing with a problem, namely: 1) What is the most adequate account of fuzziness -the so-called phenomenon of vagueness?, and 2) what is the most plausible solution to the sorites, or heap paradox? I will try to show that fuzzy properties are those which are gradual, amenable to be possessed in a greater or smaller extent. Acknowledgement of degrees in the instantiation of a property allows for a gradual transition from one opposite to the (...) other, each intermediate stage constituting an overlap in certain proportion of both contraries. Hence, degrees in the possession of a property give rise to simple contradictions. The reason why I have chosen those two questions is that they provide the main philosophical motivation for a particular brand of an infinite valued and paraconsistent logic. I will claim that Classical logic (CL) is not adequate to handle fuzzy situations, and, being deficient, is in need of being expanded to make room for degrees of truth and weak contradictions. One can hardly deny the importance of the debate, since what is ultimately at stake is what the limits of truth, rationality, intelligibility and possibility are. The main disciplines within which the research moves are the philosophy of language, philosophy of logic, and ontology. (shrink)

The dissertation has two parts, each dealing with a problem, namely: 1) What is the most adequate account of fuzziness -the so-called phenomenon of vagueness?, and 2) what is the most plausible solution to the sorites, or heap paradox? I will try to show that fuzzy properties are those which are gradual, amenable to be possessed in a greater or smaller extent. Acknowledgement of degrees in the instantiation of a property allows for a gradual transition from one opposite to the (...) other, each intermediate stage constituting an overlap in certain proportion of both contraries. Hence, degrees in the possession of a property give rise to simple contradictions. The reason why I have chosen those two questions is that they provide the main philosophical motivation for a particular brand of an infinite valued and paraconsistent logic. I will claim that Classical logic (CL) is not adequate to handle fuzzy situations, and, being deficient, is in need of being expanded to make room for degrees of truth and weak contradictions. One can hardly deny the importance of the debate, since what is ultimately at stake is what the limits of truth, rationality, intelligibility and possibility are. The main disciplines within which the research moves are the philosophy of language, philosophy of logic, and ontology. (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)

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

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.

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.

The infinite judgement has long been forgotten and yet, as I am about to demonstrate, it may be urgent to revive it for its critical and productive potential. An infinite judgement is neither analytic nor synthetic; it does not produce logical truths, nor true representations, but it establishes the genetic conditions of real objects and the concepts appropriate to them. It is through infinite judgements that we reach the principle of transcendental logic, in the depths of which (...) all reality can emerge in its material and sensible singularity, making possible all generalization and formal abstraction. (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.

I argue against the skeptical epistemological view exemplified by the Groarkes that “all theories of informal argument must face the regress problem.” It is true that in our theoretical representations of reasoning, infinite regresses of self-justification regularly and inadvertently arise with respect to each of the RSA criteria for argument cogency (the premises are to be relevant, sufficient, and acceptable). But they arise needlessly, by confusing an RSA criterion with argument content, usually premise material.

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)

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

Propositional logics in general, considered as a set of sentences, can be undecidable even if they have “nice” representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already intuitionistic logic is PSPACE-complete). On the other hand, finite-valued logics are computationally relatively simple—at worst NP. Moreover, finite-valued semantics are simple, and general methods for theorem proving exist. This raises the question to what extent and under what circumstances propositional (...) class='Hi'>logics represented in various ways can be approximated by finite-valued logics. It is shown that the minimal m-valued logic for which a given calculus is strongly sound can be calculated. It is also investigated under which conditions propositional logics can be characterized as the intersection of (effectively given) sequences of finite-valued logics. (shrink)

In this paper, I consider a family of three-valued regular logics: the well-known strong and weak S.C. Kleene’s logics and two intermedi- ate logics, where one was discovered by M. Fitting and the other one by E. Komendantskaya. All these systems were originally presented in the semantical way and based on the theory of recursion. However, the proof theory of them still is not fully developed. Thus, natural deduction sys- tems are built only for strong Kleene’s (...) logic both with one (A. Urquhart, G. Priest, A. Tamminga) and two designated values (G. Priest, B. Kooi, A. Tamminga). The purpose of this paper is to provide natural deduction systems for weak and intermediate regular logics both with one and two designated values. (shrink)

Given a three-valued definition of validity, which choice of three-valued truth tables for the connectives can ensure that the resulting logic coincides exactly with classical logic? We give an answer to this question for the five monotonic consequence relations $st$, $ss$, $tt$, $ss\cap tt$, and $ts$, when the connectives are negation, conjunction, and disjunction. For $ts$ and $ss\cap tt$ the answer is trivial (no scheme works), and for $ss$ and $tt$ it is straightforward (they are the collapsible schemes, (...) in which the middle value acts like one of the classical values). For $st$, the schemes in question are the Boolean normal schemes that are either monotonic or collapsible. (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)

For aggregative theories of moral value, it is a challenge to rank worlds that each contain infinitely many valuable events. And, although there are several existing proposals for doing so, few provide a cardinal measure of each world's value. This raises the even greater challenge of ranking lotteries over such worlds—without a cardinal value for each world, we cannot apply expected value theory. How then can we compare such lotteries? To date, we have just one method for doing so (proposed (...) separately by Arntzenius, Bostrom, and Meacham), which is to compare the prospects for value at each individual location, and to then represent and compare lotteries by their expected values at each of those locations. But, as I show here, this approach violates several key principles of decision theory and generates some implausible verdicts. I propose an alternative—one which delivers plausible rankings of lotteries, which is implied by a plausible collection of axioms, and which can be applied alongside almost any ranking of infinite worlds. (shrink)

A theory of truth is introduced for a first--order language L of set theory. Fully interpreted metalanguages which contain their truth predicates are constructed for L. The presented theory is free from infinite regress, whence it provides a proper framework to study the regress problem. Only ZF set theory, concepts definable in L and classical two-valued logic are used.

In this paper paraconsistent first-order logic LP^{#} with infinite hierarchy levels of contradiction is proposed. Corresponding paraconsistent set theory KSth^{#} is discussed.Axiomatical system HST^{#}as paraconsistent generalization of Hrbacek set theory HST is considered.

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)

This article argues that Nietzsche's transvaluation project refers not to a mere inversion or negation of a set of values but, instead, to a different conception of what a value is and how it functions. Traditional values function within a standard logical framework and claim legitimacy and bindingness based on exogenous authority with absolute extension. Nietzsche regards this framework as unnecessarily reductive in its attempted exclusion of contradiction and real opposition among competing values and proposes a nonstandard, dialetheic model of (...) valuation. (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)