We introduce an effective translation from proofs in the display calculus to proofs in the labelled calculus in the context of tense logics. We identify the labelled calculus proofs in the image of this translation as those built from labelled sequents whose underlying directed graph possesses certain properties. For the basic normal tense logic Kt, the image is shown to be the set of all proofs in the labelled calculus G3Kt.

This thesis introduces the "method of structural refinement", which serves as a means of transforming the relational semantics of a modal and/or constructive logic into an 'economical' proof system by connecting two proof-theoretic paradigms: labelled and nested sequent calculi. The formalism of labelled sequents has been successful in that cut-free calculi in possession of desirable proof-theoretic properties can be automatically generated for large classes of logics. Despite these qualities, labelled systems make use of a complicated syntax that (...) explicitly incorporates the semantics of the associated logic, and such systems typically violate the subformula property to a high degree. By contrast, nested sequent calculi employ a simpler syntax and adhere to a strict reading of the subformula property, making such systems useful in the design of automated reasoning algorithms. However, the downside of the nested sequent paradigm is that a general theory concerning the automated construction of such calculi (as in the labelled setting) is essentially absent, meaning that the construction of nested systems and the confirmation of their properties is usually done on a case-by-case basis. The refinement method connects both paradigms in a fruitful way, by transforming labelled systems into nested (or, refined labelled) systems with the properties of the former preserved throughout the transformation process. To demonstrate the method of refinement and some of its applications, we consider grammar logics, first-order intuitionistic logics, and deontic STIT logics. The introduced refined labelled calculi will be used to provide the first proof-search algorithms for deontic STIT logics. Furthermore, we employ our refined labelled calculi for grammar logics to show that every logic in the class possesses the effective Lyndon interpolation property. (shrink)

This paper shows how to derive nested calculi from labelled calculi for propositional intuitionistic logic and first-order intuitionistic logic with constant domains, thus connecting the general results for labelled calculi with the more refined formalism of nested sequents. The extraction of nested calculi from labelled calculi obtains via considerations pertaining to the elimination of structural rules in labelled derivations. Each aspect of the extraction process is motivated and detailed, showing that each nested calculus inherits favorable (...) proof-theoretic properties from its associated labelled calculus. (shrink)

We introduce translations between display calculus proofs and labeled calculus proofs in the context of tense logics. First, we show that every derivation in the display calculus for the minimal tense logic Kt extended with general path axioms can be effectively transformed into a derivation in the corresponding labeled calculus. Concerning the converse translation, we show that for Kt extended with path axioms, every derivation in the corresponding labeled calculus can be put into a special (...) form that is translatable to a derivation in the associated display calculus. A key insight in this converse translation is a canonical representation of display sequents as labeled polytrees. Labeled polytrees, which represent equivalence classes of display sequents modulo display postulates, also shed light on related correspondence results for tense logics. (shrink)

We employ a recently developed methodology -- called "structural refinement" -- to extract nested sequent systems for a sizable class of intuitionistic modal logics from their respective labelled sequent systems. This method can be seen as a means by which labelled sequent systems can be transformed into nested sequent systems through the introduction of propagation rules and the elimination of structural rules, followed by a notational translation. The nested systems we obtain incorporate propagation rules that are parameterized with (...) formal grammars, and which encode certain frame conditions expressible as first-order Horn formulae that correspond to a subclass of the Scott-Lemmon axioms. We show that our nested systems are sound, cut-free complete, and admit hp-admissibility of typical structural rules. (shrink)

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

