In June 1888, Oliver Heaviside received by mail an officially unpublished pamphlet, which was written and printed by the American author Willard J. Gibbs around 1881–1884. This original document is preserved in the Dibner Library of the History of Science and Technology at the Smithsonian Institute in Washington DC. Heaviside studied Gibbs’s work very carefully and wrote some annotations in the margins of the booklet. He was a strong defender of Gibbs’s work on vector analysis against quaternionists, even if he (...) criticised Gibbs’s notation system. The aim of our paper is to analyse Heaviside’s annotations and to investigate the role played by the American physicist in the development of Heaviside’s work. (shrink)

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

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.

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)

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)

The λμ-calculus is an extension of the λ-calculus that has been introduced by M Parigot to give an algorithmic content to classical proofs. We show that Bohm's theorem fails in this calculus.

After the publication of Begriffsschrift, a conflict erupted between Frege and Schröder regarding their respective logical systems which emerged around the Leibnizian notions of lingua characterica and calculus ratiocinator. Both of them claimed their own logic to be a better realisation of Leibniz’s ideal language and considered the rival system a mere calculus ratiocinator. Inspired by this polemic, van Heijenoort (1967b) distinguished two conceptions of logic—logic as language and logic as calculus—and presented them as opposing views, but (...) did not explain Frege’s and Schröder’s conceptions of the fulfilment of Leibniz’s scientific ideal. -/- In this paper I explain the reasons for Frege’s and Schröder’s mutual accusations of having created a mere calculus ratiocinator. On the one hand, Schröder’s construction of the algebra of relatives fits with a project for the reduction of any mathematical concept to the notion of relative. From this stance I argue that he deemed the formal system of Begriffsschrift incapable of such a reduction. On the other hand, first I argue that Frege took Boolean logic to be an abstract logical theory inadequate for the rendering of specific content; then I claim that the language of Begriffsschrift did not constitute a complete lingua characterica by itself, more being seen by Frege as a tool that could be applied to scientific disciplines. Accordingly, I argue that Frege’s project of constructing a lingua characterica was not tied to his later logicist programme. (shrink)

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)

We introduce a two-valued and a three-valued truth-valuational substitutional semantics for the Quantified Argument Calculus (Quarc). We then prove that the 2-valid arguments are identical to the 3-valid ones with strict-to-tolerant validity. Next, we introduce a Lemmon-style Natural Deduction system and prove the completeness of Quarc on both two- and three-valued versions, adapting Lindenbaum’s Lemma to truth-valuational semantics. We proceed to investigate the relations of three-valued Quarc and the Predicate Calculus (PC). Adding a logical predicate T to Quarc, (...) true of all singular arguments, allows us to represent PC quantification in Quarc and translate PC into Quarc, preserving validity. Introducing a weak existential quantifier into PC allows us to translate Quarc into PC, also preserving validity. However, unlike the translated systems, neither extended system can have a sound and complete proof system with Cut, supporting the claim that these are basically different calculi. (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)

Although Aristotle (Metaphysics, Book IV, Chapter 2) was perhaps the first person to consider the part-whole relationship to be a proper subject matter for philosophic inquiry, the Polish logician Stanislow Lesniewski [15] is generally given credit for the first formal treatment of the subject matter in his Mereology.1 Woodger [30] and Tarski [24] made use of a specific adaptation of Lesniewski's work as a basis for a formal theory of physical things and their parts. The term 'calculus of individuals' (...) was introduced by Leonard and Goodman [14] in their presentation of a system very similar to Tarski's adaptation of Lesniewski's Mereology. Contemporaneously with Lesniewski's development of his Mereology, Whitehead [27] and [28] was developing a theory of extensive abstraction based on the two-place predicate, 'x extends over y\ which is the converse of 'x is a part of y\ This system, according to Russell [22], was to have been the fourth volume of their Pήncipia Mathematica, the never-published volume on geometry. Both Lesniewski [15] and Tarski [25] have recognized the similarities between Whitehead's early work and Lesniewski's Mereology. Between the publication of Whitehead's early work and the publication of Process and Reality [29], Theodore de Laguna [7] published a suggestive alternative basis for Whitehead's theory. This led Whitehead, in Process and Reality, to publish a revised form of his theory based on the two-place predicate, 'x is extensionally connected with y\ It is the purpose of this paper to present a calculus of individuals based on this new Whiteheadian primitive predicate. (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)

In this paper, we propose a new method to deal with continuously varying quantity in the situation calculus based on the concept of the nonstandard analysis. The essential point of the method is to devise a new model called nonstandard situation calculus, which is an interpretation of the situation calculus in the set of hyperreals. This nonstandard model allows discrete but uncountable (hyperfinite) state transition, so that we can describe and reason about the continuous dynamics which are (...) usually treated with differential equations. In this enlarged perspective of the nonstandard situation calculus, we discuss about an infinitesimal action, infinite plan and an abnormality theory for the temporal prediction based on the differentiability. (shrink)