FDE, LP and K3 are closely related to each other and admit of an intuitive informational interpretation. However, all these logics are co-NP complete, and so idealized models of how an agent can think. We address this issue by shifting to signed formulae, where the signs express imprecise values associated with two bipartitions of the corresponding set of standard values. We present proof systems whose operational rules are all linear and have only two structural branching rules that express a generalized (...) Principle of Bivalence. Each of these systems leads to defining an infinite hierarchy of tractable approximations to the respective logic, in terms of the maximum number of allowed nested applications of the two branching rules. Further, each resulting hierarchy admits of an intuitive 5-valued non-deterministic semantics. (shrink)

The depth-bounded approach seeks to provide realistic models of reasoners. Recognizing that most useful logics are idealizations in that they are either undecidable or likely to be intractable, the approach accounts for how they can be approximated in practice by resource-bounded agents. The approach has been applied to Classical Propositional Logic (CPL), yielding a hierarchy of tractable depth-bounded approximations to that logic, which in turn has been based on a KE/KI system. -/- This Thesis shows that the approach can be (...) naturally extended to useful nonclassical logics such as First-Degree Entailment (FDE), the Logic of Paradox (LP), Strong Kleene Logic (K3 ) and Intuitionistic Propositional Logic (IPL). To do this, we introduce a KE/KI-style system for each of those logics such that: is formulated via signed formulae, consist of linear operational rules and branching structural rule(s), can be used as a direct-proof and a refutation method, and is interesting independently of the approach in that it has an exponential speed-up on its tableau system counterpart. The latter given that we introduce a new class of examples which we prove to be hard for all tableau systems sharing the V/& rules with the classical one, but easy for their analogous KE-style systems. Then we focus on showing that each of our KE/KI-style systems naturally yields a hierarchy of tractable depth-bounded approximations to the respective logic, in terms of the maximum number of allowed nested applications of the branching rule(s). The rule(s) express(es) a generalized rule of bivalence, is (are) essentially cut rule(s) and govern(s) the manipulation of virtual information, which is information that an agent does not hold but she temporarily assumes as if she held it. Intuitively, the more virtual information needs to be invoked via the branching rule(s), the harder the inference is for the agent. So, the nested application the branching rule(s) provides a sensible measure of inferential depth. We also show that each hierarchy approximating FDE, LP, and K3 , admits of a 5-valued non-deterministic semantics; whereas, paving the way for a semantical characterization of the hierarchy approximating IPL, we provide a 3-valued non-deterministic semantics for the full logic that fixes the meaning of the connectives without appealing to “structural” conditions. -/- Moreover, we show a super-polynomial lower bound for the strongest possible version of clausal tableaux on the well-known class of “truly fat” expressions (which are easy for KE), settling a problem left open in the literature. Further, we investigate a hierarchy of tractable depth-bounded approximations to CPL based only on KE. Finally, we propose a refinement of the p-simulation relation which is adequate to establish positive results about the superiority of a system over another with respect to proof-search. (shrink)

Graham Priest has formulated the minimally inconsistent logic of paradox (MiLP), which is paraconsistent like Priest’s logic of paradox (LP), while staying closer to classical logic. We present logics that stand to (the propositional fragments of) strong Kleene logic (K3) and the logic of first-degree entailment (FDE) as MiLP stands to LP. That is, our logics share the paracomplete and the paraconsistent-cum-paracomplete nature of K3 and FDE, respectively, while keeping these features to a minimum in order to stay closer to (...) classical logic. We give semantic and sequent-calculus formulations of these logics, and we highlight some reasons why these logics may be interesting in their own right. (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)

Building on recent work, I present sequent systems for the non-classical logics LP, K3, and FDE with two main virtues. First, derivations closely resemble those in standard Gentzen-style systems. Second, the systems can be obtained by reformulating a classical system using nonstandard sequent structure and simply removing certain structural rules (relatives of exchange and contraction). I clarify two senses in which these logics count as “substructural.”.

Dugundji proved in 1940 that most parts of standard modal systems cannot be characterized by a single finite deterministic matrix. In the eighties, Ivlev proposed a semantics of four-valued non-deterministic matrices (which he called quasi-matrices), in order to characterize a hierarchy of weak modal logics without the necessitation rule. In a previous paper, we extended some systems of Ivlev’s hierarchy, also proposing weaker six-valued systems in which the (T) axiom was replaced by the deontic (D) axiom. In (...) this paper, we propose even weaker systems, by eliminating both axioms, which are characterized by eight-valued non-deterministic matrices. In addition, we prove completeness for those new systems. It is natural to ask if a characterization by finite ordinary (deterministic) logical matrices would be possible for all those Ivlev-like systems. We will show that finite deterministic matrices do not characterize any of them. (shrink)

The Knower paradox purports to place surprising a priori limitations on what we can know. According to orthodoxy, it shows that we need to abandon one of three plausible and widely-held ideas: that knowledge is factive, that we can know that knowledge is factive, and that we can use logical/mathematical reasoning to extend our knowledge via very weak single-premise closure principles. I argue that classical logic, not any of these epistemic principles, is the culprit. I develop a consistent theory validating (...) all these principles by combining Hartry Field's theory of truth with a modal enrichment developed for a different purpose by Michael Caie. The only casualty is classical logic: the theory avoids paradox by using a weaker-than-classical K3 logic. I then assess the philosophical merits of this approach. I argue that, unlike the traditional semantic paradoxes involving extensional notions like truth, its plausibility depends on the way in which sentences are referred to--whether in natural languages via direct sentential reference, or in mathematical theories via indirect sentential reference by Gödel coding. In particular, I argue that from the perspective of natural language, my non-classical treatment of knowledge as a predicate is plausible, while from the perspective of mathematical theories, its plausibility depends on unresolved questions about the limits of our idealized deductive capacities. (shrink)

In 1988, J. Ivlev proposed some (non-normal) modal systems which are semantically characterized by four-valued non-deterministic matrices in the sense of A. Avron and I. Lev. Swap structures are multialgebras (a.k.a. hyperalgebras) of a special kind, which were introduced in 2016 by W. Carnielli and M. Coniglio in order to give a non-deterministic semantical account for several paraconsistent logics known as logics of formal inconsistency, which are not algebraizable by means of the standard techniques. Each swap structure induces (...) naturally a non-deterministic matrix. The aim of this paper is to obtain a swap structures semantics for some Ivlev-like modal systems proposed in 2015 by M. Coniglio, L. Fariñas del Cerro and N. Peron. Completeness results will be stated by means of the notion of Lindenbaum–Tarski swap structures, which constitute a natural generalization to multialgebras of the concept of Lindenbaum–Tarski algebras. (shrink)

Deductive inference is usually regarded as being “tautological” or “analytical”: the information conveyed by the conclusion is contained in the information conveyed by the premises. This idea, however, clashes with the undecidability of first-order logic and with the (likely) intractability of Boolean logic. In this article, we address the problem both from the semantic and the proof-theoretical point of view. We propose a hierarchy of propositional logics that are all tractable (i.e. decidable in polynomial time), although by means of growing (...) computational resources, and converge towards classical propositional logic. The underlying claim is that this hierarchy can be used to represent increasing levels of “depth” or “informativeness” of Boolean reasoning. Special attention is paid to the most basic logic in this hierarchy, the pure “intelim logic”, which satisfies all the requirements of a natural deduction system (allowing both introduction and elimination rules for each logical operator) while admitting of a feasible (quadratic) decision procedure. We argue that this logic is “analytic” in a particularly strict sense, in that it rules out any use of “virtual information”, which is chiefly responsible for the combinatorial explosion of standard classical systems. As a result, analyticity and tractability are reconciled and growing degrees of computational complexity are associated with the depth at which the use of virtual information is allowed. (shrink)