De Finetti would claim that we can make sense of a draw in which each positive integer has equal probability of winning. This requires a uniform probability distribution over the natural numbers, violating countable additivity. Countable additivity thus appears not to be a fundamental constraint on subjective probability. It does, however, seem mandated by Dutch Book arguments similar to those that support the other axioms of the probability calculus as compulsory for subjective interpretations. These two lines of reasoning can (...) be reconciled through a slight generalization of the Dutch Book framework. Countable additivity may indeed be abandoned for de Finetti's lottery, but this poses no serious threat to its adoption in most applications of subjective probability. Introduction The de Finetti lottery Two objections to equiprobability 3.1 The ‘No random mechanism’ argument 3.2 The Dutch Book argument Equiprobability and relative betting quotients The re-labelling paradox 5.1 The paradox 5.2 Resolution: from symmetry to relative probability Beyond the de Finetti lottery. (shrink)

Harold Brown has written an ambitious work, which traces the formation of concepts in individuals and cultures, examines case studies of concepts in calculus, mathematics, biology and related fields, summarises important philosophical works on the theory of concepts, and seeks to reconcile scientific realism with conceptual change. Brown considers himself a scientific realist but concedes that this very label is one that depends on a long history of concepts that came before, and may indeed be superseded as conceptual change (...) continues. Yet, concepts are not strictly relative to their contexts. ‘‘The usual claim is that truth is relative – period; and this claim assumes a non-relativized truth-concept’’ (p. 309). Crucial to his goal of developing a theory of concepts is how Brown reconciles conceptual change with objectivity. (shrink)

We show how removing faith-based beliefs in current philosophies of classical and constructive mathematics admits formal, evidence-based, definitions of constructive mathematics; of a constructively well-defined logic of a formal mathematical language; and of a constructively well-defined model of such a language. -/- We argue that, from an evidence-based perspective, classical approaches which follow Hilbert's formal definitions of quantification can be labelled `theistic'; whilst constructive approaches based on Brouwer's philosophy of Intuitionism can be labelled `atheistic'. -/- We then adopt (...) what may be labelled a finitary, evidence-based, `agnostic' perspective and argue that Brouwerian atheism is merely a restricted perspective within the finitary agnostic perspective, whilst Hilbertian theism contradicts the finitary agnostic perspective. -/- We then consider the argument that Tarski's classic definitions permit an intelligence---whether human or mechanistic---to admit finitary, evidence-based, definitions of the satisfaction and truth of the atomic formulas of the first-order Peano Arithmetic PA over the domain N of the natural numbers in two, hitherto unsuspected and essentially different, ways. -/- We show that the two definitions correspond to two distinctly different---not necessarily evidence-based but complementary---assignments of satisfaction and truth to the compound formulas of PA over N. -/- We further show that the PA axioms are true over N, and that the PA rules of inference preserve truth over N, under both the complementary interpretations; and conclude some unsuspected constructive consequences of such complementarity for the foundations of mathematics, logic, philosophy, and the physical sciences. -/- . (shrink)

We argue that the universal recommendations against “off-label” pediatric use of approved COVID-19 issued by the FDA, CDC, and AAP are overbroad. Especially for higher-risk children, vaccination can be ethically justified even before FDA authorization or approval – and similar reasoning is relevant for even younger patients. Legal risks can also be managed, although the FDA, CDC, and Department of Health and Human Services (HHS) should move quickly to provide clarity.

In this paper we introduce a Gentzen calculus for (a functionally complete variant of) Belnap's logic in which establishing the provability of a sequent in general requires \emph{two} proof trees, one establishing that whenever all premises are true some conclusion is true and one that guarantees the falsity of at least one premise if all conclusions are false. The calculus can also be put to use in proving that one statement \emph{necessarily approximates} another, where necessary approximation is a (...) natural dual of entailment. The calculus, and its tableau variant, not only capture the classical connectives, but also the `information' connectives of four-valued Belnap logics. This answers a question by Avron. (shrink)

