This volume is the first ever collection devoted to the field of proof-theoretic semantics. Contributions address topics including the systematics of introduction and elimination rules and proofs of normalization, the categorial characterization of deductions, the relation between Heyting's and Gentzen's approaches to meaning, knowability paradoxes, proof-theoretic foundations of set theory, Dummett's justification of logical laws, Kreisel's theory of constructions, paradoxical reasoning, and the defence of model theory. The field of proof-theoretic semantics has existed for almost 50 years, but the term (...) itself was proposed by Schroeder-Heister in the 1980s. Proof-theoretic semantics explains the meaning of linguistic expressions in general and of logical constants in particular in terms of the notion of proof. This volume emerges from presentations at the Second International Conference on Proof-Theoretic Semantics in Tübingen in 2013, where contributing authors were asked to provide a self-contained description and analysis of a significant research question in this area. The contributions are representative of the field and should be of interest to logicians, philosophers, and mathematicians alike. (shrink)

We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and Väänänen, and their compositional semantics due to Hodges. We show how Hodges’ semantics can be seen as a special case of a general construction, which provides a context for a useful completeness theorem with respect to a wider class of models. We shed some new light on each aspect of the logic. We show that the natural propositional logic carried by the semantics (...) is the logic of Bunched Implications due to Pym and O’Hearn, which combines intuitionistic and multiplicative connectives. This introduces several new connectives not previously considered in logics of informational dependence, but which we show play a very natural rôle, most notably intuitionistic implication. As regards the quantifiers, we show that their interpretation in the Hodges semantics is forced, in that they are the image under the general construction of the usual Tarski semantics; this implies that they are adjoints to substitution, and hence uniquely determined. As for the dependence predicate, we show that this is definable from a simpler predicate, of constancy or dependence on nothing. This makes essential use of the intuitionistic implication. The Armstrong axioms for functional dependence are then recovered as a standard set of axioms for intuitionistic implication. We also prove a full abstraction result in the style of Hodges, in which the intuitionistic implication plays a very natural rôle. (shrink)

Some thirty years ago, two proposals were made concerning criteria for identity of proofs. Prawitz proposed to analyze identity of proofs in terms of the equivalence relation based on reduction to normal form in natural deduction. Lambek worked on a normalization proposal analogous to Prawitz's, based on reduction to cut-free form in sequent systems, but he also suggested understanding identity of proofs in terms of an equivalence relation based on generality, two derivations having the same generality if after generalizing maximally (...) the rules involved in them they yield the same premises and conclusions up to a renaming of variables. These two proposals proved to be extensionally equivalent only for limited fragments of logic. The normalization proposal stands behind very successful applications of the typed lambda calculus and of category theory in the proof theory of intuitionistic logic. In classical logic, however, it did not fare well. The generality proposal was rather neglected in logic, though related matters were much studied in pure category theory in connection with coherence problems, and there are also links to low-dimensional topology and linear algebra. This proposal seems more promising than the other one for the general proof theory of classical logic. (shrink)

The view that toposes originated as generalized set theory is a figment of set theoretically educated common sense. This false history obstructs understanding of category theory and especially of categorical foundations for mathematics. Problems in geometry, topology, and related algebra led to categories and toposes. Elementary toposes arose when Lawvere's interest in the foundations of physics and Tierney's in the foundations of topology led both to study Grothendieck's foundations for algebraic geometry. I end with remarks on a categorical view of (...) the history of set theory, including a false history plausible from that point of view that would make it helpful to introduce toposes as a generalization from set theory. (shrink)

Cognition involves physical stimulation, neural coding, mental conception, and conscious perception. Beyond the neural coding of physical stimuli, it is not clear how exactly these component processes constitute cognition. Within mathematical sciences, category theory provides tools such as category, functor, and adjointness, which are indispensable in the explication of the mathematical calculations involved in acquiring mathematical knowledge. More speci cally, functorial semantics, in showing that theories and models can be construed as categories and functors, respectively, and in establishing the adjointness (...) between abstraction (of theories) and interpretation (to obtain models), mathematically accounts for knowing-within-mathematics. Here we show that mathematical knowing recapitulates--in an elementary form--ordinary cognition. The process of going from particulars (physical stimuli) to their concrete models (conscious percepts) via abstract theories (mental concepts) and measured properties (neural coding) is common to both mathematical knowing and ordinary cognition. Our investigation of the similarity between knowing-within-mathematics and knowing-in-general leads us to make a case for the development of the basic science of cognition in terms of the functorial semantics of mathematical knowing. (shrink)