ABSTRACT: This 1974 paper builds on our 1969 paper (Corcoran-Weaver [2]). Here we present three (modal, sentential) logics which may be thought of as partial systematizations of the semantic and deductive properties of a sentence operator which expresses certain kinds of necessity. The logical truths [sc. tautologies] of these three logics coincide with one another and with those of standard formalizations of Lewis's S5. These logics, when regarded as logistic systems (cf. Corcoran [1], p. 154), are seen to be equivalent; (...) but, when regarded as consequence systems (ibid., p. 157), one diverges from the others in a fashion which suggests that two standard measures of semantic complexity may not be as closely linked as previously thought. -/- This 1974 paper uses the linear notation for natural deduction presented in [2]: each two-dimensional deduction is represented by a unique one-dimensional string of characters. Thus obviating need for two-dimensional trees, tableaux, lists, and the like—thereby facilitating electronic communication of natural deductions. The 1969 paper presents a (modal, sentential) logic which may be thought of as a partial systematization of the semantic and deductive properties of a sentence operator which expresses certain kinds of necessity. The logical truths [sc. tautologies] of this logic coincides those of standard formalizations of Lewis’s S4. Among the paper's innovations is its treatment of modal logic in the setting of natural deduction systems--as opposed to axiomatic systems. The author’s apologize for the now obsolete terminology. For example, these papers speak of “a proof of a sentence from a set of premises” where today “a deduction of a sentence from a set of premises” would be preferable. 1. Corcoran, John. 1969. Three Logical Theories, Philosophy of Science 36, 153–77. J P R -/- 2. Corcoran, John and George Weaver. 1969. Logical Consequence in Modal Logic: Natural Deduction in S5 Notre Dame Journal of Formal Logic 10, 370–84. MR0249278 (40 #2524). 3. Weaver, George and John Corcoran. 1974. Logical Consequence in Modal Logic: Some Semantic Systems for S4, Notre Dame Journal of Formal Logic 15, 370–78. MR0351765 (50 #4253). (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)

PLEASE NOTE: This is the corrected 2nd eBook edition, 2021. ●●●●● _Critique of Impure Reason_ has now also been published in a printed edition. To reduce the otherwise high price of this scholarly, technical book of nearly 900 pages and make it more widely available beyond university libraries to individual readers, the non-profit publisher and the author have agreed to issue the printed edition at cost. ●●●●● The printed edition was released on September 1, 2021 and is now available through (...) all booksellers, including Barnes & Noble, Amazon, and brick-and-mortar bookstores under ISBN 978-0-578-88646-6. ●●●●● In light of the length of this book, readers who would like to have a more detailed description of the book's objectives and method may find it helpful to read the detailed and clearly written Wikipedia entry about this work: From the Wikipedia search page, use the search phrase "Critique of Impure Reason". At least at the time of this writing (11/29/2021), the Wikipedia entry is well-researched and accurate. ●●●●● In addition, a "Primer on Bartlett's CRITIQUE OF IMPURE REASON" has been made available by the author. It is available under its title through PhilPapers and other philosophy online archives. ●●●●● COMMENDATIONS OF THIS WORK, from the back cover of the published edition: ●●●●● “I admire its range of philosophical vision.” – Nicholas Rescher, Distinguished University Professor of Philosophy, University of Pittsburgh, author of more than 100 books. ●●●●● “Bartlett’s _Critique of Impure Reason_ is an impressive, bold, and ambitious work. Careful scholarship is balanced by original analyses that lead the reader to recognize the limits of meaning, knowledge, and conceptual possibility. The work addresses a host of traditional philosophical problems, among them the nature of space, time, causality, consciousness, the self, other minds, ontology, free will and determinism, and others. The book culminates in a fascinating and profound new understanding of relativity physics and quantum theory.” – Gerhard Preyer, Professor of Philosophy, Goethe-University, Frankfurt am Main, Germany, author of many books including _Concepts of Meaning_, _Beyond Semantics and Pragmatics_, _Intention and Practical Thought_, and _Contextualism in Philosophy_. ●●●●● “[This work’s] goal is of a unique and difficult species: Dr. Bartlett seeks to develop a formal logical calculus on the basis of transcendental philosophical arguments; in fact, he hopes that this calculus will be the formal expression of the transcendental foundation of knowledge.... I consider Dr. Bartlett’s work soundly conceived and executed with great skill.” – C. F. von Weizsäcker, philosopher and physicist, former Director, Max-Planck-Institute, Starnberg, Germany. ●●●●● “Bartlett has written an American “Prolegomena to All Future Metaphysics.” He aims rigorously to eliminate meaningless assertions, reach bedrock, and place philosophy on a firm foundation that will enable it, like science and mathematics, to produce lasting results that generations to come can build on. This is a great book, the fruit of a lifetime of research and reflection, and it deserves serious attention.” — Martin X. Moleski, former Professor, Canisius College, Buffalo, NY, studies of scientific method, the presuppositions of thought, and the self-referential nature of epistemology. ●●●●● “Bartlett has written a book on what might be called the underpinnings of philosophy. It has fascinating depth and breadth, and is all the more striking due to its unifying perspective based on the concepts of reference and self-reference.” – Don Perlis, Professor of Computer Science, University of Maryland, author of numerous publications on self-adjusting autonomous systems and philosophical issues concerning self-reference, mind, and consciousness. ●●●●● ●●●●● The _Critique of Impure Reason: Horizons of Possibility and Meaning_ comprises a major and important contribution to philosophy. Thanks to the generosity of its publisher, this massive 885-page volume has been published as a free open access eBook (3.75MB) as well as an open access printed edition. It inaugurates a revolutionary paradigm shift in philosophical thought by providing compelling and long-sought-for solutions to a wide range of philosophical problems. In the process, the work fundamentally transforms the way in which the concepts of reference, meaning, and possibility are understood. The book includes a Foreword by the celebrated German philosopher and physicist Carl Friedrich von Weizsäcker. ●●●●● In Kant’s _Critique of Pure Reason_ we find an analysis of the preconditions of experience and of knowledge. In contrast, but yet in parallel, the new _Critique_ focuses upon the ways—unfortunately very widespread and often unselfconsciously habitual—in which many of the concepts that we employ _conflict_ with the very preconditions of meaning and of knowledge. ●●●●● This is a book about the boundaries of frameworks and about the unrecognized conceptual confusions in which we become entangled when we attempt to transgress beyond the limits of the possible and meaningful. We tend either not to recognize or not to accept that we all-too-often attempt to trespass beyond the boundaries of the frameworks that make knowledge possible and the world meaningful. ●●●●● The _Critique of Impure Reason_ proposes a bold, ground-breaking, and startling thesis: that a great many of the major philosophical problems of the past can be solved through the recognition of a viciously deceptive form of thinking to which philosophers as well as non-philosophers commonly fall victim. For the first time, the book advances and justifies the criticism that a substantial number of the questions that have occupied philosophers fall into the category of “impure reason,” violating the very conditions of their possible meaningfulness. ●●●●● The purpose of the study is twofold: first, to enable us to recognize the boundaries of what is referentially forbidden—the limits beyond which reference becomes meaningless—and second, to avoid falling victims to a certain broad class of conceptual confusions that lie at the heart of many major philosophical problems. As a consequence, the boundaries of _possible meaning_ are determined. ●●●●● Bartlett, the author or editor of more than 20 books, is responsible for identifying this widespread and delusion-inducing variety of error, _metalogical projection_. It is a previously unrecognized and insidious form of erroneous thinking that undermines its own possibility of meaning. It comes about as a result of the pervasive human compulsion to seek to transcend the limits of possible reference and meaning. ●●●●● Based on original research and rigorous analysis combined with extensive scholarship, the _Critique of Impure Reason_ develops a self-validating method that makes it possible to recognize, correct, and eliminate this major and pervasive form of fallacious thinking. In so doing, the book provides at last provable and constructive solutions to a wide range of major philosophical problems. ●●●●● CONTENTS AT A GLANCE ▪▪▪▪▪ Preface ▪▪▪▪▪ Foreword by Carl Friedrich von Weizsäcker ▪▪▪▪▪ Acknowledgments ▪▪▪▪▪ Avant-propos: A philosopher’s rallying call ▪▪▪▪▪ Introduction ▪▪▪▪▪ A note to the reader ▪▪▪▪▪ A note on conventions ▪▪▪▪▪ ▪▪▪▪▪ ▪▪▪▪▪ PART I ▪▪▪▪▪ ▪▪▪▪▪ WHY PHILOSOPHY HAS MADE NO PROGRESS AND HOW IT CAN ▪▪▪▪▪ 1 Philosophical-psychological prelude ▪▪▪▪▪ 2 Putting belief in its place: Its psychology and a needed polemic ▪▪▪▪▪ 3 Turning away from the linguistic turn: From theory of reference to metalogic of reference ▪▪▪▪▪ 4 The stepladder to maximum theoretical generality ▪▪▪▪▪ ▪▪▪▪▪ ▪▪▪▪▪ PART II ▪▪▪▪▪ THE METALOGIC OF REFERENCE ▪▪▪▪▪ A New Approach to Deductive, Transcendental Philosophy ▪▪▪▪▪ 5 Reference, identity, and identification ▪▪▪▪▪ 6 Self-referential argument and the metalogic of reference ▪▪▪▪▪ 7 Possibility theory ▪▪▪▪▪ 8 Presupposition logic, reference, and identification ▪▪▪▪▪ 9 Transcendental argumentation and the metalogic of reference ▪▪▪▪▪ 10 Framework relativity ▪▪▪▪▪ 11 The metalogic of meaning ▪▪▪▪▪ 12 The problem of putative meaning and the logic of meaninglessness ▪▪▪▪▪ 13 Projection ▪▪▪▪▪ 14 Horizons ▪▪▪▪▪ 15 De-projection ▪▪▪▪▪ 16 Self-validation ▪▪▪▪▪ 17 Rationality: Rules of admissibility ▪▪▪▪▪ ▪▪▪▪▪ ▪▪▪▪▪ PART III ▪▪▪▪▪ PHILOSOPHICAL APPLICATIONS OF THE METALOGIC OF REFERENCE ▪▪▪▪▪ Major Problems and Questions of Philosophy and the Philosophy of Science ▪▪▪▪▪ 18 Ontology and the metalogic of reference ▪▪▪▪▪ 19 Discovery or invention in general problem-solving, mathematics, and physics ▪▪▪▪▪ 20 The conceptually unreachable: “The far side” ▪▪▪▪▪ 21 The projections of the external world, things-in-themselves, other minds, realism, and idealism ▪▪▪▪▪ 22 The projections of time, space, and space-time ▪▪▪▪▪ 23 The projections of causality, determinism, and free will ▪▪▪▪▪ 24 Projections of the self and of solipsism ▪▪▪▪▪ 25 Non-relational, agentless reference and referential fields ▪▪▪▪▪ 26 Relativity physics as seen through the lens of the metalogic of reference ▪▪▪▪▪ 27 Quantum theory as seen through the lens of the metalogic of reference ▪▪▪▪▪ 28 Epistemological lessons learned from and applicable to relativity physics and quantum theory ▪▪▪▪▪ ▪▪▪▪▪ PART IV ▪▪▪▪▪ HORIZONS ▪▪▪▪▪ 29 Beyond belief ▪▪▪▪▪ 30 _Critique of Impure Reason_: Its results in retrospect ▪▪▪▪▪ ▪▪▪▪▪ SUPPLEMENT ▪▪▪▪▪ The Formal Structure of the Metalogic of Reference ▪▪▪▪▪ APPENDIX I ▪▪▪▪▪ The Concept of Horizon in the Work of Other Philosophers ▪▪▪▪▪ APPENDIX II ▪▪▪▪▪ Epistemological Intelligence ▪▪▪▪▪ References ▪▪▪▪▪ Index ▪▪▪▪▪ About the author. (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)

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)

