The calculus of Natural Calculation is introduced as an extension of Natural Deduction by proper term rules. Such term rules provide the capacity of dealing directly with terms in the calculus instead of the usual reasoning based on equations, and therefore the capacity of a natural representation of informal mathematical calculations. Basic proof theoretic results are communicated, in particular completeness and soundness of the calculus; normalisation is briefly investigated. The philosophical impact on a proof theoretic account of (...) the notion of meaning is considered. (shrink)

During the cold war, Frank Fenner and Francis Ratcliffe studied mathematically the coevolution of host resistance and parasite virulence when myxomatosis was unleashed on Australia’s rabbit population. Later, Robert May called Fenner the “real hero” of disease ecology for his mathematical modeling of the epidemic. While Ratcliffe came from a tradition of animal ecology, Fenner developed an ecological orientation in World War II through his work on malaria control —that is, through studies of tropical medicine. This makes Fenner at least (...) a partial exception to other senior disease ecologists in the region, most of whom learned their ecology from examining responses to agricultural challenges and animal husbandry problems in settler colonial society. Here I consider the local ecologies of knowledge in southeastern Australia during this period, and describe the particular cold-war intellectual niche that Fenner and Ratcliffe inhabited. (shrink)

I offer a novel solution to Zeno’s paradox of The Arrow by introducing nilpotent infinitesimal lengths of time. Nilpotents are nonzero numbers that yield zero when multiplied by themselves a certain number of times. Zeno’s Arrow goes like this: during the present, a flying arrow is moving in virtue of its being in flight. However, if the present is a single point in time, then the arrow is frozen in place during that time. Therefore, the arrow is both moving and (...) at rest. In “Zeno’s Arrow, Divisible Infinitesimals, and Chrysippus,” White suggests using an infinitesimal value as the length of the present. Contra Zeno, this allows the arrow to be moving in the present, rather than frozen in place. In this paper, I follow the basic outline of White’s solution but argue that his solution suffers from arbitrariness and a related theoretical artificiality in relation to the system of infinitesimals he invokes, viz. in relation to the hyperreal infinitesimals of nonstandard analysis. After arguing that any solution to the paradox must satisfy certain theoretical requirements, I examine White’s solution alongside two nilpotent solutions. One of these solutions is inspired by F.W. Lawvere’s Smooth Infinitesimal Analysis and the other is inspired by Paolo Giordano’s ring of Fermat Reals. I argue that Giordano’s nilpotents supply the best answer to Zeno’s paradox. (shrink)

We study an expansion of the Distributive Non-associative Lambek Calculus with conjugates of the Lambek product operator and residuals of those conjugates. The resulting logic is well-motivated, under-investigated and difficult to tackle. We prove completeness for some of its fragments and establish that it is decidable. Completeness of the logic is an open problem; some difficulties with applying the usual proof method are discussed.

Provides computer science students and researchers with a firm background in lambda-calculus and combinators.

By way of a close reading of Boole and Frege’s solutions to the same logical problem, we highlight an underappreciated aspect of Boole’s work—and of its difference with Frege’s better-known approach—which we believe sheds light on the concepts of ‘calculus’ and ‘mechanization’ and on their history. Boole has a clear notion of a logical problem; for him, the whole point of a logical calculus is to enable systematic and goal-directed solution methods for such problems. Frege’s Begriffsschrift, on the (...) other hand, is a visual tool to scrutinize concepts and inferences, and is a calculus only in the thin sense that every possible transition between sentences is fully and unambiguously specified in advance. While Frege’s outlook has dominated much of philosophical thinking about logical symbolism, we believe there is value—particularly in light of recent interest in the role of notations in mathematics and logic—in reviving Boole’s idea of an intrinsic link between, as he put it, a ‘calculus’ and a ‘directive method’ to solve problems. (shrink)

In Anti-Oedipus, Gilles Deleuze and Félix Guattari maintain that nature is a process in which there is neither nature nor human being, except as a single reality produced in the processes of production, distribution and consumption, where distributions are immediately consumed and the consumptions immediately reproduced. In its historical realization, this is the process of capitalism, which must be an effect of such processes, processes of nature and human nature. This gives rise to this question: given the rules governing nature, (...) including human nature, how much contingency is there and how much determinism? And ultimately, is capitalism inevitable? (shrink)

The formalisation of Natural Language arguments in a formal language close to it in syntax has been a central aim of Moss’s Natural Logic. I examine how the Quantified Argument Calculus (Quarc) can handle the inferences Moss has considered. I show that they can be incorporated in existing versions of Quarc or in straightforward extensions of it, all within sound and complete systems. Moreover, Quarc is closer in some respects to Natural Language than are Moss’s systems – for instance, (...) is does not use negative nouns. The process also sheds light on formal properties and presuppositions of some inferences it formalises. Directions for future work are outlined. (shrink)

In this paper we consider the problem of the existence of a λ-theory T such that:–T is recursive enumerable;–the ω-rule holds in T .We solve affirmatively this problem.Some related questions are also discussed.

