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)

For deductive reasoning to be justified, it must be guaranteed to preserve truth from premises to conclusion; and for it to be useful to us, it must be capable of informing us of something. How can we capture this notion of information content, whilst respecting the fact that the content of the premises, if true, already secures the truth of the conclusion? This is the problem I address here. I begin by considering and rejecting several accounts of informational content. I (...) then develop an account on which informational contents are indeterminate in their membership. This allows there to be cases in which it is indeterminate whether a given deduction is informative. Nevertheless, on the picture I present, there are determinate cases of informative (and determinate cases of uninformative) inferences. I argue that the model I offer is the best way for an account of content to respect the meaning of the logical constants and the inference rules associated with them without collapsing into a classical picture of content, unable to account for informative deductive inferences. (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)

The present PhD thesis is concerned with the question whether good reasoning requires that the subject has some cognitive grip on the relation between premises and conclusion. One consideration in favor of such a requirement goes as follows: In order for my belief-formation to be an instance of reasoning, and not merely a causally related sequence of beliefs, the process must be guided by my endorsement of a rule of reasoning. Therefore I must have justified beliefs about the relation (...) between my premises and my conclusion. -/- The rationality of a belief often depends on whether it is rightly connected to other beliefs, or more generally to other mental states —the states capable of providing a reason to holding the belief in question. For instance, some rational beliefs are connected to other beliefs by being inferred from them. It is often accepted that the connection implies that the subject in some sense ‘takes the mental states in question to be reason-providing’. But views on how exactly this is to be understood differ widely. They range from interpretations according to which ‘taking a mental state to be reason-providing’ imposes a mere causal sustaining relation between belief and reason-providing state to interpretations according to which one ‘takes a mental state to be reason-providing’ only if one believes that the state is reason-providing. The most common worry about the latter view is that it faces a vicious regress. In this thesis a different but in some respects similar interpretation of ‘taking something as reason-providing’ is given. It is argued to consist of a disposition to react in certain ways to information that challenges the reason-providing capacity of the allegedly reason-providing state. For instance, that one has inferred A from B partly consists in being disposed to suspend judgment about A if one obtains a reason to believe that B does not render A probable. The account is defended against regress-objections and the suspicion of explanatory circularity. (shrink)

A truth-preservation fallacy is using the concept of truth-preservation where some other concept is needed. For example, in certain contexts saying that consequences can be deduced from premises using truth-preserving deduction rules is a fallacy if it suggests that all truth-preserving rules are consequence-preserving. The arithmetic additive-associativity rule that yields 6 = (3 + (2 + 1)) from 6 = ((3 + 2) + 1) is truth-preserving but not consequence-preserving. As noted in James Gasser’s dissertation, Leibniz has been (...) criticized for using that rule in attempting to show that arithmetic equations are consequences of definitions. -/- A system of deductions is truth-preserving if each of its deductions having true premises has a true conclusion—and consequence-preserving if, for any given set of sentences, each deduction having premises that are consequences of that set has a conclusion that is a consequence of that set. Consequence-preserving amounts to: in each of its deductions the conclusion is a consequence of the premises. The same definitions apply to deduction rules considered as systems of deductions. Every consequence-preserving system is truth-preserving. It is not as well-known that the converse fails: not every truth-preserving system is consequence-preserving. Likewise for rules: not every truth-preserving rule is consequence-preserving. There are many famous examples. In ordinary first-order Peano-Arithmetic, the induction rule yields the conclusion ‘every number x is such that: x is zero or x is a successor’—which is not a consequence of the null set—from two tautological premises, which are consequences of the null set, of course. The arithmetic induction rule is truth-preserving but not consequence-preserving. Truth-preserving rules that are not consequence-preserving are non-logical or extra-logical rules. Such rules are unacceptable to persons espousing traditional truth-and-consequence conceptions of demonstration: a demonstration shows its conclusion is true by showing that its conclusion is a consequence of premises already known to be true. The 1965 Preface in Benson Mates (1972, vii) contains the first occurrence of truth-preservation fallacies in the book. (shrink)

We are justified in employing the rule of inference Modus Ponens (or one much like it) as basic in our reasoning. By contrast, we are not justified in employing a rule of inference that permits inferring to some difficult mathematical theorem from the relevant axioms in a single step. Such an inferential step is intuitively “too large” to count as justified. What accounts for this difference? In this paper, I canvass several possible explanations. I argue that the most (...) promising approach is to appeal to features like usefulness or indispensability to important or required cognitive projects. On the resulting view, whether an inferential step counts as large or small depends on the importance of the relevant rule of inference in our thought. (shrink)