The derivative is a basic concept of differential calculus. However, if we calculate the derivative as change in distance over change in time, the result at any instant is 0/0, which seems meaningless. Hence, Newton and Leibniz used the limit to determine the derivative. Their method is valid in practice, but it is not easy to intuitively accept. Thus, this article describes the novel method of differential calculus based on the double contradiction, which is easier to accept intuitively. (...) Next, the geometrical meaning of the double contradiction is considered as follows. A tangent at a point on a convex curve is iterated. Then, the slope of the tangent at the point is sandwiched by two kinds of lines. The first kind of line crosses the curve at the original point and a point to the right of it. The second kind of line crosses the curve at the original point and a point to the left of it. Then, the double contradiction can be applied, and the slope of the tangent is determined as a single value. Finally, the meaning of this method for the foundation of mathematics is considered. We reflect on Dehaene’s notion that the foundation of mathematics is based on the intuitions, which evolve independently. Hence, there may be gaps between intuitions. In fact, the Ancient Greeks identified inconsistency between arithmetic and geometry. However, Eudoxus developed the theory of proportion, which is equivalent to the Dedekind Cut. This allows the iteration of an irrational number by rational numbers as precisely as desired. Simultaneously, we can define the irrational number by the double contradiction, although its existence is not guaranteed. Further, an area of a curved figure is iterated and defined by rectilinear figures using the double contradiction. (shrink)

In recent years, the e ffort to formalize erotetic inferences (i.e., inferences to and from questions) has become a central concern for those working in erotetic logic. However, few have sought to formulate a proof theory for these inferences. To fill this lacuna, we construct a calculus for (classes of) sequents that are sound and complete for two species of erotetic inferences studied by Inferential Erotetic Logic (IEL): erotetic evocation and regular erotetic implication. While an attempt has been made (...) to axiomatize the former in a sequent system, there is currently no proof theory for the latter. Moreover, the extant axiomatization of erotetic evocation fails to capture its defeasible character and provides no rules for introducing or eliminating question-forming operators. In contrast, our calculus encodes defeasibility conditions on sequents and provides rules governing the introduction and elimination of erotetic formulas. We demonstrate that an elimination theorem holds for a version of the cut rule that applies to both declarative and erotetic formulas and that the rules for the axiomatic account of question evocation in IEL are admissible in our system. (shrink)

The basic idea is to put qualia into equations (broadly understood) to get what might as well be called qualations. Qualations arguably have different truth behaviors than the analogous equations. Thus ‘black’ has a different behavior than ‘ █ ’. This is a step in the direction of a ‘calculus of qualia’. It might help clarify some issues.

John Venn has the “uneasy suspicion” that the stagnation in mathematical logic between J. H. Lambert and George Boole was due to Kant’s “disastrous effect on logical method,” namely the “strictest preservation [of logic] from mathematical encroachment.” Kant’s actual position is more nuanced, however. In this chapter, I tease out the nuances by examining his use of Leonhard Euler’s circles and comparing it with Euler’s own use. I do so in light of the developments in logical calculus from G. (...) W. Leibniz to Lambert and Gottfried Ploucquet. While Kant is evidently open to using mathematical tools in logic, his main concern is to clarify what mathematical tools can be used to achieve. For without such clarification, all efforts at introducing mathematical tools into logic would be blind if not complete waste of time. In the end, Kant would stress, the means provided by formal logic at best help us to express and order what we already know in some sense. No matter how much mathematical notations may enhance the precision of this function of formal logic, it does not change the fact that no truths can, strictly speaking, be revealed or established by means of those notations. (shrink)

The idea of this paper is to put actual qualia into equations (broadly understood) to get what might be called qualations. Qualations arguably have different meanings and truth behaviors than the analogous equations. For example, the term ‘ black ’ arguably has a different meaning and behavior than the term ‘ █ ’. This is a step in the direction of a ‘calculus of qualia’ and of expanding science to include 1st-person phenomena.

A new proof style adequate for modal logics is defined from the polynomial ring calculus. The new semantics not only expresses truth conditions of modal formulas by means of polynomials, but also permits to perform deductions through polynomial handling. This paper also investigates relationships among the PRC here defined, the algebraic semantics for modal logics, equational logics, the Dijkstra???Scholten equational-proof style, and rewriting systems. The method proposed is throughly exemplified for S 5, and can be easily extended to other (...) modal logics. (shrink)