A graph-theoretic account of fibring of logics is developed, capitalizing on the interleaving characteristics of fibring at the linguistic, semantic and proof levels. Fibring of two signatures is seen as a multi-graph (m-graph) where the nodes and the m-edges include the sorts and the constructors of the signatures at hand. Fibring of two models is a multi-graph (m-graph) where the nodes and the m-edges are the values and the operations in the models, respectively. Fibring of two deductive systems is an (...) m-graph whose nodes are language expressions and the m-edges represent the inference rules of the two original systems. The sobriety of the approach is confirmed by proving that all the fibring notions are universal constructions. This graph-theoretic view is general enough to accommodate very different fibrings of propositional based logics encompassing logics with non-deterministic semantics, logics with an algebraic semantics, logics with partial semantics and substructural logics, among others. Soundness and weak completeness are proved to be preserved under very general conditions. Strong completeness is also shown to be preserved under tighter conditions. In this setting, the collapsing problem appearing in several combinations of logic systems can be avoided. (shrink)

Harold Hodes in [1] introduces an extension of first-order modal logic featuring a backtracking operator, and provides a possible worlds semantics, according to which the operator is a kind of device for ‘world travel’; he does not provide a proof theory. In this paper, I provide a natural deduction system for modal logic featuring this operator, and argue that the system can be motivated in terms of a reading of the backtracking operator whereby it serves to indicate modal (...) scope. I prove soundness and completeness theorems with respect to Hodes’ semantics, as well as semantics with fewer restrictions on the accessibility relation. (shrink)

One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found. Since the inception of da Costa's paraconsistent calculi, an algebraic equivalent for such systems have been searched. It is known that these systems are non self-extensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of Blok-Pigozzi. The same negative results hold (...) for several systems of the hierarchy of paraconsistent logics known as Logics of Formal Inconsistency (LFIs). Because of this, these logics are uniquely characterized by semantics of non-deterministic kind. This paper offers a solution for two open problems in the domain of paraconsistency, in particular connected to algebraization of LFIs, by obtaining several LFIs weaker than C1, each of one is algebraizable in the standard Lindenbaum-Tarski's sense by a suitable variety of Boolean algebras extended with operators. This means that such LFIs satisfy the replacement property. The weakest LFI satisfying replacement presented here is called RmbC, which is obtained from the basic LFI called mbC. Some axiomatic extensions of RmbC are also studied, and in addition a neighborhood semantics is defined for such systems. It is shown that RmbC can be defined within the minimal bimodal non-normal logic E+E defined by the fusion of the non-normal modal logic E with itself. Finally, the framework is extended to first-order languages. RQmbC, the quantified extension of RmbC, is shown to be sound and complete w.r.t. BALFI semantics. (shrink)

We present a sound and complete Fitch-style natural deduction system for an S5 modal logic containing an actuality operator, a diagonal necessity operator, and a diagonal possibility operator. The logic is two-dimensional, where we evaluate sentences with respect to both an actual world (first dimension) and a world of evaluation (second dimension). The diagonal necessity operator behaves as a quantifier over every point on the diagonal between actual worlds and worlds of evaluation, while the diagonal possibility quantifies over some (...) point on the diagonal. Thus, they are just like the epistemic operators for apriority and its dual. We take this extension of Fitch’s familiar derivation system to be a very natural one, since the new rules and labeled lines hereby introduced preserve the structure of Fitch’s own rules for the modal case. (shrink)

In abstract algebraic logic, many systems, such as those paraconsistent logics taking inspiration from da Costa's hierarchy, are not algebraizable by even the broadest standard methodologies, as that of Blok and Pigozzi. However, these logics can be semantically characterized by means of non-deterministic algebraic structures such as Nmatrices, RNmatrices and swap structures. These structures are based on multialgebras, which generalize algebras by allowing the result of an operation to assume a non-empty set of values. This leads to an interest (...) in exploring the foundations of multialgebras applied to the study of logic systems. -/- It is well known from universal algebra that, for every signature Sigma, there exist algebras over Sigma which are absolutely free, meaning that they do not satisfy any identities or, alternatively, satisfy the universal mapping property for the class of Sigma-algebras. Furthermore, once we fix a cardinality of the generating set, they are, up to isomorphisms, unique, and equal to algebras of terms (or propositional formulas, in the context of logic). Equivalently, the forgetful functor, from the category of Sigma-algebras to Set, has a left adjoint. This result does not extend to multialgebras. Not only multialgebras satisfying the universal mapping property do not exist, but the forgetful functor U, from the category of Sigma-multialgebras to Set, does not have a left adjoint. -/- In this paper we generalize, in a natural way, algebras of terms to multialgebras of terms, whose family of submultialgebras enjoys many properties of the former. One example is that, to every pair consisting of a function, from a submultialgebra of a multialgebra of terms to another multialgebra, and a collection of choices (which selects how a homomorphism approaches indeterminacies), there corresponds a unique homomorphism, what resembles the universal mapping property. Another example is that the multialgebras of terms are generated by a set that may be viewed as a strong basis, which we call the ground of the multialgebra. Submultialgebras of multialgebras of terms are what we call weakly free multialgebras. Finally, with these definitions at hand, we offer a simple proof that multialgebras with the universal mapping property for the class of all multialgebras do not exist and that U does not have a left adjoint. (shrink)

This article investigates reasons to participate in non-deterministic elections, where the outcomes incorporate elements of chance beyond mere tie-breaking. The background context situates this inquiry within democratic theory, specifically non-deterministic voting systems, which promise to re-evaluate fairness and power distribution among voting blocs. This study aims to explore the normative implications of such electoral systems and their impact on our moral duty to vote. We analyze instrumental reasons for voting, including prudential and act-consequentialist arguments, alongside non-instrumental reasons, assessing (...) their validity in the context of non-deterministic systems. The results indicate that non-deterministic elections could strengthen the case for voting based on prudential and act-consequentialist grounds due to their proportional nature and the increased influence of each vote. We conclude that, while non-deterministic elections strengthen our duty to vote overall, they do not strengthen it for all the arguments in the literature. This paper contributes to the discourse on electoral systems by critically evaluating the moral obligation to vote in non-deterministic elections. (shrink)