The aim of this paper is to clarify the role of category theory in the foundations of mathematics. There is a good deal of confusion surrounding this issue. A standard philosophical strategy in the face of a situation of this kind is to draw various distinctions and in this way show that the confusion rests on divergent conceptions of what the foundations of mathematics ought to be. This is the strategy adopted in the present paper. It is divided into 5 (...) sections. We first show that already in the set theoretical framework, there are different dimensions to the expression foundations of. We then explore these dimensions more thoroughly. After a very short discussion of the links between these dimensions, we move to some of the arguments presented for and against category theory in the foundational landscape. We end up on a more speculative note by examining the relationships between category theory and set theory. (shrink)

We present a two-level theory to formalize constructive mathematics as advocated in a previous paper with G. Sambin.One level is given by an intensional type theory, called Minimal type theory. This theory extends a previous version with collections.The other level is given by an extensional set theory that is interpreted in the first one by means of a quotient model.This two-level theory has two main features: it is minimal among the most relevant foundations for constructive mathematics; it is constructive thanks (...) to the way the extensional level is linked to the intensional one which fulfills the “proofs-as-programs” paradigm and acts as a programming language. (shrink)

We apply some tools developed in categorical logic to give an abstract description of constructions used to formalize constructive mathematics in foundations based on intensional type theory. The key concept we employ is that of a Lawvere hyperdoctrine for which we describe a notion of quotient completion. That notion includes the exact completion on a category with weak finite limits as an instance as well as examples from type theory that fall apart from this.

This paper is the second in a two-part series in which we discuss several notions of completeness for systems of mathematical axioms, with special focus on their interrelations and historical origins in the development of the axiomatic method. We argue that, both from historical and logical points of view, higher-order logic is an appropriate framework for considering such notions, and we consider some open questions in higher-order axiomatics. In addition, we indicate how one can fruitfully extend the usual set-theoretic semantics (...) so as to shed new light on the relevant strengths and limits of higher-order logic. (shrink)

I present a version of Kit Fine's stratified semantics for the logic RWQ and define a natural family of related structures called RW hyperdoctrines. After proving that RWQ is sound with respect to RW hyperdoctrines, we show how to construct, for each stratified model, a hyperdoctrine that verifies precisely the same sentences. Completeness of RWQ for hyperdoctrinal semantics then follows from completeness for stratified semantics, which is proved in an appendix. By examining the base category of RW hyperdoctrines, we find (...) reason to be worried about the ontology of stratified models. (shrink)

This paper responds to recent work in the philosophy of Homotopy Type Theory by James Ladyman and Stuart Presnell. They consider one of the rules for identity, path induction, and justify it along ‘pre-mathematical’ lines. I give an alternate justification based on the philosophical framework of inferentialism. Accordingly, I construct a notion of harmony that allows the inferentialist to say when a connective or concept is meaning-bearing and this conception unifies most of the prominent conceptions of harmony through category theory. (...) This categorical harmony is stated in terms of adjoints and says that any concept definable by iterated adjoints from general categorical operations is harmonious. Moreover, it has been shown that identity in a categorical setting is determined by an adjoint in the relevant way. Furthermore, path induction as a rule comes from this definition. Thus we arrive at an account of how path induction, as a rule of inference governing identity, can be justified on mathematically motivated grounds. (shrink)

As McKinsey and Tarski showed, the Stone representation theorem for Boolean algebras extends to algebras with operators to give topological semantics for propositional modal logic, in which the “necessity” operation is modeled by taking the interior of an arbitrary subset of a topological space. In this article, the topological interpretation is extended in a natural way to arbitrary theories of full first-order logic. The resulting system of S4 first-order modal logic is complete with respect to such topological semantics.

