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)

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)

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)

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)

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)

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)

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)

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)

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)

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)

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)

This presentation of Aristotle's natural deduction system supplements earlier presentations and gives more historical evidence. Some fine-tunings resulted from conversations with Timothy Smiley, Charles Kahn, Josiah Gould, John Kearns,John Glanvillle, and William Parry.The criticism of Aristotle's theory of propositions found at the end of this 1974 presentation was retracted in Corcoran's 2009 HPL article "Aristotle's demonstrative logic".

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

We argue that the need for commentary in commonly used linear calculi of natural deduction is connected to the “deletion” of illocutionary expressions that express the role of propositions as reasons, assumptions, or inferred propositions. We first analyze the formalization of an informal proof in some common calculi which do not formalize natural language illocutionary expressions, and show that in these calculi the formalizations of the example proof rely on commentary devices that have no counterpart in the original (...) proof. We then present a linear natural deduction calculus that makes use of formal illocutionary expressions in such a way that unique readability for derivations is guaranteed – thus showing that formalizing illocutionary expressions can eliminate the need for commentary. (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)

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.

Building on the work of Peter Hinst and Geo Siegwart, we develop a pragmatised natural deduction calculus, i.e. a natural deduction calculus that incorporates illocutionary operators at the formal level, and prove its adequacy. In contrast to other linear calculi of natural deduction, derivations in this calculus are sequences of object-language sentences which do not require graphical or other means of commentary in order to keep track of assumptions or to indicate subproofs. (Translation of our German paper (...) "Ein Redehandlungskalkül. Ein pragmatisierter Kalkül des natürlichen Schließens nebst Metatheorie"; online available at http://philpapers.org/rec/CORERE.). (shrink)

Some logic students falter at the transition from the mechanical method of truth tables to the less-mechanical method of natural deduction. This short paper introduces a word game intended to ease that transition.

my goal here is to provide a detailed analysis of the methods of inference that are employed in De prospectiva pingendi. For this purpose, a method of natural deduction is proposed. the treatise by Piero della Francesca is a manifestation of a union between the ne arts and the mathematical sciences of arithmetic and geometry. He de nes painting as a part of perspective and, speaking precisely, as a branch of geometry, which is why we nd advanced geometrical exercises (...) here. (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 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)

This paper examines Hobbes’s criticisms of Robert Boyle’s air-pump experiments in light of Hobbes’s account in _De Corpore_ and _De Homine_ of the relationship of natural philosophy to geometry. I argue that Hobbes’s criticisms rely upon his understanding of what counts as “true physics.” Instead of seeing Hobbes as defending natural philosophy as “a causal enterprise … [that] as such, secured total and irrevocable assent,” 1 I argue that, in his disagreement with Boyle, Hobbes relied upon his understanding (...) of natural philosophy as a mixed mathematical science. In a mixed mathematical science one can mix facts from experience with causal principles borrowed from geometry. Hobbes’s harsh criticisms of Boyle’s philosophy, especially in the _Dialogus Physicus, sive De natura aeris_, should thus be understood as Hobbes advancing his view of the proper relationship of natural philosophy to geometry in terms of mixing principles from geometry with facts from experience. Understood in this light, Hobbes need not be taken to reject or diminish the importance of experiment/experience; nor should Hobbes’s criticisms in _Dialogus Physicus_ be understood as rejecting experimenting as ignoble and not befitting a philosopher. Instead, Hobbes’s viewpoint is that experiment/experience must be understood within its proper place – it establishes the ‘that’ for a mixed mathematical science explanation. (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)

This essay partly builds on and partly criticizes a striking idea of Dieter Henrich. Henrich argues that Kant's distinction in the first Critique between the question of fact (quid facti) and the question of law (quid juris) provides clues to the argumentative structure of a philosophical "Deduction". Henrich suggests that the unity of apperception plays a role analogous to a legal factum. By contrast, I argue, first, that the question of fact in the first Critique is settled by the Metaphysical (...) Deduction, which establishes the purity of origin of the Categories, and, second, that in the second Critique, the relevant factum is the Fact of Reason, which amounts to the fact that the Moral Law is pure in origin. (shrink)

From the second half of the last century, there has been a widespread view in the Anglophone world that Kant’s transcendental deduction (aka TD) aims to vindicate our common-sense view of the world as composed of public and objective particulars against some unqualified forms of skepticism. This widespread assumption has raised serious doubt not only about the success of TD but also about the very nature of its argument in both editions of the Critique. Yet, if there is a connection (...) between TD and global skepticism, the intriguing question is: Who is this skeptic? According to Strawson, “the skeptic” is a hypothesis of a purely sense-datum experience. In contrast, the fact that TD turns on the key notion of self-consciousness has induced several other scholars to assume that the skeptic is no none but a Cartesian external-world skeptic. None of those readings find textual support or are compatible with the very structure of the first Critique. The question is: Does this mean that TD aims only to undermine empiricism, as Guyer suggests? I do not believe so. I am pretty convinced that TD addresses a peculiar form of global skepticism, namely “Hume’s challenge to reason.” Assuming that we cognize (erkennen) and experience (erfahren) appearances as objects as a requirement of Newtonian physics, TD aims to provide a justification of the principle that nature is uniform that is superior to Hume’s justification. (shrink)

This paper raises obvious questions undermining any residual confidence in Mates work and revealing our embarrassing ignorance of true nature of Stoic deduction. It was inspired by the challenging exploratory work of JOSIAH GOULD.

There is no strict alignment between induction and fallibility, nor between deduction and certainty. Fallibility in deductive inferences, such as failed mathematical theorems, demonstrates that deduction does not guarantee certainty. Similarly, inductive reasoning, typically seen as weaker and more prone to uncertainty, is not inherently tied to fallibility. In fact, inductive generalizations can sometimes lead to certainty, especially in mathematical contexts. By decoupling induction from fallibility and deduction from certainty, we preserve the distinct nature of each form of reasoning, allowing (...) them to be properly understood without unnecessary constraints. (shrink)

This article identifies and formalizes the logical features of analogous terms that justify their use in deduction. After a survey of doctrines in Aristotle, Aquinas, and Cajetan, the criteria of “analogy of proper proportionality” are symbolized in first-order predicate logic. A common genus justifies use of a common term, but does not provide the inferential link required for deduction. Rather, the respective differentiae foster this link through their identical proportion. A natural-language argument by analogy is formalized so as to (...) exhibit these criteria, thereby showing the validity of analogical deduction. (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)

Medical diagnosis has been traditionally recognized as a privileged field of application for so called probabilistic induction. Consequently, the Bayesian theorem, which mathematically formalizes this form of inference, has been seen as the most adequate tool for quantifying the uncertainty surrounding the diagnosis by providing probabilities of different diagnostic hypotheses, given symptomatic or laboratory data. On the other side, it has also been remarked that differential diagnosis rather works by exclusion, e.g. by modus tollens, i.e. deductively. By drawing on a (...) case history, this paper aims at clarifying some points on the issue. Namely: 1) Medical diagnosis does not represent, strictly speaking, a form of induction, but a type, of what in Peircean terms should be called ‘abduction’ (identifying a case as the token of a specific type); 2) in performing the single diagnostic steps, however, different inferential methods are used for both inductive and deductive nature: modus tollens, hypothetical-deductive method, abduction; 3) Bayes’ theorem is a probabilized form of abduction which uses mathematics in order to justify the degree of confidence which can be entertained on a hypothesis given the available evidence; 4) although theoretically irreconcilable, in practice, both the hypothetical- deductive method and the Bayesian one, are used in the same diagnosis with no serious compromise for its correctness; 5) Medical diagnosis, especially differential diagnosis, also uses a kind of “probabilistic modus tollens”, in that, signs (symptoms or laboratory data) are taken as strong evidence for a given hypothesis not to be true: the focus is not on hypothesis confirmation, but instead on its refutation [Pr (¬ H/E1, E2, …, En)]. Especially at the beginning of a complicated case, odds are between the hypothesis that is potentially being excluded and a vague “other”. This procedure has the advantage of providing a clue of what evidence to look for and to eventually reduce the set of candidate hypotheses if conclusive negative evidence is found. 6) Bayes’ theorem in the hypothesis-confirmation form can more faithfully, although idealistically, represent the medical diagnosis when the diagnostic itinerary has come to a reduced set of plausible hypotheses after a process of progressive elimination of candidate hypotheses; 7) Bayes’ theorem is however indispensable in the case of litigation in order to assess doctor’s responsibility for medical error by taking into account the weight of the evidence at his disposal. (shrink)