Due to Gӧdel’s incompleteness results, the categoricity of a sufficiently rich mathematical theory and the semantic completeness of its underlying logic are two mutually exclusive ideals. For first- and second-order logics we obtain one of them with the cost of losing the other. In addition, in both these logics the rules of deduction for their quantifiers are non-categorical. In this paper I examine two recent arguments –Warren (2020), Murzi and Topey (2021)– for the idea that the natural deduction rules (...) for the first-order universal quantifier are categorical, i.e., they uniquely determine its semantic intended meaning. Both of them make use of McGee’s open-endedness requirement and the second one uses in addition Garson’s (2013) local models for defining the validity of these rules. I argue that the success of both these arguments is relative to their semantic or infinitary assumptions, which could be easily discharged if the introduction rule for the universal quantifier is taken to be an infinitary rule, i.e. non-compact. Consequently, I reconsider the use of the ω-rule and I show that the addition of the ω-rule to the standard formalizations of first-order logic is categorical. In addition, I argue that the open-endedness requirement does not make the first-order Peano Arithmetic categorical and I advance an argument for its categoricity based on the inferential conservativity requirement. (shrink)

Recent work in formal semantics suggests that the language system includes not only a structure building device, as standardly assumed, but also a natural deductive system which can determine when expressions have trivial truth-conditions (e.g., are logically true/false) and mark them as unacceptable. This hypothesis, called the `logicality of language', accounts for many acceptability patterns, including systematic restrictions on the distribution of quantifiers. To deal with apparent counter-examples consisting of acceptable tautologies and contradictions, the logicality of language is (...) often paired with an additional assumption according to which logical forms are radically underspecified: i.e., the language system can see functional terms but is `blind' to open class terms to the extent that different tokens of the same term are treated as if independent. This conception of logical form has profound implications: it suggests an extreme version of the modularity of language, and can only be paired with non-classical---indeed quite exotic---kinds of deductive systems. The aim of this paper is to show that we can pair the logicality of language with a different and ultimately more traditional account of logical form. This framework accounts for the basic acceptability patterns which motivated the logicality of language, can explain why some tautologies and contradictions are acceptable, and makes better predictions in key cases. As a result, we can pursue versions of the logicality of language in frameworks compatible with the view that the language system is not radically modular vis-a-vis its open class terms and employs a deductive system that is basically classical. (shrink)

An adequate semantics for generic sentences must stake out positions across a range of contested territory in philosophy and linguistics. For this reason the study of generic sentences is a venue for investigating different frameworks for understanding human rationality as manifested in linguistic phenomena such as quantification, classification of individuals under kinds, defeasible reasoning, and intensionality. Despite the wide variety of semantic theories developed for generic sentences, to date these theories have been almost universally model-theoretic and representational. This essay (...) outlines a range of proof-theoretic analyses for characterizing generics. Particular attention is given to an expressivist proof-theory that can be traced to 1) work on logical syntax that Carnap undertook prior to his turn toward truth-conditional model theory in the late 1930s, and 2) research on sequent calculi and natural deduction systems that originate in work from Gentzen and Prawitz.11 This essay offers a more precise exposition of some of the material discussed in the first two chapters of my dissertation (Stovall Citation2015a). These ideas developed in the context of a working group on non-monotonic logic run by Robert Brandom, and they were subsequently clarified through the work of Nissim Francez (particularly Francez Citation2015). I am indebted to many people for feedback and criticism on this essay, though I am sure none among them would agree with everything I say and do here. I would particularly like to thank Brandom, Francez, Ulf Hlobil, Daniel Kaplan, Jared Millson, Bernhard Nickel, Jaroslav Peregrin, Jeffry Pelletier, Thomas Ricketts, Mark Risjord, Shawn Standefer, and two reviewers for this journal. Work on this essay was supported by the joint Lead-Agency research grant between the Austrian Science Foundation (FWF) and the Czech Science Foundation (GAČR), Inferentialism and Collective Intentionality, GF17-33808L. It was substantially revised prior to its final submission. (shrink)

Vann McGee has recently argued that Belnap’s criteria constrain the formal rules of classical natural deduction to uniquely determine the semantic values of the propositional logical connectives and quantifiers if the rules are taken to be open-ended, i.e., if they are truth-preserving within any mathematically possible extension of the original language. The main assumption of his argument is that for any class of models there is a mathematically possible language in which there is a sentence true in just those (...) models. I show that this assumption does not hold for the class of models of classical propositional logic. In particular, I show that the existence of non-normal models for negation undermines McGee’s argument. (shrink)

Non-classical solutions to semantic paradox can be associated with conceptions of paradoxicality understood in terms of entailment facts. In a K3-based theory of truth, for example, it is prima facie natural to say that a sentence φ is paradoxical iff φ ∨ ¬φ entails an absurdity. In a recent paper, Julien Murzi and Lorenzo Rossi exploit this idea to introduce revenge paradoxes for a number of non-classical approaches, including K3. In this paper, I show that on no understanding of (...) ‘is paradoxical’ (for K3) should both rules needed for their paradox be expected to hold unrestrictedly. Just which rule fails, however, depends on various factors, including whether the derivability relation of a target system of reasoning is arithmetically definable. (shrink)

This is a thesis in support of the conceptual yoking of analytic truth to a priori knowledge. My approach is a semantic one; the primary subject matter throughout the thesis is linguistic objects, such as propositions or sentences. I evaluate arguments, and also forward my own, about how such linguistic objects’ truth is determined, how their meaning is fixed and how we, respectively, know the conditions under which their truth and meaning are obtained. The strategy is to make explicit what (...) is distinctive about analytic truths. The objective is to show that truths, known a priori, are trivial in a highly circumscribed way. My arguments are premised on a language-relative account of analytic truth. The language relative account which underwrites much of what I do has two central tenets: 1. Conventionalism about truth and, 2. Non-factualism about meaning. I argue that one decisive way of establishing conventionalism and non-factualism is to prioritise epistemological questions. Once it is established that some truths are not known empirically an account of truth must follow which precludes factual truths being known non-empirically. The function of Part 1 is, chiefly, to render Carnap’s language-relative account of analytic truth. I do not offer arguments in support of Carnap at this stage, but throughout Parts 2 and 3, by looking at more current literature on a priori knowledge and analytic truth, it becomes quickly evident that I take Carnap to be correct, and why. In order to illustrate the extent to which Carnap’s account is conventionalist and non-factualist I pose his arguments against those of his predecessors, Kant and Frege. Part 1 is a lightly retrospective background to the concepts of ‘analytic’ and ‘a priori’. The strategy therein is more mercenary than exegetical: I select the parts from Kant and Frege most relevant to Carnap’s eventual reaction to them. Hereby I give the reasons why Carnap foregoes a factual and objective basis for logical truth. The upshot of this is an account of analytic truth (i.e. logical truth, to him) which ensures its trivial nature. In opposition to accounts of a priori knowledge, which describe it as knowledge gained from rational apprehension, I argue that it is either knowledge from logical deduction or knowledge of stipulations. I therefore reject, in Part 2, three epistemologies for knowing linguistic conventions (e.g. implicit definitions): 1. intuition, 2. inferential a priori knowledge and, 3. a posteriori knowledge. At base, all three epistemologies are rejected because they are incompatible with conventionalism and non-factualism. I argue this point by signalling that such accounts of knowledge yield unsubstantiated second-order claims and/or they render the relevant linguistic conventions epistemically arrogant. For a convention to be arrogant it must be stipulated to be true. The stipulation is then considered arrogant when its meaning cannot be fixed, and its truth cannot be determined without empirical ‘work’. Once a working explication of ‘a priori’ has been given, partially in Part 1 (as inferential) and then in Part 2 (as non-inferential) I look, in Part 3, at an apriorist account of analytic truth, which, I argue, renders analytic truth non-trivial. The particular subject matter here is the implicit definitions of logical terms. The opposition’s argument holds that logical truths are known a priori (this is part of their identification criteria) and that their meaning is factually based. From here it follows that analytic truth, being determined by factually based meaning, is also factual. I oppose these arguments by exposing the internal inconsistencies; that implicit definition is premised on the arbitrary stipulation of truth which is inconsistent with saying that there are facts which determine the same truth. In doing so, I endorse the standard irrealist position about implicit definition and analytic truth (along with the “early friends of implicit definition” such as Wittgenstein and Carnap). What is it that I am trying to get at by doing all of the abovementioned? Here is a very abstracted explanation. The unmitigated realism of the rationalists of old, e.g. Plato, Descartes, Kant, have stoically borne the brunt of the allegation of yielding ‘synthetic a priori’ claims. The anti-rationalist phase of this accusation I am most interested in is that forwarded by the semantically driven empiricism of the early 20th century. It is here that the charge of the ‘synthetic a priori’ really takes hold. Since then new methods and accusatory terms are employed by, chiefly, non-realist positions. I plan to give these proper attention in due course. However, it seems to me that the reframing of the debate in these new terms has also created the illusion that current philosophical realism, whether naturalistic realism, realism in science, realism in logic and mathematics, is somehow not guilty of the same epistemological and semantic charges levelled against Plato, Descartes and Kant. It is of interest to me that in, particularly, current analytic philosophy (given its rationale) realism in many areas seems to escape the accusation of yielding synthetic priori claims. Yet yielding synthetic a priori claims is something which realism so easily falls prey to. Perhaps this is a function of the fact that the phrase, ‘synthetic a priori’, used as an allegation, is now outmoded. This thesis is nothing other than an indictment of metaphysics, or speculative philosophy (this being the crime), brought against a specific selection of realist arguments. I, therefore, ask of my reader to see my explicit, and perhaps outmoded, charge of the ‘synthetic a priori’ levelled against respective theorists as an attempt to draw a direct comparison with the speculative metaphysics so many analytic philosophers now love to hate. I think the phrase ‘synthetic a priori’ still does a lot of work in this regard, precisely because so many current theorists wrongly think they are immune to this charge. Consequently, I shall say much about what is not permitted. Such is, I suppose, the nature of arguing ‘against’ something. I’ll argue that it is not permitted to be a factualist about logical principles and say that they are known a priori. I’ll argue that it is not permitted to say linguistic conventions are a posteriori, when there is a complete failure in locating such a posteriori conventions. Both such philosophical claims are candidates for the synthetic a priori, for unmitigated rationalism. But on the positive side, we now have these two assets: Firstly, I do not ask us to abandon any of the linguistic practises discussed; merely to adopt the correct attitude towards them. For instance, where we use the laws of logic, let us remember that there are no known/knowable facts about logic. These laws are therefore, to the best of our knowledge, conventions not dissimilar to the rules of a game. And, secondly, once we pass sentence on knowing, a priori, anything but trivial truths we shall have at our disposal the sharpest of philosophical tools. A tool which can only proffer a better brand of empiricism. (shrink)