I am presenting a sequent calculus that extends a nonmonotonic consequence relation over an atomic language to a logically complex language. The system is in line with two guiding philosophical ideas: (i) logical inferentialism and (ii) logical expressivism. The extension defined by the sequent rules is conservative. The conditional tracks the consequence relation and negation tracks incoherence. Besides the ordinary propositional connectives, the sequent calculus introduces a new kind of modal operator that marks implications that hold monotonically. Transitivity (...) fails, but for good reasons. Intuitionism and classical logic can easily be recovered from the system. (shrink)

In their paper Nothing but the Truth Andreas Pietz and Umberto Rivieccio present Exactly True Logic, an interesting variation upon the four-valued logic for first-degree entailment FDE that was given by Belnap and Dunn in the 1970s. Pietz & Rivieccio provide this logic with a Hilbert-style axiomatisation and write that finding a nice sequent calculus for the logic will presumably not be easy. But a sequent calculus can be given and in this paper we will show that a (...) calculus for the Belnap-Dunn logic we have defined earlier can in fact be reused for the purpose of characterising ETL, provided a small alteration is made—initial assignments of signs to the sentences of a sequent to be proved must be different from those used for characterising FDE. While Pietz & Rivieccio define ETL on the language of classical propositional logic we also study its consequence relation on an extension of this language that is functionally complete for the underlying four truth values. On this extension the calculus gets a multiple-tree character—two proof trees may be needed to establish one proof. (shrink)

Hilbert's ε-calculus is based on an extension of the language of predicate logic by a term-forming operator εx. Two fundamental results about the ε-calculus, the first and second epsilon theorem, play a rôle similar to that which the cut-elimination theorem plays in sequent calculus. In particular, Herbrand's Theorem is a consequence of the epsilon theorems. The paper investigates the epsilon theorems and the complexity of the elimination procedure underlying their proof, as well as the length of Herbrand (...) disjunctions of existential theorems obtained by this elimination procedure. (shrink)

This paper examines systematically which features of a life story (or history) make it good for the subject herself - not aesthetically or morally good, but prudentially good. The tentative narrative calculus presented claims that the prudential narrative value of an event is a function of the extent to which it contributes to her concurrent and non-concurrent goals, the value of those goals, and the degree to which success in reaching the goals is deserved in virtue of exercising agency. (...) The narrative value of a life is a simple sum of the values of individual events that comprise it. I claim that this view best explains and support common intuitions about the significance of the shape of a life. (shrink)

In this paper I will develop a lambda-term calculus, lambda-2Int, for a bi-intuitionistic logic and discuss its implications for the notions of sense and denotation of derivations in a bilateralist setting. Thus, I will use the Curry-Howard correspondence, which has been well-established between the simply typed lambda-calculus and natural deduction systems for intuitionistic logic, and apply it to a bilateralist proof system displaying two derivability relations, one for proving and one for refuting. The basis will be the natural (...) deduction system of Wansing's bi-intuitionistic logic 2Int, which I will turn into a term-annotated form. Therefore, we need a type theory that extends to a two-sorted typed lambda-calculus. I will present such a term-annotated proof system for 2Int and prove a Dualization Theorem relating proofs and refutations in this system. On the basis of these formal results I will argue that this gives us interesting insights into questions about sense and denotation as well as synonymy and identity of proofs from a bilateralist point of view. (shrink)