Why should moral philosophers, moral psychologists, and machine ethicists care about computational complexity? Debates on whether artificial intelligence (AI) can or should be used to solve problems in ethical domains have mainly been driven by what AI can or cannot do in terms of human capacities. In this paper, we tackle the problem from the other end by exploring what kind of moral machines are possible based on what computational systems can or cannot do. To do so, we analyze normative (...) ethics through the lens of computational complexity. First, we introduce computational complexity for the uninitiated reader and discuss how the complexity of ethical problems can be framed within Marr’s three levels of analysis. We then study a range of ethical problems based on consequentialism, deontology, and virtue ethics, with the aim of elucidating the complexity associated with the problems themselves (e.g., due to combinatorics, uncertainty, strategic dynamics), the computational methods employed (e.g., probability, logic, learning), and the available resources (e.g., time, knowledge, learning). The results indicate that most problems the normative frameworks pose lead to tractability issues in every category analyzed. Our investigation also provides several insights about the computational nature of normative ethics, including the differences between rule- and outcome-based moral strategies, and the implementation-variance with regard to moral resources. We then discuss the consequences complexity results have for the prospect of moral machines in virtue of the trade-off between optimality and efficiency. Finally, we elucidate how computational complexity can be used to inform both philosophical and cognitive-psychological research on human morality by advancing the moral tractability thesis. (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)