Tichý’s Transparent Intensional Logic (TIL) is an overarching logical framework apt for the analysis of all sorts of discourse, whether colloquial, scientific, mathematical or logical. The theory is a procedural (as opposed to denotational) one, according to which the meaning of an expression is an abstract, extra-linguistic procedure detailing what operations to apply to what procedural constituents to arrive at the product (if any) of the procedure that is the object denoted by the expression. Such procedures are rigorously defined as (...) TIL constructions. Though TIL analytical potential is very large, deduction in TIL has been rather neglected. Tichý defined a sequent calculus for pre-1988 TIL, that is TIL based on the simple theory of types. Since then no other attempt to define a proof calculus for TIL has been presented. The goal of this paper is to propose a generalization and adjustment of Tichý’s calculus to TIL 2010. First, I briefly recapitulate the rules of simple-typed calculus as presented by Tichý. Then, I propose the adjustments of the calculus so that it be applicable to hyperintensions within the ramified hierarchy of types. TIL operates with a single procedural semantics for all kinds of logical-semantic context, be it extensional, intensional or hyperintensional. I show that operating in a hyperintensional context is far from being technically trivial. Yet, it is feasible. To this end, we introduce a substitution method that operates on hyperintensions. It makes use of a four-place substitution function (called Sub) defined over hyperintensions. (shrink)

Complex human reasoning involves minimal abilities to extract conclusions implied in the available information. These abilities are considered “deductive” because they exemplify certain abstract relations among propositions or probabilities called deductive arguments. However, the electrophysiological dynamics which supports such complex cognitive pro- cesses has not been addressed yet. In this work we consider typically deductive logico- probabilistically valid inferences and aim to verify or refute their electrophysiological functional connectivity differences from invalid inferences with the same content (same relational variables, same (...) stimuli, same relevant and salient features). We recorded the brain electrophysiological activity of 20 participants (age 1⁄4 20.35 ± 3.23) by means of an MEG system during two consecutive reasoning tasks: a search task (invalid condition) without any specific deductive rules to follow, and a logically valid deductive task (valid condition) with explicit deductive rules as instructions. We calculated the functional connectivity (FC) for each condition and conducted a seed-based analysis in a set of cortical regions of interest. Finally, we used a cluster-based permutation test to compare the dif- ferences between logically valid and invalid conditions in terms of FC. As a first novel result we found higher FC for valid condition in beta band between regions of interest and left prefrontal, temporal, parietal, and cingulate structures. FC analysis allows a second novel result which is the definition of a propositional network with operculo-cingular, parietal and medial nodes, specifically including disputed medial deductive “core” areas. The experiment discloses measurable cortical processes which do not depend on content but on truth-functional propositional operators. These experimental novelties may contribute to understand the cortical bases of deductive processes. (shrink)

Kant’s derivation of the table of categories from logical functions of judgments in the metaphysical deduction remains one of the least convincing arguments of the Critique of Pure Reason. This article presents an alternative approach to the question of the a priori origin of the table of categories. By circumventing the metaphysical deduction, I show the possibility of demonstrating the exact functions and necessity of the twelve categorial forms as emerging from the interaction of the synthetic unity of (...) apperception with the manifold content of the a priori intuition of space and time. I argue that this a priori material of cognition imposes a constraint on the spontaneity of understanding, thus giving rise to the specific rules of synthesis that make up the table of categories. On the reading I suggest, the table of categories can be understood as expressing the a priori form of self-consciousness in the face of space and time. (shrink)

In section 1, I develop epistemic communism, my view of the function of epistemically evaluative terms such as ‘rational’. The function is to support the coordination of our belief-forming rules, which in turn supports the reliable acquisition of beliefs through testimony. This view is motivated by the existence of valid inferences that we hesitate to call rational. I defend the view against the worry that it fails to account for a function of evaluations within first-personal deliberation. In the rest of (...) the paper, I then argue, on the basis of epistemic communism, for a view about rationality itself. I set up the argument in section 2 by saying what a theory of rational deduction is supposed to do. I claim that such a theory would provide a necessary, sufficient, and explanatorily unifying condition for being a rational rule for inferring deductive consequences. I argue in section 3 that, given epistemic communism and the conventionality that it entails, there is no such theory. Nothing explains why certain rules for deductive reasoning are rational. (shrink)

This paper describes a cubic water tank equipped with a movable partition receiving various amounts of liquid used to represent joint probability distributions. This device is applied to the investigation of deductive inferences under uncertainty. The analogy is exploited to determine by qualitative reasoning the limits in probability of the conclusion of twenty basic deductive arguments (such as Modus Ponens, And-introduction, Contraposition, etc.) often used as benchmark problems by the various theoretical approaches to reasoning under uncertainty. The probability bounds imposed (...) by the premises on the conclusion are derived on the basis of a few trivial principles such as "a part of the tank cannot contain more liquid than its capacity allows", or "if a part is empty, the other part contains all the liquid". This stems from the equivalence between the physical constraints imposed by the capacity of the tank and its subdivisions on the volumes of liquid, and the axioms and rules of probability. The device materializes de Finetti's coherence approach to probability. It also suggests a physical counterpart of Dutch book arguments to assess individuals' rationality in probability judgments in the sense that individuals whose degrees of belief in a conclusion are out of the bounds of coherence intervals would commit themselves to executing physically impossible tasks. (shrink)