This is a companion to a paper by the authors entitled “Gödel’s natural deduction,” which presented and made comments about the natural deduction system in Gödel’s unpublished notes for the elementary logic course he gave at the University of Notre Dame in 1939. In that earlier paper, which was itself a companion to a paper that examined the links between some philosophical views ascribed to Gödel and general proof theory, one can find a brief summary of Gödel’s notes for the (...) Notre Dame course. In order to put the earlier paper in proper perspective, a more complete summary of these interesting notes, with comments concerning them, is given here. (shrink)

The concept of “necessity of thought” plays a central role in Dag Prawitz’s essay “Logical Consequence from a Constructivist Point of View” (Prawitz 2005). The theme is later developed in various articles devoted to the notion of valid inference (Prawitz, 2009, forthcoming a, forthcoming b). In section 1 I explain how the notion of necessity of thought emerges from Prawitz’s analysis of logical consequence. I try to expound Prawitz’s views concerning the necessity of thought in sections 2, 3 and 4. (...) In sections 5 and 6 I discuss some problems arising with regard to Prawitz’s views. (shrink)

This volume is dedicated to Prof. Dag Prawitz and his outstanding contributions to philosophical and mathematical logic. Prawitz's eminent contributions to structural proof theory, or general proof theory, as he calls it, and inference-based meaning theories have been extremely influential in the development of modern proof theory and anti-realistic semantics. In particular, Prawitz is the main author on natural deduction in addition to Gerhard Gentzen, who defined natural deduction in his PhD thesis published in 1934. The book opens with an (...) introductory paper that surveys Prawitz's numerous contributions to proof theory and proof-theoretic semantics and puts his work into a somewhat broader perspective, both historically and systematically. Chapters include either in-depth studies of certain aspects of Dag Prawitz's work or address open research problems that are concerned with core issues in structural proof theory and range from philosophical essays to papers of a mathematical nature. Investigations into the necessity of thought and the theory of grounds and computational justifications as well as an examination of Prawitz's conception of the validity of inferences in the light of three “dogmas of proof-theoretic semantics” are included. More formal papers deal with the constructive behaviour of fragments of classical logic and fragments of the modal logic S4 among other topics. In addition, there are chapters about inversion principles, normalization of p roofs, and the notion of proof-theoretic harmony and other areas of a more mathematical persuasion. Dag Prawitz also writes a chapter in which he explains his current views on the epistemic dimension of proofs and addresses the question why some inferences succeed in conferring evidence on their conclusions when applied to premises for which one already possesses evidence. (shrink)

This Gentle Introduction is very much still work in progress. Roughly aimed at those who want something a bit more discursive, slower-moving, than Awodey's or Leinster's excellent books. -/- The current [Jan 2018] version is 291pp.

In this paper we introduce a novel way of building arithmetics whose background logic is R. The purpose of doing this is to point in the direction of a novel family of systems that could be candidates for being the infamous R#1/2 that Meyer suggested we look for.

There is some consensus among orthodox category theorists that the concept of adjoint functors is the most important concept contributed to mathematics by category theory. We give a heterodox treatment of adjoints using heteromorphisms that parses an adjunction into two separate parts. Then these separate parts can be recombined in a new way to define a cognate concept, the brain functor, to abstractly model the functions of perception and action of a brain. The treatment uses relatively simple category theory and (...) is focused on the interpretation and application of the mathematical concepts. (shrink)

Structuralism has recently moved center stage in philosophy of mathematics. One of the issues discussed is the underlying logic of mathematical structuralism. In this paper, I want to look at the dual question, namely the underlying structures of logic. Indeed, from a mathematical structuralist standpoint, it makes perfect sense to try to identify the abstract structures underlying logic. We claim that one answer to this question is provided by categorical logic. In fact, we claim that the latter can be seen—and (...) probably should be seen—as being a structuralist approach to logic and it is from this angle that categorical logic is best understood. (shrink)