From Groundwork for the metaphysics of morals and Critique of practical reason, we can deduce Kant's interpretation of the concept of freedom, which has undergone a change from practical freedom to transcendental freedom, and the deduction of freedom has been perfected, the rational facts have been put forward to provide the basis of free deduction. The reason for the change is that freedom as the basis of theoretical practice is assumed and predetermined, how the cause and effect of freedom as (...) will may not be explained, and the nature of freedom is not defined clearly, the legitimacy and authority of the moral law is not established. After the transformation, the problem was solved. Although rigour raises questions about the universality of Kant’s moral law, Onora Sylvia O’Neill and others argue that Kant’s moral law is a product of virtue ethics, not a normative ethic, Kant's moral law still can instruct us in ethical life. (shrink)

I offer an alternative account of the relationship of Hobbesian geometry to natural philosophy by arguing that mixed mathematics provided Hobbes with a model for thinking about it. In mixed mathematics, one may borrow causal principles from one science and use them in another science without there being a deductive relationship between those two sciences. Natural philosophy for Hobbes is mixed because an explanation may combine observations from experience (the ‘that’) with causal principles from geometry (the ‘why’). My (...) argument shows that Hobbesian natural philosophy relies upon suppositions that bodies plausibly behave according to these borrowed causal principles from geometry, acknowledging that bodies in the world may not actually behave this way. First, I consider Hobbes's relation to Aristotelian mixed mathematics and to Isaac Barrow's broadening of mixed mathematics in Mathematical Lectures (1683). I show that for Hobbes maker's knowledge from geometry provides the ‘why’ in mixed-mathematical explanations. Next, I examine two explanations from De corpore Part IV: (1) the explanation of sense in De corpore 25.1-2; and (2) the explanation of the swelling of parts of the body when they become warm in De corpore 27.3. In both explanations, I show Hobbes borrowing and citing geometrical principles and mixing these principles with appeals to experience. (shrink)

Many interpretations of Kant’s first Critique fail to appreciate the revolutionary nature of his account of knowledge and its implications for skepticism, givenness and mind-independence, because they read Kant as holding a compositional account of knowledge. I contend that the reason for this is that this account is both naturally appealing in its own right, and fits an influential reading of Kant’s Transcendental Deduction. On this reading, the Deduction aims to respond to a skeptical worry which issues from the empiricist (...) version of epistemic compositionalism and which questions the intelligibility of the claim to knowledge of our judgements. Against this, I argue that what Kant’s Deduction actually aims to address is a radicalization of this epistemic worry, which instead questions the intelligibility of the objective purport of our judgements. I contend that the compositional account is unable to respond to this more radical worry, thereby putting it into question both as a reading of Kant, and as an account of knowledge generally. To corroborate this, I provide a reading of the Deduction that overcomes epistemic compositionalism by thinking through its shortcomings in order to arrive at a more adequate successor account: the hylomorphic account of knowledge, which, I contend, is able to dissolve both the more radical and the epistemic worry. I suggest that this implies generally that the epistemic worry issuing from the compositional account is not self-contained, but must give way to Kant’s more radical worry, which I argue can only be addressed within the underappreciated framework of epistemic hylomorphism. (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)