PARC is an "appended numeral" system of natural deduction that I learned as an undergraduate and have taught for many years. Despite its considerable pedagogical strengths, PARC appears to have never been published. The system features explicit "tracking" of premises and assumptions throughout a derivation, the collapsing of indirect proofs into conditional proofs, and a very simple set of quantificational rules without the long list of exceptions that bedevil students learning existential instantiation and universal generalization. The system can be (...) used with any Copi-style set of inference rules, so it is quite adaptable to many mainstream symbolic logic textbooks. Consequently, PARC may be especially attractive to logic teachers who find Jaskowski/Gentzen-style introduction/elimination rules to be far less "natural" than Copi-style rules. The PARC system is also keyboard-friendly in comparison to the widely adopted Jaskowski-style graphical subproof system of natural deduction, viz., Fitch diagrams and Copi "bent arrow" diagrams. (shrink)

In this chapter, I discuss some problems of Kant’s logic corpus while recognizing its richness and potential value. I propose and explain a methodic way to approach it. I then test the proposal by showing how we may use various mate- rials from the corpus to construct a Kantian demonstration of the formal rules of thinking (or judging) that lie at the base of Kant’s Metaphysical Deduction. The same proposal can be iterated with respect to other topics. The said (...) demonstration will have cleared the path for such iterations. (shrink)

Logical inferentialism maintains that the formal rules of inference fix the meanings of the logical terms. The categoricity problem points out to the fact that the standard formalizations of classical logic do not uniquely determine the intended meanings of its logical terms, i.e., these formalizations are not categorical. This means that there are different interpretations of the logical terms that are consistent with the relation of logical derivability in a logical calculus. In the case of the quantificational logic, the categoricity (...) problem is generated by the finite nature of the standard calculi and one direction in which it can be solved is to strengthen the deductive systems by adding infinitary rules (such as the ω-rule), i.e., to construct a full formalization. Another main direction is to provide a natural semantics for the standard rules of inference, i.e., a semantics for which these rules are categorical. My aim in this paper is to analyze some recent approaches for solving the categoricity problem and to argue that a logical inferentialist should accept the infinitary rules of inference for the first order quantifiers, since our use of the expressions “all” and “there is” leads us beyond the concrete and finite reasoning, and human beings do sometimes employ infinitary rules of inference in their reasoning. (shrink)

Kant’s derivation of the table of categories from logical functions of judgments in the metaphysical deduction remains one of the least convincing arguments of the Critique of Pure Reason. This article presents an alternative approach to the question of the a priori origin of the table of categories. By circumventing the metaphysical deduction, I show the possibility of demonstrating the exact functions and necessity of the twelve categorial forms as emerging from the interaction of the synthetic unity of (...) apperception with the manifold content of the a priori intuition of space and time. I argue that this a priori material of cognition imposes a constraint on the spontaneity of understanding, thus giving rise to the specific rules of synthesis that make up the table of categories. On the reading I suggest, the table of categories can be understood as expressing the a priori form of self-consciousness in the face of space and time. (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)

Logical inferentialism maintains that the formal rules of inference fix the meanings of the logical terms. The categoricity problem points out to the fact that the standard formalizations of classical logic do not uniquely determine the intended meanings of its logical terms, i.e., these formalizations are not categorical. This means that there are different interpretations of the logical terms that are consistent with the relation of logical derivability in a logical calculus. In the case of the quantificational logic, the categoricity (...) problem is generated by the finite nature of the standard calculi and one direction in which it can be solved is to strengthen the deductive systems by adding infinitary rules (such as the ω-rule), i.e., to construct a full formalization. Another main direction is to provide a natural semantics for the standard rules of inference, i.e., a semantics for which these rules are categorical. My aim in this paper is to analyze some recent approaches for solving the categoricity problem and to argue that a logical inferentialist should accept the infinitary rules of inference for the first order quantifiers, since our use of the expressions “all” and “there is” leads us beyond the concrete and finite reasoning, and human beings do sometimes employ infinitary rules of inference in their reasoning. (shrink)

Methods available for the axiomatization of arbitrary finite-valued logics can be applied to obtain sound and complete intelim rules for all truth-functional connectives of classical logic including the Sheffer stroke and Peirce’s arrow. The restriction to a single conclusion in standard systems of natural deduction requires the introduction of additional rules to make the resulting systems complete; these rules are nevertheless still simple and correspond straightforwardly to the classical absurdity rule. Omitting these rules results in systems for intuitionistic (...) versions of the connectives in question. (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)