Aristotle's syllogistic is extended to include denumerably many quantifiers such as 'more than 2/3' and 'exactly 2/3.' Syntactic and semantic decision procedures determine the validity, or invalidity, of syllogisms with any finite number of premises. One of the syntactic procedures uses a natural deduction account of deducibility, which is sound and complete. The semantics for the system is non-classical since sentences may be assigned a value other than true or false. Results about symmetric systems are given. And reasons (...) are given for claiming that syllogistic validity is relevant validity. (shrink)

This paper presents two systems of natural deduction for the rejection of non-tautologies of classical propositional logic. The first system is sound and complete with respect to the body of all non-tautologies, the second system is sound and complete with respect to the body of all contradictions. The second system is a subsystem of the first. Starting with Jan Łukasiewicz's work, we describe the historical development of theories of rejection for classical propositional logic. Subsequently, we present the two systems (...) of natural deduction and prove them to be sound and complete. We conclude with a ‘Theorem of Inversion’. (shrink)

In this paper, I argue that the temporal connective prima (‘before’) is a comparative adverb. The argument is based on a number of grammatical facts from Italian, showing that there is an asymmetry between prima and dopo (‘after’). On the ground of their divergent behaviour, I suggest that dopo has a different grammatical status from prima. I propose a semantic treatment for prima that is based on an independently motivated analysis of comparatives which can be traced back to Seuren (in: (...) Kiefer and Ruwet (eds.) Generative grammar in Europe, 1973). Dopo is analyzed instead as an atomic two-place predicate which contributes a binary relation over events to the sentence meaning. The different semantic treatments of the two connectives provide an explanation for the grammatical asymmetries considered at the outset; interestingly, they also shed some light on other asymmetries between prima and dopo, which are known to hold for the English temporal connectives before and after as well: these asymmetries are related to the veridicality properties, the distribution of NPIs, and the logical properties of these connectives first described in Anscombe (Philos Rev 73:3–24, 1964). (shrink)

In the chapter “Information and Content” of their Impossible Worlds, Berto and Jago provide us with a semantic account of information in deductive reasoning such that we have an explanation for why some, but not all, logical deductions are informative. The framework Berto and Jago choose to make sense of the above-mentioned idea is a semantic interpretation of Sequent Calculus rules of inference for classical logic. I shall argue that although Berto and Jago’s idea and framework are hopeful, their definitions (...) do not capture what is intended. This is so because the definitions are solely based on the logical complexity of an argument and they fail to capture the richness of the non- logical content of that argument. Then I will suggest some amendments to address this problem. Finally, I will extend the application of the definitions to first-order logic. It shall be observed that in some classical deductions, applying contraction may lead to hiding some epistemic impossibilities. This happens when formulae which contribute different propositions to the proof get contracted at the quantified level. (shrink)

According to the Best System Account of lawhood, laws of nature are theorems of the deductive systems that best balance simplicity and strength. In this paper, I advocate a different account of lawhood which is related, in spirit, to the BSA: according to my account, laws are theorems of deductive systems that best balance simplicity, strength, and also calculational tractability. I discuss two problems that the BSA faces, and I show that my account solves them. I also use my account (...) to illuminate the nomological character of special science laws. (shrink)

A definition of causation as probability-raising is threatened by two kinds of counterexample: first, when a cause lowers the probability of its effect; and second, when the probability of an effect is raised by a non-cause. In this paper, I present an account that deals successfully with problem cases of both these kinds. In doing so, I also explore some novel implications of incorporating into the metaphysical investigation considerations of causal psychology.

In this paper we discuss the notions of adequacy and truth functionality in quantum logic from the point of view of a non-deterministic semantics. We give a characterization of the degree of non-functionality which is compatible with the propositional structure of quantum theory, showing that having truth-functional connectives, together with some assumptions regarding the relation of logical consequence, commits us to the adequacy of the interpretation sets of these connectives. An advantage of our proof is that it is (...) independent of the number of truth values involved, generalizing previous works. We also show the failure of the adequacy of every Nmatrix that is a model of the non-distributive lattice of quantum propositions. En este trabajo discutimos las nociones de adecuación y veritativo-funcionalidad en la lógica cuántica, desde el punto de vista de una semántica no determinista. Damos una caracterización del grado de no-funcionalidad compatible con la estructura proposicional de la teoría cuántica, mostrando que tener conectivos veritativo-funcionales, junto con algunos presupuestos relativos a la relación de consecuencia lógica, nos compromete con la adecuación de los conjuntos de interpretación de estos conectivos. Un punto ventajoso de nuestra prueba es que se independiza de la cantidad de valores de verdad involucrados, generalizando trabajos previos. Probamos también que falla la adecuación de cualquier Nmatriz que sirva como modelo para el retículo no distributivo de proposiciones cuánticas. (shrink)

In the proof-theoretic semantics approach to meaning, harmony , requiring a balance between introduction-rules (I-rules) and elimination rules (E-rules) within a meaning conferring natural-deduction proof-system, is a central notion. In this paper, we consider two notions of harmony that were proposed in the literature: 1. GE-harmony , requiring a certain form of the E-rules, given the form of the I-rules. 2. Local intrinsic harmony : imposes the existence of certain transformations of derivations, known as reduction and expansion . (...) We propose a construction of the E-rules (in GE-form) from given I-rules, and prove that the constructed rules satisfy also local intrinsic harmony. The construction is based on a classification of I-rules, and constitute an implementation to Gentzen’s (and Pawitz’) remark, that E-rules can be “read off” I-rules. (shrink)

