DOCSLIB.ORG

First Order Logic, Fixed Point Logic and Linear Order Anuj Dawar University of Pennsylvania

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
First Order Logic, Fixed Point Logic and Linear Order Anuj Dawar University of Pennsylvania View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by ScholarlyCommons@Penn University of Pennsylvania ScholarlyCommons IRCS Technical Reports Series Institute for Research in Cognitive Science November 1995 First Order Logic, Fixed Point Logic and Linear Order Anuj Dawar University of Pennsylvania Steven Lindell University of Pennsylvania Scott einsW tein University of Pennsylvania, [email protected] Follow this and additional works at: http://repository.upenn.edu/ircs_reports Dawar, Anuj; Lindell, Steven; and Weinstein, Scott, "First Order Logic, Fixed Point Logic and Linear Order" (1995). IRCS Technical Reports Series. 145. http://repository.upenn.edu/ircs_reports/145 University of Pennsylvania Institute for Research in Cognitive Science Technical Report No. IRCS-95-30. This paper is posted at ScholarlyCommons. http://repository.upenn.edu/ircs_reports/145 For more information, please contact [email protected]. First Order Logic, Fixed Point Logic and Linear Order Abstract The Ordered conjecture of Kolaitis and Vardi asks whether fixed-point logic differs from first-order logic on every infinite class of finite ordered structures. In this paper, we develop the tool of bounded variable element types, and illustrate its application to this and the original conjectures of McColm, which arose from the study of inductive definability and infinitary logic on proficient classes of finite structures (those admitting an unbounded induction). In particular, for a class of finite structures, we introduce a compactness notion which yields a new proof of a ramified version of McColm's second conjecture. Furthermore, we show a connection between a model-theoretic preservation property and the Ordered Conjecture, allowing us to prove it for classes of strings (colored orderings). We also elaborate on complexity-theoretic implications of this line of research. Comments University of Pennsylvania Institute for Research in Cognitive Science Technical Report No. IRCS-95-30. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/ircs_reports/145 Institute for Research in Cognitive Science First Order Logic, Fixed Point Logic and Linear Order Anuj Dawar Steven Lindell Scott Weinstein University of Pennsylvania 3401 Walnut Street, Suite 400C Philadelphia, PA 19104-6228 November 1995 Site of the NSF Science and Technology Center for Research in Cognitive Science IRCS Report 95--30 First Order Logic Fixed Point Logic and Linear Order Anuj Dawar Steven Lindell Scott Weinstein Dept of Computer Science Univ of Wales Swansea Swansea SA PP UK email adawarswanseaacuk Dept of Computer Science Haverford College Haverford PA USA email slindellhaverfordedu Dept of Philosophy Univ of Pennsylvania Philadelp hi a PA USA email weinsteincisupennedu Abstract The Ordered conjecture of Kolaitis and Vardi asks whether xedp oint logic diers from rstorder logic on every innite class of nite ordered structures In this pap er wedevelop the to ol of b ounded variable elementtyp es and illustrate its application to this and the orig inal conjectures of McColm which arose from the study of inductive denability and innitary logic on procient classes of nite structures those admitting an unb ounded induction In particular for a class of nite structures weintro duce a compactness notion which yields a new pro of of a ramied version of McColms second conjecture Furthermore we show a connection b etween a mo deltheoretic preservation prop erty and the Ordered Conjecture allowing us to prove it for classes of strings colored orderings We also elab orate on complexitytheoreti c implica tions of this line of research Intro duction The extensions of rst order logic by means of xed p oint op erators in particular the least xed p oint and partial xed p oint op erators have b een much studied in recentyears in the eld of nite mo del theory This is in large measure due to their connection with complexity classes ImmermanImmandVardi Var showed that the logic LFP the extension of rst order logic with a least xed p oint op erator captures the class PTIME on ordered structures Vardi Var and Abiteb oul and VianuAV showed that the similar extension of rst or der logic with a partial xed p oint op erator PFP captures the class PSPACE on ordered structures Furthermore Abiteb oul and VianuAV showed that LFP PFP if and only if PTIME PSPACE even without the restriction to ordered structures One of the most imp ortant to ols in the analysis of the xed p oint logics is the b ounded variable innitary logic L Kolaitis and Vardi Research supp orted byEPSRCgrant GRH Partially supp orted by NSF grant CCR and the John C Whitehead faculty research fundatHaverford College Supp orted in part by NSF CCR KVb showed that on the class of nite structures LFP and PFP can b e seen as fragments of L Moreover L has an elegantcharacterization in terms of p ebble games which has proved an extremely useful to ol in the analysis of the expressivepower of the xed p oint logics The logics LFP and PFP are b oth extensions of rst order logic and indeed they are prop er extensions on the class of all nite structures and on the class of ordered nite structures It also follows from the result of Abiteb oul and Vianu that if we can separate these two logics on any class of nite structures C then wewould separate PTIME from PSPACE On the other hand one can construct innite classes of structures on which the logics are equivalent and b oth of them indeed even L collapse to rst order logic Kolaitis and Vardi KVa initiated an investigation of which classes of structures C have the prop erty that LFP and L collapse to rst order logic on C They proved a conjecture of McColm McC showing that L collapses to FO if and only if every p ositive rstorder induction is b ounded Gurevich Immerman and Shelah GIS refuted another conjecture due to McColm by constructing a class of structures on which LFP collapses to FO but L do es conjectured the following weaker version of not Kolaitis and Vardi KVb McColms conjecture which remains op en Conjecture KolaitisVardi On every innite class of ordered structures thereisapolynomial time computable query that is not rst order denable In this pap er we discuss McColms conjectures relating them to nite vari able elementtyp es as intro duced in DLW a notion of compactness for classes of nite structures and a preservation prop erty In particular we relate this preservation prop erty to Conjecture allowing us to prove it for classes of strings linear orders with unary relations We also comment on the complexitytheo retic implications of Conjecture Parts of the material in this pap er app eared in preliminary form in Daw Section covers the background material on xed p oint logics innitary logics and elementtyp es Section relates inductive denitions and McColms conjectures to b ounded variable elementtyp es compactness and preservation prop erties Section discusses the relation b etween the preservation prop erties and Conjecture while Section relates this conjecture to questions in com plexity theory Background We assume the standard denitions of a rst order language or signature and a structure interpreting it Unless otherwise mentioned all structures we will b e dealing with are assumed to have nite universe and all signatures are assumed to b e nite and relational that is to consist of nitely many relation symb ols We write F to denote the class of all nite structures of signature and O to denote the class of ordered nite structures ie O is the collection of structures in F whichinterpret the binary relation symbol as a linear fg order An nary query over a class of structures C is a map Q sending each structure A C to an nary relation over A which satises the following condition for all A B C if f is an isomorphism from A onto B then QBf QA We will write FO LFP etc b oth to denote logics ie sets of formulas and the classes of queries that are expressible in the resp ective logics Wesay a logic L col lapses to another logic L over a class of structures C if and only if the collection of restrictions of queries in L to C is included in the collection of restrictions of queries in L to C Inductive and Innitary Logics Let R x x b e a rstorder formula On a structure A denes the k A A op erator R fha a ijhAR ij a a gIf is an Rp ositive k k A formula is monotone Wemay view as determining an induction on A the A m m The closure stages of which are dened as follows A A A A m m ordinal of on A denoted jjjj is the least m such that The A A A th y can b e uniformly dened over all m stage of the induction determined b m structures by a rstorder formula whichwe denote by The set inductively is the least xed p oint of the op erator that dened by on A denoted A A m is where m jjjj If s is a k tuple of elements of A and s A A A A m we use jsj to denote the least m suchthats The stage comparison query A for denoted is the query which assigns to each structure A the k ary relation dened as follows jsj js j s s s s A A where s and s are k tuples of elements of A We write LFP for the extension of rstorder logic with the lfp op eration which uniformly determines the least xed p ointofanRp ositiveformula That is for any Rp ositiveformula lfpR x x is a formula of LFP and k A j lfpR x x s if and only if s We will need the following k A basic result ab out inductive denabilitywhich is a sp ecial case
Load more