The purpose of this paper is to outline an alternative approach to introductory logic courses. Traditional logic courses usually focus on the method of natural deduction or introduce predicate calculus as a system. These approaches complicate the process of learning different techniques for dealing with categorical and hypothetical syllogisms such as alternate notations or alternate forms of analyzing syllogisms. The author's approach takes up observations made by Dijkstrata and assimilates them into a reasoning process based on modified notations. The (...) author's model adopts a notation that addresses the essentials of a problem while remaining easily manipulated to serve other analytic frameworks. The author also discusses the pedagogical benefits of incorporating the model into introductory logic classes for topics ranging from syllogisms to predicate calculus. Since this method emphasizes the development of a clear and manipulable notation, students can worry less about issues of translation, can spend more energy solving problems in the terms in which they are expressed, and are better able to think in abstract terms. (shrink)

This paper aims to address the difficulties of high school students in bridging their computational understanding with their visualization skills in understanding the notion of the limits in their calculus class. This research used a pre-experimental one-group pretest-posttest design research on 62 grade 10 students enrolled in the Science, Technology, and Engineering Program (STEP) in one of the public high schools in Zamboanga del Sur, Philippines. A series of remedial sessions were given to help them understand the function values, (...) one-sided limits, limits of a function, and its discontinuities with the aid of the GeoGebra. Results revealed that there is a significant improvement in their mathematics performance before and after the remediation, t(61) = -19.99, p<.05. The real-time feedback provided by the drawing interface of GeoGebra has provided the students the insights into how objects behave in geometrical space, bridging their understanding in locating the values shown by the computational algebraic processes. Additionally, the significant difference in the achievement reveals a large effect size (Cohen’s =2.54) which could be accounted for by the remediation using interactive activities in the GeoGebra. (shrink)

The purpose of this paper is to introduce a bi-intuitionistic sequent calculus and to give proofs of admissibility for its structural rules. The calculus I will present, called SC2Int, is a sequent calculus for the bi-intuitionistic logic 2Int, which Wansing presents in [2016a]. There he also gives a natural deduction system for this logic, N2Int, to which SC2Int is equivalent in terms of what is derivable. What is important is that these calculi represent a kind of bilateralist (...) reasoning, since they do not only internalize processes of verifcation or provability but also the dual processes in terms of falsifcation or what is called dual provability. In [Wansing, 2017] a normal form theorem for N2Int is stated, here, I want to prove a cut-elimination theorem for SC2Int, i.e., if successful, this would extend the results existing so far. (shrink)

To explore the extent of embeddability of Leibnizian infinitesimal calculus in first-order logic (FOL) and modern frameworks, we propose to set aside ontological issues and focus on pro- cedural questions. This would enable an account of Leibnizian procedures in a framework limited to FOL with a small number of additional ingredients such as the relation of infinite proximity. If, as we argue here, first order logic is indeed suitable for developing modern proxies for the inferential moves found in Leibnizian (...) infinitesimal calculus, then modern infinitesimal frameworks are more appropriate to interpreting Leibnizian infinitesimal calculus than modern Weierstrassian ones. (shrink)

One of the core insights from Eleanor Rosch’s work on categorization is that human categorization isn’t arbitrary. Instead, two psychological principles constrain possible systems of classification for all human cultures. According to these principles, the task of a category system is to provide maximum information with the least cognitive effort, and the perceived world provides us with structured rather than arbitrary features. In this paper, I show that Rosch's insights give us important resources for making progress on the 'feasibility question' (...) in conceptual engineering: the question of how we can implement conceptual engineering projects in ways that are practically feasible. Specifically, I show that one overlooked upshot of Rosch's work is that naming practices play an extremely important role in the construction of perceived similarities within and dissimilarities between categories, and, correspondingly, the dissemination of social stereotypes that serve as markers between different categories that are otherwise similar. Thus, naming practices will be a crucial constraint for the feasibility of certain ameliorative projects. (shrink)

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)