In this paper I show that we have strong empirical and theoretical reasons to treat the verbs we use in our semantic theorizing—particularly ‘refers to ’, ‘applies to ’, and ‘is true of ’—as intensional transitive verbs. Stating our semantic theories with intensional vocabulary allows us to partially reconcile two competing approaches to the nature and subject-matter of semantics: the Chomskian approach, on which semantics is non-relational, internalistic, and concerns the psychology of language users, and the Lewisian approach, (...) on which semantics is fully relational, specifies truth-conditions, and has metaphysical implications. ITVs have two readings: an intensional, de dicto reading, and a relational, de re reading. A semantic theory stated with the de dicto readings of our semantic verbs captures the core insights of the Chomskian approach to semantics, in part because it allows us to assign extremely fine-grained semantic values to expressions, even when those expressions are empty. On the other hand, the de re reading yields a theory that is fully relational, and issues in truth-conditions. The resulting theories are related—and compatible—in that they are expressed by two different readings of the very same semantic vocabulary, and plausibly, the distinction between these two readings is one of scope. (shrink)

The paper briefly surveys the sentential proof-theoretic semantics for fragment of English. Then, appealing to a version of Frege’s context-principle (specified to fit type-logical grammar), a method is presented for deriving proof-theoretic meanings for sub-sentential phrases, down to lexical units (words). The sentential meaning is decomposed according to the function-argument structure as determined by the type-logical grammar. In doing so, the paper presents a novel proof-theoretic interpretation of simple type, replacing Montague’s model-theoretic type interpretation (in arbitrary Henkin models). The (...) domains of derivations are collections of derivations in the associated “dedicated” natural-deduction proof-system, and functions therein (with no appeal to models, truth-values and elements of a domain). The compositionality of the semantics is analyzed. (shrink)

This paper discusses proof-theoretic semantics, the project of specifying the meanings of the logical constants in terms of rules of inference governing them. I concentrate on Michael Dummett’s and Dag Prawitz’ philosophical motivations and give precise characterisations of the crucial notions of harmony and stability, placed in the context of proving normalisation results in systems of natural deduction. I point out a problem for defining the meaning of negation in this framework and prospects for an account of the (...) meanings of modal operators in terms of rules of inference. (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)

Contemporary natural-language semantics began with the assumption that the meaning of a sentence could be modeled by a single truth condition, or by an entity with a truth-condition. But with the recent explosion of dynamic semantics and pragmatics and of work on non- truth-conditional dimensions of linguistic meaning, we are now in the midst of a shift away from a truth-condition-centric view and toward the idea that a sentence’s meaning must be spelled out in terms of its (...) various roles in conversation. This communicative turn in semantics raises historical questions: Why was truth-conditional semantics dominant in the first place, and why were the phenomena now driving the communicative turn initially ignored or misunderstood by truth-conditional semanticists? I offer a historical answer to both questions. The history of natural-language semantics—springing from the work of Donald Davidson and Richard Montague—began with a methodological toolkit that Frege, Tarski, Carnap, and others had created to better understand artificial languages. For them, the study of linguistic meaning was subservient to other explanatory goals in logic, philosophy, and the foundations of mathematics, and this subservience was reflected in the fact that they idealized away from all aspects of meaning that get in the way of a one-to-one correspondence between sentences and truth-conditions. The truth-conditional beginnings of natural- language semantics are best explained by the fact that, upon turning their attention to the empirical study of natural language, Davidson and Montague adopted the methodological toolkit assembled by Frege, Tarski, and Carnap and, along with it, their idealization away from non-truth-conditional semantic phenomena. But this pivot in explana- tory priorities toward natural language itself rendered the adoption of the truth-conditional idealization inappropriate. Lifting the truth-conditional idealization has forced semanticists to upend the conception of linguistic meaning that was originally embodied in their methodology. (shrink)

There are two foundational, but not fully developed, ideas in paraconsistency, namely, the duality between paraconsistent and intuitionistic paradigms, and the introduction of logical operators that express meta-logical notions in the object language. The aim of this paper is to show how these two ideas can be adequately accomplished by the Logics of Formal Inconsistency (LFIs) and by the Logics of Formal Undeterminedness (LFUs). LFIs recover the validity of the principle of explosion in a paraconsistent scenario, while LFUs recover the (...) validity of the principle of excluded middle in a paracomplete scenario. We introduce definitions of duality between inference rules and connectives that allow comparing rules and connectives that belong to different logics. Two formal systems are studied, the logics mbC and mbD, that display the duality between paraconsistency and paracompleteness as a duality between inference rules added to a common core– in the case studied here, this common core is classical positive propositional logic (CPL + ). The logics mbC and mbD are equipped with recovery operators that restore classical logic for, respectively, consistent and determined propositions. These two logics are then combined obtaining a pair of logics of formal inconsistency and undeterminedness (LFIUs), namely, mbCD and mbCDE. The logic mbCDE exhibits some nice duality properties. Besides, it is simultaneously paraconsistent and paracomplete, and able to recover the principles of excluded middle and explosion at once. The last sections offer an algebraic account for such logics by adapting the swap-structures semantics framework of the LFIs the LFUs. This semantics highlights some subtle aspects of these logics, and allows us to prove decidability by means of finite non-deterministic matrices. (shrink)

The standard view about counterfactuals is that a counterfactual (A > C) is true if and only if the A-worlds most similar to the actual world @ are C-worlds. I argue that the worlds conception of counterfactuals is wrong. I assume that counterfactuals have non-trivial truth-values under physical determinism. I show that the possible-worlds approach cannot explain many embeddings of the form (P > (Q > R)), which intuitively are perfectly assertable, and which must be true if the contingent falsity (...) of (Q > R) is to be explained. If (P > (Q > R)) has a backtracking reading then the contingent facts that (Q > R) needs to be true in the closest P-worlds are absent. If (P > (Q > R)) has a forwardtracking reading, then the laws required by (Q > R) to be true in the closest P-worlds will be absent, because they are violated in those worlds. Solutions like lossy laws or denial of embedding won't work. The only approach to counterfactuals that explains the embedding is a pragmatic metalinguistic approach in which the whole idea that counterfactuals are about a modal reality, be it abstract or concrete, is given up. (shrink)

Fichte’s ambitious project in the Foundations of Natural Right is to provide an a priori deduction of the concept of right independently from morality. So far, interpretations of Fichte’s deduction of the concept of right have persistently fallen into one of two rough categories: either they (re)interpret the normative necessity of right in terms of moral or quasi-moral normativity or they interpret right’s normative necessity in terms of hypothetical imperatives. However, each of these interpretations faces significant exegetical difficulties. By (...) contrast, I argue that we can understand the normative necessity of right in terms of conceptual necessity. On this view, right does not tell us what ought to be done, but instead tells us what we are doing and have done. Not only does this provide for a promising philosophical account of the non-moral normativity of right, but also provides a compelling reading of Fichte’s text in both the deduction of the concept of right in the Foundations of Natural Right as well as his discussion of the application of the concept of right and coercion. (shrink)

Two semantic paradoxes, the Liar and Curry’s paradox, are analysed using a newly developed conception of procedural semantics (semantics according to which the truth of propositions is determined algorithmically), whose main characteristic is its departure from methodological realism. Rather than determining pre-existing facts, procedures are constitutive of them. Of this semantics, two versions are considered: closed (where the halting of procedures is presumed) and open (without this presumption). To this end, a procedural approach to deductive reasoning is (...) developed, based on the idea of simulation. As is shown, closed semantics supports classical logic, but cannot in any straightforward way accommodate the concept of truth. In open semantics, where paradoxical propositions naturally ‘belong’, they cease to be paradoxical; yet, it is concluded that the natural choice—for logicians and common people alike—is to stick to closed semantics, pragmatically circumventing problematic utterances. (shrink)

Call a quantifier ‘unrestricted’ if it ranges over absolutely all objects. Arguably, unrestricted quantification is often presupposed in philosophical inquiry. However, developing a semantic theory that vindicates unrestricted quantification proves rather difficult, at least as long as we formulate our semantic theory within a classical first-order language. It has been argued that using a type theory as framework for our semantic theory provides a resolution of this problem, at least if a broadly Fregean interpretation of type theory is assumed. However, (...) the intelligibility of this interpretation has been questioned. In this paper I introduce a type-free theory of properties that can also be used to vindicate unrestricted quantification. This alternative emerges very naturally by reflecting on the features on which the type-theoretic solution of the problem of unrestricted quantification relies. Although this alternative theory is formulated in a non-classical logic, it preserves the deductive strength of classical strict type theory in a natural way. The ideas developed in this paper make crucial use of Russell’s notion of range of significance. (shrink)