This paper explores some variants and aspects of multi-quantificational criteria of existence, examining these in the context of the debate between monism and pluralism in analytical philosophy. Assuming familiarity with the findings to date, we seek to apply to these the newly introduced concepts of “substitution” and “substitutional model”. Possible applications of formal theories involving multiple types of existential quantifier are highlighted, together with their methods of construction. These considerations then lead to a thesis asserting the irrelevance of both multi-quantificational (...) criteria and assumptions involving quantificational ontology to the debate between monism and pluralism in ontology. Many quantifiers cannot properly distinguish different modes of existence–as we aim to show by furnishing a general method for constructing counter-examples to any theory that assumes that different types of existential quantifier correspond to different modes of existence. (shrink)

In standard model theory, deductions are not the things one models. But in general proof theory, in particular in categorial proof theory, one finds models of deductions, and the purpose here is to motivate a simple example of such models. This will be a model of deductions performed within an abstract context, where we do not have any particular logical constant, but something underlying all logical constants. In this context, deductions are represented by arrows in categories involved in a general (...) adjoint situation. To motivate the notion of adjointness, one of the central notions of category theory, and of mathematics in general, it is first considered how some features of it occur in set-theoretical axioms and in the axioms of the lambda calculus. Next, it is explained how this notion arises in the context of deduction, where it characterizes logical constants. It is shown also how the categorial point of view suggests an analysis of propositional identity. The problem of propositional identity, i.e., the problem of identity of meaning for propositions, is no doubt a philosophical problem, but the spirit of the analysis proposed here will be rather mathematical. Finally, it is considered whether models of deductions can pretend to be a semantics. This question, which as so many questions having to do with meaning brings us to that wall that blocked linguists and philosophers during the whole of the twentieth century, is merely posed. At the very end, there is the example of a geometrical model of adjunction. Without pretending that it is a semantics, it is hoped that this model may prove illuminating and useful. (shrink)

This is an examination, a commentary, of links between some philosophical views ascribed to Gödel and general proof theory. In these views deduction is of central concern not only in predicate logic, but in set theory too, understood from an infinitistic ideal perspective. It is inquired whether this centrality of deduction could also be kept in the intensional logic of concepts whose building Gödel seems to have taken as the main task of logic for the future.

The fact that many modal operators are part of an adjunction is probably folklore since the discovery of adjunctions. On the other hand, the natural idea of a minimal propositional calculus extended with a pair of adjoint operators seems to have been formulated only very recently. This recent research, mainly motivated by applications in computer science, concentrates on technical issues related to the calculi and not on the significance of adjunctions in modal logic. It then seems a worthy enterprise (both (...) for these contemporary topical pursuits and also for historical interest) to trace the concept of adjunction back to the origins of the algebraic semantics of modal logic and to make explicit its ubiquity in this branch of mathematics. (shrink)

Among the main concerns of 20th century philosophy was that of the foundations of mathematics. But usually not recognized is the relevance of the choice of a foundational approach to the other main problems of 20th century philosophy, i.e., the logical structure of language, the nature of scientific theories, and the architecture of the mind. The tools used to deal with the difficulties inherent in such problems have largely relied on set theory and its “received view”. There are specific issues, (...) in philosophy of language, epistemology and philosophy of mind, where this dependence turns out to be misleading. The same issues suggest the gain in understanding coming from category theory, which is, therefore, more than just the source of a “non-standard” approach to the foundations of mathematics. But, even so conceived, it is the very notion of what a foundation has to be that is called into question. The philosophical meaning of mathematics is no longer confined to which first principles are assumed and which “ontological” interpretation is given to them in terms of some possibly updated version of logicism, formalism or intuitionism. What is central to any foundational project proper is the role of universal constructions that serve to unify the different branches of mathematics, as already made clear in 1969 by Lawvere. Such universal constructions are best expressed by means of adjoint functors and representability up to isomorphism. In this lies the relevance of a category-theoretic perspective, which leads to wide-ranging consequences. One such is the presence of functorial constraints on the syntax–semantics relationships; another is an intrinsic view of (constructive) logic, as arises in topoi and, subsequently, in more general fibrations. But as soon as theories and their models are described accordingly, a new look at the main problems of 20th century’s philosophy becomes possible. The lack of any satisfactory solution to these problems in a purely logical and set-theoretic setting is the result of too circumscribed an approach, such as a static and punctiform view of objects and their elements, and a misconception of geometry and its historical changes before, during, and after the foundational “crisis”, as if algebraic geometry and synthetic differential geometry – not to mention algebraic topology – were secondary sources for what concerns foundational issues. The objectivity of basic geometrical intuitions also acts against the recent version of structuralism proposed as ‘the’ philosophy of category theory. On the other hand, the need for a consistent and adequate conceptual framework in facing the difficulties met by pre-categorical theories of language and scientific knowledge not only provides the basic concepts of category theory with specific applications but also suggests further directions for their development (e.g., in approaching the foundations of physics or the mathematical models in the cognitive sciences). This ‘virtuous’ circle is by now largely admitted in theoretical computer science; the time is ripe to realise that the same holds for classical topics of philosophy. (shrink)