This note is based on a lecture delivered at the Conference on the Scien- tic Research of the Mathematical Center of Opole, Turawa, May 10-11th, 1980. A somewhat extended version will be published in the Proceedings of the Conference. At the same time it is an abstract of a part of a planned larger paper, which will involve the theory of label-tokens. The theory is included into the author's monograph in Polish "Teorie Językow Syntaktycznie Kategorialnych", PWN, Warszawa-Wrocław 1985 and into (...) its English version: Theory of Language Syntax. Categorial Approach, Kluwer Academic Publishers, Boston-London-Dordrecht 1991. (shrink)

It is fair to say that Georg Wilhelm Friedrich Hegel's philosophy of mathematics and his interpretation of the calculus in particular have not been popular topics of conversation since the early part of the twentieth century. Changes in mathematics in the late nineteenth century, the new set-theoretical approach to understanding its foundations, and the rise of a sympathetic philosophical logic have all conspired to give prior philosophies of mathematics (including Hegel's) the untimely appearance of naïveté. The common view was (...) expressed by Bertrand Russell: -/- The great [mathematicians] of the seventeenth and eighteenth centuries were so much impressed by the results of their new methods that they did not trouble to examine their foundations. Although their arguments were fallacious, a special Providence saw to it that their conclusions were more or less true. Hegel fastened upon the obscurities in the foundations of mathematics, turned them into dialectical contradictions, and resolved them by nonsensical syntheses. . . .The resulting puzzles [of mathematics] were all cleared up during the nineteenth century, not by heroic philosophical doctrines such as that of Kant or that of Hegel, but by patient attention to detail (1956, 368–69). (shrink)

In this essay, I analyse Howard S. Becker's labelling theory, using Wittgenstein and Foucault to argue that it has significant explanatory power in describing what I term "the hegemonic power of the label". Much of this essay hints at my general thought with regards hegemony at the level of interaction and language. Final grade was first class honours, 2,000 word limit. -/- The ideas expressed herein have matured significantly since. I am working on a quantitative study with my University to (...) analyse the ability of Becker's labelling theory (plus some ideas of my own) to explain the exact process of the social construction of age. I am also working on a revision of the theory of hegemony, of which includes analysis of hegemony at an interactive/linguistic level, which is heavily influenced by Becker's and Wittgenstein's thought. (shrink)

Even though it is not very often admitted, partial functions do play a significant role in many practical applications of deduction systems. Kleene has already given a semantic account of partial functions using a three-valued logic decades ago, but there has not been a satisfactory mechanization. Recent years have seen a thorough investigation of the framework of many-valued truth-functional logics. However, strong Kleene logic, where quantification is restricted and therefore not truthfunctional, does not fit the framework directly. We solve this (...) problem by applying recent methods from sorted logics. This paper presents a tableau calculus that combines the proper treatment of partial functions with the efficiency of sorted calculi. (shrink)

We provide a logical matrix semantics and a Gentzen-style sequent calculus for the first-degree entailments valid in W. T. Parry’s logic of Analytic Implication. We achieve the former by introducing a logical matrix closely related to that inducing paracomplete weak Kleene logic, and the latter by presenting a calculus where the initial sequents and the left and right rules for negation are subject to linguistic constraints.

All first-order Gödel logics G_V with globalization operator based on truth value sets V C [0,1] where 0 and 1 lie in the perfect kernel of V are axiomatized by Ciabattoni’s hypersequent calculus HGIF.

This paper challenges the negative attitudes towards labelled proof systems, usually referred to as semantic pollution, by arguing that such critiques overlook the full potential of labelled calculi. The overarching objective is to develop a practice-based philosophical analysis of labelled calculi to provide insightful considerations regarding their proof-theoretic and philosophical value. To achieve this, successful applications of labelled calculi and related results will be showcased, and comparisons with other relevant works will be discussed. The paper ends (...) by advocating for a more practice-based approach towards the philosophical understanding of proof systems and their role in structural proof theory. (shrink)

