Classical Field Theory Via Cohesive Homotopy Types

Total Page:16

File Type:pdf, Size:1020Kb

Classical Field Theory Via Cohesive Homotopy Types Classical field theory via Cohesive homotopy types Urs Schreiber August 2, 2015 Abstract We demonstrate how a refined formulation of classical mechanics and classical field theory that takes global effects properly into account (e.g. classical anomalies and the global descent to reduced phase spaces) is naturally given in \higher differential geometry". This is the context where smooth manifolds are refined to smooth homotopy types. We introduce and explain this higher differential geometry as we go along. At the same time we explain how the classical concepts of classical mechanics and classical field theory follow naturally from the abstract homotopy theory of correspondences in higher slice toposes. The first part of the text is meant to serve the triple purpose of being an exposition of classical mechanics for homotopy type theorists, being an exposition of geometric homotopy theory for physicists, and finally to serve as the canonical example for the formulation of a local pre-quantum field theory which supports a localized quantization process to local quantum field theory in the sense of the cobordism hypothesis. On the way we also clarify some aspects of multisymplectic field theory by observing that the Hamilton-de Donder-Weyl field equation characterizes Maurer-Cartan elements in the L1-algebra of local observables. The second part of the text discusses the relevant statements of differential cohomology in cohesive higher toposes in more detail. This text has become section 1.2 of Differential cohomology in a cohesive 1-topos, arXiv:1310.7930. This document with further material is kept online at http://ncatlab.org/schreiber/show/Classical+field+theory+via+Cohesive+homotopy+types 1 Contents 1 Introduction 3 2 Hamilton-Jacobi-Lagrange mechanics via prequantized Lagrangian correspondences 5 2.1 Phase spaces and symplectic manifolds . .5 2.2 Coordinate systems and the topos of smooth spaces . .7 2.3 Canonical transformations and Symplectomorphisms . .9 2.4 Trajectories and Lagrangian correspondences . 10 2.5 Observables, symmetries and the Poisson bracket Lie algebra . 14 2.6 Hamiltonian (time evolution) trajectories and Hamiltonian correspondences . 16 2.7 Noether symmetries and equivariant structure . 18 2.8 Gauge theory, smooth groupoids and higher toposes . 20 2.9 The kinetic action, pre-quantization and differential cohomology . 22 2.10 The classical action, the Legendre transform and Hamiltonian flows . 25 2.11 The classical action functional pre-quantizes Lagrangian correspondences . 27 2.12 Quantization, the Heisenberg group, and slice automorphism groups . 28 2.13 Integrable systems, moment maps and homomorphism into the Poisson bracket Lie algebra . 31 2.14 Classical anomalies and projective symplectic reduction . 32 3 De Donder-Weyl field theory via higher correspondences 33 3.1 Local field theory Lagrangians and n-plectic smooth spaces . 33 3.2 The kinetic action, higher prequantization and higher differential cohomology . 37 3.3 Local observables, conserved currents and their higher Poisson brackets . 39 3.4 Field equations of motion, higher Maurer-Cartan elements, and higher Lie integration . 44 3.5 Higher gauge theory, smooth 1-groupoids and homotopy toposes . 48 3.6 Higher Chern-Simons-type boundary field theory and higher Chern-Weil theory . 48 3.7 Source terms, the off-shell Poisson bracket and holography with symplectic groupoids . 48 A Homotopy toposes and Cohesive homotopy types 52 B Differential geometry via Smooth 0-types 56 B.1 Coordinate systems . 57 B.2 Smooth 0-types . 60 B.3 Differential forms . 66 C Higher geometry via Geometric homotopy types 71 C.1 Homotopy toposes of geometric 1-groupoids . 72 C.2 Higher geometric fiber bundles . 79 C.3 Bisections of higher groupoids . 83 C.4 Higher Atiyah groupoids . 83 D Differential cohomology via Cohesive homotopy types 88 D.1 Differential coefficients . 90 D.2 Differential moduli . 95 D.3 Higher quantomorphism- and Heisenberg-groupoids . 98 D.4 Higher Courant groupoids . 101 2 1 Introduction The theory of classical mechanics (e.g. [1]) is the mathematical theory of how macroscopic physical objects of the observable world (for instance dust, rocks and planets) move through space and time while interacting via forces between them. Similarly the theory of classical field theory (e.g. [21]) is the theory of how macroscopic field excitations (for instance of the electric field, the magnetic field, and the field of gravity) relate to space and time while interacting with each other and with physical objects. As the name clearly suggests, classical mechanics and classical field theory are classical topics in math- ematical physics, about whose foundations, it would seem, there is hardly much more to be said. However, the observable universe is fundamentally not described by classical field theory (when including microscopic objects and microscopic field excitations) but by quantum field theory (QFT), for which classical (or maybe better: pre-quantum) field theory is but the generating input datum. But QFT has lately seen considerable refinements in the formalization of its foundations (see [50] for a recent survey), notably in the mathematical formalization of the physical principle of (causal) locality. Namely the cobordism hypthesis [33] (see [5] for a review) asserts that the locality property { of at least those quantum field theories which are either topologi- cal or else expressible as (\holographic") boundary theories of topological theories { is encoded in a universal construction in \directed homotopy theory", called (1; n)-category theory (see for instance [34, 5]). But this insight does reflect back on the formulation of the foundations of classical/pre-quantum field theory, because, as traditionally formulated, this does not support a quantization that would yield a genuinely local QFT in the sense of the cobordism hypothesis. Therefore some refined formulation of, or at least a new perspective on, classical field theory still seems to be needed, after all. This is what we are concerned with here. In the physics literature roughly this issue is well-known as the problem of \non-covariance of canonical quantization". There are various proposals for how to refine the traditonal formulation of classical field theory such as to solve this problem, of which maybe the best developed is called \multiymplectic covariant field theory" (see e.g. [49]). This approach starts out with a natural generalization of the basic notion of symplectic 2-forms to higher degree forms, but it used to be unclear about on how the further ingredients of classical mechanics are generalized, such as notably what is to refine the Poisson bracket Lie algebra of observables as one passes to local observables. In [17, FRS13b, 44] it was shown that these problems find a solution { and that multisymplectic classical field theory finds a formulation that makes it compatible with the formulation of local quantum field theory via the cobordism hypothesis { if one understands geometric pre-quantization not in the traditional context of differential geometry (see B below for the basics of that), but in the context of higher differential geometry [52], the combination of differential geometry with homotopy theory (see [45] for the classical axiomatization of homotopy theory by model categories, [32] for the formulation by homotopy toposes and [61] for the modern perspective on homotopy theory as homotopy type theory). This is the context where smooth manifolds are allowed to be generalized first to smooth orbifolds (see for instance [40]) and then further to Lie groupoids (see for instance [37]), then further to smooth groupoids and to smooth moduli stacks and finally to smooth higher stacks (see [20]), hence to smooth homotopy types and more generally to cohesive homotopy types [52]. However, in these articles the relation to traditional descriptions of classical field theory was not discussed much. The present article is meant to expose the formulation of classical field theory via cohesive homotopy types more in detail. We introduce and explain the relevant higher differential geometry as we go along. At the same time we explain how the classical concepts of classical mechanics and classical field theory follow naturally from just the abstract theory of \correspondences in higher slice toposes". Therefore the intended readership is twofold: on the one hand theoretical and mathematical physicists, and on the other hand homotopy-type heorists and homotopy type-theorists and topos theorists. Each group might take the following as an introduction to the topic from the other group's perspective. One purpose of this article is to explain how classical mechanics and classical field theory is naturally a subject in both specialities and to provide a dictionary to translate between the two points of view. To put this statement in perspective, notice that locally and in fact infinitesimally, classical mechanics 3 is to a large extent the theory of variational calculus. This also has a natural and useful formulation in homotopy theory and higher topos theory, namely the formulation that physicists know as BV-formalism (see e.g.[25]) and that mathematicians call derived intersection theory (e.g. [35]). This \derived" aspect of classical mechanics has found considerable attention in the literature in the last years (see for instance [?]). The higher global refinement that we discuss here however is complementary to this, and has not found due attention yet. Both aspects are complementary and naturally combine in \higher derived geometry", but to keep focus we do not particularly dwell much on the infinitesimal aspects here. Notice that by far not all aspects of classical mechanics are local or even infinitesimal in nature. In particular the passage to genuine quantization { as opposed to just formal deformation quantization { crucially requires global structure to be specified. In the context of geometric quantization this extra global structure is traditionally called a pre-quantization, in order to reflect that it is more structure than typically considered in classical mechanics, but still just a pre-requisite to the actual quantization step.
Recommended publications
  • A Core Language for Dependently Typed Programming
    DRAFT ΠΣ: A Core Language for Dependently Typed Programming Thorsten Altenkirch Nicolas Oury University of Nottingham {txa,npo}@cs.nott.ac.uk Abstract recursion and hence is, without further restrictions, unsuitable as We introduce ΠΣ, a core language for dependently typed program- a logical system. It is, after all, intended to be primarily a core ming. Our intention is that ΠΣ should play the role extensions of language for programming, not for reasoning. Apart from Σ- and System F are playing for conventional functional languages with Π-types our language has only a few more, namely: polymorphism, like Haskell. The core language incorporates mu- Type : Type This is the simplest choice, the most general form of tual dependent recursive definitions, Type : Type, Π- and Σ-types, impredicative polymorphism possible. It is avoided in systems finite sets of labels and explicit constraints. We show that standard used for reasoning because it destroys logical consistency. We constructions in dependently typed programming can be easily en- don’t care because we have lost consistency already by allowing coded in our language. We address some important issues: having recursion. an equality checker which unfolds recursion only when needed, avoiding looping when typechecking sensible programs; the sim- Finite types A finite type is given by a collection of labels, e.g. { , } plification of type checking for eliminators like case by using equa- true false to define the type of Booleans. Our labels are tional constraints, allowing the flexible use of case expressions a special class and can be reused, opening the scope for a within dependently typed programming and the representation of hereditary definition of subtyping.
    [Show full text]
  • Polymorphism All the Way Up! from System F to the Calculus of Constructions
    Programming = proving? The Curry-Howard correspondence today Second lecture Polymorphism all the way up! From System F to the Calculus of Constructions Xavier Leroy College` de France 2018-11-21 Curry-Howard in 1970 An isomorphism between simply-typed λ-calculus and intuitionistic logic that connects types and propositions; terms and proofs; reductions and cut elimination. This second lecture shows how: This correspondence extends to more expressive type systems and to more powerful logics. This correspondence inspired formal systems that are simultaneously a logic and a programming language (Martin-Lof¨ type theory, Calculus of Constructions, Pure Type Systems). 2 I Polymorphism and second-order logic Static typing vs. genericity Static typing with simple types (as in simply-typed λ-calculus but also as in Algol, Pascal, etc) sometimes forces us to duplicate code. Example A sorting algorithm applies to any list list(t) of elements of type t, provided it also receives then function t ! t ! bool that compares two elements of type t. With simple types, to sort lists of integers and lists of strings, we need two functions with dierent types, even if they implement the same algorithm: sort list int :(int ! int ! bool) ! list(int) ! list(int) sort list string :(string ! string ! bool) ! list(string) ! list(string) 4 Static typing vs. genericity There is a tension between static typing on the one hand and reusable implementations of generic algorithms on the other hand. Some languages elect to weaken static typing, e.g. by introducing a universal type “any” or “?” with run-time type checking, or even by turning typing o: void qsort(void * base, size_t nmemb, size_t size, int (*compar)(const void *, const void *)); Instead, polymorphic typing extends the algebra of types and the typing rules so as to give a precise type to a generic function.
    [Show full text]
  • Logics and Type Systems
    Logics and Typ e Systems een wetenschapp elijke pro eve op het gebied van de wiskunde en informatica proefschrift ter verkrijging van de graad van do ctor aan de Katholieke Universiteit Nijmegen volgens b esluit van het College van Decanen in het op enbaar te verdedigen op dinsdag septemb er des namiddags te uur precies do or Jan Herman Geuvers geb oren mei te Deventer druk Universiteitsdrukkerij Nijmegen Promotor Professor dr H P Barendregt Logics and Typ e Systems Herman Geuvers Cover design Jean Bernard Ko eman cipgegevens Koninklijke Bibliotheek Den Haag Geuvers Jan Herman Logics and typ e systems Jan Herman Geuvers Sl sn Nijmegen Universiteitsdrukkerij Nijmegen Pro efschrift Nijmegen Met lit opgreg ISBN Trefw logica vo or de informatica iv Contents Intro duction Natural Deduction Systems of Logic Intro duction The Logics Extensionality Some useful variants of the systems Some easy conservativity results Conservativity b etween the logics Truth table semantics for classical prop ositional logics Algebraic semantics for intuitionistic prop ositional logics Kripke semantics for intuitionistic prop ositional logics Formulasastyp es Intro duction The formulasastyp es notion a la Howard Completeness of the emb edding Comparison with other emb eddings Reduction of derivations and extensions
    [Show full text]
  • A Predicative Variant of Hyland's Effective Topos
    A predicative variant of Hyland’s Effective Topos Maria Emilia Maietti and Samuele Maschio Dipartimento di Matematica, Universit`adi Padova, Italy maietti/[email protected] Abstract Here, we present a subcategory pEff of Hyland’s Effective Topos Eff which can be considered a predicative variant of Eff itself. The construction of pEff is motivated by the desire of providing a “predicative” categorical universe of realizers to model the Minimalist Foundation for constructive mathematics which was ideated by the first author with G. Sambin in 2005 and completed into a two-level formal system by the first author in 2009. pEff is a “predicative” categorical universe because its objects and morphisms can be formalized in Feferman’s predicative weak theory of d inductive definitions ID1. Moreover, it is a predicative variant of the Effective Topos for the following reasons. First, pEff is a list-arithmetic locally cartesian closed pretopos of de- d finable objects in ID1 with a fibred category of small objects over pEff and a (non-small) classifier of small subobjects. Second, it happens to coincide with the exact completion on the lex d category defined as a predicative rendering in ID1 of the subcategory of Eff of recursive functions. As a consequence it validates the Formal Church’s thesis and it embeds in Eff by preserving the list-arithmetic locally cartesian closed pretopos structure. Keywords: Realizability topos, Lawvere’s hyperdoctrines, Type theory AMS classification: 03F50,18D30,18C99, 03D70 arXiv:1806.08519v1 [math.LO] 22 Jun 2018 1 Introduction As reported in [26] Hyland’s paper “The Effective Topos” [7] gave input to a whole new strand of research about realizability and its applications to logic, mathematics and computer science.
    [Show full text]
  • Type Theory in a Type Theory with Quotient Inductive Types
    Type theory in a type theory with quotient inductive types by Ambrus Kaposi Thesis submitted to the University of Nottingham for the degree of Doctor of Philosophy 2017 Abstract Type theory (with dependent types) was introduced by Per Martin-L¨ofwith the intention of providing a foundation for constructive mathematics. A part of constructive mathematics is type theory itself, hence we should be able to say what type theory is using the formal language of type theory. In addition, metatheoretic properties of type theory such as normalisation should be provable in type theory. The usual way of defining type theory formally is by starting with an inductive definition of precontexts, pretypes and preterms and as a second step defining a ternary typing relation over these three components. Well-typed terms are those preterms for which there exists a precontext and pretype such that the relation holds. However, if we use the rich metalanguage of type theory to talk about type theory, we can define well-typed terms directly as an inductive family indexed over contexts and types. We believe that this latter approach is closer to the spirit of type theory where objects come intrinsically with their types. Internalising a type theory with dependent types is challenging because of the mutual definitions of types, terms, substitution of terms and the conversion relation. We use induction induction to express this mutual dependency. Fur- thermore, to reduce the type-theoretic boilerplate needed for reasoning in the syntax, we encode the conversion relation as the equality type of the syntax. We use equality constructors thus we define the syntax as a quotient inductive type (a special case of higher inductive types from homotopy type theory).
    [Show full text]
  • Normalization by Evaluation for Sized Dependent Types Andreas Abel, Andrea Vezzosi, Théo Winterhalter
    Normalization by evaluation for sized dependent types Andreas Abel, Andrea Vezzosi, Théo Winterhalter To cite this version: Andreas Abel, Andrea Vezzosi, Théo Winterhalter. Normalization by evaluation for sized dependent types. Proceedings of the ACM on Programming Languages, ACM, 2017, 1, pp.33. 10.1145/3110277. hal-01596179 HAL Id: hal-01596179 https://hal.archives-ouvertes.fr/hal-01596179 Submitted on 27 Sep 2017 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. 33 Normalization by Evaluation for Sized Dependent Types ANDREAS ABEL, Gothenburg University, Sweden ANDREA VEZZOSI, Chalmers University of Technology, Sweden THEO WINTERHALTER, École normale supérieure Paris-Saclay, France Sized types have been developed to make termination checking more perspicuous, more powerful, and more modular by integrating termination into type checking. In dependently-typed proof assistants where proofs by induction are just recursive functional programs, the termination checker is an integral component of the trusted core, as validity of proofs depend on termination. However, a rigorous integration of full-fledged sized types into dependent type theory is lacking so far. Such an integration is non-trivial, as explicit sizes in proof terms might get in the way of equality checking, making terms appear distinct that should have the same semantics.
    [Show full text]
  • Type Theory in Type Theory Using Quotient Inductive Types
    Type Theory in Type Theory using Quotient Inductive Types Thorsten Altenkirch Ambrus Kaposi University of Nottingham {txa,auk}@cs.nott.ac.uk Abstract data Ty : Set where We present an internal formalisation of dependent type theory ι : Ty in type theory using a special case of higher inductive types _)_ : Ty ! Ty ! Ty from Homotopy Type Theory which we call quotient inductive types (QITs). Our formalisation of type theory avoids refering to data Con : Set where preterms or a typability relation but defines directly well typed ob- • : Con jects by an inductive definition. We use the elimination principle _,_ : Con ! Ty ! Con to define the set-theoretic and logical predicate interpretation. The data Var : Con ! Ty ! Set where work has been formalized using the Agda system extended with zero : Var (Γ , σ) σ QITs using postulates. suc : Var Γ σ ! Var (Γ , τ) σ Categories and Subject Descriptors D.3.1 [Formal Definitions data Tm : Con ! Ty ! Set where and Theory]; F.4.1 [Mathematical Logic]: Lambda calculus and var : Var Γ σ ! Tm Γ σ related systems _@_ : Tm Γ(σ ) τ) Keywords Higher Inductive Types, Homotopy Type Theory, Log- ! Tm Γ σ ! Tm Γ τ ical Relations, Metaprogramming Λ: Tm (Γ , σ) τ ! Tm Γ(σ ) τ) 1. Introduction Figure 1. Simply typed λ-calculus Within Type Theory it is straightforward to represent the simply typed λ-calculus as an inductive type where contexts and types are Typechecking can be expressed in this view as constructing a par- defined as inductive types and terms are given as an inductively tial inverse to the forgetful function which maps typed into untyped defined family indexed by contexts and types (see figure 1 for a syntax (a sort of printing operation).
    [Show full text]
  • A Framework for Defining Computational Higher-Order Logics Ali Assaf
    A framework for defining computational higher-order logics Ali Assaf To cite this version: Ali Assaf. A framework for defining computational higher-order logics. Computer Science [cs]. École polytechnique, 2015. English. tel-01235303v4 HAL Id: tel-01235303 https://pastel.archives-ouvertes.fr/tel-01235303v4 Submitted on 16 Dec 2015 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. École doctorale polytechnique (EDX) Numéro 447 Spécialité informatique Thèse de doctorat de l’École polytechnique préparée à Inria Paris-Rocquencourt par Ali Assaf A framework for defining computational higher-order logics Un cadre de définition de logiques calculatoires d’ordre supérieur Présentée et soutenue à Paris, le 28 septembre 2015 Composition du jury: Président Dale Miller LIX & Inria Saclay, France Rapporteurs Andrea Asperti University of Bologna, Italie Herman Geuvers University of Nijmegen, Pays-bas John Harrison Intel Corporation, USA Examinateurs Brigitte Pientka McGill University, Canada Hugo Herbelin PPS & Inria Paris, France Directeurs de thèse Gilles Dowek Inria Paris, France Guillaume Burel ENSIIE, France Abstract The main aim of this thesis is to make formal proofs more universal by expressing them in a common logical framework. More specifically, we use the lambda-Pi-calculus modulo rewriting, a lambda calculus equipped with dependent types and term rewriting, as a language for defining logics and expressing proofs in those logics.
    [Show full text]
  • Programs, Types, and Bayes Lucas Eduardo Morales
    On the Representation and Learning of Concepts: Programs, Types, and Bayes by Lucas Eduardo Morales Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree of Master of Engineering in Electrical Engineering and Computer Science at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY September 2018 ⃝c Massachusetts Institute of Technology 2018. All rights reserved. Author............................................................................ Department of Electrical Engineering and Computer Science September 2018 Certified by........................................................................ Joshua B. Tenenbaum Professor Thesis Supervisor Accepted by....................................................................... Katrina LaCurts Chair, Master of Engineering Thesis Committee 2 On the Representation and Learning of Concepts: Programs, Types, and Bayes by Lucas Eduardo Morales Submitted to the Department of Electrical Engineering and Computer Science on September 2018, in partial fulfillment of the requirements for the degree of Master of Engineering in Electrical Engineering and Computer Science Abstract This thesis develops computational models of cognition with a focus on concept represen- tation and learning. We start with brief philosophical discourse accompanied by empirical findings and theories from developmental science. We review many formal foundations of computation as well as modern approaches to the problem of program induction — the learning of structure
    [Show full text]
  • Normalization by Evaluation: Dependent
    Habilitationsschrift Normalization by Evaluation Dependent Types and Impredicativity Andreas Abel Institut f¨urInformatik Ludwig-Maximilians-Universit¨atM¨unchen Abstract Normalization by evaluation (NbE) is a technique to compute the normal form of a lambda-term, i. e., an expression of a pure functional programming language. While evaluation is only concerned with computing closed expressions, normalization also applies to function bodies, thus, needs to compute with open expressions containing free variables. NbE reduces normalization to evaluation of expressions in a residualizing model, i. e., a computational structure that has extra base values which are unknowns or computations blocked by unknowns. Normalization by evaluation, while not under this name, has been used by Martin- L¨of[1975] to prove normalization and decidability of type checking for his predicative intuitionistic type theory with a weak notion of term equality that is not closed under function abstraction. Independently, normalization by evaluation has been discoverd by Berger and Schwichtenberg[1991] as a tool to implement a normalizer for simply-typed lambda-calculus with a strong (extensional, \η") notion of term equality. Normaliza- tion invokes the evaluator of the host programming language, leading to a concise and efficient normalization procedure. In this thesis, we join the two strands of research by developing NbE for dependent type theory with extensional term equality that does consider normalization of func- tion bodies. Further, we extend NbE to impredicative type systems such as System F, F!, and the Calculus of Constructions. As NbE is a tool to connect syntax (terms) to semantics (values), the study of NbE enables us to semantically prove meta-theoretical properties of the considered type systems such as decidability of term equality, which entails the decidability of type checking in the presence of dependent types.
    [Show full text]
  • The Calculus of Inductive Constructions
    The Calculus of Inductive Constructions Hugo Herbelin 10th Oregon Programming Languages Summer School Eugene, Oregon, June 16-July 1, 2011 1 Outline - A bit of history, leading to the Calculus of Inductive Constructions (CIC) - The first ingredient of the CIC: a Pure Type System with subtyping - The second ingredient of the CIC: Martin-Löf-style inductive definitions - The logical strength of the CIC, compared to set theory - More advanced topics 2 A few steps of the history of logic (from formal logic to proof theory) Boole’s laws of thought (1854): an algebraic description of propositional reasoning (followed by Peirce, Schröder ...) Frege’s Begriffsschrift (1879): formal quantifiers + formal system of proofs (including an axiom- atization of Cantor’s naive set theory) Peano’s arithmetic (1889): formal arithmetic on top of Peirce-Schröder “predicate calculus” Zermelo (1908), Fraenkel (1922): the stabilization of set theory as known today (ZF) Russell and Whitehead’s Principia Mathematica (1910): type theory as a foundation of mathe- matics alternative to set theory Skolem’s Primitive Recursive Arithmetic (1923): the (quantifier-free) logic of primitive recursive functions (the logic of metamathematics) Brouwer’s intuitionism (1923): the view that proofs are “computation methods” + rejection of excluded-middle (classical logic) because not effective as a computation method (followed by Heyting, Kolmogorov, ...) 3 A few steps of the history of logic (from formal logic to proof theory) Gödel’s incompleteness of arithmetic (1931): consistency
    [Show full text]
  • The Structural Lambda-Calculus Beniamino Accattoli, Delia Kesner
    The structural lambda-calculus Beniamino Accattoli, Delia Kesner To cite this version: Beniamino Accattoli, Delia Kesner. The structural lambda-calculus. 2010. hal-00528228 HAL Id: hal-00528228 https://hal.archives-ouvertes.fr/hal-00528228 Preprint submitted on 21 Oct 2010 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. The structural λ-calculus Beniamino Accattoli and Delia Kesner PPS (CNRS and Universit´eParis Diderot) June 2010 Abstract. Inspired by a recent graphical formalism for λ-calculus based on Linear Logic technology, we introduce an untyped structural λ-calculus, called λj, which combines action at a distance with exponential rules de- composing the substitution by means of weakening, contraction and dere- liction. Firstly, we prove fundamental properties such as confluence and preservation of β-strong normalisation. Secondly, we use λj to describe known notions of developments and superdevelopments, and introduce a more general one called XL-development. Then we show how to refor- mulate Regnier’s σ-equivalence in λj so that it becomes a strong bisim- ulation. Finally, we prove that explicit composition or de-composition of substitutions can be added to λj while still preserving β-strong normal- isation.
    [Show full text]