In our thought, we employ rules of inference and belief-forming methods more generally. For instance, we (plausibly) employ deductive rules such as Modus Ponens, ampliative rules such as Inference to the Best Explanation, and perceptual methods that tell us to believe what perceptually appears to be the case. What explains our entitlement to employ these rules and methods? This chapter considers the motivations for broadly internalist answers to this question. It considers three such motivations—one based on simple cases, one based (...) on a general conception of epistemic responsibility, and one based on skeptical scenarios. The chapter argues that none of these motivations is successful. The first two motivations lead to forms of internalism—Extreme Method Internalism and Defense Internalism—that are too strong to be tenable. The third motivation motivates Mental Internalism (Mentalism), which does not fit with plausible accounts of entitlement. (shrink)

This thesis is about how deduction is analytic and, at the same time, informative. In the first two chapters I am after the question of the justification of deduction. This justification is circular in the sense that to explain how deduction works we use some basic deductive rules. However, this circularity is not trivial as not every rule can be justified circularly. Moreover, deductive rules may not need suasive justification because they are not ampliative. Deduction (...) preserves meaning, that is, the meaning of non-logical vocabulary of any theory which is developed by deductive reasoning remains unchanged. It means that deduction adds no information to what we already had in our premises. This is why deduction is analytic. -/- However, there are many ways deduction can be informative. In the next three chapters, I will pick a specific kind of deductive reasoning, namely arithmetical reasoning, and will attempt to understand the nature of information we obtain by this kind of reasoning. There is a difference between simple deductive moves such as inferring `Socrates is mortal' from `All human are mortal' and `Socrates is human', and inferring that a relation is reflexive given that it is directed, symmetric and transitive. The latter is more complicated and not as easy to prove as the former. Therefore it is informative and the proof we construct to prove it puts us in an epistemic position that we were not in before having the proof. To be more specific, I show that concepts we need to confirm the conclusion are made in the process of proving the conclusion. (shrink)

This paper studies a formalisation of intuitionistic logic by Negri and von Plato which has general introduction and elimination rules. The philosophical importance of the system is expounded. Definitions of ‘maximal formula’, ‘segment’ and ‘maximal segment’ suitable to the system are formulated and corresponding reduction procedures for maximal formulas and permutative reduction procedures for maximal segments given. Alternatives to the main method used are also considered. It is shown that deductions in the system convert into normal form and that deductions (...) in normal form have the subformula property. (shrink)

Conventional wisdom dictates that proofs of mathematical propositions should be treated as necessary, and sufficient, for entailing `significant' mathematical truths only if the proofs are expressed in a---minimally, deemed consistent---formal mathematical theory in terms of: * Axioms/Axiom schemas * Rules of Deduction * Definitions * Lemmas * Theorems * Corollaries. Whilst Andrew Wiles' proof of Fermat's Last Theorem FLT, which appeals essentially to geometrical properties of real and complex numbers, can be treated as meeting this criteria, it nevertheless leaves (...) two questions unanswered: (i) Why is x^n +y^n = z^n solvable only for n < 3 if x, y, z, n are natural numbers? (ii) What technique might Fermat have used that led him to, even if only briefly, believe he had `a truly marvellous demonstration' of FLT? Prevailing post-Wiles wisdom---leaving (i) essentially unaddressed---dismisses Fermat's claim as a conjecture without a plausible proof of FLT. -/- However, we posit that providing evidence-based answers to both queries is necessary not only for treating FLT as significant, but also for understanding why FLT can be treated as a true arithmetical proposition. We thus argue that proving a theorem formally from explicit, and implicit, premises/axioms using rules of deduction---as currently accepted---is a meaningless game, of little scientific value, in the absence of evidence that has already established---unambiguously---why the premises/axioms and rules of deduction can be treated, and categorically communicated, as pre-formal truths in Marcus Pantsar's sense. Consequently, only evidence-based, pre-formal, truth can entail formal provability; and the formal proof of any significant mathematical theorem cannot entail its pre-formal truth as evidence-based. It can only identify the explicit/implicit premises that have been used to evidence the, already established, pre-formal truth of a mathematical proposition. Hence visualising and understanding the evidence-based, pre-formal, truth of a mathematical proposition is the only raison d'etre for subsequently seeking a formal proof of the proposition within a formal mathematical language (whether first-order or second order set theory, arithmetic, geometry, etc.) By this yardstick Andrew Wiles' proof of FLT fails to meet the required, evidence-based, criteria for entailing a true arithmetical proposition. -/- Moreover, we offer two scenarios as to why/how Fermat could have laconically concluded in his recorded marginal noting that FLT is a true arithmetical proposition---even though he either did not (or could not to his own satisfaction) succeed in cogently evidencing, and recording, why FLT can be treated as an evidence-based, pre-formal, arithmetical truth (presumably without appeal to properties of real and complex numbers). It is primarily such a putative, unrecorded, evidence-based reasoning underlying Fermat's laconic assertion which this investigation seeks to reconstruct; and to justify by appeal to a plausible resolution of some philosophical ambiguities concerning the relation between evidence-based, pre-formal, truth and formal provability. (shrink)