The epsilon calculus is a logical formalism developed by David Hilbert in the service of his program in the foundations of mathematics. The epsilon operator is a term-forming operator which replaces quantifiers in ordinary predicate logic. Specifically, in the calculus, a term εx A denotes some x satisfying A(x), if there is one. In Hilbert's Program, the epsilon terms play the role of ideal elements; the aim of Hilbert's finitistic consistency proofs is to give a procedure which removes (...) such terms from a formal proof. The procedures by which this is to be carried out are based on Hilbert's epsilon substitution method. The epsilon calculus, however, has applications in other contexts as well. The first general application of the epsilon calculus was in Hilbert's epsilon theorems, which in turn provide the basis for the first correct proof of Herbrand's theorem. More recently, variants of the epsilon operator have been applied in linguistics and linguistic philosophy to deal with anaphoric pronouns. (shrink)

Traditionally, “the operator calculus of Born and Wiener” has been considered one of the four formulations of quantum mechanics that existed in 1926. The present paper reviews the operator calculus as applied by Max Born and Norbert Wiener during the last months of 1925 and the early months of 1926 and its connections with the rise of the new quantum theory. Despite the relevance of this operator calculus, Born–Wiener’s joint contribution to the topic is generally bypassed in (...) historical accounts of quantum mechanics. In this study, we analyse the paper that epitomises the contribution, and we explain the main reasons for the apparent lack of interest in Born and Wiener’s work. We argue that they did not solve the main problem for which the tool was intended, that of linear motion, because of their reluctance to use Dirac delta functions. (shrink)

The aim of this chapter is to develop a semantics for Calculus CL. CL is a diagrammatic calculus based on a logic machine presented by Johann Christian Lange in 1714, which combines features of Euler-, Venn-type, tree diagrams, squares of oppositions etc. In this chapter, it is argued that a Boolean account of formal ontology in CL helps to deal with logical oppositions and inferences of extended syllogistics. The result is a combination of Lange’s diagrams with an algebraic (...) semantics of terms: Bit-CL, in which any ordered objects are identified by characteristic bitstrings. Then, a number of objections to Bit-CL are answered to, and the process of inference is explained in this new logical framework. (shrink)

We present our calculus of higher-level rules, extended with propositional quantification within rules. This makes it possible to present general schemas for introduction and elimination rules for arbitrary propositional operators and to define what it means that introductions and eliminations are in harmony with each other. This definition does not presuppose any logical system, but is formulated in terms of rules themselves. We therefore speak of a foundational account of proof-theoretic harmony. With every set of introduction rules a canonical (...) elimination rule, and with every set of elimination rules a canonical introduction rule is associated in such a way that the canonical rule is in harmony with the set of rules it is associated with. An example given by Hazen and Pelletier is used to demonstrate that there are significant connectives, which are characterized by their elimination rules, and whose introduction rule is the canonical introduction rule associated with these elimination rules. Due to the availabiliy of higher-level rules and propositional quantification, the means of expression of the framework developed are sufficient to ensure that the construction of canonical elimination or introduction rules is always possible and does not lead out of this framework. (shrink)

In the year 1714, Johann Christian Lange published a baroque textbook about a logic machine, supposed to simulate human cognitive abilities such as perception, judgement, and reasoning. From today’s perspective, it can be argued that this blueprint is based on an inference engine applied to a strict ontology which serves as a knowledge base. In this paper, I will first introduce Lange’s approach in the period of baroque logic and then present a diagrammatic modernization of Lange’s principles, entitled Calculus (...) CL. Finally, I would like to discuss the possibilities of how to apply CL to modern cases of concern by using an example from epidemiology. (shrink)

Traces the development of the integral and the differential calculus and related theories since ancient times.

The aim of this study is to look at the the syntactic calculus of Bar-Hillel and Lambek, including semantic interpretation, from the point of view of constructive type theory. The syntactic calculus is given a formalization that makes it possible to implement it in a type-theoretical proof editor. Such an implementation combines formal syntax and formal semantics, and makes the type-theoretical tools of automatic and interactive reasoning available in grammar.In the formalization, the use of the dependent types of (...) constructive type theory is essential. Dependent types are already needed in the semantics of ordinary Lambek calculus. But they also suggest some natural extensions of the calculus, which are applied to the treatment of morphosyntactic dependencies and to an analysis of selectional restrictions. Finally, directed dependent function types are introduced, corresponding to the types of constructive type theory. (shrink)

In the present article, we introduce a multi-type display calculus for dynamic epistemic logic, which we refer to as Dynamic Calculus. The display approach is suitable to modularly chart the space of dynamic epistemic logics on weaker-than-classical propositional base. The presence of types endows the language of the Dynamic Calculus with additional expressivity, allows for a smooth proof-theoretic treatment, and paves the way towards a general methodology for the design of proof systems for the generality of dynamic (...) logics, and certainly beyond dynamic epistemic logic. We prove that the Dynamic Calculus adequately captures Baltag–Moss–Solecki's dynamic epistemic logic, and enjoys Belnap-style cut elimination. (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)