Recommended publications
  • Infinitary Logic and Inductive Definability Over Finite Structures
    University of Pennsylvania ScholarlyCommons Technical Reports (CIS) Department of Computer & Information Science November 1991 Infinitary Logic and Inductive Definability Over Finite Structures Anuj Dawar University of Pennsylvania Steven Lindell University of Pennsylvania Scott Weinstein University of Pennsylvania Follow this and additional works at: https://repository.upenn.edu/cis_reports Recommended Citation Anuj Dawar, Steven Lindell, and Scott Weinstein, "Infinitary Logic and Inductive Definability Over Finite Structures", . November 1991. University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-91-97. This paper is posted at ScholarlyCommons. https://repository.upenn.edu/cis_reports/365 For more information, please contact [email protected]. Infinitary Logic and Inductive Definability Over Finite Structures Abstract The extensions of first-order logic with a least fixed point operators (FO + LFP) and with a partial fixed point operator (FO + PFP) are known to capture the complexity classes P and PSPACE respectively in the presence of an ordering relation over finite structures. Recently, Abiteboul and Vianu [AV91b] investigated the relation of these two logics in the absence of an ordering, using a mchine model of generic computation. In particular, they showed that the two languages have equivalent expressive power if and only if P = PSPACE. These languages can also be seen as fragments of an infinitary logic where each ω formula has a bounded number of variables, L ∞ω (see, for instance, [KV90]). We present a treatment of the results in [AV91b] from this point of view. In particular, we show that we can write a formula of FO + LFP and P from ordered structures to classes of structures where every element is definable.
    [Show full text]
  • CTL Model Checking
    CTL Model Checking Prof. P.H. Schmitt Institut fur¨ Theoretische Informatik Fakult¨at fur¨ Informatik Universit¨at Karlsruhe (TH) Formal Systems II Prof. P.H. Schmitt CTLMC Summer 2009 1 / 26 Fixed Point Theory Prof. P.H. Schmitt CTLMC Summer 2009 2 / 26 Fixed Points Definition Definition Let f : P(G) → P(G) be a set valued function and Z a subset of G. 1. Z is called a fixed point of f if f(Z) = Z . 2. Z is called the least fixed point of f is Z is a fixed point and for all other fixed points U of f the relation Z ⊆ U is true. 3. Z is called the greatest fixed point of f is Z is a fixed point and for all other fixed points U of f the relation U ⊆ Z is true. Prof. P.H. Schmitt CTLMC Summer 2009 3 / 26 Finite Fixed Point Lemma Let G be an arbitrary set, Let P(G) denote the power set of a set G. A function f : P(G) → P(G) is called monotone of for all X, Y ⊆ G X ⊆ Y ⇒ f(X) ⊆ f(Y ) Let f : P(G) → P(G) be a monotone function on a finite set G. 1. There is a least and a greatest fixed point of f. S n 2. n≥1 f (∅) is the least fixed point of f. T n 3. n≥1 f (G) is the greatest fixed point of f. Prof. P.H. Schmitt CTLMC Summer 2009 4 / 26 Proof of part (2) of the finite fixed point Lemma Monotonicity of f yields ∅ ⊆ f(∅) ⊆ f 2(∅) ⊆ ..
    [Show full text]
  • ⊥N AS an ABSTRACT ELEMENTARY CLASS We Show
    ⊥N AS AN ABSTRACT ELEMENTARY CLASS JOHN T. BALDWIN, PAUL C. EKLOF, AND JAN TRLIFAJ We show that the concept of an Abstract Elementary Class (AEC) provides a unifying notion for several properties of classes of modules and discuss the stability class of these AEC. An abstract elementary class consists of a class of models K and a strengthening of the notion of submodel ≺K such that (K, ≺K) satisfies ⊥ the properties described below. Here we deal with various classes ( N, ≺N ); the precise definition of the class of modules ⊥N is given below. A key innovation is ⊥ that A≺N B means A ⊆ B and B/A ∈ N. We define in the text the main notions used here; important background defini- tions and proofs from the theory of modules can be found in [EM02] and [GT06]; concepts of AEC are due to Shelah (e.g. [She87]) but collected in [Bal]. The surprising fact is that some of the basic model theoretic properties of the ⊥ ⊥ class ( N, ≺N ) translate directly to algebraic properties of the class N and the module N over the ring R that have previously been studied in quite a different context (approximation theory of modules, infinite dimensional tilting theory etc.). Our main results, stated with increasingly strong conditions on the ring R, are: ⊥ Theorem 0.1. (1) Let R be any ring and N an R–module. If ( N, ≺N ) is an AEC then N is a cotorsion module. Conversely, if N is pure–injective, ⊥ then the class ( N, ≺N ) is an AEC. (2) Let R be a right noetherian ring and N be an R–module of injective di- ⊥ ⊥ mension ≤ 1.
    [Show full text]
  • Arxiv:2010.02145V2 [Math.LO] 25 Feb 2021 Infinitary Logics and Abstract
    Infinitary Logics and Abstract Elementary Classes Saharon Shelah1 and Andrés Villaveces2 1Hebrew University of Jerusalem / Rutgers University 2Universidad Nacional de Colombia - Bogotá March 1, 2021 Abstract We prove that every abstract elementary class (a.e.c.) with LST number κ and vocabulary τ of cardinality 6 κ can be axiomatized in L +++ + the logic i2(κ) ,κ (τ). In this logic an a.e.c. is therefore an EC class rather than merely a PC class. This constitutes a major improvement on the level of definability previously given by the Presentation Theorem. As part of our proof, we define the canonical tree S = SK of an a.e.c. K. This turns out to be an interesting combinatorial object of the class, beyond the aim of our theorem. Furthermore, we study a connection between the sentences defining an a.e.c. and the relatively new infinitary 1 logic Lλ. arXiv:2010.02145v2 [math.LO] 25 Feb 2021 Introduction Given an abstract elementary class (a.e.c.) K, in vocabulary τ of size 6 κ = LST(K), we do two main things: • We provide an infinitary sentence in the same vocabulary τ of the a.e.c. that axiomatizes K. Research of both authors partially supported by NSF grant no: DMS 1833363. Research of first author partially supported by Israel Science Foundation (ISF) grant no: 1838/19. 1 Infinitary Logics and Abstract Elementary Classes 2 • We also provide a version of the “Tarski-Vaught-criterion,” adapted to a.e.c.’s: when M1 ⊆ M2, for M1, M2 ∈ K, we will provide nec- essary and sufficient syntactic conditions for M1 ≺K M2.
    [Show full text]
  • Least Fixed Points Revisited
    LEAST FIXED POINTS REVISITED J.W. de Bakker Mathematical Centre, Amsterdam ABSTRACT Parameter mechanisms for recursive procedures are investigated. Con- trary to the view of Manna et al., it is argued that both call-by-value and call-by-name mechanisms yield the least fixed points of the functionals de- termined by the bodies of the procedures concerned. These functionals dif- fer, however, according to the mechanism chosen. A careful and detailed pre- sentation of this result is given, along the lines of a simple typed lambda calculus, with interpretation rules modelling program execution in such a way that call-by-value determines a change in the environment and call-by- name a textual substitution in the procedure body. KEY WORDS AND PHRASES: Semantics, recursion, least fixed points, parameter mechanisms, call-by-value, call-by-name, lambda calculus. Author's address Mathematical Centre 2e Boerhaavestraat 49 Amsterdam Netherlands 28 NOTATION Section 2 s,t,ti,t',... individual } function terms S,T,... functional p,p',... !~individual} boolean .J function terms P,... functional a~A, aeA} constants b r B, IBeB x,y,z,u X, ~,~ X] variables qcQ, x~0. J r149149 procedure symbols T(t I ..... tn), ~(tl,.-.,tn) ~ application T(TI' '~r)' P(~I' '~r)J ~x I . .xs I . .Ym.t, ~x] . .xs I . .ym.p, abstraction h~l ...~r.T, hX1 ..Xr.~ if p then t' else t"~ [ selection if p then p' else p"J n(T), <n(T),r(r)> rank 1 -< i <- n, 1 -< j -< r,) indices 1 -< h -< l, 1 _< k <- t,T,x,~, .
    [Show full text]
  • Structural Logic and Abstract Elementary Classes with Intersections
    STRUCTURAL LOGIC AND ABSTRACT ELEMENTARY CLASSES WITH INTERSECTIONS WILL BONEY AND SEBASTIEN VASEY Abstract. We give a syntactic characterization of abstract elementary classes (AECs) closed under intersections using a new logic with a quantifier for iso- morphism types that we call structural logic: we prove that AECs with in- tersections correspond to classes of models of a universal theory in structural logic. This generalizes Tarski's syntactic characterization of universal classes. As a corollary, we obtain that any AEC closed under intersections with count- able L¨owenheim-Skolem number is axiomatizable in L1;!(Q), where Q is the quantifier \there exists uncountably many". Contents 1. Introduction 1 2. Structural quantifiers 3 3. Axiomatizing abstract elementary classes with intersections 7 4. Equivalence vs. Axiomatization 11 References 13 1. Introduction 1.1. Background and motivation. Shelah's abstract elementary classes (AECs) [She87,Bal09,She09a,She09b] are a semantic framework to study the model theory of classes that are not necessarily axiomatized by an L!;!-theory. Roughly speak- ing (see Definition 2.4), an AEC is a pair (K; ≤K) satisfying some of the category- theoretic properties of (Mod(T ); ), for T an L!;!-theory. This encompasses classes of models of an L1;! sentence (i.e. infinite conjunctions and disjunctions are al- lowed), and even L1;!(hQλi ii<α) theories, where Qλi is the quantifier \there exists λi-many". Since the axioms of AECs do not contain any axiomatizability requirement, it is not clear whether there is a natural logic whose class of models are exactly AECs. More precisely, one can ask whether there is a natural abstract logic (in the sense of Barwise, see the survey [BFB85]) so that classes of models of theories in that logic are AECs and any AEC is axiomatized by a theory in that logic.
    [Show full text]
  • Domain Theory: an Introduction
    Domain Theory: An Introduction Robert Cartwright Rebecca Parsons Rice University This monograph is an unauthorized revision of “Lectures On A Mathematical Theory of Computation” by Dana Scott [3]. Scott’s monograph uses a formulation of domains called neighborhood systems in which finite elements are selected subsets of a master set of objects called “tokens”. Since tokens have little intuitive significance, Scott has discarded neighborhood systems in favor of an equivalent formulation of domains called information systems [4]. Unfortunately, he has not rewritten his monograph to reflect this change. We have rewritten Scott’s monograph in terms of finitary bases (see Cartwright [2]) instead of information systems. A finitary basis is an information system that is closed under least upper bounds on finite consistent subsets. This convention ensures that every finite answer is represented by a single basis object instead of a set of objects. 1 The Rudiments of Domain Theory Motivation Programs perform computations by repeatedly applying primitive operations to data values. The set of primitive operations and data values depends on the particular programming language. Nearly all languages support a rich collection of data values including atomic objects, such as booleans, integers, characters, and floating point numbers, and composite objects, such as arrays, records, sequences, tuples, and infinite streams. More advanced languages also support functions and procedures as data values. To define the meaning of programs in a given language, we must first define the building blocks—the primitive data values and operations—from which computations in the language are constructed. Domain theory is a comprehensive mathematical framework for defining the data values and primitive operations of a programming language.
    [Show full text]
  • Arxiv:1301.2793V2 [Math.LO] 18 Jul 2014 Uaeacnetof Concept a Mulate Fpwrbet Uetepwre Xo) N/Rmk S Ff of Use Make And/Or Axiom), Presupp Principles
    ON TARSKI’S FIXED POINT THEOREM GIOVANNI CURI To Orsola Abstract. A concept of abstract inductive definition on a complete lattice is formulated and studied. As an application, a constructive version of Tarski’s fixed point theorem is obtained. Introduction The fixed point theorem referred to in this paper is the one asserting that every monotone mapping on a complete lattice L has a least fixed point. The proof, due to A. Tarski, of this result, is a simple and most significant example of a proof that can be carried out on the base of intuitionistic logic (e.g. in the intuitionistic set theory IZF, or in topos logic), and that yet is widely regarded as essentially non-constructive. The reason for this fact is that Tarski’s construction of the fixed point is highly impredicative: if f : L → L is a monotone map, its least fixed point is given by V P , with P ≡ {x ∈ L | f(x) ≤ x}. Impredicativity here is found in the fact that the fixed point, call it p, appears in its own construction (p belongs to P ), and, indirectly, in the fact that the complete lattice L (and, as a consequence, the collection P over which the infimum is taken) is assumed to form a set, an assumption that seems only reasonable in an intuitionistic setting in the presence of strong impredicative principles (cf. Section 2 below). In concrete applications (e.g. in computer science and numerical analysis) the monotone operator f is often also continuous, in particular it preserves suprema of non-empty chains; in this situation, the least fixed point can be constructed taking the supremum of the ascending chain ⊥,f(⊥),f(f(⊥)), ..., given by the set of finite iterations of f on the least element ⊥.
    [Show full text]
  • Characterizations of Inductive Posets with Applications Milan R
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 104, Number 2, October 1988 CHARACTERIZATIONS OF INDUCTIVE POSETS WITH APPLICATIONS MILAN R. TASKOVIC (Communicated by Andrew Odlyzko) ABSTRACT. This paper presents new characterizations of inductiveness of posets in terms of fixed apexes and fixed points. Applications in nonlinear functional analysis and fixed point theory are considered. 1. Introduction and main results. Let P be a partially ordered set. A self- mapping / of P into itself is called an isotone mapping if x < y implies f(x) < f(y). An isotone (order-preserving or increasing) map / of a partially ordered set (:= poset) P to itself has a fixed point if there exists an element f in P such that /(£) — f. P is said to have the fixed point property if every isotone map / of P into itself has a fixed point. The first of the fixed point theorems for partially ordered sets goes back to Tarski and Knaster (cf. [TA]), who proved that the lattice of all subsets of a set has the fixed point property. In the mid-1950's Tarski [TA] published a generalization: Every complete lattice has the fixed point property. Tarski [TA] raised the question whether the converse of this result also holds. Davis [DA] proved the converse: Every lattice with the fixed point property is complete. In [RI], Rival published a far-reaching extension: Every isotone map of a finite, connected poset P into itself has a fixpoint. Call a poset P inductive (chain-complete) when every nonempty chain in P has an upper bound (supremum) in P.
    [Show full text]
  • Corecursive Algebras: a Study of General Structured Corecursion (Extended Abstract)
    Corecursive Algebras: A Study of General Structured Corecursion (Extended Abstract) Venanzio Capretta1, Tarmo Uustalu2, and Varmo Vene3 1 Institute for Computer and Information Science, Radboud University Nijmegen 2 Institute of Cybernetics, Tallinn University of Technology 3 Department of Computer Science, University of Tartu Abstract. We study general structured corecursion, dualizing the work of Osius, Taylor, and others on general structured recursion. We call an algebra of a functor corecursive if it supports general structured corecur- sion: there is a unique map to it from any coalgebra of the same functor. The concept of antifounded algebra is a statement of the bisimulation principle. We show that it is independent from corecursiveness: Neither condition implies the other. Finally, we call an algebra focusing if its codomain can be reconstructed by iterating structural refinement. This is the strongest condition and implies all the others. 1 Introduction A line of research started by Osius and Taylor studies the categorical foundations of general structured recursion. A recursive coalgebra (RCA) is a coalgebra of a functor F with a unique coalgebra-to-algebra morphism to any F -algebra. In other words, it is an algebra guaranteeing unique solvability of any structured recursive diagram. The notion was introduced by Osius [Osi74] (it was also of interest to Eppendahl [Epp99]; we studied construction of recursive coalgebras from coalgebras known to be recursive with the help of distributive laws of functors over comonads [CUV06]). Taylor introduced the notion of wellfounded coalgebra (WFCA) and proved that, in a Set-like category, it is equivalent to RCA [Tay96a,Tay96b],[Tay99, Ch.
    [Show full text]
  • Type-Based Termination, Inflationary Fixed-Points, and Mixed Inductive-Coinductive Types
    Type-Based Termination, Inflationary Fixed-Points, and Mixed Inductive-Coinductive Types Andreas Abel Department of Computer Science Ludwig-Maximilians-University Munich, Germany [email protected] Type systems certify program properties in a compositional way. From a bigger program one can abstract out a part and certify the properties of the resulting abstract program by just using the type of the part that was abstracted away. Termination and productivity are non-trivial yet desired pro- gram properties, and several type systems have been put forward that guarantee termination, com- positionally. These type systems are intimately connected to the definition of least and greatest fixed-points by ordinal iteration. While most type systems use “conventional” iteration, we consider inflationary iteration in this article. We demonstrate how this leads to a more principled type system, with recursion based on well-founded induction. The type system has a prototypical implementa- tion, MiniAgda, and we show in particular how it certifies productivity of corecursive and mixed recursive-corecursive functions. 1 Introduction: Types, Compositionality, and Termination While basic types like integer, floating-point number, and memory address arise on the machine-level of most current computers, higher types like function and tuple types are abstractions that classify values. Higher types serve to guarantee certain good program behaviors, like the classic “don’t go wrong” ab- sence of runtime errors [Mil78]. Such properties are usually not compositional, i. e., while a function f and its argument a might both be well-behaved on their own, their application f a might still go wrong. This issue also pops up in termination proofs: take f = a = λx.xx, then both are terminating, but their application loops.
    [Show full text]
  • Least and Greatest Fixed Points in Linear Logic
    Least and Greatest Fixed Points in Linear Logic DAVID BAELDE, University of Minnesota The first-order theory of MALL (multiplicative, additive linear logic) over only equalities is a well-structured 2 but weak logic since it cannot capture unbounded (infinite) behavior. Instead of accounting for unbounded behavior via the addition of the exponentials (! and ?), we add least and greatest fixed point operators. The resulting logic, which we call μMALL, satisfies two fundamental proof theoretic properties: we establish weak normalization for it, and we design a focused proof system that we prove complete with respect to the initial system. That second result provides a strong normal form for cut-free proof structures that can be used, for example, to help automate proof search. We show how these foundations can be applied to intuitionistic logic. Categories and Subject Descriptors: F.4.1 [Mathematical Logic and Formal Languages]: Mathematical Logic—Proof theory; F.3.1 [Logics and Meanings of Programs]: Specifying and Verifying and Reasoning about Programs—Specification techniques; F.3.3 [Logics and Meanings of Programs]: Studies of Program Constructs—Program and recursion schemes General Terms: Design, Theory, Verification Additional Key Words and Phrases: Fixed points, linear logic, (co)induction, recursive definitions, cut elimination, normalization, focusing, proof search ACM Reference Format: Baelde, D. 2012. Least and greatest fixed points in linear logic. ACM Trans. Comput. Logic 13, 1, Article 2 (January 2012), 44 pages. DOI = 10.1145/2071368.2071370 http://doi.acm.org/10.1145/2071368.2071370 1. INTRODUCTION Inductive and coinductive definitions are ubiquitous in mathematics and computer sci- ence, from arithmetic to operational semantics and concurrency theory.
    [Show full text]