This article examines how deduction preserves certainty and how much certainty it can preserve according to Descartes’s Rules for the Direction of the Mind. I argue that the certainty of a deduction is a matter of four conditions for Descartes. First, certainty depends on whether the conjunction of simple propositions is composed with necessity or contingency. Second, a deduction approaches the certainty of an intuition depending on how many “acts of conceiving” it requires and—third—the complexity or difficulty (...) of the acts of thinking, which is determined by the content of the thoughts and on external factors. Fourth, certainty depends on the intellectual aptitude of the person using the deduction. A deduction lacks certainty when it relies on memory such that it is not apprehended with immediacy. However, the mental capacity and speed of a mind can be increased by training the special mental faculties of perspicacity and discernment. Increasing one’s intellectual aptitude allows for more steps of a deduction to be inferred in fewer acts of conceiving, thereby helping preserve the certainty of a deduction. (shrink)

Wittgenstein's paradoxical theses that unproved propositions are meaningless, proofs form new concepts and rules, and contradictions are of limited concern, led to a variety of interpretations, most of them centered on rule-following skepticism. We argue, with the help of C. S. Peirce's distinction between corollarial and theorematic proofs, that his intuitions are better explained by resistance to what we call conceptual omniscience, treating meaning as fixed content specified in advance. We interpret the distinction in the context of modern epistemic (...) logic and semantic information theory, and show how removing conceptual omniscience helps resolve Wittgenstein's paradoxes and explain the puzzle of deduction, its ability to generate new knowledge and meaning. (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)

This paper considers a formalisation of classical logic using general introduction rules and general elimination rules. It proposes a definition of ‘maximal formula’, ‘segment’ and ‘maximal segment’ suitable to the system, and gives reduction procedures for them. It is then shown that deductions in the system convert into normal form, i.e. deductions that contain neither maximal formulas nor maximal segments, and that deductions in normal form satisfy the subformula property. Tarski’s Rule is treated as a general introduction rule (...) for implication. The general introduction rule for negation has a similar form. Maximal formulas with implication or negation as main operator require reduction procedures of a more intricate kind not present in normalisation for intuitionist 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)

This paper argues for the reasonableness of an inclusive conception of default reasoning. The inclusive conception allows untriggered default rules to influence beliefs: Since a default “from φ, infer ψ” is a defeasible inference rule, it by default warrants a belief in the material implication φ → ψ, even if φ is not believed. Such inferences are not allowed in standard default logic of the Reiter tradition, but are reasonable by analogy to the Deduction Theorem for classical logic. (...) Our main contribution is a formal framework for inclusive default reasoning. The framework has a solid philosophical foundation, it draws conclusions non-trivially different from non-inclusive frameworks, and it exhibits a host of benchmark properties deemed desirable in the literature—e.g., that extensions always exist and are consistent. (shrink)

ABSTRACT: For the Stoics, a syllogism is a formally valid argument; the primary function of their syllogistic is to establish such formal validity. Stoic syllogistic is a system of formal logic that relies on two types of argumental rules: (i) 5 rules (the accounts of the indemonstrables) which determine whether any given argument is an indemonstrable argument, i.e. an elementary syllogism the validity of which is not in need of further demonstration; (ii) one unary and three binary argumental rules which (...) establish the formal validity of non-indemonstrable arguments by analysing them in one or more steps into one or more indemonstrable arguments (cut type rules and antilogism). The function of these rules is to reduce given non-indemonstrable arguments to indemonstrable syllogisms. Moreover, the Stoic method of deduction differs from standard modern ones in that the direction is reversed (similar to tableau methods). The Stoic system may hence be called an argumental reductive system of deduction. In this paper, a reconstruction of this system of logic is presented, and similarities to relevance logic are pointed out. (shrink)

This paper presents a way of formalising definite descriptions with a binary quantifier ι, where ιx[F, G] is read as ‘The F is G’. Introduction and elimination rules for ι in a system of intuitionist negative free logic are formulated. Procedures for removing maximal formulas of the form ιx[F, G] are given, and it is shown that deductions in the system can be brought into normal form.