Kant's A-Edition objective deduction is naturally (and has traditionally been) divided into two arguments: an " argument from above" and one that proceeds " von unten auf." This would suggest a picture of Kant's procedure in the objective deduction as first descending and ascending the same ladder, the better, perhaps, to test its durability or to thoroughly convince the reader of its soundness. There are obvious obstacles to such a reading, however; and in this chapter I will argue that the (...) arguments from above and below constitute different, albeit importantly inter-related, proofs. Rather than drawing on the differences in their premises, however, I will highlight what I take to be the different concerns addressed and, correspondingly, the distinct conclusions reached by each. In particular, I will show that both arguments can be understood to address distinct specters, with the argument from above addressing an internal concern generated by Kant’s own transcendental idealism, and the argument from below seeking to dispel a more traditional, broadly Humean challenge to the understanding’s role in experience. These distinct concerns also imply that these arguments yield distinct conclusions, though I will show that they are in fact complementary. (shrink)

The main objective of this PhD Thesis is to present a method of obtaining strong normalization via natural ordinal, which is applicable to natural deduction systems and typed lambda calculus. The method includes (a) the definition of a numerical assignment that associates each derivation (or lambda term) to a natural number and (b) the proof that this assignment decreases with reductions of maximal formulas (or redex). Besides, because the numerical assignment used coincide with the length of a (...) specific sequence of reduction - the worst reduction sequence - it is the lowest upper bound on the length of reduction sequences. The main commitment of the introduced method is that it is constructive and elementary, produced only through analyzing structural and combinatorial properties of derivations and lambda terms, without appeal to any sophisticated mathematical tool. Together with the exposition of the method, it is presented a comparative study of some articles in the literature that also get strong normalization by means we can identify with the natural ordinal methods. Among them we highlight Howard[1968], which performs an ordinal analysis of Godel’s Dialectica interpretation for intuitionistic first order arithmetic. We reveal a fact about this article not noted by the author himself: a syntactic proof of strong normalization theorem for the system of typified lambda calculus λ⊃ is a consequence of its results. This would be the first strong normalization proof in the literature. (written in Portuguese). (shrink)

In this paper, I discuss the debate on Kant and nonconceptual content. Inspired by Kant’s account of the intimate relation between intuition and concepts, McDowell (1996) has forcefully argued that the relation between sensible content and concepts is such that sensible content does not severally contribute to cognition but always only in conjunction with concepts. This view is known as conceptualism. Recently, Kantians Robert Hanna and Lucy Allais, among others, have brought against this view the charge that it neglects the (...) possibility of the existence of essentially nonconceptual content that is not conceptualised or subject to conceptualisation. Their critique of McDowell amounts to nonconceptualism. However, both views, conceptualist and nonconceptualist, share the assumption that intuition is synthesised content in Kant’s sense. My interest is not in the validity of the philosophical positions of conceptualism or nonconceptualism per se. I am particularly interested in the extent to which the views that McDowell and Hanna and Allais respectively advance are true to Kant, or can validly be seen as Kantian positions. I argue that although McDowell is right that intuition is only epistemically relevant in conjunction with concepts, Hanna and Allais are right with regard to the existence of essentially nonconceptual content (intuitions) independently of the functions of the understanding, but that they are wrong with regard to non-conceptualised intuition being synthesised content in Kant’s sense. Kantian conceptualists (Bowman 2011; Griffith 2012; Gomes 2014) have responded to the recent nonconceptualist offensive, with reference to A89ff./B122ff. (§13)—which, confusingly, the nonconceptualists also cite as evidence for their contrary reading—by arguing that the nonconceptualist view conflicts with the central goal of the Transcendental Deduction, namely, to argue that all intuitions are subject to the categories. I contend that the conceptualist reading of A89ff./B122ff. is unfounded, but also that the nonconceptualists are wrong to believe that intuitions as such refer strictly to objects independently of the functions of the understanding, and that they are mistaken about the relation between figurative synthesis and intellectual synthesis. I argue that Kant is a conceptualist, albeit not in the sense that standard conceptualists assume. Perceptual knowledge is always judgemental, though without this resulting in the standard conceptualist claim that, necessarily, all intuitions or all perceptions per se stand under the categories (strong conceptualism). I endorse the nonconceptualist view that, for Kant, perception per se, i.e. any mere or ‘blind’ intuition of objects (i.e. objects as indeterminate appearances) short of perceptual knowledge, does not necessarily stand under the categories. Perception is not yet perceptual knowledge. In this context, I point out the common failure in the literature on the Transcendental Deduction, both of the conceptualist and nonconceptualist stripe, to take account of the modal nature of Kant’s argument for the relation between intuition and concept insofar as cognition should arise from it. (shrink)