The article looks briefly at Fefermans own foundations. Among many different senses of foundations, the one that mathematics needs in practice is a recognized body of truths adequate to organize definitions and proofs. Finding concise principles of this kind has been a huge achievement by mathematicians and logicians. We put ZFC and categorical foundations both into this context.

This volume is dedicated to Prof. Dag Prawitz and his outstanding contributions to philosophical and mathematical logic. Prawitz's eminent contributions to structural proof theory, or general proof theory, as he calls it, and inference-based meaning theories have been extremely influential in the development of modern proof theory and anti-realistic semantics. In particular, Prawitz is the main author on natural deduction in addition to Gerhard Gentzen, who defined natural deduction in his PhD thesis published in 1934. The book opens with an (...) introductory paper that surveys Prawitz's numerous contributions to proof theory and proof-theoretic semantics and puts his work into a somewhat broader perspective, both historically and systematically. Chapters include either in-depth studies of certain aspects of Dag Prawitz's work or address open research problems that are concerned with core issues in structural proof theory and range from philosophical essays to papers of a mathematical nature. Investigations into the necessity of thought and the theory of grounds and computational justifications as well as an examination of Prawitz's conception of the validity of inferences in the light of three “dogmas of proof-theoretic semantics” are included. More formal papers deal with the constructive behaviour of fragments of classical logic and fragments of the modal logic S4 among other topics. In addition, there are chapters about inversion principles, normalization of proofs, and the notion of proof-theoretic harmony and other areas of a more mathematical persuasion. Dag Prawitz also writes a chapter in which he explains his current views on the epistemic dimension of proofs and addresses the question why some inferences succeed in conferring evidence on their conclusions when applied to premises for which one already possesses evidence. (shrink)

Our manuscript addresses the foundational question of cognitive science: how do we know? Specifically, examination of the mathematics of acquiring mathematical knowledge revealed that knowing-within-mathematics is reflective of knowing-in-general. Based on the correspondence between ordinary cognition (involving physical stimuli, neural sensations, mental concepts, and conscious percepts) and mathematical knowing (involving objective particulars, measured properties, abstract theories, and concrete models), we put forward the functorial semantics of mathematical knowing as a formalization of cognition. Our investigation of the similarity between mathematics and (...) cognition led us to argue against the compartmentalization of scientific knowledge and ordinary cognition, and make a case for the understanding of the basic science of knowing in terms of functorial semantics. Recognizing functorial semantics as an elementary form of cognition can help advance cognitive science the way calculus helped in the advancement of physics. (shrink)

The hard problem of consciousness is explicating how moving matter becomes thinking matter. Harder yet is the problem of spelling out the mutual determinations of individual experiences and the experiencing self. Determining how the collective social consciousness influences and is influenced by the individual selves constituting the society is the hardest problem. Drawing parallels between individual cognition and the collective knowing of mathematical science, here we present a conceptualization of the cognitive dimension of the self. Our abstraction of the relations (...) between the physical world, biological brain, mind, intuition, consciousness, cognitive self, and the society can facilitate the construction of the conceptual repertoire required for an explicit science of the self within human society. (shrink)