The idea that logic is in some sense normative for thought and reasoning is a familiar one. Some of the most prominent figures in the history of philosophy including Kant and Frege have been among its defenders. The most natural way of spelling out this idea is to formulate wide-scope deductive requirements on belief which rule out certain states as irrational. But what can account for the truth of such deductive requirements of rationality? By far, the most prominent responses (...) draw in one way or another on the idea that belief aims at the truth. In this paper, I consider two ways of making this line of thought more precise and I argue that they both fail. In particular, I examine a recent attempt by Epistemic Utility Theory to give a veritist account of deductive coherence requirements. I argue that despite its proponents’ best efforts, Epistemic Utility Theory cannot vindicate such requirements. (shrink)

This article aims to dualize several results concerning various types (including possibly Cut-free and Identity-free systems) of canonical multiple-conclusion sequent calculi, i.e. Gentzen-style deduction systems for sequents, equipped with well-behaved forms of left and right introduction rules for logical expressions. In this opportunity, we focus on a different kind of calculi that we dub cocanonical, that is, Gentzen-style deduction systems for sequents, equipped with well-behaved forms of left and right elimination rules for logical expressions. These systems, simply put, (...) have rules that proceed from sequents featuring complex formulas to sequents featuring their component subformulas. Our main goals are to prove soundness and completeness results for the target systems’ consequence relations in terms of their characteristic 3- or 4-valued non-deterministic matrices. (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)

ABSTRACT This part of the series has a dual purpose. In the first place we will discuss two kinds of theories of proof. The first kind will be called a theory of linear proof. The second has been called a theory of suppositional proof. The term "natural deduction" has often and correctly been used to refer to the second kind of theory, but I shall not do so here because many of the theories so-called are not of the second (...) kind--they must be thought of either as disguised linear theories or theories of a third kind (see postscript below). The second purpose of this part is 25 to develop some of the main ideas needed in constructing a comprehensive theory of proof. The reason for choosing the linear and suppositional theories for this purpose is because the linear theory includes only rules of a very simple nature, and the suppositional theory can be seen as the result of making the linear theory more comprehensive. CORRECTION: At the time these articles were written the word ‘proof’ especially in the phrase ‘proof from hypotheses’ was widely used to refer to what were earlier and are now called deductions. I ask your forgiveness. I have forgiven Church and Henkin who misled me. (shrink)

According to the “paradox of knowability”, the moderate thesis that all truths are knowable – ... – implies the seemingly preposterous claim that all truths are actually known – ... –, i.e. that we are omniscient. If Fitch’s argument were successful, it would amount to a knockdown rebuttal of anti-realism by reductio. In the paper I defend the nowadays rather neglected strategy of intuitionistic revisionism. Employing only intuitionistically acceptable rules of inference, the conclusion of the argument is, firstly, not ..., (...) but .... Secondly, even if there were an intuitionistically acceptable proof of ..., i.e. an argument based on a different set of premises, the conclusion would have to be interpreted in accordance with Heyting semantics, and read in this way, the apparently preposterous conclusion would be true on conceptual grounds and acceptable even from a realist point of view. Fitch’s argument, understood as an immanent critique of verificationism, fails because in a debate dealing with the justification of deduction there can be no interpreted formal language on which realists and anti-realists could agree. Thus, the underlying problem is that a satisfactory solution to the “problem of shared content” is not available. I conclude with some remarks on the proposals by J. Salerno and N. Tennant to reconstruct certain arguments in the debate on anti-realism by establishing aporias. (shrink)

In the present paper, we prove the normalization theorem and the consistency of the first-order classical logic with disjunctive syllogism. First, we propose the natural deduction system SCD for classical propositional logic having rules for conjunction, implication, negation, and disjunction. The rules for disjunctive syllogism are regarded as the rules for disjunction. After we prove the normalization theorem and the consistency of SCD, we extend SCD to the system SPCD for the first-order classical logic with disjunctive syllogism. It can (...) be shown that SPCD is conservative extension to SCD. Then, the normalization theorem and the consistency of SPCD are given. (shrink)

The conventional notion of a formal system is adapted to conform to the sound deductive inference model operating on finite strings. Finite strings stipulated to have the semantic value of Boolean true provide the sound deductive premises. Truth preserving finite string transformation rules provide the valid deductive inference. Sound deductive conclusions are the result of these finite string transformation rules.

The system R, or more precisely the pure implicational fragment R›, is considered by the relevance logicians as the most important. The another central system of relevance logic has been the logic E of entailment that was supposed to capture strict relevant implication. The next system of relevance logic is RM or R-mingle. The question is whether adding mingle axiom to R› yields the pure implicational fragment RM› of the system? As concerns the weak systems there are at least two (...) approaches to the problem. First of all, it is possible to restrict a validity of some theorems. In another approach we can investigate even weaker logics which have no theorems and are characterized only by rules of deducibility. (shrink)

