Nonlinear Delay Differential Equations and Their Application to Modeling Biological Network Motifs ✉ David S

Total Page:16

File Type:pdf, Size:1020Kb

Nonlinear Delay Differential Equations and Their Application to Modeling Biological Network Motifs ✉ David S ARTICLE https://doi.org/10.1038/s41467-021-21700-8 OPEN Nonlinear delay differential equations and their application to modeling biological network motifs ✉ David S. Glass 1, Xiaofan Jin 2 & Ingmar H. Riedel-Kruse 3 Biological regulatory systems, such as cell signaling networks, nervous systems and ecolo- gical webs, consist of complex dynamical interactions among many components. Network motif models focus on small sub-networks to provide quantitative insight into overall 1234567890():,; behavior. However, such models often overlook time delays either inherent to biological processes or associated with multi-step interactions. Here we systematically examine explicit-delay versions of the most common network motifs via delay differential equation (DDE) models, both analytically and numerically. We find many broadly applicable results, including parameter reduction versus canonical ordinary differential equation (ODE) models, analytical relations for converting between ODE and DDE models, criteria for when delays may be ignored, a complete phase space for autoregulation, universal behaviors of feedforward loops, a unified Hill-function logic framework, and conditions for oscillations and chaos. We conclude that explicit-delay modeling simplifies the phenomenology of many biological networks and may aid in discovering new functional motifs. 1 Department of Molecular Cell Biology, Weizmann Institute of Science, Rehovot, Israel. 2 Gladstone Institutes, San Francisco, CA, USA. 3 Department of Molecular and Cellular Biology, and (by courtesy) Departments of Applied Mathematics and Biomedical Engineering, University of Arizona, Tucson, AZ, USA. ✉ email: [email protected] NATURE COMMUNICATIONS | (2021) 12:1788 | https://doi.org/10.1038/s41467-021-21700-8 | www.nature.com/naturecommunications 1 ARTICLE NATURE COMMUNICATIONS | https://doi.org/10.1038/s41467-021-21700-8 iological regulation consists of complex networks of is a corresponding DDE, where x(t − τ) represents the value of x dynamical interactions1–5. Transcription factors control at a time τ units in the past, making the effect of x on the current B 6,7 production of other transcription factors , kinases the rate of change of x delayed by a time τ. The time scales and delays activation of other kinases1,3,4, cells the growth of other cells8,9, are thus explicit (Fig. 1), better capturing dynamics where and species the population size of other species10. “Network intermediate steps are not fast, as compared to ODE models, motifs” describe particularly important substructures in biological which may fail to capture real delays, hide their effects by over- networks, such as negative feedback, feedforward regulation and simplification, or require additional variables and parameters to cascades2,6,11. The function of network motifs often depends on predict complex phenomena17,23,32. Such delay models have been emergent properties of many parameters, notably delays7,12,13, productive in a variety of biological scenarios, such as processes and previous work showed that delays can lead to dramatic with many intermediate but unimportant steps33,34 and age- biological changes, such as sustained oscillations12,14–17. Delays structured populations34,35. Network models with delays have are crucial to behavior in natural18–20 and synthetic21,22 genetic also been explored in various contexts36–39. Intercellular signal oscillators, in development and disease2,7,14,16,17,23–31, and in transduction, for example, requires multiple time-consuming ecological booms and busts8. Despite such examples, there has steps that are not negligible23,32. been no thorough treatment of network motifs with delays With DDEs, multiple steps (“cascades”) within a network can included explicitly. be rigorously simplified into a single step with delay (see Here we provide a theoretical and practical basis for analyzing below), an approach which has been explored in a variety of network motifs with explicit delays, and we demonstrate the biological contexts18,33,34,40–42. This makes interpretation of utility of this approach in a variety of biological contexts. the phenomenology simpler than with ODEs and reduces the Whereas network motifs are typically modeled using ordinary number of equations and parameters in the model18,23.This differential equations (ODEs) with variables reacting to one idea can be visualized by depicting regulatory networks as another instantaneously (timed by rate constants), we explore directed graphs, with nodes representing biological species, and network motif modeling using delay differential equations pointed vs. blunt arrows indicating activation vs. repression, (DDEs), which have derivatives depending explicitly on the value respectively (Fig. 1). DDE models allow a single arrow to of variables at times in the past. For example, faithfully capture many biochemical steps18,33,43,expandingthe available dynamics in a model with a reduced set of equations x_ðtÞ¼αxðtÞð1Þ and parameters. DDE regulatory models have in fact been used is an ODE, and widely to model a range of biological phenomena such 17,44 30,31 _ð Þ¼α ð À τÞðÞ as development and hematopoiesis . For instance, a 1- x t x t 2 variable ODE such as Eq. (1) can only produce exponential ODE Model DDE Model a τ τ Z XX Y Z X X Z b c 1.0 1.0 0.8 0.8 0.6 0.6 Concentration 0.4 Concentration 0.4 0.2 0.2 x y z 0.0 0.0 0 5 10 15 20 25 30 35 40 0 5 10 15 20 25 30 35 40 Time (t ) Time (t ) Fig. 1 Explicit inclusion of time delays in mathematical models of network motifs can reproduce non-delay models using fewer variables and parameters, but can also lead to more complex behavior. a An example genetic regulatory network including genes X, Y, and Z, regulated by one another either positively (activation, pointed arrow) or negatively (repression, blunt arrow). The model on the left incorporates no explicit delay terms, whereas the model on the right incorporates explicit delay terms τx and τz. b Ordinary differential equations (ODEs) and delay differential equations (DDEs) corresponding to (a) with regulation strengths αi, removal rates βi and cooperativities ni. c Numerical simulations of equations in (b) for one set of initial conditions using parameters αx = 1, αy = 1.2, αz = 1.2, βx = βy = βz = 1, nx = ny = nz = 2 for the ODE simulation, and αx = 0.5, αz = 0.3529, βx = βz = 0.5, nx = nz = 2 for the DDE simulations (dashed curves: τx = 0.8, τz = 0.1; solid curves: τx = 3, τz = 4). Note that delays can cause more complex dynamics (e.g., transient oscillations) compared to models in which effects are instantaneous, and where both models give the same long-term steady state behavior. Left: instantaneous effects modeled using ODEs, Right: delayed effects modeled using DDEs. 2 NATURE COMMUNICATIONS | (2021) 12:1788 | https://doi.org/10.1038/s41467-021-21700-8 | www.nature.com/naturecommunications NATURE COMMUNICATIONS | https://doi.org/10.1038/s41467-021-21700-8 ARTICLE growth or decay45,46. A corresponding DDE, such as Eq. (2), a fi can also oscillate (with amplitude approaching zero or in nity) X Y and, if nonlinear, lead to stable oscillations, bistability and chaos13,26,47–49. A key challenge in using DDEs is their mathematical com- b plexity relative to ODEs50,51. For example, while Eq. (1)is1- dimensional because one initial condition (x at t = 0) determines X Y X Y all future behavior, Eq. (2)isinfinite-dimensional, because x must be specified at all times − τ ≤ t ≤ 0 to predict a unique c 6 6 solution50,51. Concretely, the solution to Eq. (1) can be written as a single exponential, while Eq. (2) generally must be specified as a 5 5 sum of an infinite number of exponential terms to satisfy initial 4 4 conditions. 3 3 Despite the challenges, much progress has been made in 46,52,53 2 2 Concentration analytical understanding of DDEs , and numerical Concentration 54,55 methods exist for simulation . We thus see an opportunity to 1 1 use DDEs to recapitulate dynamics found in ODE solutions of X Y network motif behavior with fewer genes and thus fewer mod- 0 0 eling parameters and equations (Fig. 1), a type of “modeling 0 2 4 6 8 10 0 2 4 6 8 10 Time (T) Time (T) simplicity.” In this work, we thoroughly examine the most common net- Fig. 2 Direct regulation by activators and inhibitors can be captured work motifs2,6 with explicit delays and present an approachable, using a unified delay model. a The simplest regulation network consists of step-by-step view of the mathematical analysis (applying estab- a single input X directly regulating a single output Y. We use a dotted arrow lished DDE methods34,51) in order to make such delay equations to represent either activation or repression, with an implied explicit delay. easy to use for biologists and others. We show the essential role of b Direct activation (left) is represented by a pointed arrow and direct delays in autoregulation, feedforward loops, feedback loops, repression (right) by a blunt arrow. c Time response (Eq. (7)) of activated multiple feedback, and complex networks, as well as instances (left) and repressed (right) Y following a rise in X that exponentially where delays may be ignored. A reference summary is provided at approaches a new steady state (ηX = 6) from zero (governed by _ the end in Table 2. Finally, we discuss how these results can be XðTÞ¼ηX À XðTÞ). Note that the finite value of ηX leads to an effective applied to understanding fundamental design principles of var- leakage slightly greater than ϵ for the repressor case. For the activator ious natural biological systems. (n = −2), we chose η = 5.6528 to match esthetically between the X and n Y steady states, such that ηX ¼ ϵ þ η=ð1 þ ηXÞ. For the repressor (n = 2), we similarly chose η = 5.5 to match esthetically between the X steady state Results and Y initial condition, such that ηX = η + ϵ.
Recommended publications
  • Logic Functions Realized Using Clockless Gates for Rapid Single-Flux-Quantum Circuits
    R2-4 SASIMI 2021 Proceedings Logic Functions Realized Using Clockless Gates for Rapid Single-Flux-Quantum Circuits Takahiro Kawaguchi Kazuyoshi Takagi Naofumi Takagi Graduate School of Informatics Graduate School of Engineering Graduate School of Informatics Kyoto University Mie University Kyoto University Kyoto, 606-8501, Japan Mie, 514-8507, Japan Kyoto, 606-8501, Japan [email protected] [email protected] [email protected] Abstract— Superconducting rapid single-flux- and the area occupied by a clock distribution network are quantum (RSFQ) circuit is a promising candidate reduced. The reduction of the pipeline depth leads to a for circuit technology in the post-Moore era. RSFQ fewer DFFs for path-balancing and a smaller circuit area. digital circuits operate with pulse logic and are A clockless AND gate and a clockless NIMPLY gate was usually composed of clocked gates. We have proposed proposed in [10]. A NIMPLY (not-imply) gate is an AND clockless gates, which can reduce the hardware gate with one inverted input, which implements x∧¬y.A amount of a circuit drastically. In this paper, we confluence buffer [1], which merges a pulse from its inputs first discuss logic functions realizable using clockless to its output, can be used as a clockless OR gate. gates. We show that all the 0-preserving functions A clockless gate realizes only a 0-preserving logic func- can be realized using the existing clockless gates, tion, which outputs 0 from the input value of all 0s, be- i.e., AND, OR, and NIMPLY (not-imply) gates.
    [Show full text]
  • Layering Genetic Circuits to Build a Single Cell, Bacterial Half Adder
    bioRxiv preprint doi: https://doi.org/10.1101/019257; this version posted May 30, 2015. The copyright holder for this preprint (which was not certified by peer review) is the author/funder, who has granted bioRxiv a license to display the preprint in perpetuity. It is made available under aCC-BY-NC-ND 4.0 International license. 1 Layering genetic circuits to build a single cell, bacterial half adder 2 Adison Wong1,2,†, Huijuan Wang1, Chueh Loo Poh1* and Richard I Kitney2* 3 4 1School of Chemical and Biomedical Engineering, Nanyang Technological University, Singapore 637459, SG 5 2Department of Bioengineering, Imperial College London, London SW7 2AZ, UK 6 7 * To whom correspondence should be addressed: Chueh Loo Poh, Division of Bioengineering, School of 8 Chemical and Biomedical Engineering, Nanyang Technological University, Singapore 637459, SG. Tel: +65 9 6514 1088; Email: [email protected] 10 11 * Correspondence may also be addressed to: Richard Ian Kitney, Centre for Synthetic Biology and Innovation, 12 and Department of Bioengineering, Imperial College London, London SW7 2AZ, UK. Tel: +44 (0)20 7594 6226; 13 Email: [email protected] 14 15 †Present Address: NUS Synthetic Biology for Clinical and Technological Innovation, National University of 16 Singapore, Singapore 117456, SG 17 18 ABSTRACT 19 Gene regulation in biological systems is impacted by the cellular and genetic context-dependent 20 effects of the biological parts which comprise the circuit. Here, we have sought to elucidate the 21 limitations of engineering biology from an architectural point of view, with the aim of compiling a set of 22 engineering solutions for overcoming failure modes during the development of complex, synthetic 23 genetic circuits.
    [Show full text]
  • Layering Genetic Circuits to Build a Single Cell, Bacterial Half Adder
    bioRxiv preprint doi: https://doi.org/10.1101/019257; this version posted May 12, 2015. The copyright holder for this preprint (which was not certified by peer review) is the author/funder, who has granted bioRxiv a license to display the preprint in perpetuity. It is made available under aCC-BY-NC-ND 4.0 International license. 1 Layering genetic circuits to build a single cell, bacterial half adder 2 Adison Wong1,2,†, Huijuan Wang1, Chueh Loo Poh1* and Richard I Kitney2* 3 4 1School of Chemical and Biomedical Engineering, Nanyang Technological University, Singapore 637459, SG 5 2Department of Bioengineering, Imperial College London, London SW7 2AZ, UK 6 7 * To whom correspondence should be addressed: Chueh Loo Poh, Division of Bioengineering, School of 8 Chemical and Biomedical Engineering, Nanyang Technological University, Singapore 637459, SG. Tel: +65 9 6514 1088; Email: [email protected] 10 11 * Correspondence may also be addressed to: Richard Ian Kitney, Centre for Synthetic Biology and Innovation, 12 and Department of Bioengineering, Imperial College London, London SW7 2AZ, UK. Tel: +44 (0)20 7594 6226; 13 Email: [email protected] 14 15 †Present Address: NUS Synthetic Biology for Clinical and Technological Innovation, National University of 16 Singapore, Singapore 117456, SG 17 18 ABSTRACT 19 Gene regulation in biological systems is impacted by the cellular and genetic context-dependent 20 effects of the biological parts which comprise the circuit. Here, we have sought to elucidate the 21 limitations of engineering biology from an architectural point of view, with the aim of compiling a set of 22 engineering solutions for overcoming failure modes during the development of complex, synthetic 23 genetic circuits.
    [Show full text]
  • Keeping up with Expressing the Sense of Structured Natural Language Semantics
    NWI-IMK013 Keeping up with expressing the sense of structured natural language semantics Master thesis Information Sciences Author: Student number: T. (Thomas) Nobel S1013787 Supervisor dr. S.J.B.A. (Stijn) Hoppenbrouwers Assessor dr. ir. E. (Eelco) Herder Sunday 10th November, 2019 Abstract Domain-specific languages are not a static entity. On the contrary, they are con- tinuously changing and adapting to their respective environments. Cybernetics can be used to explain why domain-specific language evolution exists. We observe that objects, entities, and terms in different applications such as Fact-Based Modelling (FBM) and lexical databases (such as Wordnet) are fundamentally (logically) equiv- alent. To assert this claim, we will use a diverse set of theories including first- and second-order cybernetics, Wittgenstein, and Kripke semantics to argue why we be- lieve that in essence the challenges of defining domain-specific languages are strongly related with the challenges of formal information modelling. In this thesis, we aim for soundness and reliability while defining the domain-specific language. The goal of combining seemingly different theories is to propose a new framework and basis for further (applied) research in correctly defining, mapping, and comparing domain- specific languages. Our explanation can be used to improve the newly developed tool called A-Lex, which aims to make building domain-specific lexicons and busi- ness data models more approachable for non-IT experts by the use of self-service modelling. A-Lex gives private persons, academics, public authorities and organisa- tions the opportunity to make public collections which can be reused, shared, and imported freely by others (a form of crowdsourcing).
    [Show full text]
  • The Complexity of Boolean Functions
    The Complexity of Boolean Functions Ingo Wegener Johann Wolfgang Goethe-Universit¨at WARNING: This version of the book is for your personal use only. The material is copyrighted and may not be redistributed. Copyright c 1987 by John Wiley & Sons Ltd, and B. G. Teubner, Stuttgart. All rights reserved. No part of this book may be reproduced by any means, or transmitted, or translated into a machine language without the written permission of the publisher. Library of Congress Cataloguing in Publication Data: Wegener, Ingo The complexity of boolean functions. (Wiley-Teubner series in computer science) Bibliography: p. Includes index. 1. Algebra, Boolean. 2. Computational complexity. I. Title. II. Series. AQ10.3.W44 1987 511.3’24 87-10388 ISBN 0 471 91555 6 (Wiley) British Library Cataloguing in Publication Data: Wegener, Ingo The complexity of Boolean functions.—(Wiley-Teubner series in computer science). 1. Electronic data processing—Mathematics 2. Algebra, Boolean I. Title. II. Teubner, B. G. 004.01’511324 QA76.9.M3 ISBN 0 471 91555 6 CIP-Kurztitelaufnahme der Deutschen Bibliothek Wegener, Ingo The complexity of Boolean functions/Ingo Wegener.—Stuttgart: Teubner; Chich- ester; New York; Brisbane; Toronto; Singapore: Wiley, 1987 (Wiley-Teubner series in computer science) ISBN 3 519 02107 2 (Teubner) ISBN 0 471 91555 6 (Wiley) Printed and bound in Great Britain On this version of the “Blue Book” This version of “The Complexity of Boolean Functions,” for some people simply the “Blue Book” due to the color of the cover of the orig- inal from 1987, is not a print-out of the original sources.
    [Show full text]
  • Model-Guided Design of Mammalian Genetic Programs Exclusive Licensee J
    SCIENCE ADVANCES | RESEARCH ARTICLE GENETICS Copyright © 2021 The Authors, some rights reserved; Model-guided design of mammalian genetic programs exclusive licensee J. J. Muldoon1,2, V. Kandula3, M. Hong2, P. S. Donahue1,2,4, J. D. Boucher1,2, American Association 1,2,5,6 1,2,5 for the Advancement N. Bagheri , J. N. Leonard * of Science. No claim to original U.S. Government Genetically engineering cells to perform customizable functions is an emerging frontier with numerous techno- Works. Distributed logical and translational applications. However, it remains challenging to systematically engineer mammalian cells under a Creative to execute complex functions. To address this need, we developed a method enabling accurate genetic program Commons Attribution design using high-performing genetic parts and predictive computational models. We built multifunctional pro- License 4.0 (CC BY). teins integrating both transcriptional and posttranslational control, validated models for describing these mechanisms, implemented digital and analog processing, and effectively linked genetic circuits with sensors for multi-input evaluations. The functional modularity and compositional versatility of these parts enable one to satisfy a given design objective via multiple synonymous programs. Our approach empowers bioengineers to predictively de- sign mammalian cellular functions that perform as expected even at high levels of biological complexity. Downloaded from INTRODUCTION these parts (25), and computational and conceptual tools that facilitate Early demonstrations of genetically engineering customized func- the identification of designs that function robustly despite biological tions in mammalian cells indicate a vast potential to benefit applica- variability and cross-talk (26–28). In this study, we sought to address tions including directed stem cell differentiation (1, 2) and cell-based these issues by developing a model-driven process that enables one to therapies (3).
    [Show full text]
  • Layering Genetic Circuits to Build a Single Cell, Bacterial Half Adder Adison Wong1,2,3, Huijuan Wang1, Chueh Loo Poh1* and Richard I
    Wong et al. BMC Biology (2015) 13:40 DOI 10.1186/s12915-015-0146-0 RESEARCH ARTICLE Open Access Layering genetic circuits to build a single cell, bacterial half adder Adison Wong1,2,3, Huijuan Wang1, Chueh Loo Poh1* and Richard I. Kitney2* Abstract Background: Gene regulation in biological systems is impacted by the cellular and genetic context-dependent effects of the biological parts which comprise the circuit. Here, we have sought to elucidate the limitations of engineering biology from an architectural point of view, with the aim of compiling a set of engineering solutions for overcoming failure modes during the development of complex, synthetic genetic circuits. Results: Using a synthetic biology approach that is supported by computational modelling and rigorous characterisation, AND, OR and NOT biological logic gates were layered in both parallel and serial arrangements to generate a repertoire of Boolean operations that include NIMPLY, XOR, half adder and half subtractor logics in a single cell. Subsequent evaluation of these near-digital biological systems revealed critical design pitfalls that triggered genetic context-dependent effects, including 5′ UTR interferences and uncontrolled switch-on behaviour of the supercoiled σ54 promoter. In particular, the presence of seven consecutive hairpins immediately downstream of the promoter transcription start site severely impeded gene expression. Conclusions: As synthetic biology moves forward with greater focus on scaling the complexity of engineered genetic circuits, studies which thoroughly evaluate failure modes and engineering solutions will serve as important references for future design and development of synthetic biological systems. This work describes a representative case study for the debugging of genetic context-dependent effects through principles elucidated herein, thereby providing a rational design framework to integrate multiple genetic circuits in a single prokaryotic cell.
    [Show full text]
  • Nonlinear Delay Differential Equations and Their Application to Modeling Biological Network Motifs
    bioRxiv preprint doi: https://doi.org/10.1101/2020.08.02.233619; this version posted August 4, 2020. The copyright holder for this preprint (which was not certified by peer review) is the author/funder, who has granted bioRxiv a license to display the preprint in perpetuity. It is made available under aCC-BY 4.0 International license. Nonlinear delay differential equations and their application to modeling biological network motifs David S.Glass1, Xiaofan Jin2, Ingmar H. Riedel-Kruse3,* 1 Department of Molecular Cell Biology, Weizmann Institute of Science, Rehovot 76100, Israel 2 Gladstone Institutes, San Francisco, CA 94158, USA 3 Department of Molecular and Cellular Biology, and (by courtesy) Departments of Applied Mathematics and Biomedical Engineering, University of Arizona, Tucson, Arizona 85721, USA * [email protected] Abstract Biological regulatory systems, such as transcription factor or kinase networks, consist of complex dynamical interactions among many components. \Network motif" models focus on small sub-networks to provide quantitative insight into overall behavior. However, conventional network motif models often ignore time delays either inherent to biological processes or associated with multi-step interactions. Here we systematically examine explicit-delay versions of the most common network motifs via delay differential equations (DDEs), both analytically and numerically. We find many broadly applicable results, such as the reduction in number of parameters compared to canonical descriptions via ordinary differential equations (ODE), criteria for when delays may be ignored, a complete phase space for autoregulation, explicit dependence of feedforward loops on a difference of delays, a unified framework for Hill-function logic, and conditions for oscillations and chaos.
    [Show full text]
  • Reasoning in Description Logics Using Resolution and Deductive Databases
    Zur Erlangung des akademischen Grades eines Doktors der Wirtschaftswissenschaften (Dr. rer. pol.) von der Fakult¨atf¨urWirtschaftswissenschaften der Universit¨atFridericiana zu Karlsruhe genehmigte Dissertation. Reasoning in Description Logics using Resolution and Deductive Databases M.Sc. Boris Motik Tag der m¨undlichen Pr¨ufung: 09. Januar 2006 Referent: Prof. Dr. Rudi Studer, Universit¨atKarlsruhe (TH) Korreferentin 1: Dr. habil. Ulrike Sattler, University of Manchester Korreferent 2: Prof. Dr. Karl-Heinz Waldmann, Universit¨atKarlsruhe (TH) 2006 Karlsruhe ii Abstract Description logics (DLs) are knowledge representation formalisms with well-understood model-theoretic semantics and computational properties. The DL SHIQ(D) provides the logical underpinning for the family of Semantic Web ontology languages. Metadata management applications, such as the Semantic Web, often require reasoning with large quantities of assertional information; however, existing algorithms for DL reasoning have been optimized mainly for efficient terminological reasoning. Although techniques for terminological reasoning can be used for assertional reasoning as well, they often do not exhibit good performance in practice. Deductive databases are knowledge representation systems specifically designed to efficiently reason with large data sets. To see if deductive database techniques can be used to optimize assertional reasoning in DLs, we studied the relationship between the two formalisms. Our main result is a novel algorithm that reduces a SHIQ(D) knowledge base KB to a disjunctive datalog program DD(KB) such that KB and DD(KB) entail the same set of ground facts. In this way, we allow DL reasoning to be performed in DD(KB) using known, optimized algorithms. The reduction algorithm is based on several novel results.
    [Show full text]
  • Theorem Proving and Algebra
    SSSS Theorem Proving and Algebra SSSS Theorem Proving and SSSS Algebra Joseph A. Goguen SSSS Joseph A. Goguen SSSS SSSS S Theorem Proving and Algebra Theorem Proving and Algebra Joseph A. Goguen University of California, San Diego Joseph A. Goguen (1941–2006) Department of Computer Science and Engineering University of California, San Diego 9500 Gilman Drive, La Jolla CA 92093-0114 USA April 2006 © Joseph A. Goguen, 1990–2006. Edited by: Kokichi Futatsugi Narciso Martí-Oliet José Meseguer Text reviewed and commented by: Kokichi Futatsugi Daniel Mircea Gaina Narciso Martí-Oliet José Meseguer Masaki Nakamura Miguel Palomino Book designed and typeset by: Alberto Verdejo Contents Foreword by Editors xiii 1 Introduction 1 1.1 What is Theorem Proving? . 1 1.2 Applications of Theorem Proving . 2 1.3 Logic for Foundations versus Logic for Applications . 2 1.4 Why Equational Logic and Algebra? . 3 1.5 What Kind of Algebra? . 4 1.6 Term Rewriting . 5 1.7 Logical Systems and Proof Scores . 5 1.8 Semantics and Soundness . 6 1.9 Loose versus Standard Semantics . 7 1.10 Human Interface Design . 8 1.11 OBJ . 9 1.12 Some History and Related Work . 10 1.13 Using this Text . 12 1.13.1 Synopsis . 13 1.13.2 Novel Features . 13 1.14 Acknowledgements . 14 2 Signature and Algebra 15 2.1 Sets and Arrows . 15 2.2 Sorted Sets . 16 2.3 Signature . 18 2.4 Signatures in OBJ . 20 2.5 Algebras . 22 2.6 Term Algebras . 24 2.7 Unsorted Signature and Algebra . 26 2.8 Literature .
    [Show full text]