Instead of the half-century old foundational feud between set theory and category theory, this paper argues that they are theories about two different complementary types of universals. The set-theoretic antinomies forced naïve set theory to be reformulated using some iterative notion of a set so that a set would always have higher type or rank than its members. Then the universal u_{F}={x|F(x)} for a property F() could never be self-predicative in the sense of u_{F}∈u_{F}. But the mathematical theory of categories, (...) dating from the mid-twentieth century, includes a theory of always-self-predicative universals--which can be seen as forming the "other bookend" to the never-self-predicative universals of set theory. The self-predicative universals of category theory show that the problem in the antinomies was not self-predication per se, but negated self-predication. They also provide a model (in the Platonic Heaven of mathematics) for the self-predicative strand of Plato's Theory of Forms as well as for the idea of a "concrete universal" in Hegel and similar ideas of paradigmatic exemplars in ordinary thought. (shrink)

This paper shows how the universals of category theory in mathematics provide a model (in the Platonic Heaven of mathematics) for the self-predicative strand of Plato's Theory of Forms as well as for the idea of a "concrete universal" in Hegel and similar ideas of paradigmatic exemplars in ordinary thought. The paper also shows how the always-self-predicative universals of category theory provide the "opposite bookend" to the never-self-predicative universals of iterative set theory and thus that the paradoxes arose from having (...) one theory (e.g., Frege's Paradise) where universals could be either self-predicative or non-self-predicative (instead of being always one or always the other). (shrink)

Today it would be considered "bad Platonic metaphysics" to think that among all the concrete instances of a property there could be a universal instance so that all instances had the property by virtue of participating in that concrete universal. Yet there is a mathematical theory, category theory, dating from the mid-20th century that shows how to precisely model concrete universals within the "Platonic Heaven" of mathematics. This paper, written for the philosophical logician, develops this category-theoretic treatment of concrete universals (...) along with a new concept to abstractly model the functions of a brain. (shrink)

As is well known, any preorder R on a set U induces an Alexandrov topology on U. In some interesting cases related to data mining an Alexandrov topology can be transformed into different types of logico-algebraic models. In some cases, (pre)topological operators provided by Pointless Topology may define a topological space on U even if R is not a preorder. If this is the case, then we call R a crypto-preorder. The paper studies the conditions under which a relation R (...) is a crypto-preorder and how to transform a crypto-preorder into a proper preorder. (shrink)

We present a full completeness theorem for the multiplicative fragment of a variant of noncommutative linear logic, Yetter's cyclic linear logic (CyLL). The semantics is obtained by interpreting proofs as dinatural transformations on a category of topological vector spaces, these transformations being equivariant under certain actions of a noncocommutative Hopf algebra called the shuffie algebra. Multiplicative sequents are assigned a vector space of such dinaturals, and we show that this space has as a basis the denotations of cut-free proofs in (...) CyLL + MIX. This can be viewed as a fully faithful representation of a free *-autonomous category, canonically enriched over vector spaces. This paper is a natural extension of the authors' previous work, "Linear Lauchli Semantics", where a similar theorem is obtained for the commutative logic MLL + MIX. In that paper, we interpret proofs as dinaturals which are invariant under certain actions of the additive group of integers. Here we also present a simplification of that work by showing that the invariance criterion is actually a consequence of dinaturality. The passage from groups to Hopf algebras in this paper corresponds to the passage from commutative to noncommutative logic. However, in our noncommutative setting, one must still keep the invariance condition on dinaturals. (shrink)

Hermann Grassmann's Ausdehnungslehre of 1844 and his Lehrbuch der Arithmetik of 1861 are landmark works in mathematics; the former not only developed new mathematical fields but also both contributed to the setting of modern standards of rigor. Their very modernity, however, may obscure features of Grassmann's view of the foundations of mathematics that were not adopted since. Grassmann gave a key role to the learning of mathematics that affected his method of presentation, including his emphasis on making initial assumptions explicit. (...) In order to better understand this less well-known aspect of his work it will help to examine why some commentators have overlooked his theme of unifying logic, pedagogy and foundations, while others have recognised it. (shrink)