ABSTRACT: A detailed presentation of Stoic theory of arguments, including truth-value changes of arguments, Stoic syllogistic, Stoic indemonstrable arguments, Stoic inference rules (themata), including cut rules and antilogism, argumental deduction, elements of relevance logic in Stoic syllogistic, the question of completeness of Stoic logic, Stoic arguments valid in the specific sense, e.g. "Dio says it is day. But Dio speaks truly. Therefore it is day." A more formal and more detailed account of the Stoic theory of deduction can (...) be found in S. Bobzien, Stoic Syllogistic, OSAP 1996. (shrink)

A Mathematical Review by John Corcoran, SUNY/Buffalo -/- Macbeth, Danielle Diagrammatic reasoning in Frege's Begriffsschrift. Synthese 186 (2012), no. 1, 289–314. ABSTRACT This review begins with two quotations from the paper: its abstract and the first paragraph of the conclusion. The point of the quotations is to make clear by the “give-them-enough-rope” strategy how murky, incompetent, and badly written the paper is. I know I am asking a lot, but I have to ask you to read the quoted passages—aloud if (...) possible. Don’t miss the silly attempt to recycle Kant’s quip “Concepts without intuitions are empty; intuitions without concepts are blind”. What the paper was aiming at includes the absurdity: “Proofs without definitions are empty; definitions without proofs are, if not blind, then dumb.” But the author even bollixed this. The editor didn’t even notice. The copy-editor missed it. And the author’s proof-reading did not catch it. In order not to torment you I will quote the sentence as it appears: “In a slogan: proofs without definitions are empty, merely the aimless manipulation of signs according to rules; and definitions without proofs are, if no blind, then dumb.”[sic] The rest of my review discusses the paper’s astounding misattribution to contemporary logicians of the information-theoretic approach. This approach was cruelly trashed by Quine in his 1970 Philosophy of Logic, and thereafter ignored by every text I know of. The paper under review attributes generally to modern philosophers and logicians views that were never espoused by any of the prominent logicians—such as Hilbert, Gödel, Tarski, Church, and Quine—apparently in an attempt to distance them from Frege: the focus of the article. On page 310 we find the following paragraph. “In our logics it is assumed that inference potential is given by truth-conditions. Hence, we think, deduction can be nothing more than a matter of making explicit information that is already contained in one’s premises. If the deduction is valid then the information contained in the conclusion must be contained already in the premises; if that information is not contained already in the premises […], then the argument cannot be valid.” Although the paper is meticulous in citing supporting literature for less questionable points, no references are given for this. In fact, the view that deduction is the making explicit of information that is only implicit in premises has not been espoused by any standard symbolic logic books. It has only recently been articulated by a small number of philosophical logicians from a younger generation, for example, in the prize-winning essay by J. Sagüillo, Methodological practice and complementary concepts of logical consequence: Tarski’s model-theoretic consequence and Corcoran’s information-theoretic consequence, History and Philosophy of Logic, 30 (2009), pp. 21–48. The paper omits definitions of key terms including ‘ampliative’, ‘explicatory’, ‘inference potential’, ‘truth-condition’, and ‘information’. The definition of prime number on page 292 is as follows: “To say that a number is prime is to say that it is not divisible without remainder by another number”. This would make one be the only prime number. The paper being reviewed had the benefit of two anonymous referees who contributed “very helpful comments on an earlier draft”. Could these anonymous referees have read the paper? -/- J. Corcoran, U of Buffalo, SUNY -/- PS By the way, if anyone has a paper that has been turned down by other journals, any journal that would publish something like this might be worth trying. (shrink)

In their Introduction to Logic, Copi and Cohen suggest that students construct a formal proof by "working backwards from the conclusion by looking for some statement or statements from which it can be deduced and then trying to deduce those intermediate statements from the premises. What follows is an elaboration of this suggestion. I describe an almost mechanical procedure for determining from which statement(s) the conclusion can be deduced and the rules by which the required inferences can be made. This (...) method is designed to forestall the quandary in which many beginners find themselves: not knowing how to get started. (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)

I show that the model-theoretic meaning that can be read off the natural deduction rules for disjunction fails to have certain desirable properties. I use this result to argue against a modest form of inferentialism which uses natural deduction rules to fix model-theoretic truth-conditions for logical connectives.

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)

C. I. Lewis (I883-I964) was the first major figure in history and philosophy of logic—-a field that has come to be recognized as a separate specialty after years of work by Ivor Grattan-Guinness and others (Dawson 2003, 257).Lewis was among the earliest to accept the challenges offered by this field; he was the first who had the philosophical and mathematical talent, the philosophical, logical, and historical background, and the patience and dedication to objectivity needed to excel. He was blessed with (...) many fortunate circumstances, not least of which was entering the field when mathematical logic, after only six decades of toil, had just reaped one of its most important harvests with publication of the monumental Principia Mathematica. It was a time of joyful optimism which demanded an historical account and a sober philosophical critique. Lewis was one of the first to apply to mathematical logic the Aristotelian dictum that we do not understand a living institution until we see it growing from its birth. (shrink)