It is well known that the circumflex notation used by Russell and Whitehead to form complex function names in Principia Mathematica played a role in inspiring Alonzo Church's “lambda calculus” for functional logic developed in the 1920s and 1930s. Interestingly, earlier unpublished manuscripts written by Russell between 1903–1905—surely unknown to Church—contain a more extensive anticipation of the essential details of the lambda calculus. Russell also anticipated Schönfinkel's combinatory logic approach of treating multiargument functions as functions having other functions (...) as value. Russell’s work in this regard seems to have been largely inspired by Frege’s theory of functions and “value-ranges”. This system was discarded by Russell due to his abandonment of propositional functions as genuine entities as part of a new tack for solving Russell’s paradox. In this article, I explore the genesis and demise of Russell’s early anticipation of the lambda calculus. (shrink)

The aim of this paper is to explore the uses made of the calculus by Gilles Deleuze and G. W. F. Hegel. I show how both Deleuze and Hegel see the calculus as providing a way of thinking outside of finite representation. For Hegel, this involves attempting to show that the foundations of the calculus cannot be thought by the finite understanding, and necessitate a move to the standpoint of infinite reason. I analyse Hegel’s justification for this (...) introduction of dialectical reason by looking at his responses to Berkeley’s criticisms of the calculus. For Deleuze, instead, I show that the differential must be understood as escaping from both finite and infinite representation. By highlighting the sub-representational character of the differential in his system, I show how the differential is a key moment in Deleuze’s formulation of a transcendental empiricism. I conclude by dealing with some of the common misunderstandings that occur when Deleuze is read as endorsing a modern mathematical interpretation of the calculus. (shrink)

The deductive validity of arguments from analogy is formally demonstrable. After a brief survey of the historical development of doctrines relevant to this claim the present article analyzes the “analogy of proper proportionality”, which meets two requirements of valid deduction. First, the referents of analogues by proportionality must belong to a common genus. Here it must be cautioned, however, that the common genus does not constitute the basis of the deductive inference. Rather, it is a prerequisite for the second and (...) decisive requirement, that the different logical content to which an analogous middle term corresponds must exhibit the same proportional relation to this common genus. In Section II I translate a natural language argument with such an analogous middle term into the language of classical first-order predicate calculus, and show that its conclusion follows from its premises with the force of deductive necessity. The rule of inference justifying the analogical entailment of the conclusion from the premises functions much like the familiar modus ponens rule, and could be called “modus ponens analogice”. The validity of this rule ought to be judged on the same basis as that of the traditional modus ponens rule – immediate logical intuition. The present article endeavors to facilitate this logical intuition by making the logical structure of inference by analogy formally explicit. (shrink)

Application 1. The case against Materialism and Illusionism Application 2. Ineffability Application 3. Hard Problems Application 4. Knowledge Argument questions Application 5. Argument for A-theories of time Application 6. Possible qualia are necessary.

The paper is an introduction to geometric algebra and geometric calculus for those with a knowledge of undergraduate mathematics. No knowledge of physics is required. The section Further Study lists many papers available on the web.

Drug regulation is fraught with inductive risk. Regulators must make a prediction about whether or not an experimental pharmaceutical will be effective and relatively safe when used by typical patients, and such predictions are based on a complex, indeterminate, and incomplete evidential basis. Such inductive risk has important practical consequences. If regulators reject an experimental drug when it in fact has a favourable benefit/harm profile, then a valuable intervention is denied to the public and a company’s material interests are needlessly (...) thwarted. Conversely, if regulators approve an experimental drug when it in fact has an unfavourable benefit/harm profile, then resources are wasted, people are needlessly harmed, and other potentially more effective treatments are underutilized. Given that such regulatory decisions have these practical consequences, non-epistemic values about the relative importance of these consequences impact the way such regulatory decisions are made (similar to the analysis of laboratory studies on the toxic effects of dioxins presented in Douglas [2000]). To balance the competing demands of the pertinent non-epistemic values, regulators must perform what I call an “inductive risk calculus.” At least in the American context this inductive risk calculus is not well-managed. (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)

