We present a proof system for a multimode and multimodal logic, which is based on our previous work on modal Martin-Löf type theory. The specification of modes, modalities, and implications between them is given as a mode theory, i.e., a small 2-category. The logic is extended to a lambda calculus, establishing a Curry–Howard correspondence.

After discussing the limitations inherent to all set-theoretic reflection principles akin to those studied by A. Lévy et. al. in the 1960s, we introduce new principles of reflection based on the general notion of Structural Reflection and argue that they are in strong agreement with the conception of reflection implicit in Cantor’s original idea of the unknowability of the Absolute, which was subsequently developed in the works of Ackermann, Lévy, Gödel, Reinhardt, and others. We then present a comprehensive survey of results showing that different forms of the new principle of Structural Reflection are equivalent to well-known large cardinal axioms covering all regions of the large-cardinal hierarchy, thereby justifying the naturalness of the latter.

We investigate an approach for drawing logical inference from inconsistent premisses. The main idea in this approach is that the inconsistencies in the premisses should be interpreted as uncertainty of the information. We propose a mechanism, based on Kinght’s [14] study of inconsistency, for revising an inconsistent set of premisses to a minimally uncertain, probabilistically consistent one. We will then generalise the probabilistic entailment relation introduced in [15] for propositional languages to the first order case to draw logical inference from a probabilistic set of premisses. We will show how this combination can allow us to limit the effect of uncertainty introduced by inconsistent premisses to only the reasoning on the part of the premise set that is relevant to the inconsistency.

Kristiansen and Murwanashyaka recently proved that Robinson arithmetic, Q, is interpretable in an elementary theory of full binary trees, T. We prove that, conversely, T is interpretable in Q by producing a formal interpretation of T in an elementary concatenation theory QT+, thereby also establishing mutual interpretability of T with several well-known weak essentially undecidable theories of numbers, strings, and sets. We also introduce a “hybrid” elementary theory of strings and trees, WQT*, and establish its mutual interpretability with Robinson’s weak arithmetic R, the weak theory of trees WT of Kristiansen and Murwanashyaka, and the weak concatenation theory WTCε of Higuchi and Horihata.

The use of the symbol $\mathbin {\boldsymbol {\vee }}$ for disjunction in formal logic is ubiquitous. Where did it come from? The paper details the evolution of the symbol $\mathbin {\boldsymbol {\vee }}$ in its historical and logical context. Some sources say that disjunction in its use as connecting propositions or formulas was introduced by Peano; others suggest that it originated as an abbreviation of the Latin word for “or,” vel. We show that the origin of the symbol $\mathbin {\boldsymbol {\vee }}$ for disjunction can be traced to Whitehead and Russell’s pre-Principia work in formal logic. Because of Principia’s influence, its notation was widely adopted by philosophers working in logic (the logical empiricists in the 1920s and 1930s, especially Carnap and early Quine). Hilbert’s adoption of $\mathbin {\boldsymbol {\vee }}$ in his Grundzüge der theoretischen Logik guaranteed its widespread use by mathematical logicians. The origins of other logical symbols are also discussed.

In his paper on the incompleteness theorems, Gödel seemed to say that a direct way of constructing a formula that says of itself that it is unprovable might involve a faulty circularity. In this note, it is proved that ‘direct’ self-reference can actually be used to prove his result.

This paper presents hitherto unpublished writings of Kurt Gödel concerning logical, epistemological, theological, and physical antinomies, which he generally considered as “the most interesting facts in modern logic,” and which he used as a basis for his famous metamathematical results. After investigating different perspectives on the notion of the logical structure of the antinomies and presenting two “antinomies of the intensional,” a new kind of paradox closely related to Gödel’s ontological proof for the existence of God is introduced and completed by a compilation of further theological antinomies. Finally, after a presentation of unpublished general philosophical remarks concerning the antinomies, Gödel’s type-theoretic variant of Leibniz’ Monadology, discovered in his notes on the foundations of quantum mechanics, is examined. Most of the material presented here has been transcribed from the Gabelsberger shorthand system for the first time.