Saunders Mac Lane famously remarked that "Bourbaki just missed" formulating adjoints in a 1948 appendix (written no doubt by Pierre Samuel) to an early draft of Algebre--which then had to wait until Daniel Kan's 1958 paper on adjoint functors. But Mac Lane was using the orthodox treatment of adjoints that only contemplates the object-to-object morphisms within a category, i.e., homomorphisms. When Samuel's treatment is reconsidered in view of the treatment of adjoints using heteromorphisms or hets (object-to-object morphisms between objects in (...) different categories), then he, in effect, isolated the concept of a left representation solving a universal mapping problem. When dualized to obtain the concept of a right representation, the two halves only need to be united to obtain an adjunction. Thus Samuel was only a now-simple dualization away for formulating adjoints in 1948. Apparently, Bodo Pareigis' 1970 text was the first and perhaps only text to give the heterodox "new characterization" (i.e., heteromorphic treatment) of adjoints. Orthodox category theory uses various relatively artificial devices to avoid formally recognizing hets--even though hets are routinely used by the working mathematician. Finally we consider a "philosophical" question as to whether the most important concept in category theory is the notion of an adjunction or the notion of a representation giving a universal mapping property (where adjunctions arise as the special case of a bi-representation of dual universal mapping problems). (shrink)

Coherence with respect to Kelly–Mac Lane graphs is proved for categories that correspond to the multiplicative fragment without constant propositions of classical linear first-order predicate logic without or with mix. To obtain this result, coherence is first established for categories that correspond to the multiplicative conjunction–disjunction fragment with first-order quantifiers of classical linear logic, a fragment lacking negation. These results extend results of [K. Došen, Z. Petrić, Proof-Theoretical Coherence, KCL Publications , London, 2004 ; K. Došen, Z. Petrić, Proof-Net Categories, (...) Polimetrica, Monza, 2007 ], where coherence was established for categories of the corresponding fragments of propositional classical linear logic, which are related to proof nets, and which could be described as star-autonomous categories without unit objects. (shrink)

Consistency of choice is a fundamental and recurring theme in decision theory, social choice theory, behavioral economics, and psychological sciences. The purpose of this paper is to study the consistency of choice independent of the particular decision model at hand. Consistency is viewed as an inherently logical concept that is fundamentally void of connotation and is thus disentangled from traditional rationality or consistency conditions imposed on decision models. The proposed formalization of consistency takes two forms: internal consistency, which refers to (...) the property that a choice model does not generate contradictory statements; and semantic consistency, which refers to the idea that a theory’s predictions are valid with respect to some observed data. In addressing semantic consistency, the relationship between theory and data is analyzed in terms of so-called duality mappings, which allow a passage between the two universes in a way that consistency is preserved. The formalization of consistency concepts relies on adapting the revealed preference theory to the context-dependent setting. The paper concludes by discussing the implications of the proposed framework and how it relates to classical revealed preference theory and other formalizations of the relationship between the theory and reality of choice. (shrink)

We present in this paper an abstract categorical logic based on an abstraction of quantifier. More precisely, the proposed logic is abstract because no structural constraints are imposed on models (semantics free). By contrast, formulas are inductively defined from an abstraction both of atomic formulas and of quantifiers. In this sense, the proposed approach differs from other works interested in formalizing the notion of abstract logic and of which the closest to our approach are the institutions, which in addition to (...) be semantics free do not also impose any syntactic contingencies on the structure of formulas. To define the semantical framework in which formulas will be interpreted, we propose to follow the idea from categorical logic which defines the semantical interpretation of formulas from context and as subobjects of an object of a given category. In the spirit of Lawvere’s hyperdoctrines, we use a more abstract notion which generalizes the notion of subobject, standard in category theory: Pitt’s prop-categories. Always in the spirit of categorical logic, we propose a sequent calculus of which we show correctness and completeness for all semantical frameworks defined over any prop-categories. We then study some conditions which allow us to get this completeness result for particular classes of prop-categories. (shrink)