The Monist’s call for papers for this issue ended: “if formalism is true, then it must be possible in principle to mechanize meaning in a conscious thinking and language-using machine; if intentionalism is true, no such project is intelligible”. We use the Grelling-Nelson paradox to show that natural language is indefinitely extensible, which has two important consequences: it cannot be formalized and model theoretic semantics, standard for formal languages, is not suitable for it. We also point out that (...) object-object mapping theories of semantics, the usual account for the possibility of non intentional semantics, doesn’t seem able to account for the indefinitely extensible productivity of natural language. (shrink)

This essay delves into the multifaceted concept of determin-ism within the domain of physics, scrutinizing prevalent definitions and classifications. Navigating through the nuances of deterministic behavior, we distinguish it from colloquial interpretations of "non-deterministic." By examining determin-ism through the lenses of natural laws, weak determinism, and strong determinism, we unravel the intricate relationship between predictability and the underlying mathematical structures of the universe. Classical mechanics serves as an exemplar of deterministic principles, while statistical mechanics introduces complexities (...) that challenge simplistic classifications. The interplay between ignorance and non-determinism emerges as a pivotal consideration, urging a nuanced understanding of deter-ministic frameworks amidst intricate systems. In essence, this exploration seeks to reconcile the richness of deterministic behavior with the complexities inherent in the natural world. (shrink)

This dissertation lays the foundation for a new theory of non-relational intentionality. The thesis is divided into an introduction and three main chapters, each of which serves as an essential part of an overarching argument. The argument yields, as its conclusion, a new account of how language and thought can exhibit intentionality intrinsically, so that representation can occur in the absence of some thing that is represented. The overarching argument has two components: first, that intentionality can be profi tably studied (...) through examination of the semantics of intensional transitive verbs (ITVs), and second, that providing intensional transitive verbs with a nonrelational semantics will serve to provide us with (at least the beginnings of) a non-relational theory of intentionality. This approach is a generalization of Anscombe's views on perception. Anscombe held that perceptual verbs such as "see" and "perceive" were ITVs, and that understanding the semantics of their object positions could help us to solve the problems of hallucination and illusion, and provide a theory of perception more generally. I propose to apply this strategy to intentional states and the puzzles of intentionality more generally, and so Anscombe's influence will be felt all through the dissertation. -/- In the first chapter, titled "Semantic Verbs are Intensional Transitives", I argue that semantic verbs such as "refers to", "applies to", and "is true of" have all of the features of intensional transitive verbs, and discuss the consequences of this claim for semantic theory and the philosophy of language. One theoretically enriching consequence of this view is that it allows us to perspicuously express, and partially reconcile two opposing views on the nature and subject-matter of semantics: the Chomskian view, on which semantics is an internalistic enterprise concerning speakers' psychologies, and the Lewisian view, on which semantics is a fully externalistic enterprise issuing in theorems about how the world must look for our natural language sentences to be true. Intensional Transitive Verbs have two readings: a de dicto reading and a de re reading; the de dicto reading of ITVs is plausibly a nonrelational reading, and the intensional features peculiar to this reading make it suitable for expressing a Chomskian, internalist semantic program. On the other hand, the de re reading is fully relational, and make it suitable for expressing the kinds of word-world relations essential to the Lewisian conception of semantics. And since the de dicto and de re readings are plausibly related as two distinct scopal readings of the very same semantic postulates, we can see these two conceptions of semantics as related by two scopal readings of the very same semantic postulates. -/- In chapter two, titled "Hallucination and the New Problem of Empty Names", I argue that the problem of hallucination and the problem of empty names are, at bottom, the same problem. I argue for this by reconstructing the problem of empty names in way that is novel, but implicit in much of the discussion on empty names. I then show how, once recast in this light, the two problems are structurally identical down to an extremely fine level of granularity, and also substantially overlap in terms of their content. If the problems are identical in the way I propose, then we should expect that their spaces of solutions are also identical, and there is signi cant support for this conclusion. However, there are some proposed solutions to the problem of hallucination that have been overlooked as potential solutions to the problem of empty names, and this realization opens new non-relational approaches to the problem of empty names, and to the nature of meaning more generally. -/- In chapter three, titled "Intensionality is Additional Phrasal Unity", I argue for a novel approach to the semantics of intensional contexts. At the heart of my proposal is the Quinean view that intensional contexts should, from the perspective of the semantics, be treated as units, with the material in them contributing to the formation of a single predicate. However, this proposal is subject to a number of objections, including the criticism that taken at face value, this would render intensional contexts, which seem to be fully productive, non-compositional. I begin by discussing the concept of the unity of the phrase, and pointing to various ways that phrases can gain additional unity. I then proposes that the intensionality of intensional transitive verbs is best construed as a form of semantic incorporation; ITVs, on their intensional readings, meet all of the criteria for qualifying as incorporating the nominals in their object positions. I then give a semantics for ITVs that builds on existing views of the semantics of incorporation structures, and gesture at how this can be extended to intensional clausal verbs, including the so-called propositional attitude verbs. (shrink)

This book is an anthology with the following themes. Non-European Tradition: Bussanich interprets main themes of Hindu ethics, including its roots in ritual sacrifice, its relationship to religious duty, society, individual human well-being, and psychic liberation. To best assess the truth of Hindu ethics, he argues for dialogue with premodern Western thought. Pfister takes up the question of human nature as a case study in Chinese ethics. Is our nature inherently good (as Mengzi argued) or bad (Xunzi’s view)? Pfister ob- (...) serves their underlying agreement, that human beings are capable of becoming good, and makes precise the disagreement: whether we achieve goodness by cultivating autonomous feelings or by accepting external precepts. There are political consequences: whether government should aim to respect and em- power individual choices or to be a controlling authority. Early Greek Thinking: Collobert examines the bases of Homeric ethics in fame, prudence, and shame, and how these guide the deliberations of heroes. She observes how, by depending upon the poet’s words, the hero gains a quasi- immortality, although in truth there is no consolation for each person’s inevi- table death. Plato: Santas examines Socratic Method and ethics in Republic 1. There Socrates examines definitions of justice and tests them by comparison to the arts and sciences. Santas shows the similarities of Socrates’ method to John Rawls’ method of considered judgments in reflective equilibrium. McPherran interprets Plato’s religious dimension as like that of his teacher Socrates. McPherran shows how Plato appropriates, reshapes, and extends the religious conventions of his own time in the service of establishing the new enterprise of philosophy. Ac- cording to Taylor, Socrates believes that humans in general have the task of helping the gods by making their own souls as good as possible, and Socrates’ unique ability to cross-examine imposes on him the special task of helping others to become as good as possible. This conception of Socrates’ mission is Plato’s own, consisting in an extension of the traditional conception of piety as helping the gods. Brickhouse and Smith propose a new understanding of Socratic moral psychology—one that retains the standard view of Socrates as an intellectualist, but also recognizes roles in human agency for appetites and passions. They compare and contrast the Socratic view to the picture of moral psychology we get in other dialogues of Plato. Hardy also proposes a new, non-reductive understanding of Socratic eudaimonism—he argues that Socrates invokes a very rich and complex notion of the “Knowledge of the Good and Bad”, which is associated with the motivating forces of the virtues. Rudebusch defends Socrates’ argument that knowledge can never be impotent in the face of psychic passions. He considers the standard objections: that knowledge cannot weigh incom- mensurable human values, and that brute desire, all by itself, is capable of moving the soul to action. Aristotle: Anagnostopoulos interprets Aristotle on the nature and acquisition of virtue. Though virtue of character, aiming at human happiness, requires a complex awareness of multiple dimensions of one’s experience, it is not properly a cognitive capacity. Thus it requires habituation, not education, according to Aristotle, in order to align the unruly elements of the soul with reason’s knowledge of what promotes happiness. Shields explains Aristotle’s doctrine that goodness is meant in many ways as the doctrine that there are different analyses of goodness for different types of circumstance, just as for being. He finds Aristotle to argue for this conclusion, against Plato’s doctrine of the unity of the Good, by applying the tests for homonymy and as an immediate cons- equence of the doctrine of categories. Shields evaluates the issue as unresolved at present. Russell discusses Aristotle’s account of practical deliberation and its virtue, intelligence (phronesis). He relates the account to contemporary philo- sophical controversies surrounding Aristotle’s view that intelligence is neces- sary for moral virtue, including the objections that in some cases it is unnecessary or even impedes human goodness. Frede examines the advantages and disadvantages of Aristotle’s virtue ethics. She explains the general Greek con- ceptions of happiness and virtue, Aristotle’s conception of phronesis and compares the Aristotle’s ethics with modern accounts. Liske discusses the question of whether the Aristotelian account of virtue entails an ethical-psy- chological determinism. He argues that Aristotle’s understanding of hexis allows for free action and ethical responsibility : By making decisions for good actions we are able to stabilize our character (hexis). Hellenistic and Roman: Annas defends an account of stoic ethics, according to which the three parts of Stoicism—logic, physics, and ethics—are integrated as the parts of an egg, not as the parts of a building. Since by this analogy no one part is a foundation for the rest, pedagogical decisions may govern the choice of numerous, equally valid, presentations of Stoic ethics. Piering interprets the Cynic way of life as a distinctive philosophy. In their ethics, Cynics value neither pleasure nor tradition but personal liberty, which they achieve by self-suffi- ciency and display in speech that is frank to the point of insult. Plotinus and Neoplatonism: Gerson outlines the place of ordinary civic virtue as well as philosophically contemplative excellence in Neoplatonism. In doing so he attempts to show how one and the same good can be both action-guiding in human life and be the absolute simple One that grounds the explanation of everything in the universe. Delcomminette follows Plotinus’s path to the Good as the foundation of free will, first in the freedom of Intellect and then in the “more than freedom” of the One. Plotinus postulates these divinities as not outside but within each self, saving him from the contradiction of an external foundation for a truly free will. General Topics: Halbig discusses the thesis on the unity of virtues. He dis- tinguishes the thesis of the identity of virtues and the thesis of a reciprocity of virtues and argues that the various virtues form a unity (in terms of reciprocity) since virtues cannot bring about any bad action. Detel examines Plato’s and Aristotle’s conceptions of normativity : Plato and Aristotle (i) entertained hybrid theories of normativity by distinguishing functional, semantic and ethical normativity, (ii) located the ultimate source of normativity in standards of a good life, and thus (iii) took semantic normativity to be a derived form of normativity. Detel argues that hybrid theories of normativity are—from a mo- dern point of view—still promising. Ho ̈ffe defends the Ancient conception of an art of living against Modern objections. Whereas many Modern philosophers think that we have to replace Ancient eudaimonism by the idea of moral obligation (Pflicht), Ho ̈ffe argues that Eudaimonism and autonomy-based ethics can be reconciled and integrated into a comprehensive and promising theory of a good life, if we enrich the idea of autonomy by the central elements of Ancient eudaimonism. Some common themes: The topics in Chinese and Hindu ethics are perhaps more familiar to modern western sensibilities than Homeric and even Socratic. Anagnostopoulos, Brickhouse and Smith, Frede, Liske, Rudebusch, and Russell all consider in contrasting ways the role of moral character, apart from intellect, in ethics. Brickhouse / Smith, Hardy, and Rudebusch discuss the Socratic con- ception of moral knowledge. Brickhouse / Smith and Hardy retain the standard view of the so called Socratic Intellectualism. Shields and Gerson both consider the question whether there is a single genus of goodness, or if the term is a homonym. Bussanich, McPherran, Taylor, and Delcomminette all consider the relation between religion and ethics. Pfister, Piering, Delcomminette, and Liske all consider what sort of freedom is appropriate to human well-being. Halbig, Detel, and Ho ̈ffe propose interpretations of main themes of Ancient ethics. (shrink)