Vector models of language are based on the contextual aspects of language, the distributions of words and how they co-occur in text. Truth conditional models focus on the logical aspects of language, compositional properties of words and how they compose to form sentences. In the truth conditional approach, the denotation of a sentence determines its truth conditions, which can be taken to be a truth value, a set of possible worlds, a context change potential, or similar. In the vector models, (...) the degree of co-occurrence of words in context determines how similar the meanings of words are. In this paper, we put these two models together and develop a vector semantics for language based on the simply typed lambda calculus models of natural language. We provide two types of vector semantics: a static one that uses techniques familiar from the truth conditional tradition and a dynamic one based on a form of dynamic interpretation inspired by Heim’s context change potentials. We show how the dynamic model can be applied to entailment between a corpus and a sentence and provide examples. (shrink)

Recent studies have explored the effectiveness of open-label placebos for a variety of conditions, including chronic pain, cancer-related fatigue and irritable bowel syndrome. OLPs are thought to sidestep traditional ethical worries about placebos because they do not involve deception: with an OLP, patients or subjects are told outright that they are not given an active substance. As deception is framed as the primary hurdle to ethical placebo use, the door is ostensibly opened to ethical studies of OLPs. In this article, (...) I suggest that even though OLPs seemingly do not involve deception, there are other ethical considerations in their clinical investigation and subsequent use. Research ethics often focusses on informed consent—of which, deception and honesty are a piece—as a means to justify research practices with human subjects. Yet, it is but one of the ethical considerations that should be taken into account. With research into placebo effects in particular, I argue that the history of clinical placebo use grounds special considerations for OLP research that go beyond respect for the autonomy of individual patients through informed consent and encompass structural concerns about the type of patient for whom a placebo has historically been thought appropriate. (shrink)

This paper discusses the following question: why was the term “dunatos” (“possible”) employed by Aristotle as an alternative label for imperfect syllogisms in his discussion of assertoric syllogistic? My answer ascribes to Aristotle a bottom up perspective, in which he stresses what is necessary in the premise-pairs to attain target conclusions of a given form within a given figure. I argue that “dunatos” is employed by Aristotle to stress that an imperfect syllogism is always one of the possible options to (...) attain a conclusion of a given form within a given figure. I also argue that this picture sheds some light on Aristotle’s clarifications of the final clause in his definition of syllogism. (shrink)

Expressivism in logic is the view that logical vocabulary plays a primarily expressive role: that is, that logical vocabulary makes perspicuous in the object language structural features of inference and incompatibility (Brandom, 1994, 2008). I present a precise, technical criterion of expressivity for a logic (§2). I next present a logic that meets that criterion (§3). I further explore some interesting features of that logic: first, a representation theorem for capturing other logics (§3.1), and next some novel logical vocabulary for (...) expressing structural features of inference (§4). (shrink)

Leibniz proposed the ‘Most Determined Path Principle’ in seventeenth century. According to it, ‘ease’ of travel is the end purpose of motion. Using this principle and his calculus method he demonstrated Snell’s Laws of reflection and refraction. This method shows that light follows extremal (local minimum or maximum) time path in going from one point to another, either directly along a straight line path or along a broken line path when it undergoes reflection or refraction at plane or spherical (...) (concave or convex) surfaces. The extremal time path avoided the criticism that Fermat’s least time path was subjected to, by Cartesians who cited examples of reflections at spherical surfaces where light took the path of longest time. Thereby it became the standard method of demonstration of Snell’s Laws. Ptolemy’s theorem is a fundamental theorem in geometry. A special case of it offers a method of finding the minimum sum of the two distances of a point from two given fixed points. We show in this paper that Leibniz’s calculus proof of Snell’s Laws violates Ptolemy’s theorem, whereby Leibniz’s proof becomes invalid. (shrink)

We extend Barbanera and Berardi's symmetric lambda calculus [2] to second-order classical propositional logic and prove its strong normalization.