We shall address from a conceptual perspective the duality between algebra and geometry in the framework of the refoundation of algebraic geometry associated to Grothendieck’s theory of schemes. To do so, we shall revisit scheme theory from the standpoint provided by the problem of recovering a mathematical structure A from its representations \ into other similar structures B. This vantage point will allow us to analyze the relationship between the algebra-geometry duality and the structure-semiotics duality. Whereas in classical algebraic geometry (...) a certain kind of rings can be recovered by considering their representations with respect to a unique codomain B, Grothendieck’s theory of schemes permits to reconstruct general rings by considering representations with respect to a category of codomains. The strategy to reconstruct the object from its representations remains the same in both frameworks: the elements of the ring A can be realized—by means of what we shall generally call Gelfand transform—as quantities on a topological space that parameterizes the relevant representations of A. As we shall argue, important dualities in different areas of mathematics can be understood as particular cases of this general pattern. In the wake of Majid’s analysis of the Pontryagin duality, we shall propose a Kantian-oriented interpretation of this pattern. We shall use this conceptual framework to argue that Grothendieck’s notion of functor of points can be understood as a “relativization of the a priori” that generalizes the relativization already conveyed by the notion of domain extension to more general variations of the corresponding domains. (shrink)

We suggest a new approach for addressing the problem of establishing an axiomatic foundation for large cardinals. An axiom asserting the existence of a large cardinal can naturally be viewed as a strong Axiom of Infinity. However, it has not been clear on the basis of our knowledge of ω itself, or of generally agreed upon intuitions about the true nature of the mathematical universe, what the right strengthening of the Axiom of Infinity is—which large cardinals ought to be derivable? (...) It was shown in the 1960s by Lawvere that the existence of an infinite set is equivalent to the existence of a certain kind of structure-preserving transformation from V to itself, not isomorphic to the identity. We use Lawvere's transformation, rather than ω, as a starting point for a reasonably natural sequence of strengthenings and refinements, leading to a proposed strong Axiom of Infinity. A first refinement was discussed in later work by Trnková—Blass, showing that if the preservation properties of Lawvere's tranformation are strengthened to the point of requiring it to be an exact functor , such a transformation is provably equivalent to the existence of a measurable cardinal. We propose to push the preservation properties as far as possible, short of inconsistency. The resulting transformation V→V is strong enough to account for virtually all large cardinals, but is at the same time a natural generalization of an assertion about transformations V→V known to be equivalent to the Axiom of Infinity. (shrink)

We present the paradigm of categories-as-syntax. We briefly recall the even stronger paradigm categories-as-machine-language which led from -calculus to categorical combinators viewed as basic instructions of the Categorical Abstract Machine. We extend the categorical combinators so as to describe the proof theory of first order logic and higher order logic. We do not prove new results: the use of indexed categories and the description of quantifiers as adjoints goes back to Lawvere and has been developed in detail in works of (...) R. Seely. We rather propose a syntactic, equational presentation of those ideas. We sketch the (quasi-equational) categorical structures for dependent types, following ideas of J. Cartmell (contextual categories). All these theories of categorical combinators, together with the translations from -calculi into them, are introduced smoothly, thanks to the systematic use of– - an abstract variable-free notation for -calculus, going back to N. De Bruijn, – - a sequent formulation of the natural deduction. (shrink)

The volume includes twenty-five research papers presented as gifts to John L. Bell to celebrate his 60th birthday by colleagues, former students, friends and admirers. Like Bell’s own work, the contributions cross boundaries into several inter-related fields. The contributions are new work by highly respected figures, several of whom are among the key figures in their fields. Some examples: in foundations of maths and logic ; analytical philosophy, philosophy of science, philosophy of mathematics and decision theory and foundations of economics. (...) Most articles are contributions to current philosophical debates, but contributions also include some new mathematical results, important historical surveys, and a translation by Wilfrid Hodges of a key work of arabic logic. (shrink)