The Logic of Causation: Definition, Induction and Deduction of Deterministic Causality is a treatise of formal logic and of aetiology. It is an original and wide-ranging investigation of the definition of causation (deterministic causality) in all its forms, and of the deduction and induction of such forms. The work was carried out in three phases over a dozen years (1998-2010), each phase introducing more sophisticated methods than the previous to solve outstanding problems. This study was intended as part (...) of a larger work on causal logic, which additionally treats volition and allied cause-effect relations (2004). The Logic of Causation deals with the main technicalities relating to reasoning about causation. Once all the deductive characteristics of causation in all its forms have been treated, and we have gained an understanding as to how it is induced, we are able to discuss more intelligently its epistemological and ontological status. In this context, past theories of causation are reviewed and evaluated (although some of the issues involved here can only be fully dealt with in a larger perspective, taking volition and other aspects of causality into consideration, as done in Volition and Allied Causal Concepts). Phase I: Macroanalysis. Starting with the paradigm of causation, its most obvious and strongest form, we can by abstraction of its defining components distinguish four genera of causation, or generic determinations, namely: complete, partial, necessary and contingent causation. When these genera and their negations are combined together in every which way, and tested for consistency, it is found that only four species of causation, or specific determinations, remain conceivable. The concept of causation thus gives rise to a number of positive and negative propositional forms, which can be studied in detail with relative ease because they are compounds of conjunctive and conditional propositions whose properties are already well known to logicians. The logical relations (oppositions) between the various determinations (and their negations) are investigated, as well as their respective implications (eductions). Thereafter, their interactions (in syllogistic reasoning) are treated in the most rigorous manner. The main question we try to answer here is: is (or when is) the cause of a cause of something itself a cause of that thing, and if so to what degree? The figures and moods of positive causative syllogism are listed exhaustively; and the resulting arguments validated or invalidated, as the case may be. In this context, a general and sure method of evaluation called ‘matricial analysis’ (macroanalysis) is introduced. Because this (initial) method is cumbersome, it is used as little as possible – the remaining cases being evaluated by means of reduction. Phase II: Microanalysis. Seeing various difficulties encountered in the first phase, and the fact that some issues were left unresolved in it, a more precise method is developed in the second phase, capable of systematically answering most outstanding questions. This improved matricial analysis (microanalysis) is based on tabular prediction of all logically conceivable combinations and permutations of conjunctions between two or more items and their negations (grand matrices). Each such possible combination is called a ‘modus’ and is assigned a permanent number within the framework concerned (for 2, 3, or more items). This allows us to identify each distinct (causative or other, positive or negative) propositional form with a number of alternative moduses. This technique greatly facilitates all work with causative and related forms, allowing us to systematically consider their eductions, oppositions, and syllogistic combinations. In fact, it constitutes a most radical approach not only to causative propositions and their derivatives, but perhaps more importantly to their constituent conditional propositions. Moreover, it is not limited to logical conditioning and causation, but is equally applicable to other modes of modality, including extensional, natural, temporal and spatial conditioning and causation. From the results obtained, we are able to settle with formal certainty most of the historically controversial issues relating to causation. Phase III: Software Assisted Analysis. The approach in the second phase was very ‘manual’ and time consuming; the third phase is intended to ‘mechanize’ much of the work involved by means of spreadsheets (to begin with). This increases reliability of calculations (though no errors were found, in fact) – but also allows for a wider scope. Indeed, we are now able to produce a larger, 4-item grand matrix, and on its basis find the moduses of causative and other forms needed to investigate 4-item syllogism. As well, now each modus can be interpreted with greater precision and causation can be more precisely defined and treated. In this latest phase, the research is brought to a successful finish! Its main ambition, to obtain a complete and reliable listing of all 3-item and 4-item causative syllogisms, being truly fulfilled. This was made technically feasible, in spite of limitations in computer software and hardware, by cutting up problems into smaller pieces. For every mood of the syllogism, it was thus possible to scan for conclusions ‘mechanically’ (using spreadsheets), testing all forms of causative and preventive conclusions. Until now, this job could only be done ‘manually’, and therefore not exhaustively and with certainty. It took over 72’000 pages of spreadsheets to generate the sought for conclusions. This is a historic breakthrough for causal logic and logic in general. Of course, not all conceivable issues are resolved. There is still some work that needs doing, notably with regard to 5-item causative syllogism. But what has been achieved solves the core problem. The method for the resolution of all outstanding issues has definitely now been found and proven. The only obstacle to solving most of them is the amount of labor needed to produce the remaining (less important) tables. As for 5-item syllogism, bigger computer resources are also needed. (shrink)

In 1942 Haskell B. Curry presented what is now called Curry's paradox which can be found in a logic independently of its stand on negation. In recent years there has been a revitalised interest in non-classical solutions to the semantic paradoxes. In this article the non-classical resolution of Curry’s Paradox and Shaw-Kwei' sparadox without rejection any contraction postulate is proposed. In additional relevant paraconsistent logic C ̌_n^#,1≤n<ω, in fact,provide an effective way of circumventing triviality of da Costa’s paraconsistent Set Theories〖NF〗n^C.