Few of Kant’s doctrines are as difficult to understand as that of self-affection. Its brief career in the published literature consists principally in its unheralded introduction in the Transcendental Aesthetic and unexpected re-appearance at a key moment in the Deduction chapter in the B edition of the first Critique. Kant’s commentators, confronted with the difficulty of this doctrine, have naturally resorted to various strategies of clarification, ranging from distinguishing between empirical and transcendental self-affection, divorcing self-affection from the claims of self-knowledge (...) with which Kant explicitly connects it, and, perhaps least justified of all, ignoring the doctrine altogether. Yet the connection between self-affection and central Critical doctrines (such as the transcendental synthesis of the imagination) marks all of these strategies as last resorts. In this paper, I seek to provide a clearer outline of the constellation of those issues which inform Kant’s discussion of self-affection. More particularly, I intend to explain the crucial role played by self-affection in the account of the transcendental conditions of perception provided late in the B Deduction. (shrink)

The aim of this paper is to examine the nature, scope and importance of philosophy in the light of its relation to other disciplines. This work pays its focus on the various fundamental problems of philosophy, relating to Ethics, Metaphysics, Epistemology Logic, and its association with scientific realism. It will also highlight the various facets of these problems and the role of philosophers to point out the various issues relating to human issues. It is widely agreed that philosophy as a (...) multi-dimensional subject that shows affinity to others branches of philosophy like, Philosophy of Science, Humanities, Physics and Mathematics, but this paper also seeks, a philosophical nature towards the universal problems of nature. It evaluates the contribution and sacrifices of the great sages of philosophers to promote the clarity and progress in the field of philosophy. (shrink)

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

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)

Certain results, most famously in classical statistical mechanics and complex systems, but also in quantum mechanics and high-energy physics, yield a coarse-grained stable statistical pattern in the long run. The explanation of these results shares a common structure: the results hold for a 'typical' dynamics, that is, for most of the underlying dynamics. In this paper I argue that the structure of the explanation of these results might shed some light --a different light-- on philosophical debates on the laws of (...) nature. In the explanation of such patterns, the specific form of the underlying dynamics is almost irrelevant. The conditions required, given a free state-space evolution, suffice to account for the coarse-grained lawful behaviour. An analysis of such conditions might thus provide a different account of how regular behaviour can occur. This paper focuses on drawing attention to this type of explanation, outlining it in the diverse areas of physics in which it appears, and discussing its limitations and significance in the tractable setting of classical statistical mechanics. (shrink)

The vision of natural kinds that is most common in the modern philosophy of biology, particularly with respect to the question whether species and other taxa are natural kinds, is based on a revision of the notion by Mill in A System of Logic. However, there was another conception that Whewell had previously captured well, which taxonomists have always employed, of kinds as being types that need not have necessary and sufficient characters and properties, or essences. These competing (...) views employ different approaches to scientific methodologies: Mill’s class-kinds are not formed by induction but by deduction, while Whewell’s type-kinds are inductive. More recently, phylogenetic kinds (clades, or monophyletic-kinds) are inductively projectible, and escape Mill’s strictures. Mill’s version represents a shift in the notions of kinds from the biological to the physical sciences. (shrink)

In the 17th century, Hobbes stated that we reason by addition and subtraction. Historians of logic note that Hobbes thought of reasoning as “a ‘species of computation’” but point out that “his writing contains in fact no attempt to work out such a project.” Though Leibniz mentions the plus/minus character of the positive and negative copulas, neither he nor Hobbes say anything about a plus/minus character of other common logical words that drive our deductive judgments, words like ‘some’, ‘all’, ‘if’, (...) and ‘and’, each of which actually turns out to have an oppositive, character that allows us, “in our silent reasoning,” to ignore its literal meaning and to reckon with it as one reckons with a plus or a minus operator in elementary algebra or arithmetic. These ‘logical constants’ of natural language figure crucially in our everyday reasoning. Because Hobbes and Leibniz did not identify them as the plus and minus words we reason with, their insight into what goes on in ‘ratiocination’ did not provide a guide for a research program that could develop a +/- logic that actually describes how we reason deductively. I will argue that such a +/- logic provides a way back from modern predicate logic—the logic of quantifiers and bound variables that is now ‘standard logic’—to an Aristotelian term logic of natural language that had been the millennial standard logic. (shrink)

In previous articles, it has been shown that the deductive system developed by Aristotle in his "second logic" is a natural deduction system and not an axiomatic system as previously had been thought. It was also stated that Aristotle's logic is self-sufficient in two senses: First, that it presupposed no other logical concepts, not even those of propositional logic; second, that it is (strongly) complete in the sense that every valid argument expressible in the language of the system is (...) deducible by means of a formal deduction in the system. Review of the system makes the first point obvious. The purpose of the present article is to prove the second. Strong completeness is demonstrated for the Aristotelian system. (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)