A graph-theoretic account of logics is explored based on the general notion of m-graph (that is, a graph where each edge can have a finite sequence of nodes as source). Signatures, interpretation structures and deduction systems are seen as m-graphs. After defining a category freely generated by a m-graph, formulas and expressions in general can be seen as morphisms. Moreover, derivations involving rule instantiation are also morphisms. Soundness and completeness theorems are proved. As a consequence of the generality (...) of the approach our results apply to very different logics encompassing, among others, substructural logics as well as logics with nondeterministic semantics, and subsume all logics endowed with an algebraic semantics. (shrink)

ABSTRACT -/- A propositional attitude (PA) is a belief, desire, fear, etc., that x is the case. This dissertation addresses the question of the semantic content of a specific kind of PA-instance: an instance of a belief of the form all Fs are Gs. The belief that all bachelors are sports fans has this form, while the belief that Spain is a country in Eastern Europe do not. Unlike a state of viewing the color of an orange, a belief-instance is (...) semantically contentful because it has reference, a meaning, logical implications, or a truth-value. While the intrinsic semantics view holds that either concepts or abstract objects are the source of content for PAs, the extrinsic semantics view holds that symbols of a mental language provide this content. I argue that a successful theory of intentionality must explain: (1) the truth-preserving causal powers of PAs, (2) the failure of the deductive principle Substitutivity to preserve truth over sentences that ascribe PAs, and (3) the truth-evaluability of PAs. As an internalist version of the extrinsic semantics view, I first evaluate Fodor’s Computational Theory of Mind, which says the semantic ingredients of mental states are symbols governed by rules of a mental syntax. I argue that in order to meet (1), CTM would have to associate the causal patterns of each thought-type with the inferential relations of some proposition – in an arbitrary or question-begging way. I also evaluate Fodor’s causal theory, as an externalist version of the extrinsic semantics view. This view is that lawlike causal relations between mental symbols and objects determine the reference, and thus the truth-value, of a thought. I argue that Brian Loar’s circularity objection refutes the ability of this theory to meet (3); and I endorse the intrinsic semantics perspective. I evaluate Frege’s theory of abstract, mind-external, and intrinsically semantic objects (senses), as an attempt to meet condition (2). I conclude that mind-external universals are the source of the intrinsically semantic features of concepts. Finally, I put forth a theory called ‘Bare Property Intentionality’, which describes the features of intrinsically representative and semantic concepts that connect them to these universals. (shrink)

This paper presents a new system of logic, LF, that is intended to be used as the foundation of the formalization of science. That is, deductive validity according to LF is to be used as the criterion for assessing what follows from the verdicts, hypotheses, or conjectures of any science. In work currently in progress, we argue for the unique suitability of LF for the formalization of logic, mathematics, syntax, and semantics. The present document specifies the language and rules of (...) LF, lays out some notational conventions, and states some basic technical facts about the system. (shrink)

This paper and its sequel “look under the hood” of the usual sorts of proof-theoretic systems for certain well-known intuitionistic and classical propositional modal logics. Section 1 is preliminary. Of most importance: a marked formula will be the result of prefixing a formula in a propositional modal language with a step-marker, for this paper either 0 or 1. Think of 1 as indicating the taking of “one step away from 0.” Deductions will be constructed using marked formulas. Section 2 presents (...) the model-theoretic concepts, based on those in [7], that guide the rest of this paper. Section 3 presents Natural Deduction systems IK and CK, formalizations of intuitionistic and classical one-step versions of K. In these systems, occurrences of step-markers allow deductions to display deductive structure that is covered over in familiar “no step” proof-theoretic systems for such logics. Box and Diamond are governed by Introduction and Elimination rules; the familiar K rule and Necessitation are derived (i.e. admissible) rules. CK will be the result of adding the 0-version of the Rule of Excluded Middle to the rules which generate IK. Note: IK is the result of merely dropping that rule from those generating CK, without addition of further rules or axioms (as was needed in [7]). These proof-theoretic systems yield intuitionistic and classical consequence relations by the obvious definition. Section 4 provides some examples of what can be deduced in IK. Section 5 defines some proof-theoretic concepts that are used in Section 6 to prove the soundness of the consequence relation for IK (relative to the class of models defined in Section 2.) Section 7 proves its completeness (relative to that class). Section 8 extends these results to the consequence relation for CK. (Looking ahead: Part 2 will investigate one-step proof-theoretic systems formalizing intuitionistic and classical one-step versions of some familiar logics stronger than K.). (shrink)