Frege’s definition of the real numbers, as envisaged in the second volume of Grundgesetze der Arithmetik, is fatally flawed by the inconsistency of Frege’s ill-fated Basic Law V. We restate Frege’s definition in a consistent logical framework and investigate whether it can provide a logical foundation of real analysis. Our conclusion will deem it doubtful that such a foundation along the lines of Frege’s own indications is possible at all.

This paper collects and presents unpublished notes of Kurt Gödel concerning the field of many-valued logic. In order to get a picture as complete as possible, both formal and philosophical notes, transcribed from the Gabelsberger shorthand system, are included.

We give a survey of current research on Gödel’s incompleteness theorems from the following three aspects: classifications of different proofs of Gödel’s incompleteness theorems, the limit of the applicability of Gödel’s first incompleteness theorem, and the limit of the applicability of Gödel’s second incompleteness theorem.

Is a logicist bound to the claim that as a matter of analytic truth there is an actual infinity of objects? If Hume’s Principle is analytic then in the standard setting the answer appears to be yes. Hodes’s work pointed to a way out by offering a modal picture in which only a potential infinity was posited. However, this project was abandoned due to apparent failures of cross-world predication. We re-explore this idea and discover that in the setting of the potential infinite one can interpret first-order Peano arithmetic, but not second-order Peano arithmetic. We conclude that in order for the logicist to weaken the metaphysically loaded claim of necessary actual infinities, they must also weaken the mathematics they recover.

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.

One of the central logical ideas in Wittgenstein’s Tractatus logico-philosophicus is the elimination of the identity sign in favor of the so-called “exclusive interpretation” of names and quantifiers requiring different names to refer to different objects and (roughly) different variables to take different values. In this paper, we examine a recent development of these ideas in papers by Kai Wehmeier. We diagnose two main problems of Wehmeier’s account, the first concerning the treatment of individual constants, the second concerning so-called “pseudo-propositions” (Scheinsätze) of classical logic such as $a=a$ or $a=b \wedge b=c \rightarrow a=c$ . We argue that overcoming these problems requires two fairly drastic departures from Wehmeier’s account: (1) Not every formula of classical first-order logic will be translatable into a single formula of Wittgenstein’s exclusive notation. Instead, there will often be a multiplicity of possible translations, revealing the original “inclusive” formulas to be ambiguous. (2) Certain formulas of first-order logic such as $a=a$ will not be translatable into Wittgenstein’s notation at all, being thereby revealed as nonsensical pseudo-propositions which should be excluded from a “correct” conceptual notation. We provide translation procedures from inclusive quantifier-free logic into the exclusive notation that take these modifications into account and define a notion of logical equivalence suitable for assessing these translations.

Gödel’s ontological proof is by now well known based on the 1970 version, written in Gödel’s own hand, and Scott’s version of the proof. In this article new manuscript sources found in Gödel’s Nachlass are presented. Three versions of Gödel’s ontological proof have been transcribed, and completed from context as true to Gödel’s notes as possible. The discussion in this article is based on these new sources and reveals Gödel’s early intentions of a liberal comprehension principle for the higher order modal logic, an explicit use of second-order Barcan schemas, as well as seemingly defining a rigidity condition for the system. None of these aspects occurs explicitly in the later 1970 version, and therefore they have long been in focus of the debate on Gödel’s ontological proof.

A theory of magnitudes involves criteria for their equivalence, comparison and addition. In this article we examine these aspects from an abstract viewpoint, by focusing on the so-called De Zolt’s postulate in the theory of equivalence of plane polygons (“If a polygon is divided into polygonal parts in any given way, then the union of all but one of these parts is not equivalent to the given polygon”). We formulate an abstract version of this postulate and derive it from some selected principles for magnitudes. We also formulate and derive an abstract version of Euclid’s Common Notion 5 (“The whole is greater than the part”), and analyze its logical relation to the former proposition. These results prove to be relevant for the clarification of some key conceptual aspects of Hilbert’s proof of De Zolt’s postulate, in his classical Foundations of Geometry (1899). Furthermore, our abstract treatment of this central proposition provides interesting insights for the development of a well-behaved theory of compatible magnitudes.