LOGICAL FRAMEWORKS FOR TRUTH AND ABSTRACTION An Axiomatic Study
STUDIES IN LOGIC AND THE
FOUNDATIONS
OF
VOLUME
MATHEMATICS 135
Honorary Editor: E SUPPES
Editors: S. ABRAMSKY, London S. ARTEMOV, Moscow J. BARWISE, Stanford H.J. KEISLER, Madison A.S. TROELSTRA, Amsterdam
ELSEVIER A M S T E R D A M 9L A U S A N N E 9N E W Y O R K 9O X F O R D 9S H A N N O N 9T O K Y O
LOGICAL FRAMEWORKS FOR TRUTH AND AB STRACTION An Axiomatic Study
Andrea CANTINI
Department of Philosophy Universityof Florence Florence, Italy
1996
ELSEVIER AMSTERDAM
9L A U S A N N E
9N E W Y O R K
9O X F O R D
9S H A N N O N
9T O K Y O
ELSEVIER SCIENCE B.V. Sara Burgerhartstraat 25 P.O. Box 211, 1000 AE Amsterdam, The Netherlands
ISBN: 0 444 82306 9 9 1996 Elsevier Science B.V. All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, recording or otherwise, without the prior written permission of the publisher, Elsevier Science B.V., Copyright & Permissions Department, EO. Box 521, 1000 AM Amsterdam, The Netherlands. Special regulations for readers in the U.S.A. - This publication has been registered with the Copyright Clearance Center Inc. (CCC), 222 Rosewood Drive, Danvers, MA 01923. Information can be obtained from the CCC about conditions under which photocopies of parts of this publication may be made in the U.S.A. All other copyright questions, including photocopying outside of the U.S.A., should be referred to the Publisher. No responsibility is assumed by the publisher for any injury and/or damage to persons or property as a matter of products liability, negligence or otherwise, or from any use or operation of any methods, products, instructions or ideas contained in the material herein. This book is printed on acid-flee paper. Printed in The Netherlands
PREFACE
This book is concerned with logical systems, which are usually termed typefree or self-referential and emerge from the traditional discussion on logical and semantical paradoxes. We will consider non-set-theoretic frameworks, where forms of type-free abstraction and self-referential truth can consistently live together with an underlying theory of combinatory logic. However, this is not a book on paradoxes; nor we aim at a grand logic la Frege-Russell, inspired by a foundational program. We shall rather investigate type-free systems, in order to show that" (i) there are rich theories of self-application, involving both operations and truth, which can serve as foundations for property theory and formal semantics; (ii) these theories give new outlooks on classical topics, such as inductive definitions and predicative mathematics; (iii) they are promising as far as applications are concerned. This way of looking is justified by the history of the antinomies in our century. In spite of isolated foundational and philosophical traditions, the research arising from paradoxes has become progressively closer to the mainstream of mathematical logic and it has received substantial impulse during the last twenty years: a number of significant developments, techniques and results have been cropping up through the work of several logicians (see below for our main debts). Therefore a major aim of this book is to attempt a unifying view of relevant research in the field, by dwelling on connections with well-established logical knowledge and on applicable theories and concepts. However, the present work is far from being comprehensive. We do not treat illative combinatory logic (with the exception of a system of Ch.VI, investigated by Flagg and Myhill 1987), nor we deal with the BarwiseEtchemendy approach to self-reference via non-well-founded sets. Another significant direction, which is only touched upon in two sections of chapter XIII, is the systematic development of the general theory of semi-inductive definitions (in the sense of Herzberger, Gupta and others).
vI
Preface
The project started some years ago, when Prof. A. S. Troelstra kindly suggested an English translation of the author's monograph (Cantini 1983a) about theories of partial operations and classifications in the sense of Feferman (1974). The attempted translation soon shifted towards a thorough expanded revision of the old text, and eventually gave rise to an entirely new set of notes at the end of 1988. After a stop of almost two years, these notes were taken up again, fully rewritten and reorganized. The manuscript was submitted to the editor for final refereeing in October 1993. The content and the results of the present version are disjoint from the 1983 monograph; they partly overlap with the 1988 notes, except for a different choice of primitive notions and for the addition of Ch.VI, parts of Ch.XIII and the epilogue. Ch.VIII offers a development of topics, contained in the author's paper "Levels of Truth" (to appear in the Notre Dame Journal of Formal Logic, 1995): we thank the Editors for granting the permission of using parts of that paper in Ch.VIII of this book.
Acknowledgments. The present work owes a great deal to the writings of several logicians, and even if I tried hard to make a complete list of my debts in the text and in the reference list, I am sure that there are omissions: I apologize for them. As to the proper content of the book, pertaining to type-free abstraction and self-referential truth, I would like to underline my intellectual debt with the following papers (listed in alphabetical order): Aczel(1980), Feferman (1974), (1984), (1991), Fitch(1948), (1967), Friedman and Sheard (1987), Kripke (1975), Myhill (1984), Scott (1975). Profl W. Buchholz offered an invaluable help in correcting errors of any kind and in proposing technical improvements. I owe a special thank to him, also because the topics I dealt with were not touching his main research interests. I am grateful to Prof. S. Feferman and to Profi G. Js for keeping me informed over the years about their own research on type-free systems and proof theory, and for important advice. J~iger's Ph.D. student, T. Strahm made useful critical comments on the first chapter. Dr. R. Giuntini and Dr. P. Minari undertook the final proof-reading of chapters I-VIII and XII-XIV; I warmly thank them for a host of useful remarks and corrections. I am deeply indebted to Dr. A. P. Tonarelli for proof-reading the remaining chapters and for eagle-eyed assistance in the unrewarding task of preparing the final manuscript.
Preface
vii
Of course, I must stress that I am fully responsible for all errors, to be found in the whole work. I am grateful to the Alexander-von-Humboldt Stiftung (Germany) for granting me a "Wiederaufnahme" of a research fellowship at the LudwigMaximilians-Universit~it M/inchen in Sommer Semester 1991, when the present work was at a difficult stage. Partial support to the present project was granted by the Italian National Research Council (CNR)-and the Italian Ministry for University, Scientific Research and Technology (MURST). Last but not least, this work is dedicated to my children Giulia and Francesco.
Firenze, April 1995
This Page Intentionally Left Blank
CONTENTS
Preface Contents
IX
Introduction PART A: COMBINATORS AND TRUTH Introducing operations The basic language 2. Operations I: general facts Operations Ih elementary recursion theory 3. 4A. The Church-Rosser theorem 4B. Term models The graph model 5. An effective version of the extensional model D co 6. Appendix
13 14 15 18 22 26 28 34 39
Extending operations with reflective truth 7. Extending combinatory algebras with truth 8. The theory of operations and reflective truth: simple consequences 9A. Type-free abstraction, predicates and classes 9B. Operations on predicates and classes 10A. The fixed point theorem for predicates 10B. Applications to semantScs and recursion theory 11. Non-extensionality Appendix I: a property theoretic definition of the fixed point operator for predicates Appendix Ih on the explicit abstraction theorem Appendix III: independence of truth predicates from the encoding of logical operators
43 45
o
II
11
51 55 59 63 68 73 76 77 80
Contents
x
PART B: TRUTH AND RECURSION THEORY III
IV
V
Inductive models and definability theory 12. Inductive models and the induction theorem 13. The envelope of an inductive model 14. The uniform ordinal comparison theorem for inductive models 15. Applications of the uniform ordinal comparison theorem
VII
85 86 88 91 97
Type-free abstraction with approximation operator 16. Approximating properties by classes 17. The approximation theorem for extensional operations and the fixed point theorem for monotone operations 18. Topology displayed: basic definitions 19. The representation theorem for explicitly CL-continuous operators Appendix: alternative proofs
103 104
Type-free abstraction, choice and sets 20. Choice principles and the distinction between operations and functions 21. Admissible hulls: elementary facts 22. A model of admissible set theory 23. The boundedness theorem
125
PART C: SELECTED TOPICS VI
83
109 113 117 122
126 131 137 144 149
Levels of implication and intensional logical equivalence 24. Myhill's levels of implication 25. Formal deducibility based on levels of implication and its proof-theoretic strength 26. Introducing an intensional equivalence relation 27. The infinitary reduction relation :=~ 28. The Church-Rosser theorem for ==~ 29. A model of type-free logic based on intensional equivalence
151 152
On the global structure of models for reflective truth 30. The lattice of fixed point models for the neutral minimal theory 31. The sublattice of intrinsic fixed point models and the cardinality theorem
177
158 162 165 169 174
179 186
Contents 32. 33. 34. 35.
Variations on the encoding technique: non-modularity and other oddities A model for an impredicative extension of reflective truth On Kripke's classification of self-referential sentences On the consistency of coinduction principles Appendix: a variant to the basic operator F and the restriction axiom
XI
192 198 203 207 209
PART D: LEVELS OF TRUTH AND PROOF THEORY
213
VIII Levels of reflective truth 36. A language and axioms for reflective truth with levels 37. Simple consequences 38. Universes and the Weyl extended iteration principle 39. A recursion-theoretic model 40. Levels of truth and predicatively reducible subsystems of second-order arithmetic 41. Consistency of a reducibility principle for classes 42. Levels of truth and impredicative subsystems of second-order arithmetic Appendix: on projectibility and stronger reflection
215 218 220 225 230
IX
Levels of truth and predicative well-orderings 43. On well-orderings 44. Ramified hierarchies 45. Predicative well-orderings I 46. Predicative well-orderings II
257 258 261 269 277
X
Reducing reflective truth with levels to finitely iterated reflective truth 47. A sequent calculus STLR for a theory of reflective truth with levels 48. Basic properties of STLR 49A. Elimination of the full level induction schema 49B. Elimination of unbounded level quantifiers 50. The infinitary sequent calculus I T ~ of n-iterated reflective truth 51. Embedding STLR n into I T ~
XI
Proof-theoretic investigation of finitely iterated reflective truth 52. The ramified system RS n 53. Cut elimination 54. Some derivable sequents of RS n
238 244 248 253
285 286 291 293 297 303 305 311 312 316 320
XII
Contents 55. 56. 57. 58.
Embedding ITn~ into RS n The upper bound theorem for I T ~ Upper bound theorems for TLR and its subsystems Conclusion: the conservation theorems Appendix: primitive recursive cut elimination for RS n
PART E: ALTERNATIVE VIEWS XII
Non-reductive systems for type-free abstraction and truth 59. The core system V F - and transfinite induction 60. Supervaluation models of V F 61. An abstract sequent calculus and truth 62. Cut elimination and related properties 63. A provability interpretation and the upper bound theorem 64. Reconciling supervaluation models with provability interpretation
XIII The 65. 66. 67. 68. 69.
variety of non-reductive approaches An inconsistency On a truth theory of Friedman and Sheard Fitch's models Introducing semi-inductive definitions Semi-inductive models for reflective truth
324 327 329 335 338 349 351 352 357 358 364 369 375 379 380 383 386 390 394
XIV Epilogue: applications and perspectives 70A. A logical theory of constructions: informal motivations 70B. A logical theory of constructions: basic syntax 71. Axioms for the computation relations 72. Extending the logical theory of constructions with higher reflection 73. Proof-theoretic reduction 74. Perspectives: related work in Artificial Intelligence and Theoretical Linguistics 75. Sense and denotation as algorithm and value: subsuming theories of reflective truth under abstract recursion theory
401 402 403 407
Bibliography
425
Index
441
List of Symbols
453
411 416 419 422
INTRODUCTION "There never were set-theoretic paradoxes, but the property-theoretic paradoxes are still unresolved" (K. Gbdel, as reported by J. Myhill 1984). "... the theory of types brings in a new idea for the solution of the paradoxes, especially suited to their intensional form. It consists in blaming the paradoxes not on the axioms that every propositional function defines a concept or a class, but on the assumption that every concept gives a meaningful proposition, if asserted for any arbitrary object or objects as arguments" (K. G6del 1944)
1. Informal ideas. The starting point of our investigation is the idea that the notions of predicate application and property are susceptible of independent study; in particular, these intuitive notions should be kept distinct from their counterparts of set-theoretic membership and set, as it is readily seen through a brief comparison. According to the iterative conception, a set is always a collection of mathematical entities of a given type (possibly, sets of lower rank); thus it has its being in its members, and equality among sets is ruled by the extensionality principle. Sets are conceived as completed totalities, generated by language independent operations and iterations thereof. The membership relation is a standard mathematical relation: this means that a C b is a well-defined proposition, whenever a and b are sets. Moreover, if we reflect upon the intuitive picture of the cumulative hierarchy, we come to know that C is well-founded and does not allow self-application. By contrast, a property is an abstract object, which is grounded in a concept, i.e. a function, not in the objects which fall under it (Frege 1984, p.199); it has no a priori bound on its extension, and it usually depends on some sort of explicit or implicit finite specification. Properties satisfy the so-called unrestricted abstraction or comprehension principle (AP): every condition A(x) determines a property {x:A}, which applies to all and only those things of which A(x) holds true. Of course, on the face of the well-known paradoxes, A P introduces elemcnts which are open to dispute and to multiform solutions; for instance, as GSdel's citation suggests, the predication r e l a t i o n - henceforth 7/- cannot be always meaningful, and therefore the laws of standard (classical) logic cannot be valid.
2
Introduction
The present approach, to be developed in various forms in this book, tries to keep the regimentation for predication and abstraction at a minimum; we maintain that {x" A} is an individual term and that r/applies to statements possibly involving 7/ itself. Thus we are looking for flexible, type-free theories of predication. More specifically, we are influenced by the tradition of illative combinatory logic in the sense of Curry and Fitch, by the work of Feferman (1975) on partial classifications and of Aczel (1980) on Frege structures. The inspiring idea is that properties and predication can be adequately explained in terms of the primitive notions of function and truth. As to the notion of function, we cannot expect to deal with functions in set-theoretic sense. In fact properties, given in intension, may apply to anything in a given realm, without type restrictions; and the same must hold of the functions underlying the properties themselves. Thus we are driven to understand functions essentially as rules of constructions (or, in short, operations) in the sense of combinatory logic. In contrast to the set-theoretic conception, operations are prior to their graphs and have no a priori bound on their domain; in particular, they do support non-trivial forms of self-application. On this view, it is natural to identify properties
with object-correlates of functions, and to reduce the abstraction operation to familiar )~-abstraction; formally, {x:A} simply becomes a h-term of the form )~x[a], where [A] is a term of combinatory logic, canonically representing the function defined by the condition A (of any given language). The second point concerns the reduction of predication to a primitive notion of reflective (or self-applicable) truth. Indeed, the expression
yq{x : A} is analyzed as: " the result of applying the function represented by {x:A} to the argument y turns out to be true". Therefore, if we let T stand for the truth predicate, yq{z: A} is defined as T({x: A}y) (with juxtaposition of {x: A} and y as application), and the abstraction principle AP becomes obviously derivable from the basic law of h-abstraction (i.e. we convert {x: A}y to the term [A[x := y]], the result of replacing x with y in [A]). Of course, these preliminary considerations do not solve the main problem of specifying the basic features of the truth predicate T. Nevertheless, they direct our attention towards the study of simple mathematical objects, namely expansions of combinatory algebras by reasonably closed truth sets. The typical structure (essentially) consists of a pair
where (i) 3t~ is a combinatory algebra, i.e. a model of Curry's combinatory
Introduction
3
logic; (ii) ff is a subset of M ( - t h e domain of 31,), which assigns a semantical structure to Jtt~. These expansions are uniformly described by means of operators F from the power-set of M into itself, acting as abstract valuation schemata. Informally, if X C_ M, F(X) represents the set of "truths" we come to know by means of the semantic rules of F on the basis of X. A central role in this book is played by an operator F, which essentially embodies Kleene's three valued non-strict interpretation of logical constants. In general, if F is monotone and reflects a cumulative conception of knowledge, the natural candidates for o-j-will be those subsets of M, that cannot be further extended with new information by means of F, i.e. the so-called fixed points of F, satisfying F(X) - X. Among these sets, a special role will be played by the minimal ones: they are technically the most interesting objects for the recursion-theoretic and proof-theoretic investigations. Conceptually, they reflect the idea that abstraction is not the mere description of an independent logical realm, but rather a process with its own logic implicit in F. In order to provide a few intuitions behind the construction of the first part of the book, it may be suggestive to regard 31~ as an abstract syntax, in which formal languages can be processed and defined. In particular, elements of M may be thought of as symbolic expressions, to be combined and identified according to the operations and laws of combinatory logic. M will typically include (notations for) natural numbers or any other chosen ground type, but also and most important, objects representing functions. The objects associated to computable functions can be seen as (functional) programs, implementing effective algorithms. On the other hand, still pursuing the computational analogy, properties-as representatives of (generally non-computable) propositional functions-can be considered as programs implementing a sort of generalized algorithms. While application of an effective algorithm to an input produces a computation, possibly converging to a value, a property { x ' P ( x ) } is ultimately applied to an object, in order to produce a verification that the object itself satisfies the given condition, according to the rules specified by the truth set ~. We wish to conclude by raising three conceptual points. First of all, the notion of truth T is not understood as a formalized truth predicate in the usual metamathematical sense: T classifies the objects of a combinatory algebra, and not an inductively defined collection of sentences ! In this sense, T, like set-theoretic membership, does not depend upon a specific language. As it should be clear from the sketched schema of interpretation ~ + , the predicate T is a primitive concept, which is prior to the specification of any formalism and is the source of the abstract notion of proposition. The underlying philosophy is that there are certain objects in our universe AI~,
4
Introduction
which carry information and can be called propositions; they can be partitioned into atomic or complex. Atomic propositions are simply grasped and reflect implicit (synthetic) knowledge, to be accepted as given. On the other side, complex propositions correspond to some sort of construction via logical operators; thus they require a(n analytic) process, in order to be understood (think of the search for verification), and they are controlled by the truth predicate T. As a second point, we like to stress the importance of having operations acting on classifications. Indeed, the fact that operations and classifications live together has the consequence of a symmetry, lacking to set theory: not only we can classify operations, but we can operate on classifications. So we can treat classifications, which depend on parameters, as operations; this is generally impossible in set theory. It follows that many constructions and statements acquire an "explicit character" and greater uniformity. A final comment is left for the choice of non-extensional basic notions. In general, even if we make use of intensional data (like definitions or enumerations), we never appeal to specific features of them, and thus we obtain results with an intrinsic character. Moreover, we find that the nonextensional language helps to avoid "strong logical principles" and to carry out proofs in rather weak systems (just as remarked in Kreisel 1971, p. 170); it often permits uniform and explicit statements of the results obtained, which do not obscure the appreciation of proper extensional aspects. On the contrary, non-extensional and extensional features are free to interact in a unified framework. As it will be clarified by the introduction of the approximation structure in chapter III and its applications in the subsequent chapters, the essential interplay of these aspects leads to rather smooth generalizations of the Myhill-Shepherdson theorem (w to the appreciation of extensional choice principles (w and to a satisfactory "internal" treatment of inductive definitions (boundedness and covering; w 2. Organization and contents. As we previously explained, the starting point of the book is the need for an independent logical approach to the notions of predicate application, property, abstraction, truth. The arrangement of the material reflects the increasing logical complexity of the truth notions that are met in the text. The different proposals, though generally motivated by model-theoretic constructions, are developed in axiomatic style. This is mainly because we wish to emphasize the connections with standard concepts of mathematical logic and deductive systems for (substantial parts of) mathematics. Proof-theoretic considerations and conservative extension results play an important role in classifying the various systems: very loosely, we tend to stress the importance of frameworks not stronger than Peano arithmetic and
Introduction
5
to distinguish predicative from impredicative systems. We also underline that type-free systems should not be opposed to type theories; we regard the former as a sort of generalized type assignment systems, in which types are left implicit and emerge from the theory itself. More concretely, the book is divided into five parts, which group together relatively homogeneous topics. The read thread can be described as follows. By and large, the first three parts form a sort of independent essay on a first-order theory of reflective truth over combinatory logic, whose truth axioms essentially stem from Fitch's extended basic logic (Fitch 1948) through Scott (1975) and Aczel (1977). The notion of reflective truth explicitly refers to Feferman (1991). After the general results of Part A, the theory is motivated and enriched by means of recursion-theoretic investigations (part B), by showing its unifying power and studying its semantics (part C). Parts D and E explore alternative routes. Part D deepens the intuitions underlying the systems of parts A-C by use of prooftheoretic techniques and by relativizing the concept of truth. Part E is experimental in character and scans over a variety of approaches, which are still subject of investigation. To give the reader a closer idea of what is in the book, we shall survey the content of the single chapters. A more detailed account can be found in the introductory section to each chapter. Part A: it offers a general introduction to the basic notions of operation and reflective truth. The basic aim is to illustrate, both axiomatically and semantically, a consistent notion of type-free logical structure, which will be fundamental in the whole book. The opening chapter contains the necessary preliminaries on (expanded) combinatory logic, which is here taken as the core of a classical first-order theory of operations OP. There is an introduction to concrete models of OP, as they form the ground structures in the entire book. In the second chapter, we inductively expand combinatory algebras with a notion of self-referential truth, which naturally generalizes the familiar Tarskian semantical clauses, in order to cope with a situation of partiality. The given expansions only depend on the isomorphism type of the underlying combinatory algebras. By inspection of the model-theoretic construction, we are led to a minimal axiomatic first-order system MF-, which contains a version of the Kripke-Feferman axioms for reflective truth and yields a theory of partial and total properties ( = classes henceforth), satisfying natural closure conditions. For instance, classes are provably closed under Feferman's join and elementary comprehension principles; moreover, MF- is provably closed under inductive definitions (though not capable of showing the corresponding induction schemata). We also consider
6
Introduction
extensions of MF- with various number-theoretic induction principles. Part B: we show that there is a two-sided link between generalized recursion theory and languages with operations and self-referential truth. Not only inductive definitions are crucial for building up models of self-referential languages, but these languages offer smooth formulations of non-trivial definability results. In chapter III we prove that classes (properties) in the inductive model over a given combinatory algebra a~ exactly define the hyperelementary (inductive) subsets of dtt, in the sense of Moschovakis (1974). The recursiontheoretic approach suggests to extend the minimal system by simple approximation conditions on properties. The new axioms, together with MF-, a powerful generalized induction schema GID and number-theoretic induction for classes, form an axiomatic system PWc+GID , which is still conservative (actually proof-theoretically reducible to) over the theory of operations and hence over Peano arithmetic. In chapter IV we show that PWc+GID proves a number of interesting consequences (separation and reduction principles) and, above all, an analog of the Myhill-Shepherdson theorem for operations which are y-extensional (i.e. extensional with respect to the predication relation). The results can be restated in topological terms via a natural generalization of the positive information topology. In chapter V, we produce models for admissible set theory and a boundedness theorem for inductive sets, again provably in PWc+GID. Part C: it is a natural complement to the previous parts. In chapter VI, the reader will find two alternative type-free logics. The first system, due to Myhill (1972, 1980), relies on a logic with levels of implication. The second system, inspired by Aczel-Feferman (1980), offers a type-free logic with a definitional equivalence relation on formulas, which is inspired by conversion in combinatory logic. Both systems are formally interpreted in the theory PWc+GID of chapters IV-V. Chapter VII offers a general outlook on the global structure FIX(art,) of fixed point models of N M F - ( = M F - without a consistency axiom) over arbitrary combinatory algebras art,. We prove that FIX(.Jt) only depends on the isomorphism type of art, and that the set of sentences A such that TA holds in every structure of FIX(..~), for arbitrary d~, is axiomatizable. It is shown that FIX(art) is a very rich and intricate non-distributive complete lattice; a few applications to consistency results and to formal semantics are thereby outlined (see connection with Kripke 1975). Part D: it focuses on proof theory and the foundations of mathematics. We investigate a type-free logic TLR, which is able to internalize to a certain
Introduction
7
extent quantification on classes and negative semantic information. The intuitive idea is that truth is the (direct) limit of local self-referential truth predicates, which are related one another by a directed pre-order of levels. Formally, we present TLR and its variants in chapter VIII. Among its consequences, it is possible to introduce a notion of "mathematical universe" with nice closure properties and interpret non-trivial subsystems of second-order arithmetic (ranging from versions of predicative analysis, like Friedman's ATR0, to the so-called A12-CA). In chapter IX we develop the prerequisites for a proof-theoretic analysis of TLR: in particular, we describe a well-ordering proof of the so-called Feferman-Sch/itte ordinal. Chapter X proves that the theory of truth with levels is proof-theoretically reducible to (infinitary) theories of finitely iterated self-referential truth ITS; on the other hand, each I T ~ is shown to be reducible to fragments of predicative analysis in chapter XI. The methods used include cut elimination for ramified systems in w-logic and asymmetrical interpretations d la Girard. Part E: we are concerned with logics of truth and type-free abstraction, which are based upon non-reductive, non-truth functional semantical valuation schemata. In contrast to the reductive schema underlying the semantics of chapter II, we study systems which are well-behaved with respect to logical consequence (e.g. a tautology is always classified as true; this does not work under a partial semantics d la Kleene). Chapter XII investigates a minimal system VF endowed with a simple supervaluation monotone semantics; VF naturally justifies principles of generalized inductive definitions (in contrast to what happens with the theories of parts A-C, it yields a model of the theory of elementary inductive definitions ID1). We also develop an alternative interpretation for VF by means of proof-theoretic infinitary methods. Chapter XIII addresses the problem of extending the logic of truth, as codified in VF. We discuss a refinement of supervaluation methods; but the new point is the introduction of semi-inductive definitions (in the sense of Herzberger 1982) and the application of the related notion of stable truth. We also consider consistent though w-inconsistent logics of truth, due to Friedman, Sheard and Mc Gee. The epilogue (chapter XIV) discusses prospective applications of typefree systems, as they result from the literature. In particular, we consider a logical theory of constructions, that has been investigated in Theoretical Computer Science and is strictly linked with the theories of part D. We conclude with a short survey of applications in other fields.
Introduction
8
3. How to use the book. The interdependence of the chapters is roughly indicated in the diagram below:
I II
1 III IV
VII
V VIII
~
XlI
IX
VI
1
x
1
1
XI
~
XlII
XIV Certain parts of the book, once suitably combined, offer a non-conventional approach to: 1) generalized recursion theory and inductive definability (part A + part B); 2) predicative mathematics and subsystems of analysis (part A + part B + + part D). If we disregard the recursion-theoretic and proof-theoretic parts, the book can serve as an introduction to" 3) formal semantics (part A + III + part C + VIII (w167 36-39) 4- part E). If the reader has in mind possible connections with logics for Artificial Intelligence, Theoretical Computer Science or semantics for natural languages, the suggestion 3) can be profitably modified to: 4) part A + part B + VIII (w167 36-39) + part E. Some chapters have appendices, containing additional details for proofs or suggestions for alternative routes: they can be always skipped without prejudice of understanding the later developments. 4. Prerequisites. The text is intended for readers who are familiar with the topics usually covered in an advanced undergraduate or basic graduate logic course. Thus we assume acquaintance with the elements of first-order logic
Introduction
9
and model theory, recursion theory, set theory and proof theory, as they are developed in good standard textbooks, or in the corresponding chapters of the Handbook of Mathematical Logic (Barwise 1977). In particular, it is useful to have a preliminary knowledge of the basic facts of hyperarithmetic and inductive definability (see Aczel 1977a, Moschovakis 1974). For the proof theory of Chapters VIII-XI, a previous exposure to sequent calculi and w-logic would be helpful (e.g. see Schwichtenberg 1977 or the textbooks of Takeuti 1975, Schfitte 1977, Girard 1987, Pohlers 1989). The simple topological notions of Ch. IV can be obtained from any standard textbook in general topology. Ch. VII presupposes a few elementary facts about partially ordered sets and lattices, usually met in logic courses (consider the classical reference of Birkhoff 1967). In Ch. VIII we hinge upon some advanced results of admissible set theory, to be found in Barwise (1975), Hinman (1977); however, the basic definitions and results are briefly recalled there. 5. General notations and conventions. A number of notations are adopted in the whole text. We summarize them below. 5.1. Internal and bibliographical references. The book is structured in five parts from A to E; each part is subdivided into chapters; the chapters are organized in sections, which are numbered in progressive order. Within each section, each specific item (subsection, definition, remark, axiom, rule, theorem, lemma or corollary) is usually assigned a pair "m.n" of numbers: "m.n" refers to the nth item of the ruth section. Sometimes, for finer classifications and reference, we allow the use of three (and exceptionally four) numbers (e.g. 37.4.1 locates the first sub-item of the 4th-item of section 37). In some cases, we specify the class, which the referred item belongs to (e.g. we may speak of theorem 3.2 or definition 34.5). References to publications are given by means of the author's name followed by the year of publication, possibly followed by a letter in the case of more publications by the same author in the same year. 5.2. Definitions. := is used as the definition symbol (definiendum on the left of : = , definiens on the right), while - stands for literal identity, unless it is specified otherwise. 5.3. Variables and substitution. We adopt the standard notions of free and bound variable; FV(E) is the set of free variables of the expression E. E[x := t] denotes the substitution of x with t in E. E(E') means that E' possibly occurs as a subexpression of E. 5.4. Logical Symbols. As usual we use V, 3, -1, ~ , A, V, ~ . For bracketing, we adopt the usual conventions; V, 3, -~ bind stronger than the other symbols, while A, V bind more than ---, and ~ . To enhance
Introduction
10
readability, dots may be used instead of brackets as separating symbols. A A B.---,C, A---,.B V C, 3x.A stand for (A A B)---,C, A ~ ( B V C) 3xA (respectively); ~x.ts shortens ~x(ts), etc... Sometimes, we make use of bounded quantifiers as abbreviations: if R : = r / , E, VxRa.A, 3xRa.A shorten Vx(xRa~A), 3x(xRa A A). If bounded quantifiers are iterated, we write: (VxRa)(VyRb)(...), (VxRa)(3yRb)(...), or even VxRa.VyRb.(...), VxRa.3yRb.(...), for the proper Vx(xRa---,Vy(yRb...)), Vx3y(xRa A yRb...) (respectively). We shorten logical equivalence on the metalevel (i.e. "if and only if") by the standard "iff" . "3!x" stands for "there is exactly one x". Sometimes, we adopt :=~ as implication on the metalevel. 5.5. Logical Complexity. The logical complexity of any given formula A is the number of distinct occurrences of logical symbols in A. 5.6. Set-theoretic symbols. We use the standard E , ~ (negation of E ), w (the set of natural infinite ordinal), 0, U, A, ~P(X) (power set of (Cartesian product), f" X-~Y (to be read as Y"), cz (characteristic function for the set Z).
notations: numbers, but also the first
X), X - Y ,
C, C_, D, D_, •
"f is a function from X to If k,m E w,
[k, m] "- {i E w " k _< i _< m}; ( k , m ] ' - { i e w ' k < i _ < m } ; (k,m) . - {i
k < i < m}; [ k , m ) . - {i
k < i < m}.
{ x : . . . } is the set of objects satisfying the condition (...); {al,... , an} is the set containing exactly the elements a l , . . . , a n. (...) denotes set-theoretic ntuple operation, unless otherwise specified. We warn the reader that set-theoretic symbols will be sometimes adopted as abbreviations for corresponding non-extensional operations on properties and predicates. But possible ambiguities will be spared by the context. The arithmetical symbols are the standard ones. 5.7. Provability and standard Tarskian semantics. ~ I = A stands for "A holds in the structure Eft,". S F A means that A is derivable from S by means of classical logic (unless otherwise specified). 5.8. Inductive proofs. We often carry out proofs by induction (either in the metatheory or within axiomatic theories). As a rule, we adopt the acronym IH as a shortening for "induction hypothesis".
PART A
COMBINATORS AND TRUTH
~r v a s t & "V r ~ v a l r o p ~ v " M//~'~ #c7' c~lrrls: cvL ")'~p, ~ #a~c&pLc, carL, '" ~1 #cT"Larrl ~a't 7rpJorrI. 7rcp'~ ~/&p avrrlv a v r o v riTv apxrlv o ~ a rvTx~vet" (Plato, Soph.238a)
This Page Intentionally Left Blank
CHAPTER 1
INTRODUCING OPERATIONS w w w w w w w
The basic language Operations I: general facts Operations II: elementary recursion theory The Church-Rosser theorem Term models The graph model An effective version of the extensional model D oo Appendix
This chapter contains an elementary introduction to combinatory logic. The topic is highly developed, but the chapter has quite a limited aim: that of yielding all the necessary prerequisites and making the book self-contained. According to the informal ideas outlined in the general introduction, we aim at investigating an axiomatic notion of abstract logical system, whose ground structure (the abstract syntax) is a combinatory algebra, extended with suitable built-in operations and with a primitive notion N of natural number. The choice of N is largely a matter of convenience and tradition; the basic constructions do not depend on the initial stock of built-in predicates and operations. The central aim of this chapter is to clarify what we understand by ground structure. We begin in the axiomatic style and we describe a formal system OP for a type-free theory of operations; we then outline three basic semantic constructions. We underline that the basic constructions can be carried out in OP itself. After the description of the formal language (w we define OP and we discuss its general features (w closure under /?-conversion, fixed point theorem, relation with )~-calculus), while w reviews some basic facts on recursion theory. We then present the term models of OP, which are based on the fundamental Church-Rosser theorem (w In w we give an elementary description of the Plotkin-Scott graph model Pw, together with its recursive submodel R E and Engeler's construction. Finally, following an elegant procedure, due to Scott (1976, 1980), we show how to isolate an extensional submodel D oo of RE.
Introducing Operations
14
[Ch.1
w The basic language We describe an axiomatic theory of operations OP, which is a first-order extension of pure combinatory logic by simple number-theoretic notions. OP is proof-theoretically equivalent to PA, the elementary system of Peano arithmetic, s it will constitute the basis of all systems to be investigated in this book. The basic language 2, contains: (i) countably many individual variables Xl, x2, x3, ... ; (ii) the logical constants -1, A, V; (iii) the individual constants K (constant function combinator), S (composition combinator), SUC (successor), P R E D (predecessor), P A I R (ordered pair operation), L E F T (left projection), R I G H T (right projection), 0 (zero), D (definition by cases on numbers); (iv) the binary function symbol Ap (application operation) and the predicate symbols N (natural numbers), T (truth), = (equality). Terms are inductively defined from variables and constants via application of Ap. We use x, y, z, u, v, w, f, g as metavariables; while t, t', t ' , s, s ~, r, r ~, etc., are metavariables for terms. We write (ts) instead of Ap(t,s), and outer brackets are usually omitted, while the missing ones are restored by associating to the left; for instance, xyz stands for ((xy)z). We adopt familiar shorthands for special terms: t + 1 : - SUCt ( - the successor of t); (t,s):-- P A I R t s ( = the ordered pair composed by t and s); (t)i := L E F T t ( - t h e left projection of t ) a n d (t)2 : - R I G H T t ( = the right projection of t). Formulas are inductively generated by means of the logical operations from atomic formulas (atoms, in short) of the form t = s, Nt, Tt. A, B, C are syntactical variables for formulas of 2,. As to the syntactical notions of free and bound variable, substitution, etc., we follow the standard conventions and terminology (Shoenfield 1967). In particular, if E is an expression (term or formula), E(x) means that x may occur free in E, while E[x := t] stands for the result of substituting t for the free occurrences of x (provided t is substitutable for x in E). FV(E) is the set of free variables of the expression E; x E FV(E) means that "x occurs free in E~
9
The remaining logical symbols are defined classically:
3xA := -~Vx~A; A V B := -~(-~A A -~B); A - , B := ~A V B ; A + B := (A---,B) A (B---,A). We stick to the usual convention that --1 and quantifiers bind more than the remaining connectives, while A, V bind more than --, and ~-,; sometimes dots are used in place of parentheses (see w of the introduction).
Basic language
1.1]
15
As usual, a numeral is any term obtained from the constant zero by means of a finite number of successor applications; if n E w (w - the set of natural numbers), ~ stands for the n-th numeral, i.e. the term built up from 0 with n applications of S U C . We now recall the standard definition of A-abstraction in combinatory logic. 1.1. D E F I N I T I O N . If t is an arbitrary term of s induction on the notion of s (i) Ax.x "- S K K ; (ii) Ax.t : - K t if x it FV(t); (iii) A x . ( t s ) ' - S ( A x . t ) ( A x . s ) , if x E FV(ts)
A x . t is introduced by
Of course Ax.t has exactly the same free variables as t, minus Coding of n-tuples can be obviously defined by iteration of ( , ).
x.
1.2. We inductively put 9( t ) " - t and ( t l , . . . , tk+i} "-- ((ti, . . . , t k ) , tk+i). If 1 _
(t)kl "-- L E F T ( k - l ) t ;
1, (t) k "- R I G H T ( L E F T ( k - i ) t ) ,
where L E F T ( ~ " - t and L E F T ( k + I ) t " - L E F T ( L E F T ( k ) t ) . index is clear, e. g. if t - ( t l , . . . , tk) , we write (t)i for (t) k.
If the upper
w Operations I " general facts OP, our basic theory of operations, is based on PC, classical predicate calculus with equality in Hilbert style presentation (the equality axioms being given by the formula wvyvz(~
A
-
9 A (~ -
y ~
y -
~) A (~ -- y A y -- z ~
9 -- z )) A
V x V y V z ( x -- y ~ (zx -- zy A xz -- yz) A ( N x ----,N y ) A ( T x ~ T y ) ) .
The non-logical axioms of OP are listed in 2.1 below. 2.1. A x i o m s f o r operations and natural numbers COMB
W, V y V z ( K x y
- x A
PAIR
W, V y ( ( ( x , Y>)i -- x A (<~,Y))2 -- Y);
NAT.1
NO A V x ( N x -~ ( N ( x + 1) A --(x + 1) -- 0 A P R E D ( x + I )
NAT.2
V x V y V u V v ( N x A N y A -~x -- y --, D x x u v - u A D x y u v - v);
NIND
A(O) A V x ( A ( x ) - - ~ A ( x + l ) ) - - , V x ( N x --, A ( x ) ) ( A arbitrary).
S~yz
--
~(yz));
- x));
Introducing Operations
16
[Ch. !
Clearly OP states that the universe is a combinatory algebra, which is suitably extended with natural numbers. It is here important to mention a natural extension of OP, which includes the extensionality axiom for operations" Ext op
Vx(zx - yx) ~ z - y.
CONVENTION. If S is any system containing NIND, S - - S minus NIND. Similarly, if S- is any system not containing NIND, S - S- plus NIND. We now recall the basic elementary facts underlying the pure theory of combinators and A-calculus. Of course, the results below are quite standard and are quickly surveyed for the reader's sake. To this aim, we first restrict our attention to the induction free fragments O P - and O P - + E x t o p of OP. A-abstraction, as defined in 1.1, commutes with substitution and satisfies aand fl-conversion. It also satisfies 7/- and ~-conversion, in presence of extensionality; projections of k-tuples, as defined in 1.2, verify the due equations. 2.2. P R O P O S I T I O N 1. The following formulas are provable in OP-, for arbitrary t,s" (i)
a-conversion
Ax.t = Ay.t[x := y];
(ii)
fl-conversion:
(Ax.t)s = t[x := s];
(iii) (Ay.t)[x := s] = Ay.(t[x := s]). Proviso: in (i) y ~ FV(t) ; in (iii)y ~ F V ( s ) U {x}. 2. The following formulas are provable in O P - + Extop , for arbitrary t, s" (i) 5-conversion: (ii)
~-conversion:
Vx(t-
s)---, A x . t - Ax.s;
Ax.tx-t
(x ~ FV(t)).
3. For each k, i C ~ such that 1 <_i <_k, O P - proves: ((Xl,...,Xk))i--X
i.
PROOF. 1. (i)-(iii) follow by straightforward induction on the build up of t. 2. (i)-(ii)" by/%conversion and Extop. 3: argue by induction on k with the axiom P A I R . D In (i) and ( i i i ) - can be replaced by literal identity - . Closed term are sometimes called combinators. In combinatory logic every operation has a fixed point; indeed, a stronger result holds: 2.3. T H E O R E M (Fixed-point).
o e - t- V f ( f ( F P f )
- FPf).
We can find a combinator F P
such that
Operations
1.2] PROOF: define fl-conversion:
17
FP:=Af.(Ax.f(xx))(Ax.f(xx)).
Then
we
have
by
F P f = (Ax. f(xx))(Ax, f(xx)) = f((Ax, f(xx))(Ax, f(xx))) = f ( F P f ) .
0
FP is Curry's paradoxical combinator Y; for other fixed point combinators, see Barendregt (1984), pp.131-32. We now introduce, following Scott (1980a) and Meyer (1982), certain combinators, which characterize (the first-order theory of) A-calculus as a fragment of OP-. 2.4. DEFINITION (i) I := Ax.x and 1 := S(KI); (ii) 10 := I and lk+ 1 := S(Klk). 2.5. LEMMA (provable in O P - + E x t o p ) MS.1 MS.2 MS.3 MS.4
Vx(yx = zx)-~ ly = lz; 12K = K; 13S = S; 1 -- I.
The proof is a routine application of extensionality and the axioms for K and S. The reason for these esoteric equations is that MS.1-MS.3 axiomatize (-conversion over O P - and yield all together the full strength of Extop. 2.6. Let O P A - : = O P - + MS.1-MS.3 . 2.7. PROPOSITION
(i) oP -
(2.2.2 (i)).
ch ma of
(ii) O P A - + ( 1 - I) proves Extop. PROOF. (ii)is immediate by MS.1. As to (i), assume Vx(t = s); then by flconversion =
which yields with MS.1 l(Ax.t) = l(Ax.s).
(1)
But MS.2-MS.3 imply K x = l ( K x ) and Sxy = l(Sxy); for instance, we have;
Sxy = S(K12)Sxy = ((K12)x(Sx))y =
18
Introducing Operations -- (12(Sx))y - S ( K 1 ) ( S x ) y - ( K 1 ) y ( S x y )
[Ch.1 - l(Sxy).
Hence by definition of A, we have A x . t - l(Ax.t) and the conclusion follows by (1). 13 Of course, we can assume A-abstraction as primitive, and define: s := (s {A})-{K,S}. In the new language s terms are inductively generated by the new clause: if t is a term, Ax.t is a term and FV(Ax.t)= F V ( t ) - { x } ( = x is bound in Ax.t). We also identify terms differing only by the names of their bound variables (e.g. Ax.x is identified with Ay.y). 2.8. DEFINITION. A is the first-order theory in the language s which is obtained from OP by omitting COMB and by assuming the schemata of fl- and ~-conversion (in fl-conversion it is understood that s is substitutable for x in t). 2.9. THEOREM. We can define maps C" s163 and L" s163 that, if ~g - OPA- (OP-+Extop), Y - A- (A-+Extop), then for every L-formula A and every s B, (i)
~Y F A ~ C ( L ( A ) )
such
and Y F B ~ L(C(B));
(ii) ~Y F A iff Y F- L(A); Y F B iff ~Y F C(B). (The exponent - m e a n s that the number-theoretic induction axioms are omitted). As to the verification of 2.9, C ( B ) is the L-formula which results by replacing in A each term of the form Ax.t with the corresponding term, built up from K , S and defined in w L(A) is the s which is obtained from A by replacing K, S by AxAy.x and AxAyAz.xz(yz) in the given order (A primitive symbol). The proof requires some work and computations (apply 2.2, 2.5, 2.7 or see Barendregt 1984). After 2.9, we henceforth identify OPA (OP+Extop) with h (A+Exto.p). It is well-known that the inclusions OP C OPA C OP+Extop are proper, 1.e. there are models of OP which refute MS.1-MS.3 and there are models of OPA falsifying MS.4 (see w167
w Operations H " elementary recursion theory In this section we review a few basic results of elementary recursion theory on w, formalized in the setting of combinatory logic. Since this topic is thoroughly developed in the literature (see Barendregt 1984, Hindley-Seldin
1.3]
Elementary Recursion Theory
19
1986), we only outline the main steps. CONVENTION. In formal contexts m, n,k (also with indices or apices) are syntactical variables for bound number variables; thus we write Vm, 3m instead of Vx(gx---~...), 3 x ( g x A . . . ) . Informally n, m, k, p, q range over natural numbers in contexts of the form n E w, k E w; n, m, k, etc., denote numerals. 3.1. LEMMA. OP proves the following sentences: (i) A(0) A Vn(A(n)---, A ( n § 1))---, VnA(n) , A arbitrary; (ii)
Vn(n - 0 V 3 m ( m + l - n));
(iii)
V n V m ( n + l - m + l ~ n - m);
(iv)
Vn(-,n - 0 ~ N ( P R E D n ) A ( P R E D n ) + I - n);
(v)
Vn(n+lCn)
Agr
P R O O F . (i)-(ii): apply N-induction, identity logic and the consequence of the axiom NAT.1 N0 A v x ( g x - - - , g ( x + l ) ) to the formulas A'(x) "- g x A A ( x ) and A ( x ) "- (x - 0 V 3 y ( g y A y + l -- x)). (iii)" if n + l - m + l , also P R E D ( n + I ) P R E D ( m + I ) , whence n - m by use of V n ( P R E D ( n § - n). (iv): i f - - n - 0, then there exists an m such that n - m + l , by (ii); hence m - F R E D ( m - t - l ) - F R E D ( n ) and n - m + 1 - P R E D ( n ) T 1. Since N m , also N ( P R E D n ) . (v): the first conjunct follows by N-induction, NAT.1 and (iii); it also implies 3x3y(x ys y); but K - S yields V x V y ( x - y) by a well-known trick. O 3.2. LEMMA (Existence of recursor on natural numbers). We can find a closed term R N such that, provably in OP" VmVyVz(R gOyz - y A RN(m+l)yz
- zm(RNmYZ)).
P R O O F : choose t - )~w)~x)~y)~z.DxOy(z(PREDx)(w(PREDx)yz)). Define R N " - F P t (by 2.3); then apply ~-conversion and definition by cases on N.D Clearly, we can define the standard primitive recursive functions and predicates by means of R N and then verify by NIND that the usual definitions are correct; in particular, we have a formula x < y which represents the standard less-relation on numbers and satisfies its elementary properties, provably in OF.
20
Introducing Operations
[Ch.1
3.3. DEFINITION (i) (ii)
f " N - ~ N "- V n . N ( f n ) ( - f is a number-theoretic operation); Vn < m . A "- Vn(n < m ~ A) and 3n < m . A " - 3 n ( n < m A A).
3.4. LEMMA. We can find a closed term #, such that, provably in OP: gk - O A Vm < k. gm > O-~ #g - k.
PROOF. By fixed point theorem, we find a term h such that h - ) ~ g A z . D O ( g z ) z ( h g ( z + l ) ) , and we choose # ' - ) ~ g . ( h g O ) . Assume that gk -- O A V m < k. gm > O. Then hgk - k and h g m - hg(m + l ), if m < k . By induction we verify h g k - h g O - k. [] 3.5. DEFINITION. A partial number-theoretic function F" w - ~ w is representable in a theory ~T (in the language L) iff there is a closed term f such that: F ( n l , . . . , nk) ~_ n iff ~ F f n l ' - " nk -- n; ( n l , . . . , n k are arbitrary natural numbers; ___ is Kleene's notation and F ( n a , . . . , nk) "~ n means that F ( n l , . . . , nk) is defined and has value n).
3.6. THEOREM. The partial recursive functions are representable in OP. PROOF. S U C , KO, )~Xl...)~Xn.X i represent the initial functions successor, constant-zero, projections (respectively). The recursor and minimalization operators exist by 3.3-3.4; the substitution operator is immediately available by )~-abstraction. F1 3.6.1. REMARK. The representing combinators in 3.6 can always be chosen in normal form and such that, if F ( n l , . . . ,nk) diverges, then f ~ i . . . ~ k - f 2 - ()~x.xx)()~x. xx); cf. w below and narendregt, cit. ,p.179. By 3.6, we denote the standard primitive recursive number-theoretic predicates (e.g. the ordering relation on w) by their customary symbols. Strictly speaking, if P is a primitive recursive predicate, P x stands for the quantifier-free formula f x - O , where f is a term representing the characteristic function of P. It is also clear that OP can provably formalize the standard facts of elementary recursion theory s la Kleene. In the following, we shall adopt the bracket notation { a } ( x ) ~ _ y without distinguishing it from its formal presentation in OP. We conclude with a few observations. 3.7. First of all, the distinction between operations and functions in the set-theoretic sense has interesting conceptual consequences. Let Church's thesis be the statement" CT
Vf(f " N ~ i. ~ qnVm({n}(m) ~ fm)).
1.3]
E l e m e n t a r y Recursion Theory
21
Then CT is consistent with the basic theories we consider in this book, even if full classical logic is used (see 4.11 below). 3.8. It is well-known (see Barendregt 1984, Hindley-Seldin 1986) that numerals, successor, predecessor, definition by cases on numerals and pairing are representable in the theory CL of pure combinatory logic. By CL we here understand the subsystem of O P - , formalized in the sublanguage of s which only contains the function symbols Ap, K, S, the predicate - , variables and logical operators. The only non-logical axioms of CL are COMB and (-~K - S). Here follow the basic steps. (a)
Let T " - g and F " - K I ( I is the identity combinator). Pairing: P A I R x y " - )~u.uxy; L E F T x " - x T ; R I G H T x "- xF. Then CL ~- T x y - x A F x y - y A ( P A I R x l X 2 ) i - x i (i - 1, 2).
(b)
Numerals:
0 " - I; S U C - ~ " - P A I R - ~ K ;
PRED-~ "- LEFT-~;
Z~ "- (RIGHT~)FT.
Then, for arbitrary n, m E w, CL F- Z0 - T A Z ( S U C - ~ ) - F and CL F- -~ 0 - S U C - ~ A ( S U C ~ - S U C - ~ ~ ~ - -~) (apply -~K - S). By fixed point, choose G-
and let D else G ~ -
AxAy.(Zx)(Zy)((Zy)(Zx)(G(LEFTx)(LEFTy)))
A x A y A a A b . ( G x y ) a b . Then CL proves that, if ~ - ~ , G ~ F. Hence by the properties of T, F we are done.
T,
Notice that, once we choose to enlarge combinatory logic by standard numerals 0, S U C O , etc., and we assume S U C as a primitive constant, we are forced to introduce P R E D and D: without them, it would be impossible to define a number-theoretic recursion operator (see Curry et al. 1972, vol.II w 13.A.3, theorem 2). 3.9. On f u l l d e f i n i t i o n by cases. Let DIS be a new constant satisfying the axiom 3.9.1
V x V y ( ( x - y A DISxy - 0) V (-~x - y A DISxy - 1)).
Then 3.9.1 is inconsistent with CL. P R O O F (folklore). Let N e g ( x ) - DISxl. By 2.3 we can find an e such that e - i e g ( e ) . Hence we have that e - T implies e - i e g ( 1 ) - O, and - ~ e - T implies e - Neg(e) - 1. F1 It follows: 3.9.2. CL plus the statement " e v e r y t h i n g is a n u m b e r " is inconsistent.
Introducing Operations
22
[Ch.1
Indeed, if we apply the above trick to D, we get an e such that -~Ne. 3.9.3. There cannot exist an injective operation f from the universe into the natural numbers (define by D an operation h such that h x - 1 , if f x - fO and hx - O, if -,fx - f0; any fixed point of h leads to a contradiction).
g4A. The Church-Rosser t h e o r e m We are going to construct term models for the non-extensional theory OP of operations. The strategy is well-known and it relies upon a fundamental result of Church and Rosser (1936). In order to ensure that the given theory of rules is consistent, we prove that c o m p u t a t i o n s - regardless of the various patterns we may follow- give unambiguous results. This technique regards the equality relation, as inductively generated by an asymmetric reduction relation, which splits the computation process into basic atomic steps. For a thorough treatment of the subject, we send the reader to Barendregt (1984), Hindley-Seldin (1986). In the following we deal with the term fragment of the basic language s which contains individual variables and the individual constants K, S, SUC, P R E D , O, D, P A I R , L E F T , R I G H T . Terms are inductively generated by application from variables and individual constants. (w
4.1. DEFINITION OF REDUCTION. (a) The reduction relation > is the smallest binary relation among terms, which satisfies the clauses below" (i) (ii) (iii) (iv) (v) (vi) (vii)
> is reflexive ( R ) a n d transitive (T); > is preserved by application, namely: t > s, t ' > s' imply t t ' > ss';
K t s >_ t; Strs > ts(rs); L E F T ( P A I R t s ) > t and R I G H T ( P A I R t s ) PRED(SUC-~) > -if; n f i f i t r >_ t; D-~-~tr > r, if n # m;
> s;
(A) (K) (S) (P) (SUC) (n.1) (D.2)
(b) We then read t > r as "t reduces to r" and the clauses (iii)-(vii) are called proper reductions.
(c) The terms which are on the left (right) of the proper reductions are called redexes ( contracta). (d) A term t is normal, or in normal form (in short t E NF), iff no subterm of t (t included) is a redex. For instance, every numeral or basic constant is normal; however, there are terms without normal form, the most
1.4A]
23
Church-Rosser Theorem
typical a m o n g t h e m being gt -()~x.xx)()~x.xx). A reduction s t a t e m e n t t >_ s can be conveniently regarded as a derivable formula of a formal system, where (R) and proper reductions play the role of axioms, while the inference rules are (T) and (A). Hence t>_ s holds iff there exists a derivation in tree-form which is locally correct with respect to the axioms and the rules, and which has t _ s at its root; thus we can recursively assign a length to reductions: 4.2. D E F I N I T I O N (reduction with length), t >_ n s iff (i) 0 - n and t _ s is a proper reduction or an application of (R), or (ii) there are k, rn < u E w and either t >_ k r, r >__m s, for some r, or t' _ k r', t" --> m r" and t - t' t", s - r' r", for some t', t", r', r". (In the following sections of this chapter - is literal identity). 4.3. T H E C H U R C H - R O S S E R P R O P E R T Y CR CR states that the reduction relation _ is directed (confluent)" for all t, t', t" if t > t' and t > t", there exists a term s such that t' > s and t" > s We verify that C R holds for a relation R E D , whose transitive closure is >_. 4.4. (i) t R E D n s is defined by replacing everywhere _ by R E D in 4.2 and by omitting the transitivity rule in 4.2 (ii); (ii) t R E D s " - " t R E D I r s, for some k G w". Obviously, t __ s holds iff t >_ k s holds for some k. 4.5. LEMMA. t ~ s iff there t 1 R E D t 2 , . . . , t k _ 1 R E D t k.
are t l , . . . ,t k such that t l - t ,
t k - s and
The proof is i m m e d i a t e by induction on the length of the derivation. If we replace >_ by R E D in 4.3, we have a statement of the Church-Rosser property for R E D . It is also clear that we can obtain, by simple diagram chasing: 4.6. LEMMA. I f C R holds f o r R E D , C R holds f o r > . 4.7. L E M M A ( A n a l y s i s of R E D )
(i) (ii) (iii)
I f C is an arbitrary constant and C R E D t,
then t -
C.
I f C - K , S , D and C s R E D t , then there is a t' such that s R E D t' and t - C t ' . I f C - S , D , P A I R and C t l t 2 R E D t t i R E D t ~ ( = 1, 2) and t - C t l t ' 2.
, there are t], t'2 such that
Introducing Operations
24 (iv)
[Ch.1
I f C - D and C t l t 2 t 3 R E D t, there are t'l, t'2, t'3 such that tiREDt~(i-1, 2, 3) a n d C t ' i t ' 2 t'3 - t .
P R O O F . (i) C R E D t can hold only by (R). (ii) Let C s R E D O t: since C ~ P R E D , L E F T , R I G H T , we must have applied (R) and we are done. Let C s R E D m t be derived by (A): we have C R E D a t ' a n d s P E D kt'', for some n, k, t', t" such that m > k , n and t - t't". One application of (i) yields the conclusion. (iii) If C t l t 2 R E D o t, t must have the form C t l t 2 , because C ~ K. If m, k < n and C t 1 R E D ks1, t 2 R E D ms2, we can find by (ii) a t~ such that t l R E D t ' 1 and s I - C t ' 1" hence we have t~, t ~ - s 2 , such that t i R E D t~, ( i - 1, 2) and t - Ct'lt'2. (iv): by similar arguments resting on (iii). 13 4.8. T H E O R E M .
CR holds f o r R E D .
P R O O F . Assume t R E D n s l , t R E D ms2: we produce a term r such that s 1 R E D r, s 2 R E D r. We argue by induction on l = n + m . If 1 = 0 and (R) is applied on both sides, choose r - s 1 - s 2. If there is a proper reduction, choose r as the result of the contraction. Let l > 0. Case 1. One of the given derivations has length 0. By symmetry, it is not restrictive to assume t R E D o s 1. We analyse its derivation ~1" 1.1 (R) is the inference applied in ~1: choose r - s 2. 1.2. (R) is not applied. We have to distinguish a few subcases. 1.2.1. Let (K) be the inference applied in ~1" Then t - K t l t 2 and s I = t 1. Since m > 0, the last inference of the derivation ~2 (of t R E D m s2) must be (A): K t 1 R E D k rl, t 2 R E D n r2, where f i r 2 = s 2 and k, n < m. By 4.7 (ii), there is a t~ such that r I - K t ' 1 and t 1 R E D t"l. t'l is the right choice. 1.2.2. Let (P) be the inference applied in ~1" for definiteness, assume that we apply left projection. Then t - L E F T ( P A I R tit2); in ~2 we have, for some rl, r2, L E F T R E D rl, ( P A I R t l t 2 ) R E D r 2.
Hence by 4.7 (i) and (iii), r I - L E F T and we find t~, t~ such that t i R E D t~ ( i - 1, 2 ) a n d r 2 - P A I R t'1 t'2. Choose r - t~. 1.2.3 Let (S) be applied in ~1" Then t - S t l t 2 t 3 and s I - tlt3(t2t3); by 4.7 (iii), and noting that ( A ) i s applied in ~2, we find t~, t~, t~ such that , t i R E D t i, (1 _< i _< 3) and s 2 - S t l, t 2, t 3. Choose r _ tl,t,(t,t,3)" 3~ 2 1.2.4 Let
(D.1)
be the
last
inference
of ~1" then
t R E D t I and
Church-Rosser Theorem
1.4A]
25
I I I t-D-ff-fftlt2, t1 s 1. By 4.7 (iv), we find t3, t4, tl, t 2I such that I I I I I s 2 -- D t 3 t 4 t i t 2 and ~ R E D t'3, ~ R E D t'4, t I R E D t'a, t 2 R E D t 2. Since n is I ~ I I normal, t 3 t 4 -- ~: hence we can choose r - t 1. If D.2 is applied, t - D ~ t l t 2 with ~ distinct from ~ and s I - t 2. By normality of ~, ~ and 4.7(iv), we find a t~ such that t 2 R E D t ' 2 and I s 2 R E D t 2.
1.2.5. Assume t - P R E D ( S U C ~ ) s2-PREDs' , where ( S U C - f f ) R E D s ' : s ' - S U C ~ and we can choose r - ~.
and s 1 - - n . Then for some s', but S U C ~ is normal, hence
Case 2. Assume n, m > 0: hence (A) is the last inference in both derivations. We m a y suppose 2.1 t I R E D k t'x, t2 R E D m
t'l' and t - txt2, s I - t'lt'{, where k, m < n;
2.2 t i R E D p t'2, t 2 R E D q t'2' and s 2 - t~ t~', where p, q < m. But k + p, m + q < n + m and by IH, there are t', t" such that t '1 R E D t', t 2' R E D t ' a n d t 1" R E D
By r -
(A) , t't".
81 - -
t'lt'1' R E D t't"
and
"'"~2~2
t"
, t 2" R E D
s 2 [ t E D t't":
t"
.
hence
we
choose
13
4.8.1. R E M A R K . It is essential to the proof that D be restricted to numerals and, more generally, to closed normal terms (see Church's calculus of A&conversion in Church 1941, Barendregt 1984). There are counterexamples to C R in the case, where P A I R satisfies surjectivity, namely P A I R ( ( L E F T t ) ( R I G H T t ) ) > t ( s e e Barendregt 1984, p.403). However, this last reduction gives rise to a consistent convertibility relation by w If we apply 4.8, 4.7 and the definition of normal form, we get 4.9. C O R O L L A R Y . (i) C R holds f o r > . (ii) I f t ,I t l l E NF and r _>_ t', r _>_ t" then t' and t" coincide ( u n i q u e n e s s of normal form). 4.9.1. R E M A R K . (a) A notion of reduction which enjoys CR, can be defined for the A-formalism, plus ~- and ~-conversion (see w (b) There exist several reduction strategies. However, for combinatory logic, there is a standard reduction procedure SR, whose main virtue is condensed in the Standardization Theorem (Curry-Feys 1958). If t has a normal form, then SR terminates and yields the normal form of t. (c) The property of having a normal form is recursively enumerable, but not recursive, by a classical result of Church.
Introducing Operations
26
[Ch.1
~4B. T e r m Models We are ready operations.
to
introduce
the
syntactical
models
of the
theory
of
4.10. D E F I N I T I O N (i) C T M := { t : t is a closed term}; T M " - {t 9t is an arbitrary term}. (ii) The open term model T M is the structure {TM, 9 , - , where the e m p t y set interprets the truth predicate T and
C,N,T), m
1. 2. .
4.
e - {K, S, D, P A I R , L E F T , R I G H T , SUC, P R E D , 0}; 9 9T M 2 ~ TM is the operation of juxtaposition of terms (i.e. application); = C T M 2 and t - s holds iff t > r and s > r, for some term r; N _C T M and t E N iff t > g, for some n C w.
(iii) The closed term model C T M is the substructure of TM, whose support is TM. 4.11. T H E O R E M . Let ~ " - C T M or T M . Then ~ is a non-trivial model of O P + C T , but ~ is not a model of OPA (for notations 2.6, 3.7). P R O O F (sketch)..At, is non-trivial, because K, S are normal and ~ falsifies K - S (by unicity of normal form). Again the Church-Rosser theorem ensures that - is transitive and that ( N t A t - - s ~ N s ) holds in RAt,. In .At,, -- preserves application, simply because > is closed under (A). The axioms on the special constants and N are true by definition of > and since the numerals of ~ are isomorphic to the standard numbers. Consider the closed term 12K - S ( K 1 ) K where 1 - S ( K ( S K K ) ) . Then -~K - 12K holds in ,A1, because the given terms are different normal terms; thus the axiom MS.2 of OP,~ (see 2.5) fails in ,At,. Assume that f " N--+N (see 3.3) is true in All,; we define F" w--+w by F(n)-m iff f g > ~ . By hypothesis, F is total and its graph is trivially recursively enumerable" hence F is recursive. T h i s - t o g e t h e r with the fact that ,A1, is a model of OP and OP provably formalizes the standard results of elementary recursion t h e o r y - yields the soundness of CT. [3 4.12. C O R O L L A R Y . Let ~ " - C T M (i) (ii)
- ~ I- t - ~
or TM. If t and s are closed terms,
iff O P F t - s ;
~l, l= N t iff OP F t - g ,
for some numeral g.
P R O O F . F r o m right to left, apply 4.11. As to the opposite direction, it suffices to verify that t _ r implies OP F t - r. 13
Term Models
1.4B]
27
The proof of CR is constructive and it can be carried out in the system PA of first-order Peano arithmetic (PA is described in the appendix). Hence we have" 4.13. THEOREM. Arithmetic.
OP
is
interpretable
in
the
system
PA
of Peano
4.13 can be sharpened, once we realize that CR is (at least) provable in PRA, the system of primitive recursive arithmetic. This remark naturally leads to a subsystem of OP, which is tailored for PRA. Let 3(+) be the smallest class of L-formulas which is generated from atoms of the form Nt, t - s by means of A, V and existential quantification; 3(+)-NIND is Ninduction schema restricted to 3(+)-conditions. If we define OP 1 := O P - + 3 ( + ) - N I N D , we can prove: 4.14. THEOREM. If f is a combinator such that OP 1 F f : N ~ N , defines a primitive recursive function.
then f
Of course, the proof depends upon a careful formalization of 4.11 (for more details, see Troelstra 1973, Troelstra and van Dalen 1988, J~iger and Strahm 1994, and the Appendix). 4.13-4.14 can be further strengthened by adding to OP and OP 1 some truths of the closed term model CTM. An important example (to be applied in Ch.VI) is the enumeration axiom: EA
3 f V x 3 y ( N y A f y -- x).
EA holds in CTM, because there is a closed term which enumerates CTM (cf. Appendix). 4.15. THEOREM. Theorem 4.13 (4.14) remains true if we replace OP (OP1) respectively by the system O P + E A + C T (OPI+EA). We do not know whether Church's thesis can be conservatively added to O P I + E A . We also mention that there are consistency results involving continuity of extensional operations, encoding type-2-functionals (see Beeson 1985, Troelstra and van Dalen 1988).
Introducing Operations
28
[Ch.1
w The graph model In this section we describe the classical graph model Pw, due to Plotkin and Scott, its recursive submodel R E and Engeler's DM-models. Pw, D M and R E verify OPA, i.e. OP plus the Meyer-Scott axioms (cf. 2.5) and hence they are models of (the extended) A-calculus with ~-conversion, but without full extensionality (cf. 2.6). The construction of R E can be carried out in OP and this fact yields another method to interpret OP plus the MeyerScott axioms into Peano arithmetic (see w While R E validates Church's thesis, Pw is a model of a strong choice principle AC N on natural numbers" O P + A C N yields a model of full second-order arithmetic. Let us fix a few preliminaries. First of all, we let a, b, c, d, x, y, z, u range over elements of P w - { x ' x C_ w}, where w is the set of natural numbers. Of course, if a, b E Pw, a - b stands for extensional equality; n, m, k, p, i, j range over w. We also adopt the lambda notation informally, i.e. to name (set-theoretically defined) functions. If T is the Kleene predicate, W k - { n " 3 m T ( k , n , m ) } - the k-th r.e. set (r.e -- recursively enumerable) and R E - {x" x E Pw A 3n( W n - x)}. We also put ( n , m ) - l ( n + m ) ( n + m + l ) + m ; $x$y.(x, y) is a primitive recursive bijection of w • w onto w. We also define a canonical enumeration of the finite subsets of w:
e n - { n o , . . . , n p _ i } , provided n 0 < ... < up_ 1 and n -
~
2 hi, and e0 - 0 .
i
F, G, H range over the set of operators ( - total functions) from Pw to Pw. We set
F C_ G "- F(a) C_ G(a), for every a E Pw. 5.1. D E F I N I T I O N (i)
GRAPH(F)"-
{(n, m) " m E F(en)};
F U N ( a ) := .~b.{n: 3k(e k _C b A (k, n) E a)} (for a E Pw); (ii)
a. b := (FUN(a))(b);
(iii)
F is continuous iff F(a) = U {F(ek): e k C_ a} (for every a E Pw);
(iv) (v)
F is r.e. iff G R A P H ( F )
is r.e;
F is effectively continuous iff F is continuous and r.e.
Pw is a topological space under the so-called positive information topology, where the basic open sets have the form 0 k - { a ' a C P w A e k C a}, for some k E w (cf. Scott 1976 or Barendregt 1984).
The Graph Model
1.5]
29
5.2. LEMMA (i) Continuous operators are monotone, i.e. a C_ b implies F(a) C_ F(b); (iN) Pw, R E are closed under the application operation .; (iii) a . x - U {a . e k" e k C_ x} and a . x - tO {ek . x" e k C_ a}; x C y implies a. x C a . y and x . a C y . a ;
(iv) F U N ( a ) is continuous; if ais r.e, so is F U N ( a ) ; (v) R E is closed under effectively continuous operators; (vi) I f F C_ G, then G R A P H ( F ) C_ G R A P H ( G ) ; a C_ b implies F U N ( a ) C_ F U N ( b ) .
The verification of 5.2 is straightforward by definitions of continuity, application, F U N , G R A P H and the closure properties of R E . 5.3. LEMMA (i) I f F is continuous, F U N ( G R A P H ( F ) ) F. (iN) Let H ( a ) - G R A P H ( F U N ( a ) ) : then H is a closure operator ( H is monotone and it satisfies a C_ H(a) and H ( H ( a ) ) C_ H ( a ) ) . F U N ( a ) , for some r.e set a.
(iii) F is effectively continuous iff F -
PROOF. (i) By continuity and definition of F U N and G R A P H , we have m E F(a)r
m E F(en), for some e n C_ a (continuity); r (n, m) E G R A P H ( F ) ,
for some en C_ a;
r m E FUN(GRAPH(F))(a)
(iN): by (i), 5.2 (iv)-(vi). (iii)" choose a - G R A P H ( F )
(by 5.1 (i)).
and apply (i). V1
By theorem 2.9, it is enough to interpret in Pw the elementary theory A of 2.8, whose language L()~) contains the constants 0, S U C , D, P R E D , P A I R , L E F T , R I G H T , the binary symbol Ap, the )~-operator and N (unary predicate constant). If C is a basic constant, [C] is the interpretation of C in Pw , indeed an r.e subset of w. We freely use the improper notation (a, n), whenever a - {hi,... , nk} instead of (p,n), p being the canonical code of a. 5.4 Realization of s
in Pw a n d ' R E .
(i) [ 0 ] - {0}; (iN) [ S U C ] - { ( { n } , n + l ) " n E w }; (iii) [ P R E D ] - {({n + 1}, n)" n E w} ; (iv) [ P A I R ] - {({n}, (0, 2n))" n E w} U {(0, ({m}, 2m + 1 ) ) ' m E w}; (v) [ L E F T ] -
{({2k}, k)" k E w};
Introducing Operations
30
(vi)
(vii)
[Ch.1
[ [ R I G H T ] = {({2k + 1}, k): k C w};
[D] = {({m},({n},(l,(k,i)))): k,l,m,n,i E ~ A ^ [(m = ~ ^ i e ~ ) v (-~m = ~ ^ i e ~k)]};
(viii) The unary predicate N is interpreted by IN] = {{n}: n E w}, while identity is interpreted by extensional equality. 5.5. A s s i g n m e n t s . An assignment is a map p 9w ~ Pw. If P w is replaced by R E , p is called RE-assignment. Once p is given, we define, as usual, the assignment p(i := a) such that p(i := a)(i) = a; p(i := a)(j) = p ( j ) if j :/: i. If x := xi, we simply write p(x := a) instead of p(i := a). 5.6. INDUCTIVE DEFINITION OF THE VALUE It] M (t arbitrary term of s p assignment, M = Pw, R E ) . (i) If C is one of the basic constants, then [ C ] y - ~C]; (ii)
Wxi] M - p(i);
(iii)
[rs] M - ~r] M . ~s]y;
(iv)
lAx.sly
- GRAPH()~a.[[S]p(Mx := a)) - { ( k , m ) " m E [S]p(x := ek)}.
N.B. In (iv))~x is the syntactical operator applied to the variable x; Aa is ranging over D - Pw, R E . Clearly, [[t]y e P w by definition of G R A P H
and 5.2 (ii).
5.7 LEMMA. For every term t and every valuation p, ( i ) ) ~ a [9t ] M p(x (ii)
: = ~)
is a continuous operator;,
if y is free f o r x
in t a n d s is free f o r x
[t],(~ := o ) = It Ix .- y]],~, := It Ix .- ~]]M _ [timp(~ := l ~ ] i ) (iii)
if p is an R E - a s s i g n m e n t ,
in t,
o); '
[ t ~ y is r.e
and hence Aa.it~p( M ._ ,) is
~Z~c.v~ly co~..uou~; mor~ov~ ~tl~ ~ - i t ~ E. PROOF: by induction on the definition of t. We only check that Aa'[t]p(Mx . - a ) continuously depends on the interpretation of the variables. First note that Aa.[t]Mp(z ._ a ) i s monotone (apply 5.2 (iii)). As to continuity, if t is atomic, the conclusion is trivial. Assume t pick any m e [t]p(Mx ._ a): then for some e k C - Is] M p(x := a)' we have
rs;
The Graph Model
1.5]
31
(k,m) E ~r]Mp(x :=a). By Iit, for every i E e k, there is a k(i) such that ek(i) C_ a and i E ~s ~M~p(x:= %(i))" Since e k is finite, we can find a j such that, for every i E e k, ek(i) C_ ej C_ a; by monotonicity, e k C_ ~s~Mp(x:= ej)" by
IH,
llM : = en) (k,m) E [r .Up(x
for
some
n
such
that
Again
en C a. Choose
p = max(j,n): by monotonicity
C Is] M p(x
en
-
-
and (k, m) E [r]Mp(x :-- ep) ~
:-- e p )
m E [ t ] ~ . := ev) by definition. Assume (k, rn) E ~Ay.t]p(Mx : = a) " then by definition m E t ]p(xM
a~ y
ek)"
Hence by IH, there is an n such that e n C_ a and m E [t]Mp(x
ert~ y i.e. by definition (k, m) E ~Ay.t] M This concludes the verification of p(z := %)"
continuity, since the other direction follows by monotonicity. I-I Once M -- RE, Pw is fixed or clear from the context, we simply write [tip instead of It] M. Let p be an assignment in M and let ~ be the structure for the language L(A) whose domain is M: then the initial conditions
~l-(t
- s) [p] iff [tip - [sip and
~1-- (Nt) [p] iff [tip E IN] iff for some k E w, [tip -- {k}, fully determine the standard satisfaction relation for L(A) AI~[= A[p] r
p satisfies A in .Ate,
once we interpret T as the empty set. Then we can state: 5.8. T H E O R E M . . ~ (with M = Pw, R E ) is a model of A (and hence OPA)
plus the surjective pairing axiom V x ( P A I R ( L E F T x ) ( R I G H T x ) = Moreover .~]=--1 - I and hence Extop fails in MI~ (cf. 2.5).
x).
PROOF. We have to verify the schemata of ~-, a- and /?-conversion (see 2.2). First observe that = is preserved by application (5.2 (iii)). As to (~), assume [[t]p(x := a) C [S]p(x := a) , for all a E .,~. Then, by definition of inclusion for operators, Aa.[t]p(x := a) C Aa.[s]p(x := a); hence:
[Ax.t]p C_ lAx.sip (by 5.2 (vi) and 5.6 (iv)). (c~)-conversion is essentially the first part of 5.7 (ii). As to (fl)-conversion, if
Y = Yi, p(i) -- a, -
-
F
U
N
(
C
R
A
P
H
._
-
Introducing Operations
32
[Ch. 1
= it]p(x := a) = [[t[x "-- y]]p (apply 5.3, 5.7). Hence Jig is a model of )~-calculus. By definition of IN], it is easy to check that I X ] is the least subset of R E , which contains {0} and is closed under [SUC]. Hence the N-induction schema is satisfied; all the remaining axioms are verified with 5.4 (as to the surjective pairing axiom, observe that if nEa, either n - 2 m and hence m E [ L E F T a ] or m - 2 m + l and m E ~ R I G H T a ] ) . A simple computation also shows that 1 - I ( - MS.4 of w fails in R E ; hence Extop is false in R E (and Pw). D
Pw and R E greatly differ as to the interpretation of the space of number-theoretic operations. 5.9. T H E O R E M . R E is a model of Church's thesis and of the enumeration axiom (see EA, after 4.14). P R O O F . EA: this is a by-product of the enumeration theorem for closed s (cf. Scott 1976, Barendregt 1984, p.166 or Appendix), plus the following fact: to each r.e. set a, we can effectively associate a closed s re, such that [ta] = a (Scott, cit. or Beeson 1985, pp.133-134). CT: assume b E R E and for every a E IN], b.a E IN]. Define F ( n ) = m iff m E b. {n). Then F is a function (as b. {n} is a singleton) and is total ; but F has an r.e. graph: hence F is recursive . I"1 5.9.1. REMARK. The cited result for R E - {[t]" t closed term of s should be contrasted with the fact that P w ~ R E ( C strict inclusion), Pw ~ being the set {~t]: t closed term of pure lambda calculus}. This follows from 5.7 (iii), 5.8 and the fact that that Pw ~ is not a model of ~-conversion 2.2 by Barendregt (1984, p.514). 5.10. T H E O R E M (Extension). Let X be a subspace of the topological space Y. If F" X---,Pw is continuous, then there exists a continuous function F" Y---,Pw, which extends F.
PROOF: one can define, if y E Y, F(y) - U { M {F(x)" x E X M ~}" y E ~ , Rt open in Y}. If we endow w with the discrete topology and we identify I N ] with w, w can be regarded as a subspace of Pw, and hence by 5.10 and choice, we have: 5.11. C O R O L L A R Y (i)
If F" w--. Pw, then there is a continuous function F" Pw ~ Pw, which extends (i.e. F({n}) - F(n), for n E w).
1.5]
The Graph Model
(ii)
33
If R C w x Pw and the domain of R is w, then R has a continuous choice function, i.e. there exists a continuous operator F such that for every n E ~, R ( n , F ( n ) ) .
5.12. D E F I N I T I O N (i) AC N is the schema
Vn3yA(n,y) ~ 3fVnA(n, f n ) (A arbitrary formula of s or s (ii) ACN! is the schema obtained from AC N by replacing 3y with 3!y( = there exists a unique y). As an immediate application of 5.11, we obtain: 5.13. T H E O R E M . Pw is a model of OPA+AC N. It is worth noting that OP)~+ACN! yields a model of full second-order arithmetic (cf.40.2), if we interpret variables ranging over sets of numbers simply as operations from w to {0, 1}. We shall see later that the restriction to numbers in the choice schemata cannot be neglected (because of an inconsistency); however, there are models of )~-calculus where the choice schema holds, if the opening universal quantifier is bounded by a type generated from w (one applies the models of Flagg 1989). 5.14. Generalization: Engeler models In order to study computability over an arbitrary structure MI, with (nonempty) domain M, one would like to expand Mr, with a set of additional objects, which represent programs or rules of constructions. Engeler (1981) produces simple generalizations of the model Pw, the so-called D M-models , which meet the above desiderata. Below, lower case Greek letters c~, /3, -/ stand for finite subsets of M. If a c_ M is a (finite) subset of M, we write (a~b) for the ordered pair (a,b). The notation is suggestive of the situation, where the elements of M are atoms of a given language and (a~b) is a program clause with b as head and a as body (see Engeler 1988). 5.14.1. D E F I N I T I O N (i) Go(M ) - M;
Gk+I(M ) - Gk(M ) U {(a~b)" a C Gk(M), a finite and b E Gk(M)}; G(M) - U {Gn(M ) 9n C w}. (ii) If X, Y C_ G(M) and ~P(G(M))is the power set of G(M), we define application by
X , Y "- {b e G(M)" 3o~ C_ Y.(o~--,b) e X}.
34
Introducing Operations
[Ch.1
(iii) If F ' ~ ( G ( M ) ) - ~ ~P(G(M))is a continuous function (i.e. it is C-monotone and preserves U ), )~-abstraction is interpreted with the natural generalization of G R A P H : /~M(F) "-- {(fl, a)" fl C_ G ( M ) and a E F(fl)}.
(iv) Finally, we put D M "--(~(G(M)), *, )~M)"
It is then clear how to adapt the previous results in order to make sense of the following 5.15. THEOREM. D M is a )~-model of OP)~. 5.16. REMARK. Graph models form a significant class of )~-models and they have been studied in general. We mention that D M and Pw are not isomorphic; Pw has no non-trivial automorphism (Schellinx 1991). For extensive information on models of )~-calculus and combinatory logic, the interested reader might consult Scott (1982), Longo(1983), Koymans (1984), narendregt(1984), Lambek and Scott(1986), Hindley and Seldin(1986), Asperti and Longo (1990).
w
A n effective version of the extensional m o d e l D oo
Henceforth we work within the model R E of the previous section; we use capital letters X, Y, Z, P, Q for r.e. sets and we freely write X ( Y ) for X - Y , and • X . P ( X ) for the graph of the operator X ~ P ( X ) . By 5.3 (ii), R E satisfies the laws: (7/-):
Q c_ ~ X . Q ( X )
(C):
Z C_ Y implies )~X.Z(X) C )~X.Y(X).
6.1. DEFINITION (after Scott 1976, 1980) (i) P o Q := )~X.P(Q(X)); (ii) D o : = A X . X = I = { ( n , m ) : m E e n } ; Dn+ 1 := ,~P.D n o P o D n.
Of course the operation o is associative. 6.2. LEMMA 1. We can find a primitive recursive function a such that for every n E w,
1.6]
The Extensional Model Doo
35
W~(n)-D n. 2. F o r every n,
(i) (ii)
D n C Dn+i; D n o D n - D n.
P R O O F . 1. The definition of A X . W a o X o W a is uniform in a and hence there exists a primitive recursive function r such that Wr(a)
--
) ~ X . W a O X O W a.
If we let (r(0) - i n d e x for the r.e. set I, ~r(n+l) - r(er(n)), we are done. 2. If n - 0 , (ii)is trivial. By ( ~ - ) , Y C A X . Y ( X ) ; hence by (~*), D o - A Y . Y C_ A Y A X . Y ( X ) 0 1 , which verifies (i). Induction step: we assume D n C_ D n + 1 and D n - D n o D n. Then we have by monotonicity on the right and on the left (5.2 (iii)) plus IH, Dn(P(Dn(X))
) C Dn+l(P(Dn+l(X))
).
(+)
D ~ + 1 c_ D n + 2 is a consequence of (+) and ((*). As to (ii), we have by associativity of o and IH, (D,~+I o D ~ + I ) ( P ) - D . + I ( D . + I ( P ) )
- Dn+I(D,~ o P o Dn) -
= D n o (D n o P o Dn)o D n - (D n o Dn)o P o (D n o Dn) = D n o P o D n -- D n + I ( P ).
Hence
D n + 1 o D n + 1 -- D n + 1
6.3. D E F I N I T I O N 6.3.1. F A C T .
by (~*). I-!
D o o - - tO { D n 9n C w}.
Dc~ is r.e.
P R O O F : by 6.2.1 Doo is the union of a primitive recursive family of r.e. sets. ['1 N.B. By the proof of 5.9 and 5.9.1, there is a closed term t of L(A,) with It] P w - Doo; but no such term exists in pure A-calculus by Longo (1983, p.170). We now verify that the collection of r.e. fixed points of F U N ( D o o ) is the required extensional A-model. 6.4. MAIN L E M M A (i) D oo - D oo o Doo (ii)
Doo - A P . D o o o P o Doo.
Introducing Operations
36
[Ch.1
PROOF. (i) D ~ C_ D ~ o D ~ : by monotonicity of application, 6.2.2 (ii). 0o0o D ~ C_ D ~ : if m E D ~ ( D ~ ( e k ) ), by continuity, there exists a j such that ej C Dc~(ek) and m E Dc~(ej). Since ej is finite, we find a q such that ejC_Dq(ek) and by monotonicity of application m E D~(Dq(ek) ). By continuity of application in the first coordinate, and since )~x.D x is increasing, we finally get, for p big enough, by 6.2 and monotonicity of application,
m E Dp(Dp(ek) ) - Dp(ek) C_ D~(ek). (ii) 9similar. D 6.4.1. REMARK. Since I - A X . X C_ D ~ (by 6.1 and 6.2), 6.4 (i) states that Dc~ is a closure operator on R E (see 5.3 (ii)). By 6.4 (i) we also have F I X ( D ~ ) - {X" X E R E A D ~ ( X ) - X } - { D ~ ( X ) 9X E R E ) . Moreover, I C_ D ~ and 6.4 (i)-(ii) imply that D ~ ( D ~ ) -
D~.
6.5. DEFINITION (i) D~ "- F I X ( D ~ ) (ii) Given any assignment p'w--+Dc~ , we inductively define the value it].
Doo: ~xi]]pD oo -- p(i); D - aX.O
;
- t-Dc~ (ll o(u := D
(X)))"
It]if ~ is well-defined by the theorem below; we simply write [tip instead of gt]l_ L'~ and we neglect the interpretation of the additional constants .11~.)
i1
of A.
6.6. THEOREM. Dc~ is a non trivial applicative substructure of R E , which can be expanded to a model of OP)~ and extensionality for operations Extop. PROOF. D ~ has at least two distinct elements T "- w and J_ "- 0. Indeed, we have that Dc~(T ) - T holds by remark 6.4.1. Trivially _L C_ D c~( _L ) and Do( _1_)C_ J_. Assume by IH Dn( J_ )C_ J_. Then Dn( _L ( D n ( X ) ) ) C_ J_ (IH and since J_ ( X ) - J_ ); by ~* we get Dn+l( _L ) Now let D ~ ( X ) hypothesis,
)~X.Dn( • ( n n ( X ) ) ) C_ )~X. _L -
_L .
X, D c~(Y ) - Y" we then obtain, by the main lemma and
X(Y) - D~(X)(Y) - (D~ o X o D~)(Y) - D~(X(D~(Y)))
- D~(X(Y)).
1.6]
37
The Extensional Model Doo
This shows that Doo is an applicative substructure of RE; hence it satisfies left and right monotonicity of application. Moreover, for every term t, Doo is closed under the operation p ~ [t]p, provided p" w ~ Doo. This is verified by induction on t. In particular, by lemma 6.4, IH and fl-conversion in RE:
Doo([)~x.t]p ) - Doo o [~x.tlp o Doo = ~Z.Doo((~X.Doo([t]p(x := Doo(X))))(Doo(Z))) -- )~Z.Dco([t]p(x := Doo(Doo(Z)))" But Doo o Doo - Doo; hence
Doo([)~x.t]p) -- AZ.Doo([t]p(x := Doo(Z))) -- lAx.tip, i.e. [Ax.t]]p E Doo. ~-conversion in Doo: since R E is a model of fl-conversion, we have for [ x ] p - P,
[()~y.t)x]]p - ~Y.Doo([t]p(x := Doo(y))). P - Doo([[t]p(x := Doo(P))). But [t]p(x := Doo(P) ) and P are fixed points of Dco , whence the conclusion. ~-conversion in Doo (cf. 2.2)" let p" w---~Doo and assume
[[t]p(x := p) = [s]p(x := p), for every P E Doo. Then
[t]p(x
:=
Doo(p) ) = [S]p(x
:= D o o ( P ) ) ,
for every P E R E
and hence
by closure of D oo under p ~ I-Iv, we have for every P E RE,
Doo(~t]p(x := Doo(P))) -- Doo([S]p(x := Doo(P)))" By ~-conversion in R E (5.8),
AX.Doo([[t]]p(x := Doo(X))) -- AX.Doo([s]p(x := Doo(X))), whence by 6.5 (ii) l A x . t i p - Ax.[S]p. ~/-conversion (see 2.2)" it corresponds to the equation [)~x.fxlp-[f]p which holds by 6.5 and 6.4(ii). On the other hand, ~- and y-conversion imply Extop. (a)-conversion is left to the reader. Finally, Doo can be expanded to a full model of OP by choosing the denotations of the terms given by 3.8. [:] 6.7. REMARK (Park's theorem). Doo and R E share an important feature: in these models the paradoxical combinator F P (see w coincides with Tarski's fixed point operator, namely, if X E I}oo (or RE), F P ( X ) satisfies the condition: X ( Z ) C_ Z implies F P ( X ) C_ Z, i.e. F P ( X ) is the C_-least fixed point of the operator F U N ( X ) (for a proof, see Scott 1980).
Introducing Operations
38
By straightforward immediately obtain:
arithmetization
of
the
[Ch.1 preceding
model,
we
6.8. THEOREM. OP+Extop is interpretable in PA. Howev&, if we wish to refine 6.8 with OP 1 and PRA in place of OP and PA respectively, it is not clear how to deal with D c~, in presence of restricted inductions. The difficulty can be overcome by considering term models of O P + E x t op" According to the equivalence theorem of 2.9, it is enough to produce models for the system A+Extop , i. e. the variant of OP based on )iabstraction as primitive; of course, Al+EXtop is obtained from A+Extop by assuming the restricted induction schema 3(+)-NIND of 4.13 in place of the full N-induction schema. Let >-~n be the least reflexive transitive relation which preserves application and is closed under the clauses (A), (P), (SUC), (D.1), (D.2) of 4.1 and
_>
(Z) (,)
. - ,];
)~x.tx >__~, t (x not free in t); from t _ f3u s infer Ax.t >_ ~,)ix.s.
By adapting the standard argument of Barendregt (1984), it turns out that >__fl, satisfies the Church-Rosser property (cf. 4.3); hence the associated conversion relation is a non-trivial congruence relation on the set TM~u of all terms in the language of A+Extop , provably in primitive recursive
arithmetic. To be definite, let TMf~o be the structure (TMf3o, 9 , = f3o, C, N/3o), where TM~o is the set of all terms in the language of A and
1.
r
P A I R , L E F T , R I G H T , SUC, P R E D , 0};
2. 9 :TM~o-~ TMf3 o is the operation of juxtaposition of terms (i.e. application); 3.
= f~o C_TM~o and t - zos holds iff t >_ zor and s _ f3o r, for
some r E TM~o; 4.
N/3,7 C_TM~o and t E N~o iff t _ f3o~, for some n.
Now TMzn is a non-trivial model of A+Extop , and satisfies CT, as in 4.11. Thus by standard arithmetization, we get:
Appendix
I.A]
39
6.9. THEOREM. OP+Extop+CT (respectively OPl+Extop ) is interpretable in PA (PRA respectively). A final question involves the consistency of OP+Extop+EA+CT. At present, we can only state the following partial result: 6.10. THEOREM. OP+Extop+EA is consistent. For the proof, consider the theory OP(w), which includes OP plus an infinitary w-rule for terms : tr = sr, for each closed term r t=s Then define C T M ( w ) " - ( C T M , Lop-closed terms and
9 ,-w,
e, Nw) , where CTM is the set of
1. r "- {K, S, D, P A I R , L E F T , R I G H T , SUC, P R E D , 0}; 2. 9 9CTM 2 ~ CTM is the operation of juxtaposition of terms (i.e. application); 3. - w C _ C T M 2 a n d t - w s h o l d s i f f O P ( w )
Ft-s;
4. N w C_ CTM and t E N w iff OP(w) F Nt. By Barendregt (1984, Ch.XVII and Ch.XIX, p. 508), de(w) is consistent; hence CTM(w) is non-trivial and makes Ext op and EA obviously true (see also Flagg-Myhill 1987).
Appendix This appendix contains a few details about results, which were quickly summarized in w First of all, we deal with the provability of the Church Rosser theorem in PRA. It is fairly obvious to see that the proof of w works in PA; however, it is not entirely obvious that only suitably restricted instances of number-theoretic induction are needed. A reminder on the chosen metatheory P RA is in order: the basic language is a standard first-order language containing 0 (zero), successor and function symbols for primitive recursive functions; terms and formulas are defined as usual. (An occurrence of) A quantifier 3 (V)in a formula is bounded, if 3 occurs in the context 3 x ( x < t A . . . ) (respectively Vx(x < t ~ . . . ) ) . Formulas, which only contain bounded number quantifiers, are called bounded (or A0); formulas of the form 3xB (Vy3xB) are called E 1 (H2) , provided B is bounded. PRA is the formal system, based on classical predicate calculus, which includes Peano axioms for zero and successor, defining equations for primitive recursive functions and numbertheoretic induction for bounded formulas. By E l - i n d u c t i o n - EI-IND , we
40
Introducing Operations
[Ch.1
mean the induction schema extended to El-formulas; the rule of H 2induction, II2-INDR , is the rule: if A is a II2-formula , infer VxA from A(O),Vx(A(x)~ A(x+I)). PA can be identified with the extension of PRA which contains the number-theoretic induction schema for arbitrary formulas. A.1. THEOREM (Parsons 1972). PRA, PA 1 - P R A + ~ I - I N D and PRA+II2-INDR have the same II2-lheorems. A.1 grants that the provably recursive functions of the three systems are exactly the primitive recursive functions. We know from w that there exists a formal calculus ~', for deriving expressions of the form tREDs (t,s terms of OP). ~" has the axioms (R), (g), (S), (P), (SUC), (FRED), (D.1)-(D.2)of 4.1, while the inference rule is (A); a ~-derivation is a finite sequence, whose elements are either axioms or else expressions, obtained by previous ones by application of (A). If d is a derivation, ending with tREDs, we put H e a d ( d ) - t and T a i l ( d ) - s. It is folklore to find: 1) a bounded formula Dim(d), which formally represents in PRA the metamathematical predicate "d is a derivation in the ~F-calculus"; 2) terms representing the functions Head and Tail. Moreover, tREDs is ~'-derivable iff tREDs holds according to 4.4 (ii). It is easy to see that (modulo encoding of tuples) the statement of the crucial inversion lemma 4.7 has the form VxR(x, t(x)), where t(x)is a term of PRA, actually built-up by inspecting the proof, and R is a bounded formula. As a consequence of bounded induction, we get: A.2. LEMMA. PRA proves the formalizalion of 4.7. The Church-Rosser theorem CR(RED) for RED has the form of a bounded condition
(VH < x)(Vd' < x)(x = d+d' A Dim(d) A Dim(d') A Head(d) = H e a d ( d ' ) ~ --. (Dim(CRl(d, d')) A Dim(CR2(d, d')) A Head(CRl(d, d')) = Tail(d) A A nead(CR2(d, d')) = Tail(d')A Tail(CRl(d, d')) = Tail(CR2(d, d')) ), where CRI(x,y), CR2(x,y ) are primitive recursive terms which can be explicitly extracted from the proof of 4.8. If we apply bounded induction on x, A.2 and we mimic the content of 4.8, we get A.3. LEMMA. PRA F CR(RED). Now we need CR for the transitive closure TC(RED) of RED, provably in PRA; hence we extend ~" to the system ~* with the transitivity rule (T) and we have an obvious notion of ~*-derivation and a
Appendix
I.A]
41
corresponding bounded formula Dim*, which represents it in PRA. Let"
Ro(d , a, b)"- Dim(d) A Head(d) - a A Tail(d) - b;
n*(d,a,b) . -
Dim*(d) A Head(d) - a A Tail(d) - b.
As Ro,R* are bounded, the following formula is 112:
C(n) "- VdVd'VaVbVc(Ro(d, a, b) A R*(d', a, c) A lh(d') - n 3r3r'3x(R*(r, b, x) A R*(r', c, x)); (here lh(x) is the primitive recursive term which computes the length of a finite sequence). By A.3, we can show PRA F C(0) and P R A + C ( n ) F C(n+I); hence a first application of II2-INDR together with Parsons's theorem yields: A.4. LEMMA. PRA F VnC(n). Again II2-INDR applied to the condition
B(n) "- VdVd'VaVbVc(lh(d') - n A R*(d', a, b) A R*(d, a, c) ---, b,
^
together with A.1, implies that PRA proves VnB(n), whence: A.5. THEOREM. PRA proves the Church-Rosser property for the transitive
closure of RED. Now let: CT(x) "- "x is the code of a closed term of s NUM(x) "- "x is the code of a numeral of s CONV(x, y) "- 3z3d3d'(R*(d, x, z) A R*(d ', y, z)); NAT(x) "- 3z3d(R*(d,x,z) A NUM(z)). Clearly CT(x), NUM(x) are bounded while CONV(x,y) and N A T ( x ) a r e El" If A E L, Acre is the L0-formula which is obtained by replacing: 1) each atom of the form Nt, t - s respectively by NAT(t), CONV(t,s); 2) each quantifier Vx, 3y respectively by Vx(CT(x)--~...), 3 x ( C T ( x ) A . . . ) . Now we give a more explicit statement of 4.15: A.6. THEOREM (i) If O P + E A F A(x), then PA F C T ( x ) ~ Acre(x); (ii) O P I + E A F A(x) implies PA 1 F C T ( x ) - , Acm(X ).
Introducing Operations
42
[Ch.1
As to the proof of A.6(ii), we apply A.5 and we remark that each instance of 3(+)-N-induction is sent into a suitable version of El-induction. As to EA, it suffices to see that its verification in the closed term model requires only El-induction (at most). The claim is made apparent by the following informal argument. First, fix a primitive recursive bijection J* from ~ x ~ onto ~ - { 0 , . . . , 8 } such that J*(n, m) > n, m (we can choose the modified Cantor pairing function J*(n,m)
"-
(n+m)2+3n+m-+-18 2 ). Then primitive recursively define a
GSdel numbering GD of closed terms as follows: G D ( 0 ) - 0;
GD(SUC)- 1; GD(PRED)- 2; G D ( D ) - 3;
GD(PAIR) - 4; GD(LEFT)- 5; GD(RIGHT)- 6; G D ( K ) - 7; GD(S)-
8;
GD(Ap(t,s))- J*(GD(t), GD(s)).
The fixed point theorem for operations ensures the existence of a closed term E such that A.7. If 0 < n < 8, then: E~E~
the unique constant C such that GD(C) - n; else: -- (E(~)o)(E(~)I);
((~)0,(~)1 are the terms representing in O P - the projections of J*). A straightforward induction on closed terms yields that E ~ - t , where ~ is the numeral representing the value of GD(t). Clearly, Parsons's theorem (ii) entails 4.14.
CHAPTER 2
EXTENDING OPERATIONS WITH REFLECTIVE TRUTH w
w w w w w w
Extending combinatory algebras with truth The theory of operations and reflective truth: simple consequences Type-free abstraction, predicates and classes Operations on predicates and classes The fixed point theorem for predicates Applications to semantics and recursion theory N on- extension ali ty Appendix I Appendix II Appendix III
We introduce an axiomatic framework MF- (=Minimal Framework without number-theoretic induction) and we derive a set of simple, but significant consequences of MF-. The minimal fixed points of a natural monotone operator over arbitrary combinatory algebras yield set-theoretic models of MF-. This kind of models (in short, inductive models) are generated by means of natural elementary semantic clauses. The informal intuition is probably due to Curry and Fitch, and it freely takes inspiration from the ideas of illative combinatory logic, later reinterpreted by Aczel with the notion of Frege structure. The main intuition can be summarized as follows: MF- describes an abslract logical system, i.e. a pair given by an abstract syntax and a semantics. More explicitly, we can imagine a non-empty set U of objects (if you like, terms), which is endowed with a two-fold structure. The syntax establishes the rules of combining elements of U; application is the basic combination mode and U is an applicative structure with strong closure conditions and selfreferential abilities (indeed a combinatory algebra). Furthermore, the syntax identifies two objects of U, whenever they are computationally equivalent in a precise sense, specified by a conversion relation. It must be stressed that these features are quite general and that they can be reasonably specialized, as soon as we specify U with additional constraints (for instance, we can always assume a set of primitive numbertheoretic operations, if we are interested in foundational applications).
44
Extending Operations with Reflective Truth
[Ch.2
On the other hand, the semantic structure comes on the scene, as soon as we assert equalities and classify elements of U, e.g. we state that an object truly enjoys a certain property, or that an algorithm yields welldefined values for arguments of a certain type. At this stage, we content ourselves by choosing the simplest alternative, i.e. a truth predicate T, naturally extending the standard Tarskian truth conditions. The basic T-clauses reflect the idea of a reduclionist semantics: truth is assigned to certain basic syntactic objects, (representing) atomic propositions, and it propagates to more complex entities by means of appropriate reductive clauses for logical operations. In agreement with the reductive spirit, atomic propositions do not refer to the truth predicate T and their semantic value only depends on the combinatory structure. Nevertheless, T strictly extends the limits of Tarskian semantics. T itself becomes a propositional constructor and it directly applies to expressions explicitly using T, like T[~Tt] ([a] stands for the term representing the sentence a). Of course, such "higher order" expressions cannot be regarded as atomic, and they have a definite truth value, only if they can ultimately be reduced to well-defined atoms (eft Kripke 1975). There is, however, a price to pay, as one might expect from Tarski's theorem: T cannot be consistent and complete at the same time. In spite of this limitation, a logical system in the previous informal sense yields a reasonable environment for an extended logic" predication, abstraction and the notions of proposition and predicate (total or partial) can be easily introduced by means of T and the combinatory structure, and the resulting theory of abstraction has non-trivial aspects. In details, w shows how to expand any given model of the theory of operations with a reductive notion of self-referential truth, which satisfies natural axioms. These axioms give rise to the basic axiomatic system MF-, whose consequences are first discussed in w In w167 we define the predicate abstraction operation {x: A} via ~-abstraction, and we introduce a consistent reformulation of the type-free comprehension principle AP, together with a few closure conditions on total properties ( = classes). It turns out that AP can be finitely axiomatized by means of four primitive predicates and eight generating operations. In w167 we exploit a kind of second recursion theorem for predicates, which yields fixed point solutions to a class of significant conditions (positive operators, definable in the language of MF-). It follows that the system MF : - MF-plus the numbertheoretic induction schema, is proof-theoretically stronger than first-order arithmetic PA, but still predicatively reducible in the sense of Feferman. We then apply the fixed point technique to the formalization of semantics and we obtain analogues of recursion-theoretic results, due to Rice and Myhill. This last point naturally hints at possible connections with
II.7]
45
Combinatory Algebras with Truth
Generalized Recursion Theory, to be pursued in parts B and C. The final section w shows that extensionality for classes and properties is violated in MF-.
w7. Extending combinatory algebras with truth We canonically associate to each OP--model an interpretation of the truth predicate, which satisfies natural closure conditions. To this aim, we first introduce canonical terms representing the "logical" functions, which are defined by E-formulas. 7.1.
DEFINITION. (a) We choose: I D "- ~x)~y.(1,{x,y)); NEe
"- Ax.{4, x);
T R : - )~x.(2, x);
A N D "- AxAy.(5, (z, y));
(b) We then define the map A H [ A ] Z-formula:
(i) (ii)
[t = s] =
(IDt)s;
[--A] = NEG[A];
N A T : - ~x.{3, x);
[Ns]- NATs;
A L L "- )~x.{6, x).
by induction on the notion of [Tt]- TRt;
[A A B] - AND[A][B];
[VzA] - ALL(~x[A]).
7.1.1. FACT
(i)
I f L1, L 2 E L O G 1 - { N A T , N E G , T R , A L L } , then O P - I- LlX - L2Y -+ L 1 - L 2 A x -- y;
(ii)
if G1, G 2 E L O G 2 - { I D , A N D } , then O P - ~ GlXy - G2x'y'---+ G 1 - G 2 A x - x' A y - y';
(iii)
if L 1 E L O G 1, L 2 E L O G 2, then OP-I---1 L l X -
L2Yz;
if L1, L 2 are distinct elements of L O G 1 U LOG2, then O P - I-- --1 L 1 - L 2. (Verification by pairing axioms and #-conversion).
(iv)
We stress that [A] and A have the same free variables in common. It would be possible to trivialize T R to ~x.x; but we stick to the present choice, since it better suits to the generalizations of chapter VIII. 7.2.
Further notations and terminology
(i) We henceforth write T A as a shorthand for T[A]. (ii) To increase readability, we keep using --, A, V, etc., and infix notation, instead of the terms N E G , A N D , A L L , etc. Thus t A s, V f , Vx.t , ~t stand for the terms ( A g D t ) s , A L L f , A L L ( ~ x . t ) ,
Extending Operations with Reflective Truth
46
[Ch.2
N E G t (in the given order); we also adopt the obvious shorthands ~ t , t V s, t ~ s , in place of -~(-~t), -~(~t A-~s), (-~t V s) (respectively). As to the existential operator, we define: 3(f) "-~(V()~x.-~(fx)))and 3x.t "-3()~x.t). (iii) s is the (operational) fragment of s which omits the predicate T. The atoms of Lop, i.e. Nt, t - s are called elementary atoms, e-atoms for short. Atoms of the form Tt of the full language are called T-atoms. s and s clearly have the same terms. We now fix a model ~1~ of O P - (i.e. OP without number-theoretic induction) with domain M. 7.3.
DEFINITION (i) L op(~t~), L ( ~ ) are the languages Lop , L (respectively), expanded with distinct individual constants, for each element of M. If t is a closed term of the expanded languages, Jtt~(t) denotes the (unique) value of t in M. For the sake of simplicity, we shall use a, b, c, d, e,..., both for the elements of M and the corresponding constants (we identify ~ ( a ) with a). (ii) If P is a unary predicate (possibly T itself), L op(P ) is the language Lop expanded with P; so, Pt is a new atomic formula ( = atom) of Lop(P). (iii) Let S be any subset of M: ( ~ , S ) i s the realization of Lop(P), which interprets P by the set S: if t is an arbitrary closed term of s ( ~ , S ) I= Pt iff ~t~(t)E S. If P - T, then L - Lop(T) and (Jtl~,S) is the realization of s which interprets T by the set S.
P F O R ( x ) i s the Lop-formula:
(iv) ~y3z(~
[~
-
z]
-
v
~
-
[g~]
v
9 -
[Ty]
v
9 -
(-~y)
v
x
-
(y ^ z)
v
~
-
vy);
.
M-PFOR-
{a E M" Jft~l=PFOR(a)}.
If a C M - P F O R , we say that a is (the code of) a pseudo-formula (p-form, for short). (v) We define: P(x, P ) ' - 3u3v((x - (~u) A-~PFOR(u)) V (x - (~-~u) A Pu) V v (~ - [~ - v]A ~ - v) v (~ - [~(u - v)] ^ ~(~ - v)) v
V (x - [gu] A g u ) V (x - [-~Nu] A ~ g u ) V V ( x - [-~Tu] A P(~u)) V (x - [Tu] A Pu) V V
(x
-
(u A v) A Pu A By)
V
(x
-
[-~(u A v)] A (P(-~u) V P(-~v))) V
V (x - (Vu) A VyP(uy)) V (x - -~(Vu) A 3yP(~(uy))));
II.7]
Combinatory Algebras with Truth
47
If S C_ M, we put: r(S) "- {a E M" ( ~ , S ) l = r ( a , P ) } . (vi) A subset S of M is consistent (complete) iff for every a E M, either a ~ S or (--,a) ~ S (a E S or (--,a)E S). (vii) Put atl~(g)"- {dig(t)" t numeral}; then att,(SUC) ^ (ati,(PRED) ^) is the unary function atl,(N)~,&(N), represented by SUC ( F R E D ) in art,. Jig is an w-model iff the structure (.3g(g), Jlg(0), JIg(FRED)', JIg(SUC) ^) is isomorphic with (w,O, pred, suc) ( - s e t of natural numbers with zero, predecessor and successor). (viii) S C_ M is F-dense (F-closed) iff S C_ F(S) (F(S) C S). Once ~ is a fixed combinatory algebra of domain M and b, c E M, we shall write be, ~b, Vb, b Ac, instead of the proper ~t,(Ap(b,c)), JlI,(NEGb), JtI,(ALLb), Jlg(ANDbc)(in the given order); we also let id(b,c) (tr(b)) stand for JIg([b- c]) (respectively Jlg([Tb])). 7.3.1. REMARK. I'(x,S) formalizes the clauses of the intended semantic schema, to be used for interpreting the truth predicate T. As to PFOR(x), it defines the range of application of T: we stress that p-forms are not inductively defined entities (like sentences), but only objects of the ground algebra, possibly representing semantical information. 7.4. LEMMA (i) /f S C_ M, F(S) C_ M - P F O R . (ii) r " ~ 2 ( M ) ~ ( M )
is monotone: S C_S' implies F(S) C_ F(S').
(iii) Assume a, b, f E M: if a ~ M - P F O R , (~a) E F(S); .Ag([A]) E F(S) iff A holds in att~ (A closed e-atom or a negated e-atom); (aAb) EF(S) iff a E S and b E S; (~(a /k b)) E F(S) iff (-~a) E S or (-~b) E S; (Vf) E F(S) iff (fa) E S, for all a E M; (--,(Vf)) E F(S) iff (-~(fc)) E S, for some c E M; (-~tr(a)) E F(S) iff (-~a) E S; (tr(a)) E F(S) if]" a E S; (-,--,a) E F(S) iff a E S. (iv) If S is consistent and F-dense (complete and F-closed), then r ( s ) is consistent and F-dense (complete and F-closed). PROOF. (i): trivial.
48
Extending Operations with Reflective Truth
[Ch.2
(ii): r ( z , P ) i s positive in P, i.e no negated atom Pt occurs in r(z, P). (iii): by 7.1, 7.3, 7.1.1 and the pairing axioms. (iv)" we repeatedly apply (iii). Let S be consistent and F-dense; we claim" a ~ F(S) or (--a) ~ F(S).
(,)
Case 1. a ~ M-PFOR: then a ~ F(S) follows by (i) above. Case 2. a = JII,([A])with A = gb, (b = c ) o r a = (Vb), tr(b), (b A c). Then (,) is a consequence of the consistency of S and (iii). For instance, if a = (b Ac) E F(S), then b E S and c E S. Were (-,a) E F(S), we ought to have (-,b)E S or (--,c)E S: either alternative contradicts the consistency of S. Case 3. a = (-,b). Assume by contradiction (-,b) E F(S), (-~-~b) E F(S). Then b E S and by F-density b E F(S), which also implies b E M - P F O R . 3.1. b=-,c: then we have ( - - c ) e r ( s ) a n d (-,c) E S , whence c E S and (-~c) E S, against the consistency of S. 3.2. b = (c A d), (Yc), tr(c), NI,([A])with A e-atom or negated e-atom. By F-density, we are led to case 2. Note that if S is F-dense, so is F(S) by F-monotonicity. If S is complete and F-closed, the argument is similar. I-1
7.5. DEFINITION. FIX(r,~).- {S C_M. r ( s ) - s}. F I X ( F , MI,) is the set of fixed points of F over Mr,. In chapter VII we shall investigate the global structure of the fixed points of F; however, in the following we concentrate upon O(M1,) "- the C-least fixed point, which is generated from below by transfinite iteration of r. 7.6. DEFINITION (by recursion on ordinals). (i)
-
0;
(ii) O(Jtt~, c~ + 1) - F(O(~I,, or)); (iii) O(.Ab, A) - U O(~l,, c~) (A limit). a<,k 7.7. LEMMA (i) c~ < ~ implies O(Jtt,, c~) C_ O(Jtt,,/~); (ii) O(.At~,c~) C_ M - P F O R and O(.Ai,,c~) is consistent and F-dense,
for each ~. P R O O F . (i). We verify by induction on ~: for each a < fl, O(~,c~) C_ O(.tl,,~).
(,)
If fl = 0 or ~ is a limit, the claim ( , ) i s trivial. Assume that (,) holds and let a < fl + 1. It suffices to check O(dtt,, fl) C_ O(.At~, fl + 1). If fl = 0, we are done; if fl = 5 + 1, we have O(Nl,,5) C_ O(.&,5 + 1) by In, which implies O ( ~ , fl) C_ O ( ~ , fl + 1) by F-monotonicity. If fl is a limit and 7 < fl, then
Combinatory Algebras with Truth
II.7]
49
by IH and F-monotonicity O(all,, 3') C_ O(all,, 7 + 1) C_ O(,&,/3 + 1). Hence O(ag, fl) _C O(all,, fl + 1). (ii) O(atl,,c~) is r-dense by (i) above and hence O(aM,,a)C_ M - P F O R by 7.4 (i). On the other hand, O(.Al,,c~) is consistent by induction on a, using (i) and lemma 7.4 (iv). E] The _C-chain {O(alg, c~)" a E ON} cannot be strictly C_-increasing by the well-known Cantor's theorem: hence, there exists an ordinal 6 < card(All,) + (+ "- successor operation on cardinals), such that O(all,, 5) - O(all,, 5 + 1). 7.8. DEFINITION. We set" .-
6)
where 5 - the least a such that O(all,, a) - O(all,, a + 1). Then O(./11,) - U {O(Jtt~, a)" a E ON}. 7.9. PROPOSITION. Let ag be a model of O P - (OP). O(all,) is consistent and is the C_-least fixed point of F: r ( o ( . ~ ) ) c O ( ~ ) (r-closure);
(,)
if F(S) _C S, then O(atl,) C_S (F-induction).
(**)
PROOF. The consistency follows by lemma 7.7, while (,) holds by choice of 5 in 7.8. As to (**), simply prove O(Ml~,a)C_ S by transfinite induction on a, applying F-closure of S and F-monotonicity. V1 7.10.THEOREM. (i) If JM,I=OP- , the structure (~,O(3t~)) universal closures of the following s
T.1
TARA,
if A - ( x - y ) ,
T.2.1
TTx~Tx;
T.3
T',-,x ~ Tx;
T.4.1
satisfies the
Nx, ( - x - y), ~Nx; T.2.2
T-~Tx ~ T-~x;
T(x A y)+-+Tx A Ty;
T.4.2
T~(x A y ) ~ T ~ x V T~y;
T.5.1
T(Vf)~VxT(fx);
T.5.2
T--(Vf) ~ 3xT~(fx);
T.6
~(Tx A T~x) ( - C O N S ) ;
RES
Tx---, PFOR(x);
~PFOR(x)---~T~x.
(ii) If .]g is an co-model (i.e the denotation of N is isomorphic with the standard set of natural numbers), (all,,O(alt,)) satisfies the N-induction schema for arbitrary formulas of 2.. PROOF. Part (ii) is trivial. As to part (i), CONS is true in O(31,) by 7.9,
50
Extending Operations with Reflective Truth
[Ch.2
while T x ~ P F O R ( x ) holds by 7.7(ii). The other axioms are immediate consequences of 7.4 (iii) and the fact that O(Jtl~)is F-closed and r-dense. [3 7.10.1. REMARK. Let O(~t~) d : : {a: a E M and (-~a)~ O(.~1~)]. The reader can easily check that O(~l~)dl: T.1-T.5 + RES + COMB : : Vx(Tx V T~x); O(Jtt~) d is the C_-largest fixed point of F over ~ (see Ch.VII). 7.11. DEFINITION. (i) The theory M F - ( - m i n i m a l framework for selfreferential truth and abstraction) is the finite extension of O P - by means of axioms T.1-T.6 of 7.10. (ii) MF is M F - plus the schema of N-induction for arbitrary s NIND "- A(0) A Vx(A(x)-~ A(x + 1))-~ V x ( g x ~ A(x)). NB. RES is omitted (unless we explicitly mention it). In the sequel, we mostly deal with MF- or with subsystems of MF, which contain restricted forms of number-theoretic induction. The restriction axioms RES will play a marginal role in our investigation; also, the second restriction axiom is certainly a matter of convention (for alternatives, see Ch.VII). However, RES is needed for a full characterization of models of theories of reflective truth in Ch.VII, as it can be guessed from the following" 7.12. PROPOSITION (Alternative axiomatization of M F - + R E S ) Let the fixed point axiom for truth FPT be the sentence
Vx(Tx ~ F(x, T)),
where r(x,T) is obtained from the formula r(x,p) of 7.3 (v) by replacing every subformula of lhe form Pt with Tt . Then we have: M F - + RES C_ O P - + FPT + CONS and M F - + RES ~ FPT. The verification makes use of the independence properties of 7.1.1; we underline that by 7.12 M F - + R E S is a genuine fixed point theory in the sense of Feferman (1982), and it axiomatizes the property of being an arbitrary fixed point of F (see Ch.VII).
II.8]
Operations and Reflective Truth: Simple Consequences
51
w8. The theory of operations and reflective truth: simple consequences In this section we start working axiomatically within the system M F without number-theoretic induction; since we are interested in general properties of truth and propositions, the number-theoretic axioms are not needed. Towards the end of the section, we sketch a version of M F - , where the consistency axiom CONS is replaced by its dual, i.e. completeness. First of all, we must distinguish between T-~t, which can be read as "t is internally false", from -~Tt; so we define a notion of internal falsehood F: 8.1.
F x := T ~ z .
8.2.
PROPOSITION.
The following
formulas are provable in M F -
without consistency: (i) (ii) (iii)
T z ~ FFx;
Fz ~ T F z ~ FTz;
T(x V y ) ~ Tx V Ty;
F ( x V y ) ~ Fx A Fy;
T3(f)~
3zT(fx);
F 3 ( f ) ~ VxF(fx).
Closure under cut: M F - p r o v e s (iv)
T(x ~ y ) ~ (Tx ~ Ty).
P R O O F . (i)-(ii): apply T.3 and T.2, T.4. As to (iii), recall the definition of 3 ( f ) and apply ~-conversion 2.2(ii) and T.5. The statement ( i v ) i s a consequence of (ii) and consistency. O 8.3.
DEFINITION (i) (ii)
Prop(x):= Tx V T-~x = "x is a proposition". Propfunn(f):= VXl... VxnProp(fxl...Xn) = " / i s a n-ary propositional function" (n > 1; if n -- 1, we simply omit the index).
Clearly we have in pure logic :
Propfunk+l(f) ~ VxPropfunk(fz ) (k > 1);
8.3.1.
hence we can restrict our attention to unary propositional functions. We now investigate the closure properties of Prop under standard logical operations and the behaviour of T, whenever T is restricted to Prop. Abbreviation: Prop(A):= Prop([A]). 8.4.
LEMMA. (i)
M F - proves:
Prop(A), whenever A = (-~)Nx, (-~)x = y; Tx--. Prop(x);
52
Extending Operations with Reflective Truth
[Ch.2
(ii) Prop(z)~ Prop(Tz)~ T(Prop(z)); (iii) Prop(z)~ Prop(Prop(z)); (iv) Prop(z)~ Prop(--,z); (v) Prop(z) A Prop(y)---, Prop(x A y) A Prop(z V y); (vi) Prop(z) A (Tz --, Prop(y))---, Prop(z ---,y); (vii) Prop fun(f)---, Prop(V(f)) A Prop(3(f)); (viii) Prop(x,y)~ Prop(z) V Prop(y) (, = V, A,---,); (ix) Prop(Q(f))~3zProp(fz) (Q = 3, V); (x) ,F(Prop(z)). PROOF: straightforward application of 8.2 and T-axioms. As to the final point, if FProp(z)is assumed, we have F T z A F F z (8.2(ii)), whence Fz A Tz (by T.2.1), against consistency T . 6 . 0 8.4.1. REMARK. 8.4 (x)implies T(Vz(Prop(z)---, f z ) ) ~ T(Vf); this means that internal truth (i.e. truth with respect to T) disregards quantification on propositions; thus, there is no hope to produce propositions by means of Vx(Prop(x)---,... ), except for trivial cases. We stress that the internal truth predicate is partial and that 8.4 (viii)(ix) cannot be improved by replacing V, 3 in the right member of the implications with A, V respectively; for instance, there are disjunctive propositions with a member which is not itself a proposition. Therefore the behaviour of logical operators on Prop is non-strict. By 8.4 (x), the notion of proposition is essentially external and positive; we cannot come to know that p is not a proposition by adopting the semantical schema embodied by T. 8.5. PROPOSITION. MF-proves: (i) 3x(-,Prop(x)) A -,Propf un(Iz.[Prop(z)]); (ii) 3z3y(Prop(x V y) A-,(Prop(x) A Prop(y))); (iii) 3f(Prop(3f) A--,VxProp(fz)). PROOF. (i) We consider the fixed point L of )~x.[Fz], i.e. L - [FL] (apply 2.2). Then Prop(L)implies both TL and FL (by 8.2 (i)), against consistency. If .kz.[Prop(x)] were a propositional function, we could conclude by 8.4 (x) Vx.TProp(x), which contradicts the previous result. (ii): choose y - [ 0 - 0] and x - [L].
II.8]
Operationsand Reflective Truth: Simple Consequences
(iii): choose f -
53
~y.[Fy]. Vl
On the other hand, T is consistent and complete on propositions and satisfies the standard Tarski conditions; indeed, the essential content of 8.2 and 8.4 can be summarized as follows: 8.6.THEOREM. MF- proves: (i) Prop(A) A (TA ~ A), whenever A = (-,) x = y, (--)Nx; (ii) P r o p ( x ) ~ Prop(-,x) A (T-,x ~ - , T x ) ; (iii)
Prop(x) A (Tx~Prop(y))---,Prop(x ~ y) A (T(x ~ y ) ~ ( T x ~ Ty));
(iv) Prop fun(f)---, Prop(V f) A (T(Y f ) ~ Y x T ( f x)); (v) Prop(x)--, Prop(Tx) A ( T ( T x ) ~ Tx). 8.6.1. REMARK. (i) 8.6 shows that MF-essentially contains the (classical) theory of Frege structures (see Aczel 1977, 1980). (ii) The Curry paradox (Curry 1942). We cannot consistently add to M F - a strengthened introduction axiom for implication, which omits the hypothesis Prop(x)in 8.6 (iii): ME- + ( , ) i s inconsistent, where ( , ) i s the statement
(Tx ~ Prop(y))--, ((Tx -~ T y ) ~ T(x ---,y)).
(,)
Indeed, we can find c such that c-c---, y ( c - FP(,~x.[x---, y]), see 2.3)and clearly Tc---, Ty (by 8.2 (ii), consistency and ---logic). If we assume (,), we can infer T(c---,y), i.e. Tc, whence Ty by 8.2(iv): contradiction (choose
[0-1]). m
As to the general Tarski schema T A ~ A, it can be justified "from left to right" and also for positive conditions. 8.7. DEFINITION. (i) A formula B is T-free if T does not occur in B. (ii) The collection T-Pos (T-Neg) of T-positive (T-negative) formulas is inductively generated by the following clauses: 1. each e-atom is both T-positive and T-negative; each atom of the form Ts (-~Ts)is T-positive (T-negative); 2. if B is T-positive (T-negative), ~B is T-negative (T-positive); 3. if B, C are T-positive (T-negative), then so is B A C; 4. if B is T-positive (T-negative), then so is VxB.
Extending Operations with Reflective Truth
54
[Ch.2
8.8. T H E O R E M (i) (ii)
The soundness schema: M F - proves ( T A ~ A), for arbitrary A; if A is T-positive (T-negative), M F - minus consistency proves: A ~ T A (-~A---, FA, respectively);
(iii)
if A is T-free, M F - minus consistency proves T A Y T-~A.
P R O O F . (i): by induction on A and by considering the form of B whenever A - - - l B . If A is an atom, we apply T.1 and T.2.1, while, if A is a conjunctive or universally quantified formula, we use IH~ T.4.1, T.5.1 plus /?-conversion. If A = - ~ T t , we apply T.2.2 and consistency; in the remaining cases, we make use of T.4.2, T.5.2 coupled with IH. (ii): by simultaneous induction on the definition of T-Pos and T-Neg. (iii): by ( i i ) a n d tertium non datur. F! We conclude with a simple, but useful duality property, whose semantic content will be made clear in Ch.VII (w 8.9. DEFINITION 1. ^ is the (unique) map of the basic language s into itself such that (i) ^ is the identity map on e-atoms and (Tt)^ =--,Ft; (ii) ^ commutes with the logical operations: ( A ^ B ) ^ = A ^ ^ B ^, ( W A ) ^ =
W(A^),
(-,A) ^ =
2. Put COMP := Vx(Tx V T-~x)(Completeness); NMF ( = the neutral MF) is MF minus CONS, where CONS = T.6; MF ^ := NMF + COMP. As usual, N M F - is NMF without N-induction.
3. x=~y := (Tx ---, Ty) A (Fx ~ Fy) and xc~y := ( x ~ y ) A (y=~x). Then CONS ~ (COMP) ^ and COMP ~ (CONS) ^, provably in NMF (use axiom T.3); more generally, we can easily check 9 8.10. LEMMA. NMF proves: (i) A ~ A ; (ii) ( ~ y ) ^ ~ ( y ~ ) ; ( ~ r
(~r
8.11. T H E O R E M (Self-duality of NMF) For every A, NMF F A iff NMF F A ^. The same holds if the restriction axioms RES are added to NMF. P R O O F . By the previous lemma, it is enough to check the theorem from
II.9A]
Type-free Abstraction, Predicates and Classes
55
left to right. The verification runs by induction on the length of the formal proof of A in NMF; the induction step is immediate by definition of ^ and IH. If A is an axiom, either it is self-dual (i.e. equivalent to its ~-transform, like NIND, T.3) or it can be proved by the axiom lying on the same line in the statement 7.10 (e.g. (T.2.1) ^ requires T.2.2). F! 8.12. COROLLARY. For every A, MF F A iff MF^F A ^. MF and MF ^ have
the same T-free theorems and hence they are equiconsistenr NMF is a possible axiomatic counterpart of the four-valued approach to semantics (Belnap 1977, Woodruff 1984, Visser 1984), according to which self-reference leads to underdefined (neither true nor false), as well as to overdefined (both true and false) sentences. For a general account of the NMF-models, we send the reader to Ch.VII.
w9A. Type-free abstraction, predicates and classes We will show that M F - s u p p o r t s a reasonable theory of type-free abstraction. To this aim, we observe that internal truth yields a wellbehaved notion of general predicate application (in short predication), and that the underlying combinatory structure grants a systematic notation for partial predicates defined by abstraction. Furthermore, if we identify total predicates withpropositional functions, we obtain a rich domain, satisfying natural closure conditions for abstraction. Henceforth, we shall adopt Feferman's terminology by using the shorter term class instead of propositional function. Of course, as we already know from the previous section, there exists a stumbling block in any theory of abstraction, based on such an identification" the notion of propositional function (or class) is itself non-total and this is an essential limitation for deriving impredicative fragments of second-order logic. On the other hand, the limitation is not surprising, in view of the reductive, predicativistic interpretation, which is suggested by the C - m i n i m a l model of w7. 9.1. DEFINITION (i) (Xl...Xn)~Ty :- T(YXl...Xn); (ii)
(Xl...xn)-~y - F(YXl...Xn);
{Xl...xn: A} := ~Xl...)~xn[A]("the n-ary predicate defined by A");
(iii) Cl(y):= Yx(xrly V xfiy) ("y is a class"); CL
:=
Note that e l ( y ) = Prop fun(y). We also recall (see 8.10):
xVVy := (Tx ~ Ty) A (Fx ~ Fy) and AC~B := [A]c:~[B].
Extending Operations with Reflective Truth
56
[Ch.2
9.1.1. REMARK. (i) The definition does not ensure the injectivity condition
[~] =
[u~v]--,
9 = u ^ y = v
(,)
If (,) is needed, choose P D := ~xy. Ix = x A y = y A yx] and define xrly := T ( P D x y ) , x-~y := T-~(PDxy). Then (,) is met and we can prove in N M F - the formula: T(PDxy) ~ T(yx) A T~(PDxy)~
T~(yx).
(ii) Of course, 77, ~, { } might be accepted as primitive symbols of s and the definitions of 9.1 (i) would become axioms. A similar choice might be advisable in applications, or if one wishes to avoid combinatory logic (see appendix I and Ch.XIV). 9.2. PROPOSITION. (i) The Abstraction principle AP: for every formula
A, N M F - (i.e MF- minus consistency) proves: VUl... Vun((Ul... Un)r]{Xl... Xn 9A} ~ A[x 1 "- Ul,... , Xn "-- an]); (ii) NMF- proves:
((=1... ~ , ) , y ~ T[(~I... ~,),y]) ^ ((~1... ~,)~Y ~ F[(~l... ~,),y]); (iii)
NMF- F- (uT]{x" A} ~ TA[x : - u]) A (u~{x" A} ~ FA[x "- u]);
(iv)
NMF- F- T[Cl(x)] ~-, Cl(x) ~-, x~CL;
(v)
M F - }- Cl(x) ~ (-(y~x)~y-~x).
PROOF. (i) Assume n - 1 " then T(ur]{x" A } ) ~ T ( A x . [ A ] ) u ~ T A [ x "-u] (by T.2.1, fl-conversion and [A][x " - u ] - [A[x "-u]]). A similar argument works for F (we need T.2.2.). (ii)-(v)" left to the reader. [3 By the Russell paradox, there exist predicates, which are not classes, and the notion of class does not determine a class. More generally: 9.3. PROPOSITION. Let r -
{x" ~xrlx }. Then:
MF- ~ ~3~(Ct(~) ^ W(~,~ ~ ~,~)) ^-~3y(Cl(y) ^ W(u,~ ~ Cl(~))). PROOF. Let x be a class such that Vu(urlx ~ urir). Then by AP we have: xrlx ~ x~r ~ x-~x, whence by consistency ~(T(xrlx ) V F(xrlx)), i.e. ~Cl(x). If y is a class, which exactly contains all classes, b - {x" x~y A-~x~x} is a class and br]y: hence br]b~(bqyAb-~b)~b-~b, i.e. b is not a class" contradiction !El n-ary predication can be reduced to unary one by adding parameters: 9.4. LEMMA (Parametrization). NMF-proves:
II.9A]
57
Type-free Abstraction, Predicates and Classes
VXl... VXn+m((Xl... g::}(xn_l_l... X n + r n ) r l { U n + l .
Xn+rn)rl{Ul...
Un_kr n 9 A } r
. . un+rn:A[Ul " - X l , . . . , ttn . -
xn] }.
We now consider some useful approximations to the naive abstraction principle, i.e. to versions of AP where r is replaced by the standard biconditional. 9.5. DEFINITION (i) A formula B is elementary in the list X l , . . . , x n iff B is built up from e-atoms, negated e-atoms, T-atoms of the form trlx i and their negations -~trlxi (1 < i < n ), by means of A, V ,Vy, 3y (y ~ {Xl,...,Xn}); (ii) a formula B is quasi-elementary in x l , . . . , x n iff B is built up from e-atoms and negated e-atoms, arbitrary T-atoms, and negated T-atoms of the form -~t~x i (1 < i _< n), by means of A, V and Vy, 3y (y ~ {Xl,...,Xn} ). 9.5.1. REMARK. (i) B is T-positive iff B is (up to logical equivalence) quasi-elementary in the empty list of variables. (ii) If B is elementary, then B is trivially quasi-elementary; moreover, the negation of an elementary formula is always elementary (up to logical equivalence). The notion of elementary condition for type-free languages is adapted from Feferman (1975). We say that B is (quasi-) elementary tout court iff B is (quasi-) elementary in some list X l , . . . , x n. With the notions of 9.5, we obtain a useful generalization of 8.8 (i)-(ii): 9.6. LEMMA (i) Let A be quasi-elementary in Xl,... , x n. Then: MF(ii)
F CI(Xl) A . . .
A Cl(xn)---+
(A ~ TA).
If A is elementary in Xl,... , xn,
MF- F C l ( x l )
A...
A Cl(xn)--+
Prop(A).
PROOF. (i) By 8.8 and induction on A, using the hypothesis on Xl,...,Xn, whenever A - - , t q x i. (ii): by (i), classical logic and 9.5.1 (ii). F! Lemma 9.6 and the abstraction principle 9.2 immediately imply 9 9.7. COROLLARY. (i) If A(V, X l , . . . , x n ) is quasi-elementary in
Xl,...,Xn,
M F - ~ Cl(xl) A ... A Cl(xn)--+ Vy(y~{v: A(V, Xl,...,Xn) } ~-+A(y, x l , . . . , X n ) ). (ii)
If A(v, Xl, . . . , Xn) is elementary in Xl,... , Xn, M F - F Cl(xl) A . . . A Cl(xn)--+Cl({v: A(V, Xl,...,Xn)}).
58
Extending Operations with Reflective Truth
[Ch.2
Corollary 9.7 yields the so-called elementary comprehension schema, in short EC (Feferman 1975). It may be asked whether classes are closed under a strengthened schema, where "elementary" is replaced by some reasonable notion of "second-order condition", e.g. the formula A admits a standard interpretation in second-order logic. In Ch.VII, we shall prove that a second-order impredicative comprehension schema is consistent with MF, but there are models (e. g. the inductive model of w which falsify it. 9.S. DEFINITION (i) Vxrlt.A "- Vx(xrlt --. A);
3xrlt.A "- 3x(xrlt A A);
(ii)
"f is a family of classes indexed by a " : - Vxrla.Cl(fx);
(iii)
{{Xl,...,xn)" A(Xl,...,xn) } ": - { x ' x - ( ( X ) l , . . . , (X)n) A A((x)I , . .., (x)n)} (for (x)i, see w
(iv)
E(a, f) "- {(x, y)" xTla A yrl(fx)} ( - generalized direct sum or join);
(vi)
I I ( a , f ) : - {g" Vxrla. (gx)rl(fx)} (-generalized product).
(iii) is justified in N M F - w i t h pairing axioms: 9.8.1.
(al,...,an)rl{(Xl,...,xn): A(Xl,...,xn) } r A[x 1 := a l , . . . , x n := an].
9.9. PROPOSITION (The Join Principle J). CL is closed under generalized sums over families of classes, indexed by classes. Formally, MF-proves:
(i) w(~,r,(b, f ) ~ 3~3y(~ = (~, ~)^ ~,b ^ y,(f~))); (ii) Yx~lb.Cl(fx) A Cl(b) --, Cl(E(b, f)). PROOF. (i) is an immediate application of 9.7 (i) and 9.5.1. (ii): let f be a family of classes indexed by the class b and let:
A(u) := 3x3y(u = {x, y) A xrlb A yrl(fx)). By T.1, Cl(b), 8.2 (ii)-(iii), T.4.2, 9.2 (v)we get:
FA(u) ~ VxVyF(u = {x, y) A xrlb A yrl(f x)) VxVy(u r (x, y)V F(xrlb) V F(yrl(fx)))
wvy(,., 7: (~, y) v-~(~,Tb) v y~(f~)) wvy(,_, = (~, y) ^ ~,Tb ~ ~,~(f~)) w v y ( u = (~, y) ^ =,Tb ~-~(~,,7(.f~))) ~A(u). Together with (i) and 9.2 (i), this yields:
Operations on Predicates and Classes
II.9B]
59
-~(u~)E(b, f)) ~-~A(u) ~ FA(u) ~ u~E(b, f). [3 9.9.1. REMARK. 9.9 proves the so-called join principle J; 9.9 and 9.7 show that MF contains Feferman's system EM+J for explicit mathematics (Feferman 1975, 1979; Beeson 1985; cf. appendix II). As an exercise, the reader may verify the dual principle for II: 9.10. PROPOSITION (Closure under generalized products). MF-proves: (i) C l ( b ) ~ Vg(g~lII(b, f ) ~
Vx~lb. (gx)~l(fz));
(ii) el(b) A VxTib.Cl(fx) ---, Cl(H(b, f)). Similar arguments prove that Prop, the notion of (internal) proposition, is closed under infinitary conjunctions and disjunctions in the following sense: if f is a family of propositions indexed by any class c (for instance c = {x: Nx}), there exist propositions A { f x : xTIc}, V { f x : x~lc}, satisfying:
T( A { f x : xrlc}) ~-, Vxzlc.T(f x);
T( V { f x : x~lc)).-. 3xrlc.T(f x).
w9B. Operations on predicates and classes
We extend the standard operations of the algebra of (extensional) classes and relations to the general domain of partial properties. In particular, each definable predicate can be generated starting from four primitive predicates by means of eight predicate operations. 9.11. DEFINITION 1. Initial Predicates: ~Pe := {(~,y,z):
OD := { ( ~ , y ) :
9 = yz);
~ = y);
N :- {x:Nx}; ~-:= {x:
Tx}.
2. Basic Operations: Singleton
{a} := {x : x = a} ;
Complement - a
:= {x: -~xTla};
Intersection
a f-1 b "- {x" xqa A xrlb};
Domain
dom(a) := {x: 3y.(x,y)~?a}.
Extending Operations with Reflective Truth
60
[Ch.2
3. Combinatorial operations: Expansion
Exp(a) :-- {(x,y): y~a};
Converse
Cony(a) :- {(x,y) : (y,x)rla};
Cycle
Cyc(a) :-- {(x,y,z) : (z,x,y)ria};
Transpose
Tress(a) :- {(x,y,z): (x,z, ylria};
(x, y, z, a, b denote distinct variables; remind that ( x , y , z ) - ((x, y),z)). 4. We say that CL is closed under a given n-ary operation H, provably in a theory ~l', if C l ( a l ) A . . . A C l ( a n ) ~ Cl(H(al,..., an) ) is provable in ~';
5.
a - b :- Vx(xria r xrib);
6.
a C_ b "- Vx(x~a - , x~b) and a - eb "- a C_ b A b C_ a. {Clearly, if a and b are classes, then a - e b ~ a - b)}.
7. EXPL is the collection of s which is inductively generated by the clauses: ~PP, DD, N, Y E EXPL; if t is a variable or a constant of .5o_, {t} E EXPL; if t E EXPL and s E EXPL, then dora(t), tM s , - t , Conv(tl, Exp(t), Cyc(t), Trans(t) are elements of EXPL. If t E EXPL, we say that t is an explicit predicate of .5. The subcollection ELP of elementary predicates is inductively generated as EXPL, except that we omit Y from the initial clauses of EXPL, and we add the condition" if t is a variable, Exp(t) E ELP. A trivial application of elementary comprehension 9.7 (ii) yields" 9.12. LEMMA. CL contains f~DD, DD, N and is closed under the operations of 9.11.2-9.11.3, provably in MF-. 9.13.THEOREM (Explicit abstraction) (i) For every formula A of s for every n, we can effectively define a term vn(A) E E X P L with F V ( r n ( A ) ) - F V ( A ) - { x l , . . . , x n } , such that, provably in MF-:
vn(A ) - {(xl,...,xn)" A}.
(*)
(ii) Assume that A is elementary in u (where u may be a finite list of variables): then the term rn(A ) can be chosen in ELP. P R O O F . (i) The argument parallels the well-known class theorem for Gbdel-Bernays set theory. We proceed by induction on the built-up of A. The inductive step is easily handled by means of complement, intersection and domain; therefore we only need to find, for each n, a predicate rn(A),
Operations on Predicates and Classes
II.9B]
61
satisfying (~) above, whenever A - Nt, Tt, t I - t 2. On the other hand, t 1 - t 2 is equivalent (mod r to 3 y ( y - t l A y - t 2 ) . Now we can find, uniformly in r, n, i with 1 _< i _< n, a term er'n(r ) such that:
crin(r)- {(Xl,...,Xn)" X i - - r } . Hence:
{(Xl,. ..,
t2} -
Xn > 9tl _
~.n-I- 1 d o m ( ~ nn-t-1 + l ( t l ) fq~n+](t2)).
The definition of ~r/n(r) can be reduced to the construction of elementary predicates I~PPn(i , j , k ) and ODn(i, j), where 1 < i, j < n such that:
f~pPn(i,j,k)-
{<Xl,...,Xn). x i - X j X k }
ODn(i,j ) - { ( x i , . . . , X n ) "
x i -xj}.
(1)
In turn, (1) is verified by induction on n with the help of ~PP, 0I) and the combinatorial functions (details are in appendix II). A similar argument works if A - N t or T t where, of course, we must use N and 3-. (ii) It is enough to deal with the atomic case A(Xl, u) - tou , where Xl, u are distinct variables, possibly free in t. But there is an elementary predicate (r2(t) -- {(Xi,X2>" Z 2 -- t}; if we choose ezt(u,t) - dom(a2(t) f3 E x p ( u ) ) , ext(u, t ) i s elementary and ext(u, t ) - {xl" trlu }. [3 By application of elementary comprehension generalized sums and products, we easily have:
and
closure
under
9.14. PROPOSITION. C L is closed, provably in MF-, under the operations defined in the following list.
1.
Pair"
{a,b} : - {x" x - a V x - b};
2.
PirectSum:
a@b:--{(x,y)'(xT?aAy--O)V(x~bAy--1)};
3.
Cartesian Product:
4.
Exponenlialion: [a--,b] "- { f " Vxqa.(fx)qb};
5.
Universe and empty class:
m
v.-
6.
m
a | b "- {(x, y)" xrla A yrlb};
-
0
.
-
Generalized union and intersection:
n fz .- {u. Vz,Tb.u,7(fz)}, U far {u 93xrlb. u,l(fx)} , xob xrlb provided b is a class and f : b ~ CL. 9-
9.14.1. REMARK. In analogy with the generalized closure condition of P r o p under implication, it holds, provably in MF-:
Extending Operations with Reflective Truth
62
[Ch.2
Cl(a) A (3x(xrla) ~ Cl(b))----, Cl([a---, b]) A V f(frl[a ~ b] ~ Vxqa. (fx)rlb). We end up the section by considering a natural question: is there any reasonable counterpart at the level of predication of the set-theoretic power set operation? Let us try two obvious alternatives:
P(a) "- {x" x C_ a}; P+(a) "- {x" xrlCL A x C_ a}. Unfortunately, the former is unmanageable, while CL is not closed under the operation P+: 9.15. PROPOSITION (i)
M F - F ~VyVx(x C_ y ~ x~?P(y));
(ii)
M F - F Vz(z~?P+(y)~ Cl(x) A z C_ y);
(iii)
MF-F~Vx(CI(x)~CI(P+(x)).
PROOF.(i): choose x - CL and apply 9.3. (ii) is obvious. As to (iii), choose y - V ( - universal class) and verify that Cl(P+(V)) implies Cl(CL): contradiction !O Clearly, both operations ~x.P(x) and ~x.P+(x) are C_-monotone (e.g. a C_ b implies P(a)C_ P(b), etc.); however, in the present framework we can also define an intensional power set operation" 9.16. DEFINITION (Weak power set). P w ( b ) " - {x " 3 y ( x - y
gl b)}.
Then by elementary comprehension 9.7 we have, provably in MF-: 9.17.
Cl(Pw(b)) A Vu(u C_ b---, 3v(wlPw(b) A v -- e u)) A
where - e is the extensional equality of 9.11.6. The interest of Pw(b) is limited by the fact that, even if b is a class, we cannot predict whether any given subproperty of b is itself total. A weakening of the power set operation along constructivistic patterns, looks more promising and it leads to consider the decidable subclasses of a given class x. If c is a class, a decidable subclass of c has the form {x" x~c A f x -- 0}, for some f" c ~ 2 (here 2 - {0,1}). 9.18. DEFINITION. P d ( a ) " - {y" 3f3y(y - {z" xrla A f x -- 0} A f~[a --, 2]}. Then we have: 9.19. PROPOSITION. MF-proves:
Cl(c) ~ (Cl(Pd(c)) A Vb(brlPd(c ) ---, Cl(b) A b C_ c)).
Fixed Point Theorem for Predicates
II.10A]
63
We underline that Pd(c), for certain c's, can be very large: it is consistent to assume that P d ( N ) i s a model of second-order comprehension (cf. 5.13).
w10A. The fixed point theorem for predicates We know from the previous sections that the logical universe described by MF-, though not well behaved under impredicative quantification over classes and propositions, is closed under natural infinitary constructive operations, which go beyond the limits of elementary logic. We now consider the problem of inductive definitions; we shall see that M F - can prove the existence of solutions to a number of recursive conditions, but in general such solutions cannot be shown to define total predicates, or to be extremal (i.e. minimal or maximal). The main tool is the property-theoretic analogue of the second recursion theorem. Indeed, if we combine the fixed point theorem for operations and the abstraction schema, we get the simple and fundamental: 10.1. T H E O R E M (Fixed point for predicates) (i) Let A(x,y,v) be a formula with the free variables shown only. We
can f i n d - uniformly in A - a is v, such that M F - p r o v e s :
term IxyA(x,y,v),
whose only free variable
IxyA(x, y, v) = {x: A(x, IxyA(x, y, v), v)} A A Vu(u~IxyA(x, y, v) r A(u, IxyA(x, y, v), v)). (ii) /f A(x,y,v) is quasi-elementary in v (a fortiori if A is T-positive, see 8.7), and we assume that v is a class, r can be replaced by ~-~. PROOF. Choose:
IxyA(x,y,v) := FP(Ay.{x: A(x,y,v)}). Hence u q l x y A ( x , y , v ) c ~ A ( u , IxyA(x, y, v), v) by 2.3 and 9.2. The second part follows with 9.7. D 10.1.1. NOTATION. 10.1 introduces a new variable binding operator I. If x, y are clear from the context, we shorten IxyA(x,y, v) to I(A, v); we also let I ( A , v ) : = I(A) if the dependence on the variable v is not explicitly needed. Of course, the definition of I makes sense in the general case where v is a finite (possibly empty) list of variables, apart from the bound x and y. 10.2. Examples (i)
The notion I S of "ileralive set" (or "hereditary class").
64
Extending Operations with Reflective Truth
Let I T S ( x , y ) := Cl(x) A x C_ y and choose I S ( x ) : = xrII(ITS). have, by 10.1(ii) and exploiting the classhood of x: 10.2.1
MF- ~ I S ( x ) ~
[Ch.2 Then we
Cl(x) A Vz(z,lx ---, IS(z)).
In chapter V we shall prove that I S (actually, a generalization) yields a well-behaved set-theoretic universe. (it) The intensional notion of (finite) type over N. Let T P ( x , y ) be the formula:
[(= = N) v 3c3b(~ = [b-~ ~] ^ b~y ^ c ~ ) v ~b3c(~ = b | c ^ b ~ ^ c~y)]. If T Y P E ] " - I ( T P ) , we get, provably in MF-, that T Y P E / c o n t a i n s N and is closed under Cartesian product and exponentiation. (iii) Let:
The construclive second number class O.
O~d(., y ) . -
=~N ^ [(. - T) v 3 k ( . - 2 k ^ k~y) v
V 3kVn3m({k}(n) ~_ m A mTly A x -- 3k)] (for the notations 2 k, 3 k, recall the convention 3.6.1). If O "- I(Ord), M F proves the fixed point axiom 10.2.2.
Vm(m~O ~ Ord(m, 0)).
By inspecting the examples above, we are naturally led to lift to the present framework the notion of (positive) operator, which is familiar from the standard theory of inductive definitions (Moschovakis 1974). 10.3. DEFINITION (i) A formula A(v) is operative in v iff either v does not occur in A or A belongs to the least class of formulas, which is inductively generated by means of A, V, Vy, 3y (y distinct from v) from formulas of the form Nt, -~Nt, t - s, -~t - s, tTlv, Tr, -~Tr, provided v does not occur in t, r, s. (it) If A is a formula, which is operative in v and T-positive, the term ~ v . { x l . . . x n : A ( x l , . . . , X n , V)} is called an operator, n being the arity of the operator; A may contain free variables ~ {Xl,... ,Xn, v}. (iii) An operator Av.{xl...Xn: A(Xl,...,Xn, V)} is elementary if every T-atom, which occurs in A, has the form t,lv. (iv) An operator ~ v . { x l , . . . , Z n : A(Xl,...,Xn, V)} is existential iff no universal quantifier occurs in A, except possibly for universal bounded number quantifiers of the form Vm < n (see 3.1).
II.10A]
Fixed Point Theorem for Predicates
65
10.3.1. CONVENTION. We henceforth identify any given operator with the formula defining it; thus we simply call A(Xl,...,Xn, V) an operator in v tout court, and X l , . . . , x n show its arity. In the following we only consider operators of arity 1 (or 2 at most; this is not restrictive by pairing). The idea is that any given operator defines a monotone operation (with respect to C_ of 9.11), transforming relations (represented by) v into relations (represented by) { X l . . . x n ' A ( X l , . . . , X n , V)}. The notion of existential operator is suggested by the formula involved in the definition of T Y P E I , while Ord(x, y) is elementary and I T S ( x , y) is not. In set theory (or in a suitable fragment of second-order logic), the Knaster-Tarski theorem grants the existence of fixed points; here we have, by induction on the build-up of the given operator and by 10.1 (ii)" 10.4. PROPOSITION. ( i ) / f A(v) is operative in v, then in pure logic
A(v) A v C_ u ~ A(u). Hence if A(x, v) is an operator, )~v.{x" A(x, v)} is C_-monotone, provably in MF-: a C b ~ {x" A(x,a)} C_ {x" A(x,b)}. (ii) For every operator A(x, v), I ( A ) : - IxvA(x, v) is a fixed point, provably in MF-:
Vu(urlI(A ) ~ A(u, I(A)). 10.4.1. REMARK. We warn the reader that the class of T-positive formulas, which are operative in the variable v, is not closed under substitution" e.g. A(x, v) - XrlV is an operator, but A(v, v) - VrlV is not. Proposition 10.4 raises two natural problems. We first wonder whether there exists a more mathematical characterization of operators, which does not refer to the syntax: the question will be answdred in the positive in Ch. IV, where we shall prove that operators coincide with extensional (or C_-monotone) operations and have a natural topological interpretation. A second question concerns the apparent weakness of 10.4(ii): it only offers implicit solutions to the given condition and states nothing about the minimality (or the maximality) of the solution I(A), which is essential to argue by (generalized) induction on the given I(A). In the next chapter, we shall see that such limitation is essential: MF- is consistent with different hypotheses on I(A) and hence MF- is formally unable to distinguish among them. However, proposition 10.4(ii) already establishes a simple link with standard subsystems of second-order arithmetic ( - analysis, in short).
Extending Operations with Reflective Truth
66
[Ch.2
Indeed, let us consider the standard language s of PA ( - first-order arithmetic), expanded by a new unary predicate symbol P; an arithmetical operator is simply a formula A(x,P) of s which is positive in P (i.e. A is logically equivalent to a formula, built up from atoms of the form Pt, t = s, --t = s by means of V, A, 3, V), and has the free variable shown only. s , the language of the elementary theory of inductive definitions, is obtained from the language of PA, by adding a distinct unary predicate symbol I A, for each arithmetical operator A(x,P). A
10.5. DEFINITION. ID 1 is the first-order theory in the language Z(ID1) , which contains Peano arithmetic PA (with the induction schema, extended to all formulas of s ) and the fixed point axiom:
FP(A)
VX(IAx~A(X, IA)),
for each arithmetical operator A (of course, A(X, IA)results from A(x,P) by replacing each subformula of the form Pt with IAt ). It is clear that every arithmetical operator becomes an elementary operator in the sense of 10.3 above, once we replace "Px" with "xr/v" (we can assume that v is a fresh variable); thus, if we choose N as the range of individual variables and we interpret "IAX" by "xrlI(A)" , we readily obtain: A
10.6. PROPOSITION. ID 1 is interpretable in MF. Since I131 has the same arithmetical theorems as the subsystem EI-AC or, equivalently, Predicative Analysis of levels < e0 (cf. Aczel 1977, Feferman 1982 and Ch.VIII), we also have a lower bound on the arithmetical content of MF (which turns out to be sharp by the proof theory of chapters IX-XI). At this stage of the investigation, it becomes essential to calibrate the strength of the number-theoretic induction available; so we explicitly introduce two finitely axiomatized subsystems of MF, which restrict NIND to arbitrary properties and to classes respectively. 10.7. DEFINITION induction).
(Subsystems of MF with restricted number-theoretic
(i) Set Clos(y) "- (Orly) A Vx(xrly~(x+l)77y). Then" Property N-induction P-NIND: Class N-induction CL-NIND: (for C see 9.11.6).
Vy(Clos(y)~N C_ y); Vy(Clos(y) A C l ( y ) ~ N C_ y);
II.10A]
Fixed Point Theorem for Predicates
(ii) MFp "- MF-+P-NIND;
67
MFc := MF-+CL-NIND.
Later, we shall prove that the inclusions MF c C_ MFp C_ MF are proper; while MF c is proof-theoretically equivalent to OP, MFp already proves the consistency of OP. If we restrict our attention to existential operators, then we can give a standard inductive definition of minimal fixed points. 10.8. LEMMA. Let A(x,u) be an existential operator. Then we can find a term Ax.IXA such that, provably in MF" (i) Vn(I~ -- { x : - , x -
x} A InA+1 -- {x" A(x,I~4)});
(ii) VnVp(n < p---, InA C I~); (iii) Vx(A(X, I A ) ~ 3kA(x, IkA)). PROOF. (i)-(ii): we apply recursion on N (see 3.2), N-induction and proposition 10.4(i). As to (iii), proceed by outer induction on the build up of A; here it is necessary that A is existential and we apply the true arithmetical schema:
Vn(n < m--~ 3 k B ) ~ 3jVn(n < m ~ 3k(k < j A B)), which is provable by induction on m. O Now choose:
10.9. THEOREM. MF proves (for B arbitrary, A existential operator): (i) gx(A(x, IA) ~ x~7IA); (ii) Vx(A(x,B)---, B(x))---~ Vx(xOI A - , B(x)). PROOF. (i): by 10.8 (iii), (i). (ii)" if we assume the premise of (ii), VnVx(xrlI~4---, B(x)) is derivable by means of N-induction and monotonicity. O 10.9.1. REMARK. If the existential operator defined by A(x,u) is elementary in u, then by property N-induction, elementary comprehension 9.6 and 9.14, we have: MFp F VnCl(InA)A CI(IA).
(1)
Under the same hypothesis on A, (1)implies that 10.8 (ii)-(iii) are provable in MFp. Hence, 10.9 (i) together with
Extending Operations with Reflective Truth
68
[Ch.2
is already derivable in MFp. (1) also holds if every T - a t o m occurring in A ( x , u ) - e x c e p t those of the form trlu-is of the form sr/r where r can be proven to be a class. Hence 10.9(i) and the special case of 10.9(ii) with B(x) = xTlu are derivable in MF p "
wlOB. Applications to semantics and recursion theory The fixed point theorem 10.1 turns out to be a significant tool in general: in most applications, one only needs the existence of a solution and not its m i n i m a l i t y / m a x i m a l i t y . We illustrate the theme by showing the existence of a partial satisfaction predicate for 2, and then by proving two abstract versions of well-known results, due to Rice and Myhill. First of all, OP is obviously sufficient (see w to carry out a primitive recursive arithmetization of the L-syntax; so, we can fix an effective GSdel numbering [ ] and we let [E] stand for the (canonical term of L representing the) GSdel number (in short gn) of the expression E. For later applications, it is also convenient to define the satisfaction predicate over GSdel numbers of arbitrary terms, possibly encoding formulas via [... ]. To this aim, we say that t is a formula-term if t = [A], for some formula of s 10.10. D E F I N I T I O N (i)
If f is any term, f( + ) is the operation defined by x
f ( xi ) i - x
,
f ( xi ) n - fn, if - - , n - i .
Here we suppose that n, k, i range over N. Clearly f(/=)is well-defined, uniformly in i, x (apply definition by cases on N ; see 2.1, NAT.2). (ii) By 3.6, we may assume that there are formulas and terms in the T-free part Lop of the language s defining the following notions:
Ter(x) := x is the gn of a term; F o r ( x ) "- x is the gn of a formula of s Fort(x): = x is the gn of a formula-term [A]; f t r ( z ) := the gn of [A] if z is the gn of A (i.e. ftr([A]) = [[A]]); vr(x) := the gn of the z-th variable; tr(z) := the gn of [Tt], if z is the gn of t; id(x, y):= the gn of [t = s] if z = It], y = Is]; nat(z) := the gn of [Nt] if z = [t]; neg(z) := the gn of [-~A], if z is the gn of [A]; and(x, y):= the gn of [A A B] (x gn of [A], y gn of [B]); all(x, y):= the gn of [VziA ] (x = [zi] , y gn of [A]);
Applications to Semantics and Recursion Theory
II.IOB]
69
app(x, y):-- the gn of (ts) (x gn of t, y gn of s).
10.11.LEMMA. There exists a term Val such that, provably in OP-, Yal([tl, f ) -
t[x o "-- f O , . . . ,x n "-- f-i],
for every term t with free variables in the list Z o , . . . , x n. In particular, O P - proves
Val([[A]], y ) -
m
[A[~ o " - f 0 , . . . , ~ n " - f n ] ] ,
for every L-formula A with free variables in the list Zo,... , z n.
PROOF: we define an operation Val such that" Yal ([vi], f) - f~; Val ([c], f ) - c if c is a constant; Val ([t~l, f ) -- Val(rtl,/)Va/(r~l, f). Val is well-defined by means of the operation D and fixed point theorem 2.3 (it is essential that the operation F 1 is N-valued and that the language has a finite number of constants). E!
In order to introduce the satisfaction predicate, let S ( z , v ) formula saying that z has the form (m, f) and 1. 2. 3. 4. 5. 6.
m -mmm m m -
be the
id(n, k) and Val(n, f ) - Val(k, f ), or nat(n) and N ( Y a l ( n , f)), or tr(n) and T ( Y a l ( n , f)), or nag(n) and -~(
Then, if we apply the fixed point for properties (10.1) and we define Sat(x, y) "- <x, y)r/I(S),
we have: 10.12.THEOREM. (i) For every L-formula A, MFc ~ Sat([[A]l, f ) <=~A[xo "- f O , . . . , x n "- f-i]; ( X o , . . . , x n contain all the free variables of A).
~f v ( ~ ) . - Sat(~,go), w~ ha~ fo~ ~v~y Z-~nt~.c~ C: MF c ~ V ( [ [ C ] l ) ~ C.
(ii)
Moreover Sat satisfies, provably in MFe, the adequacy conditions: Sat(nag(n), f ) r -~Sat(n, f);
Extending Operations with Reflective Truth
70
3. 4. 5. 6.
Sat(and(n, m), f) ~-, Sat(n, f) A Sat(m, f); Sat(all(vr(n),m),f)~Vu.Sat(m,f( ~ )); Sat(tr(n), f) ~ T(Val(n,/)); Sat(nat(n), f) ~ g(Yal(n, f)); Sat(id(n,m),f) ~-, Yal(n,f) - gel(re, f).
(iii)
ME c F -~V([[L]])A--V([[~L]]), for some L-sentence L.
.
[Oh.2
PROOF" the definition of Sat is already available. Condition (i) follows by metamathematical induction on A, while (ii) is a consequence of the definition of Sat and (iii) is Tarski's theorem. 0 Of course, by the first clause of 10.12 (ii), V cannot be an adequate truth definition; however, if A is a sentence of OP, MF c F V ( [ [ A ] ] ) ~ A and we obtain: 10.13. COROLLARY. MFp proves the consistency of OP and hence is proof-theoretically stronger than Peano Arithmetic. PROOF. Let Provop(X ) be the formalization of "x is the gn of a formula provable in OP". Then we apply P-NIND with X - {x" Nx A Y(ftr(x))} and we verify the formalized soundness theorem:
Vn(Provop(n)---,n~X ). The argument does not work in the subsystem with class N-induction only, because the predicate involved is strictly partial. After a glimpse into formal semantics, we illustrate the fixed point technique by lifting two well-known propositions of Recursion Theory to the present setting. Indeed, we can easily formalize a general form of Rice's theorem (see Rogers 1967, Fitting 1981), which is a useful tool to test the non-classhood of certain properties. 10.14. DEFINITION. We recall that x - e equality modulo 7/);
Y "-Vu(urlx~u~Y) (extensional
(i) b is eztensional iff, for every z, y, if x - e Y and yrlb, then xrlb. (ii) b c c "- (b C_ c) A~(cC_b); b is proper if b C V - {z" x - x}. For instance, {u: 3y(yqu)} is extensional; but C L = {x: Cl(z)} is not extensional (provably in MF-). In fact, recall that N - {x: Nx} is a class and clearly, if r is the Russell property of 9.3, b - {x: Nx V r r / r } - - a N . Were b a class, we should have Vu((Nu V r~r) V (-,gu A r~r)). Since r~r, rr/r are provably false, we should have Vu.Nu, against remark 3.9.2.
II.IOB]
Applications to Semantics and Recursion Theory
71
10.15. T H E O R E M ("Rice generalized";provable in MF-). If a is non-empty, extensional and proper, then there exists no class c such that c - e a. PROOF: by contradiction, assume that d is a class such that d - e a and choose b, c such that br/a and not cr/a. Then by 10.1 we can find a property I such that I - {x:(xr/b A - I r / d ) V (xr/c A/r/d)}; so, by classhood of d,
Vx(xr/I ~ (xr/b A -~Ir/d) V (xr/c A Ir/d)).
(1)
If Ir/a, then Ir/d and by ( 1 ) a n d consistency V x ( x r / I ~ x r / c A I r / d ) , i.e. I - e c, whence by extensionality, cr/a: contradiction. If-~Ir/a, then -~Ir/d and I - e b, whence Ir/a" contradiction! 0 10.15.1. APPLICATION {x" 3y(yr/x)}, { x ' c C_ x} (c is a class), cannot be made equiextensional to classes. The same holds for the property of being a finite property. Indeed, let f" k H b (k in N) mean that f is a bijection between {x" N x A x < k} and b, and assume that F I N - {b" 3 k 3 f ( f " k H b ) ) is a class. Then b is an element of FIN iff, for some k and f, f" k ~ b. Clearly, if c - e b holds, also f" k~--~c, i.e. cr/FIN. Hence, since FIN is non-empty, we must have V C_ FIN, which is absurd (N is not in FIN provably in MFc). We outline an extension of Myhill's theorem about recursive equivalence of creative sets (Rogers 1967). Being a creative property, again implies nonclasshood. We closely follow the proof, given by Fitting (1981). 10.16. DEFINITION. Let a U b "- {x:xr/a V xr/b}. Then: (i) b is creative iff 3fVa(a f3 b - e 0 ~ ~(fa)r/(b U a)). (ii) b is m-reducible to c (in short b < m e) iff 3fVx(xr/b ~ (fx)r/c). 10.16.1. Example: b - {x" xr/x} is creative. Indeed, choose f if a fq b - e 0, we get -~ar/(b U a).
Ax.x. Then,
10.17. T H E O R E M (MF-). b is creative iff every c is m-reducible to b. The proof is a consequence of two lemmata. 10.17.1. LEMMA. If b is creative and b <_ m c, then c is creative. PROOF. Assume, for some f,
(1) There exists an operation g, such that a n b - e 0--,-~(ga),(a U b). Choose h -
~x.f(g(tx)), where t x -
{u" (fu)~x}. The claim is that
(2)
72
Extending Operations with Reflective Truth
a I'1 c -- e 0--*-~((ha)rl(a U c)).
[Ch.2 (3)
First note that a N c - e 0 implies ( t a ) N b - e O (by (1)). Hence by (2), g(ta) does not belong to (re)U b, which implies by definition ~(ha)~(a U c). D 10.17.2. LEMMA We can define a term f such that, if y is in b, then f y = e ( g ( f y ) ) is no~ in b, then f y =cO"
and if y
PROOF. Define hey = {z: yrlb A x = gey}. By fixed point, choose f such that h f y = f y: hence w(~fy
~ v~b ^ 9 =
gfv).
n
P R O O F of 10.17. Assume that b is creative; for some g, we have cnb
- ~ 0 - ~ ~ ( g c ) ~ ( c u b).
(1)
It follows: c = ~ 0--,-,(gc)~b;
c = e {x} A -~xrlb --, ~gc = x.
(2.1) (2.2)
By 10.17.2, we find an operation f such that: uTlc---~ f u - e {g(fu)};
(3)
-~u~c ---*f u = e O.
It is immediate to check that c is m-reducible to b via h - A z . g ( f x) using (2)-(3). In the other direction, assume that every property is m-reducible to b" then {z: zrlz} < m b . Therefore b is creative by 10.16.1 (example) and 10.17.1.17 10.18. COROLLARY (provable in MF-) No creative property can be equieztensional to a class. PROOF: pick any property c not equiextensional to a class (such c exists by 9.3 or 10.15.1). Were b creative and equiextensional to some class b', we should have that c is extensionally equivalent to c ' = {x: (fx)~b'}, for some f. But c' is a class: contradiction. 13 Moreover, by Rice's theorem, the property of being creative does not define a class.
Non-Extensiona lity
II. 11]
73
w11. Non-extensionality The informal intuition behind the theory M F - and its extensions obviously suggests an interpretation of properties and classes, which is radically opposed to a world of extensional entities. We show that extensionality fails, already in a very weak fragment of MF-. It is impossible, in general, to identify arbitrary empty properties. 11.1 THEOREM. (Gilmore 1974) (i) We can produce terms t, s such that ( t intuitionistic logic with where A is T - p o s i t i v e .
(ii)
e s A-~t -- s) is provable in equality plus the schema V u ( u ~ { x " A } ~ A ( u ) ) ,
We can show in M F - that t and s are classes.
PROOF. Define: 9-
{z" x~x}
f y "-- {x" x -
~ A YrIX }
a "-- {u" f u -- f u n q)},
where, as usual, 0 "- { x ' - ~ x - x). We first verify fanO
-- e f a .
(1)
Trivially, urlf a N O implies u y f a. Let u ~ f a; then u - tc A a~lu , i.e. aya, whence aya, which yields f a N 0 -- f a , i.e. u ~ f a N 0, by - -logic. We now prove: - - , f a n 0 -- f a .
(2)
If f a n 0 - - f a , then a~la, i.e. a~/~, whence tc~lfa and by (1) ~7/0: contradiction! (1)-(2) complete the proof of (i). Ad(ii). f a n 0 is a class, because we have Vu(u-fffa n 0). As to the classhood of f a , if -~u - to, we trivially obtain: (u - ~ A arlu) V --,u -- ~ V a -~u,
i.e. by T.1 u~lfa V u-~fa. Assume u - ~; by (2), we have a~a, i.e. @ u , whence @ f a V urlfa. It follows that (ur/fa V @ f a ) holds for arbitrary u, i.e. C l ( f a). El
Gilmore's tricky empty classes are constructed via a detour through properties, which are not classes (like ~; see 10.16.1, 10.18). However, no essential use is made of the combinatory structure underlying the semantic structure. Gordeev found a quicker refutation of extensionality for classes; in his proof, the self-referential aspect is entirely absorbed by the fixed point for operations, and the argument has the advantage of being intrinsic (no
74
Extending Operations with Reflective Truth
[Ch.2
detour through properties) and acceptable in a fully constructive context. The informal idea is to consider the fixed point of the property "to be equal to the empty property"" 11.2. Gordeev's Paradox. MF-proves: 3 a ( C l ( a ) A a = {x: x = 0 A x = a} A a = eq} A - a = 0).
P R O O F . By 10.1 we can find a n f s u c h t h a t f = { u : u = 0 / ~ u = f } . By axiom T.1, f and 0 are classes. Moreover, f = e0: trivially 0 C f and u r l f implies u = 0 and u = f, i.e. ur/0 and f C_ 0. Now f = 0 yields fr/0, which is a contradiction. [:] 11.3. R E M A R K (i) 11.1-11.2 imply that there are very simple non-extensional operations on classes ; here we say that g" C L ~ C L is extensional if a - e b implies ga - e gb for every a, b C C L . For instance, if we choose g x - { z } - { u ' u x} and f as in the proof of 11.2, we have f - e 0, but --, {f} - e {0}" hence g is non-extensional. (ii)
11.2 can be generalized; indeed MF-proves Va(Cl(a)---, 3b(Cl(b) A ~a - b A a - e b)).
Hint (by Minari)" choose b - {x "(a - b A ~arla ) V (~a -- b A x~Ta)}. 11.1-11.3 do not completely settle the situation: for instance, remains to see whether it is consistent to assume: a - b---, a - b,
it (,)
where a - b " - a - e b A Vx (x~a ~-, x~b) and a, b are not classes. A straightforward modification of Gordeev's argument shows that ( , ) leads to inconsistencies. Choose ' E - - {z" --z - x V rr/r}, where r - {x" --xr/x} and G - {x "(x - E/~ x - G) V rr/r}. It is easy to verify that, in ME-: -
Cl(E) ^ E -
0^ -
Cl(a) ^ E - a ^
- a.
We don't know whether the non-uniform version of abstraction 3 y ( V u ( u q y C : ~ A ( u ) ) ) is consistent with extensionality for properties. Of course, it is possible to maintain extensionality for properties, as soon as a specific equality relation for properties is adopted. This suggests to extend the language with a new sort of variables, ranging over properties in extension, in order to distinguish properties as data types (or partial functions) from properties as f o r m a l constructs (or names); the interested reader can consult Js (1987), Marzetta (1993).
II. 11]
Non-Extensionality
75
11.4. On formalizing mathematical arguments Beginning with the work of Bishop (1967), it has been demonstrated that non-extensionality of the basic notions does not affect the formalization of mathematical practice. Since we always work within specific mathematical structures, we are simply required to make explicit the equality relation, which is appropriate to the structures in question. In other words, mathematical practice has to cope with different kinds of "equalities", which are simply congruence relations and have to be explicitly given: think of the introduction of "equality" in the different number systems or when a basic equality on a given domain U of urelements is lifted to the type structure, built upon U. Moreover, equality on a given structure may depend on the presentation of the structure itself; for instance, consider equality on Cauchy reals versus equality on Dedekind reals. The reader versed in foundational applications will find the philosophy of constructive and explicit mathematics appropriate here (see Bishop 1967, Feferman 1979, 1985, Beeson 1985). Accordingly, one has to consider not classes (or properties), but objects of the form ~4r- (W, - w ) , where - w is an equivalence relation on W. This also means that the notion of operation itself has to be specialized. If ~ - ( W , - w ) and ~ - ( U , - u ) are structures (of the same similarity type), a function f . ~r___,~ is an operation f" W ~ U, which "preserves equality"" x, y are in W and x - w Y
::~fx - u f Y "
Incidentally, we recall that, according to the views of Poincar~ (1913, p.133), a class is well-defined not only if it is predicatively defined, but also if it is possible to produce a predicative definition of the equality on elements of that class. As usual in the constructive practice, the power set operation z2(~r) can be replaced by the function space 2 ~r (see w Of course, the classical step from a structure ~ to its quotient ~47"/E, modulo a given congruence relation, cannot be carried out: if two elements x, y of W are E-equivalent, it is not true in general that the corresponding equivalence classes [X]E, [Y]E are equal (in the sense of ground equality). At any rate, one can use equivalence classes as "contextually eliminable symbols"; one should also not forget that, in axiomatic set theory, the definition of Ix] requires some trickery. To conclude, let us recall that the present framework and its extension look promising for the treatment of categorial concepts; some hints may be found in Feferman (1977a) (although the theory is somewhat different), and interesting developments are due to Gilmore (1990).
76
Extending Operations with Reflective Truth
[Ch.2
Appendix I" a property theoretic definition of the f'Lxed point operator for predicates In w we discussed a fixed point theorem for predicates which heavily relies on the full definitional strength of combinatory logic. It may be of interest to observe that the essence of the construction can be recovered under much weaker conditions. 1. DEFINITION. Let A(z,y) be a formula with the free variables shown. We define:
D(A) := {(x, f ) : A(x, {u: (u, f)rlf })}; V(A) := {z: (z,D(A))qD(A)}. The definition of V(A) is essentially in Visser (1989, pp. 695-96), though in semantical context (77 being replaced by a satisfaction predicate). The verification of the following lemma is straightforward: 2. LEMMA ("Second diagonalizalion'). (i) /f A(x,y) is an arbitrary L-formula with the free variables shown
only, then we can find a term V(A), not containing the paradoxical combinator FP, such that MF-proves: Vz(xT} V(A) r A(z, V(A))). (ii) If A is T-posilive, r
can be replaced by ,-,.
We underline that V(A) can be used in place of I ( A ) i n all the relevant applications of this book. This is important when we wish 1o weaken lhe operational basis of the theory and to avoid full combinatory logic. In fact, the lemma suggests the consideration of a pure properly theory PT, based on the following language: (i) three binary predicates - ,
77, ~ and a unary predicate T;
(ii) three function symbols for pairing function (-,-) and left and right projection ()1, ()2; (iii) the operators [] and { }. Terms and formulas of PT are defined by simultaneous induction: variables are terms; if t,s are terms, t - s , trls, t~s, Tt are formulas; if A is a formula, [A] and {z: A} are terms (the free variables of [A] are exactly the free variables of A; the free variables of {z: A} are exactly the free variables of A minus z); if A and B are formulas, -~A, A A B, VzA are formulas; if t, s are terms, then (t,s) and (t)l , (t)2 are terms. We again use T A as an
Appendix !
II.A.1]
77
abbreviation for T[A]. 3. DEFINITION. P T is the theory based on classical first-order logic with identity, which contains the following axioms and schemata: AP:
Vx(xrl{u" A} ~ TA[u "- x]) A Vx(x~{u" A} ~ T-~A[u "- x]);
T.1.
T A H A , if A - (x - y), Nx, ~(x - y), ~Nx, x~?y, x~y;
T.2.1.
TTA~TA;
T.3.
T-~-~A ~ TA;
T.4.1.
T.2.2.
T-~TA~T-~A;
T(A A B ) ~ T A A TB;
T.4.2.
T-~(A A B ) H T-~A V T-~B;
T.5.1.
TVxA H VxTA;
T.5.2.
T~VxAH3xT~A;
CONS
~ ( T A A T-~A);
SYM
(x~y ~ T-~(xOy)) A (x~y ~ T--,(xrly));
PAIR
VxVy(((x, Y))I
- x A ((x, Y))2 -- Y)"
Clearly P T can be interpreted into MF- and considered as a fragment of MF-. By inspection, D(A) and V ( A ) c a n be regarded as PT-terms and hence we have: 4. P R O P O S I T I O N . The second diagonalizalion lemma holds for FT. Of course, we can expand P T with the notion of natural number, some sort of number-theoretic induction schema and axioms for successor, zero, plus, times and additional number-theoretic operations. The resulting theory would have a non-trivial mathematical content; yet, in comparison with M F - and its extension, P T has models in which - is decidable and is compatible with the axiom that everything is a number. Thus it could be a basis for applicative refinements of the theory of abstraction (cf. Ch. XIV).
Appendix II- on the explicit abstraction theorem We give details for the proof of the explicit abstraction theorem 9.13; then we conclude with a few comments about the applications of explicit abstraction and related problems. 1. LEMMA (Combinatorial operators)
We can define ELF-terms Prod(a, b), V, Y n, Sap, Sap-, RE(n, k, a) (for l < n,k), LE(n,k,a), (for l < n, l < k< 3), Ins(k,i,a) (for l < k, i e {2,3}), which satisfy, provably in MF-:
78
1.1.
Extending Operations with Reflective Truth
Vu(uT1Prod(a , b)~-~ 3x3y(u = (x, y) A xqa A yr/b));
W(u V" 1.2
[Ch.2
3x1...
=
V u ( u q S e p ( a ) ~ 3 x 3 y 3 z ( u = (x, y, z) A (x, (y, z))r/a));
Vu(urlSep-(a ) ~-, 3x3y3z(u = (x, (y, z)) A (x, y, z)qa)). 1.3. Expansion to the right:
Vu(urlRE(n, k, a ) +--, +--+3 X l . . . ~ x n ~ Y l . . . ~ y k ( t t
-- ( X l , . . . , X n ,
Yl,...,yk)
A (Xl,...,Xn)r]a)).
1.4. Expansion to the left:
Vu(urlnE(n, k, a) ~-*
+-~3Xl""" 3 X n 3 Y l " " 3Yk(U -- ( Y l " " " Yk' X l " " " xn) A (Xl, . . . , xn)r]a)). 1.5. k-Insertion:
Vu(urlIns(k, 3, a)~-, 3X3Xl...3xk3Y3Z(U = (X, X l , . . . , x k , Y,Z ) A (x,y,z)rla)); Vu(urlIns(k, 2, a ) ~-. 3X3Xl. . . 3xk3Y(U = (X, Xl, . . . , xk, y ) A (x, y)rla)). P R O O F . 1.1. Choose:
Prod(a, b) - C o n v ( E x p ( a ) ) N Exp(b); Y - dom(nD), Y k+l - P r o d ( Y k, Y). 1.2. Choose S e p ( a ) = Cyc2(Conv(a))
Cyc2(t) = Cyc(Cy
and S e p - ( a ) = C o n y ( e y e ( a ) ) ,
where
(t)).
1.3: by iteration of R E ( n , 1, a) = C o n v ( E x p ( a N Vn)). 1.4: we inductively define
F(1, a) = Exp(a); F(2, a) = Sep(Exp(a)); F(n+3, a ) - S e p ( F ( n + 2 , Sep-(a))). Then we verify by induction on n:
urlF(n , a) ~ 3v3x1. . . 3Xn(U = (v, Xl , . . . , Xn> A (Xl,... , Xn)rla ). Finally choose LE(n, k, a) - V k+n N F(n, a). 1.5: let
G(a)-
Sep(Cyc2(Sep(Exp(Cyc(a))))).
Then we recursively define:
Ins(1,3, a) = G(a); I n s ( k + l , 3 , a) = G ( I n s ( k , 3 , a)). The case of 2-insertion is similar. 0
We can find ELF-predicates -~n(i), such that:
2. L E M M A .
~ee.(i, j, k), QD.(i, j), N.(i),
Appendix II
II.A.2] 2.1
l~ppn(i,j,k )
2.2
~Dn(i,j )
-
2.3
Nn(i ) -
{(Xl,...,Xn).Nxi};
-
{(Xl,...,Xn).
x i -
79
xjxk};
{(Xl,...,Xn)" x i - xj};
2.4 -[n(i) - { ( x l , . . . , x n ) " Txi}; (all the variables are distinct and 1 <_ i, j, k <_ n; in 2.1, 3 <_ n and in 2.2, 2_n). PROOF. 2.1" we proceed by induction on n___3. If n - 3, NPPn(i, j, k) is obviously obtained from /~PP by permutation and hence Cyc and T r a n s suffice. If n > 3, let u, v, w denote distinct variables in the set {xi, xj, xk}. Case a)" u, v, w already occur in the list Xl,...,Xn_l; then we apply the induction hypothesis and expansion to the right. Case b): u - Xn, but v, w r {Xn_l}. It is enough to observe that IH applies to T r a n s { ( x l , . . . , X n ) : x i - x j x k } . Case c)" v - xn, w - Xn_ 1. Apply left expansion and possibly insertion to /~PP, whenever u r Xn_ 2. The proof of 2 . 2 - 2.4 are similar. ['1 3. LEMMA. Let r be a term of s For every n, i, such that 1 < i ~ n, and x i not occurring in r, we can effectively find an elementary term ~r~n(r) with the free variables of r except X l , . . . , X n , such that, provably in MF-: {(Xl,...,Xn)"
X i -- r} -- gin(r ) .
PROOF. Induction on r. If r is a constant or a variable v q~ { x l , . . . , X n } , we apply right and left expansions to the singleton {r}. If r is a variable v C {Xx,...,Xn}, by assumption v - x k with k r and hence lemma 2.2 applies. If r - rlr2, we use IH, dom, n and lamina 2.1. E!
Remarks and problems (a) The collection ELP (see 9 . 1 1 ) o f elementary terms is well behaved with respect to substitution (if t(y) is elementary, z ~ {y}, z free for y in t, then t[y : - z ] is elementary), and renaming of bound variables; this should be contrasted with the collection of elementary formulas. By the theorem 9.13(ii) we can avoid the syntactical notion of elementary formula in defining { x ' A } , if A is elementary in y. (b) Add a new unary predicate E C l ( x ) " - " x is an explicit class" to the language of M F - with the axioms: 1) E C l contains DD, /~PP, N; 2) E C l is closed under the combinatorial and basic operators of 9.11; 3) E C l is closed under join; 4) E C l is the C_-least such property (i.e. the schema saying
80
Extending Operations with Reflective Truth
[Ch.2
that any "externally definable" property with the same closure conditions of E e l , contains E e l ) . Note that 4)immediately implies Vx(ECl(x)---, C l ( x ) ) .
Call the resulting extension of MF- (MFc, etc.) EMF- (EMFc, etc.). Show that all these extensions are consistent with the construction principle CP" 3y(ECl(y) ^ 9
-
CP can be regarded as a sort of abstract Suslin-Kleene theorem (Moschovakis 1974). Prove that EMFc+CP is a conservative extension of MF c and hence of OP. (c)
Consider the language s
expanded with the new unary predicate
C1, the binary relation E, and f~PP, ~D, N, singleton { - } , - , f 3 , dora, T r a n s , Cony, Cyc, E x p and E (all regarded as primitive individual
constants). Let if be the first-order extension of OP in the modified language, which includes, besides the number-theoretic induction schema, finitely many axioms, stating that: 1) C1 contains g~PP, nD, N; 2) Cl is closed under singleton, complement, domain, intersection, transpose, cycle, converse, expansion and join, and it satisfies the intended equivalences for each of the given operations (e.g. for E x p we require: Cl(a)----~Cl(Exp(a)) A V x ( x E Exp(a)~---~3y3z((y,z) - x A z~Ta)).
Then ~f is a possible reformulation of Feferman's system for explicit mathematics E M 0 + J + "every operation is total" (Feferman 1979), in a language, which avoids the use of countably many constants.
Appendix HI" independence of truth predicates from the encoding of the logical operators The notion of truth we introduced and axiomatized in w clearly involves the use of the special terms I D "- )~xy.(1,(x,y));
T R "- ~x.(2, x); N A T "- ~x.(3, x);
(1)
N E G "- Ax.(4, x); A N D "- )~xy.(5, (x, y)); A L L "- Ax.(6, x);
they represent the basic predicates and logical operations in 2.op. However, this choice is immaterial for the development of the theory MF-. This fact can be seen as follows. We choose an expansion 2.+ of the basic language s in which ID, TR, N A T , N E G , A N D , A L L are new primitive individual constants. The new constants are supposed to satisfy the set LOG of finitely many axioms, obviously suggested by 7.1.1: LOG1
L l x - L2Y --+ L 1 - L 2 A x - y,
where Li, L 2 E L O G 1 - { N A T , N E G , T k , ALL};
II.A.3] LOG2
Append& Ill
81
GlXy - G2x'y' ---,. G 1 - G 2 A x - x' A y -- y',
where G1, G 2 E LOG 2 - {ID, AND}; LOG3
--1 L l X - L2Yz , for L 1 E LOG 1, L 2 E LOG2;
LOG4
-- L 1 - L2, where L1, L 2 are distinct elements of LOG 1 (.J LOG 2.
Now let MFL- be the theory which is obtained from MF-: 1) by replacing the terms ID, N A T , T R , N E G , A N D , A L L with L+primitive constants ID, N A T , T R , N E G , A N D , ALL (respectively)in the truth axioms T.1-T.6 of theorem 7.10; 2) by adding the axioms LOG. The reader can check that, if the axioms LOG are assumed, all theoretical developments of part A through part C can be carried out without difficulty in MFL-. PROPOSITION ("Change-of-basis") 1.1. We can define a term ~+x and a map A ~ ( A ) + from the set of Lformulas into the set of L+-formulas such that: (i) (A)+ is obtained from A by replacing every subformula of the form Tt with T(O+t), and hence (A)+ - A if A does not contain T; (ii) if MF- F- A, then MFL-F-(A)+ (A arbitrary). 1.2. Conversely, we can define a map A ~ ( A ) _ from the set of L+-formulas into the set of L-formulas such that: (i) if MFL- F- A, then MF- F- (A)_ ( A arbitrary); (ii) A - (A)_ if A is an L-formula. PROOF. Ad 1.1. By applying the fixed point theorem 2.3 and definition by cases on N, we can find a term (I)+, which satisfies the following recursive conditions" O_l_X- ID((x)2)l((X)2)2 if (X)l --]-;
O + x - T k ( O + ( ( x ) 2 ) ) i f (x)l - 2 ; O+x - N A T ( ( x ) 2 ) if (X)l - 3; (b+x - NEG(r
if (X)l - 4 ;
O+x - AND(O+((z)2)I)(r
) if (Z)a - 5;
O + x - ALL(~u.O+(((z)2)u)) if (X)l - 6 .
82
Extending Operations with Reflective Truth
[Ch.2
Then we define A~A+ by induction on A: (i) (Nt)+ - Nt and ( t - s)+ - ( t - s); (Tt)+ - T(cI,+t); (ii) (~A)+ - -~(A+); (A A C)+ - A+ A C+; (VxA)+ - Vx(A+). The claim is checked by a straightforward induction on the length on the derivation of A. Ad 1.2. (A)_ is obtained from A by replacing the constants ID, T/~, NAT, NE(~, AND, ALL with the corresponding terms ID, NAT, TR,
NEG, AND, ALL. gl A second route for ensuring the independence of the truth theory on the choice in (1) is (roughly) suggested by the analogy with recursion theory and acceptable Gbdel numberings (see Rogers 1967, Odifreddi 1989). One might introduce a notion of acceptable logical basis and show that the truth theories do not depend on the choice of a particular basis.
PART B
TRUTH AND RECURSION THEORY
"Niemand kann eine unendliche Menge anders beschreiben als dutch A ngabe von Eigenschaflen, welche fiLr die Elemente der Menge charakteristisch sind; niemand eine Zuordnung zwischen unendlich vielen Dingen stiffen ohne Angabe eines Gesetzes, d.h. eine Relation, welche die zugeordneten Gegenstande miteinander verkn~pft." (H.Weyl 1918).
This Page Intentionally Left Blank
CHAPTER 3
INDUCTIVE MODELS AND DEFINABILITY THEORY w w w w
Inductive models and the induction theorem The envelope of an inductive model The uniform ordinal comparison theorem for inductive models Applications of the uniform ordinal comparison theorem
We know from w that the minimal fixed points of a simple monotone operator yield natural set-theoretic models of MF-, the so-called inductive models. On the other hand, there exists a close relation between inductive models and elementary inductive definability on combinatory algebras: not only inductive definitions are crucial for the semantics of reflective truth, but the language of reflective truth offers a natural framework for an intensional approach to non trivial recursion-theoretic facts. The two-sided link with generalized recursion theory is first illustrated by the equivalence theorems of this chapter. First of all, the fixed points of elementary inductive definitions in the sense of Moschovakis (1974) are naturally represented by terms of our language, as soon as we work within inductive models (w167 Second and more important, we can prove in w a uniform ordinal comparison theorem for inductive models, which readily implies that total predicates on a given model . ~ of O P - ( = OP without N-induction) coincide with the collection of hyperelementary subsets of 31~ (w The recursion-theoretic investigations naturally lead to an extension of the basic system M F - with simple axioms on a suitable approximation operator 7r; 7r uniformly splits each non-empty property into a C_-chain of subclasses, satisfying certain simple compatibility and well-foundedness conditions. The 1r-axioms are still conservative, even in presence of a full generalized induction schema, as far as number-theoretic induction holds for total predicates only (see the general conservation theorem of 15.5). We shall see that ~r-axioms are quite effective for obtaining consequences, that usually require ordinal-theoretic arguments. In a sense, this is not surprising: 7r-axioms are directly responsible for interpreting fragments of set theory in Ch.V.
86 w
Inductive Models and Definability Theory
[Ch.3
Inductive models and the induction theorem
Ah is a fixed model of O P-, whose universe is the set M. As in Ch.II, s (.~op(J~)) denotes the language of MF (of OP without the truth predicate T respectively) with distinct individual constants, for each element of M. For the sake of simplicity, we stick to the notations and conventions of w If I' is the monotone operator of w O(At,) is the C_-least fixed point, which is generated from below by transfinite iteration of I'" (i) O(.AI~,O) - O; (ii) O ( . A ~ , a + l ) - F(O(dll~,a)); (iii) O(dtb, A)-a ~ ,xO(ylb'a) (~ limit). Once dtb is fixed or clear from the context, we set 0 " - O ( d l ~ ) and O(a) :-O(Ml~,a). If S C_ M, we identify (31,,S) with S; thus we simply write SI= A instead of (MI~,S)I= A. As usual, if tin a closed term of s .Al~(t) is the unique value of t in Eft,. 12.1. LEMMA. If A is an arbitrary sentence of s
(,)
O ( a + l ) [= T A implies O(a)l= A, for every a.
PROOF. It is enough to check (,), by induction on the logical complexity of A. The case where A is an e-atom is trivial. If A =--,Tt, we have, by assumption and the inversion lemma 7.4(ii)-(iii), Al~(-~t)E O(a), whence Jtt~(t) ~ O(a) by consistency, i.e. O(a)l=-~Tt. Let A = B A G . Again by assumption and inversion, we have Mb([B]), Mh([C]) E O(a) C_ O(a + 1), which implies O(a + 1)[=TB and O(a + 1)[=TC, whence we conclude by IH O(a)[= B A C. The remaining cases are similar. Vi 12.2. (i) Below we need to consider the expansion of s by a new unary predicate symbol; we put s 1 6 3 (P unary predicate symbol distinct from T). Then a realization of s over Jft, is given by any pair ($1,$2) of subsets C_M: it is understood that S 1 is the interpretation of T, while S 2 is the interpretation of P. (ii) Let A(x,P) be any formula of s if B ( x ) i s a formula of s A ( x , B ) i s the s obtained by replacing each occurrence of Pt in A with B[x " - t ] (we assume that the substitution is legitimate). Then, if S C_ M, we obviously have (induction on A)" 12.2.1. FACT (i) If A(x,P) is a formula of s
P) with the free variables shown, lhen (S, {a" a E M and SI= B(a)})l= A(a, P) iff S]= A(a, B).
(ii) If A(x,v) is an operalor (in the variable v) of s
10.3.1),
III.12]
Inductive Models and the Induction Theorem
87
and A(x,P) is the s obtained from A(x, v) by replacing each subformula of the form trlv with Pt, then A(x,P) is positive in P and T (i.e. its negation normal form contains an even number of negations in / ont of atom of fo m Tt, Pt). Co,v ly of which is positive in T and Q, determines an operator A(x,v) of s obtained by replacing Pt with toy (v being a fresh variable). Clearly if A(x, v)is an operator and B(x)is a formula, it is natural to write A(x,B) also for the result of replacing each occurrence of "tTlv" by B(t). 12.3. DEFINITION (i) If B(x)is a formula of s
and A(x, v)is an operator of s
ClosA(B ) "- Vx(A(x, B) ~ B(x)) ( - "B is A-closed"); (ii) If B ( x ) - xrIb, we simply write ClosA(b)(- "b is A-closed"). 12.4. THEOREM (Generalized induction). If A(x,v) s and I(A) is the fixed point term of 10.1, lhen
is an operator of
01= ClosA(B ) implies O1= Vx(xqI(A)~ B(x)). PROOF. Assume Ol=ClosA(B ). We verify by transfinite induction on a" for every a e ~ , O ( a ) I = a r i I ( A ) i m p l i e s Ol=B(a ).
(1)
If a = 0 or a is a limit, (1) is trivially true. Let (1) hold for a, and assume that O(a + 1)r=aqI(A), i.e by (/?)-conversion, O(a + 1)I=TA(a,I(A)). But Lemma 12.1 implies O(a)l= A(a,I(A)); if P is a new predicate symbol and we set I ( A , a ) := {a: a C ~1~ and O(a)l=a~I(A)} , we obtain by 12.2.1"
(O(a), I(A, a)) ]= A(a, P). By IH, since A depends positively upon the interpretations of T and P, (O, {a: C 31o and O I=B(a)})I=A(a,P);
0 I=A(a,B)(by 12.2.1); hence, by A-closure of B, O [= B(a). [7 12.4.1. GID ( = generalized inductive definition) is the schema:
ClosA(B ) ~ Vx(xqI(A)-~ B(x)), where B is an arbitrary formula of s and A(x, v) is an operator of 2..
88
[Ch.3
Inductive Models and Definability Theory
Theorem 12.4 and 7.10 imply: 12.5. COROLLARY. MF + GID is consistent.
w
The envelope of an inductive model
We fix a structure ./~ with universe M, which is a model of OP-. If S C_ M, each closed term t of s naturally defines a subset of M in the structure (dtt, S), namely the set:
t(S) "- {a" a E M and S[=arlt}.
13.1 If X C_ M and X -
t(S), for some closed term t of s
we say that X is
representable in (31~,SI (or simply in S), and we put" 13.2.
ENV(At~,S)"- {X" X C_M and X is representable in (31~,S/}.
Trivially S E E N V ( ~ , S ) . We call ENV(.AI,, S) the envelope of (.AI,,S); as usual, once ~ is clear, we simply neglect its explicit mention and we speak of the envelope of a given S C_ M. The envelope of O(.A~) has a natural characterization in terms of elementary inductive definability in the sense of Moschovakis (1974). The argument is the recursion-theoretic pendant of the generalized induction theorem 12.4. We give the basic definitions, suitably adapted to the present context. 13.3. DEFINITION (i) If P is a predicate symbol distinct from T and A ( u , P ) i s a formula of s which only contains the free variables shown, A(u,P) is positive elementary (in P) iff A belongs to the smallest class of s which includes formulas of the form t - s, Nt, -,t - s, -,Nt, Pt, and is closed under A, V and Qx (Q - 3, V). (ii) If A ( u , P ) i s positive elementary in P, then A(u,P) defines a monotone operator r A 99 ( M ) - , 9(M) ( 9 ( M ) - power set of M), namely, if S C_ M and we interpret P by S, FA(S ) "- {a'a E M and (.Ate, S)[= A(a,P)}. For simplicity, it is convenient to call A(u,P) itself an elementary positive operator on dtt~ (thus identifying the formula with the operator it defines). (iii) We write I A for the smallest fixed point of F A (in short, the fixed point of the given operator; so I A satisfies FA(I A)-C_ I A and I A C_X, whenever FA(X ) C_ X). (iv) A set X C_ M is inductive on ~
iff there are a positive elementary
III.13]
89
The Envelope of an Inductive Model
operator A and an element f of M such that, for every a E M , (f "M a) E I A ( ' M is the application operation of Jtl~). (v) I N D ( 2 ~ ) ' -
aEX
iff
the collection of sets C_ M, which are inductive on dtl,.
(vi) X C_ M is coinductive on M1, i f f - X ( - the complement of X in M) is inductive on Jtl~. (vii) X C_ M is hyperelementary on ~ iff X is both inductive and coinductive on Jtt~. (viii)
HYP(JtI~)'- the collection of subsets C_ M, hyperelementary on ~ .
13.4. THEOREM. Let ag be a model of OP-. Then:
(i)
ENV(O(31~))-IND(~);
(ii)
O(Jtt~) E IND(31,)- HYP(31,).
PROOF. (i) IND(31~)C_ E N V ( O ( ~ ) ) . It clearly suffices to check that, if A(u,P) is an arbitrary positive elementary operator on dtl,, then I A is representable in O(Mt~). Consider the operator A(u,v) in the language s obtained from A(u,P) according to 12.2.1 (ii) (v fresh variable). Now O(dtl~) is a model of M F - (by 7.10) and M F - p r o v e s by 10.4 that there is an abstract I ( A ) = IxvA(x, v)such that: O(all,) ]= Vx(xr/I(A) ~ A(x, I(A))).
(1)
Hence, if we let I(A)(O(.Ytt,))'-I (recall the notation of 13.1), and we notice that the only T-atoms occurring in A(x,I(A)) have the form tTlI(A ) by assumption on A, we get by 12.2.1 (i), O(all,)[= A(a, I(A)) iff (0, I)l = A(a, P),
(2)
which implies by (1),
rA(I)-I.
(3)
By minimality of IA, I A C_I. Conversely, it is straightforward to check, by induction on a with 12.1-12.2"
O(a)l-ar/I(A ) implies a E I A (for a E M).
(4)
Thus I C_I A and I A - I; hence I E ENV(O(all,)). In order to complete the proof of the theorem, we show"
ENY(O(ag)) C_IND(all,). If X- t(O(all,)), for some closed term t of 2,(all,) and f have, for every a E M:
alg(t)E M, we
90
Inductive Models and Definability Theory
[Ch.3
a E X iff O(-~)l--a~t iff ( f . M a) G O(Jtt~). Hence X is inductive on RAt,, since O(atl~) is the fixed point of the positive elementary operator r(u, P ) o f section 7.3 (v). (ii) If M - 0(31,) E IND(31~), {a E M:O(Ml~)l=-,arla}={a E M: O(31~)]=a~t}, for some closed term t, and we can derive a contradiction ~ la Russell. V! 13.5. DEFINITION. Let S C M: (i) S E C ( S ) " - {X" X C_31~ and X - t(S), for some closed term t of s such that S[=Cl(t)} ( - " the section of S"); (-
(ii) S E C + ( S ) " - {X" X C_M and X , - X "the +-section of S").
E ENV(S)}
We immediately obtain, with theorem 13.4: 13.6. LEMMA
If S is consistent and S E FIX(F, Jtt,) (cf. 7.5), SEC(S)C_ SEC+(S) and SEC+(S) C ENV(S). In particular, SEC+(O(Jlg))- HYP(Mg). From the ordinal comparison theorem of the next section, it will follow that We conclude with a prooftheoretic application of 13.4-13.6: as far as we restrict number-theoretic induction to total predicates, i.e. classes, we obtain a theory of abstraction and truth, whose arithmetical content does not exceed that of OP, and hence of Peano arithmetic, even if we add the generalized induction principle of w
SEC+(O(Jtl~))-SEC(O(JIg))-HYP(~).
13.7. THEOREM. MF c -F GID is a conservative extension of OP, i.e. if A is a formula of s and MF c + GID F- A, then OP ~- A. (For the definition of MFc, see 10.7; as to GID, see 12.4.1). PROOF. The argument uses well-known results from general model theory: (i) every structure Ml~ for a given elementary language ,Lop(.J~ ) h a s a n elementary extension, which is recursively saturated (see Chang-Keisler 19903); (ii) if Nl, is recursively saturated, HYP(Jtl~)-DEF(JtI~)(here X E DEF(31~) iff X - {a'a E M and att~[= B(a)}, for some B(x) of .~,op(~l~) (see Barwise 1975, Barwise-Schlipf 1975). In order to prove the theorem, we assume that dlt is a model of OP + A (A sentence of .Lop(dig)). By 7.10, 12.4, O(Ytt,)is a model of M F - + GID + A, plus N-induction for s Assume:
O(~)I=Cl(t ) A Vx(x~t ~ ( x + 1)r/t)A 0r/t and X - t(O(Mg)); then, by lemma 13.6, X E HYP(Jt[~). By (i), it is not restrictive to suppose
III.14]
The Uniform Ordinal Comparison Theorem
91
that ~ is recursively saturated; so by (iN) X E D E F ( ~ ) . By hypothesis on t and N-induction for Lop(Ml~)-conditions , we have O(~4i~)]=Vx(ix-~ xrlt ). In conclusion, O(~t,)]= MF c + GID + A. F1 Similar results hold if we add the enumeration axiom EA of w or extensionality for operations Ext op, and we replace class N-induction by the weaker 3(+)-N-induction of 4.13. Let: MF1 := M F - + 3(+)-NIND. Then by 4.15 and the appendix to Ch. I, we immediately have: 13.8. THEOREM. Let Ax be either EA or Ext op. (i) If f is a combinator such that MF c + GID + Ax F- f " N ~ N, then f defines a number-theoretic function, which is still provably recursive in Peano arithmetic. (ii) If f is a combinator such that MF 1 A- GID + Ax F- f " N ~ N, then f defines a primitive recursive function. We do not know what happens if both EA and Extop are present; perhaps, it might be useful to check that CTM(w) (cf. w is a model of OP + Ext op + EA, provably in (some conservative extension of) MF c + GID.
w
The uniform ordinal comparison theorem for inductive models
We further investigate the recursion-theoretic structure of O ( ~ ) model of OP-), in order to prove, in the notation of w HYP(~I~) - S E C + ( O ( ~ ) ) -
SEC(O(~I~)).
(.Ab fixed
(,)
The main result of this section, from which (,) easily follows, is the extension to O(31~) of a fundamental theorem, originally stated for Kleene's recursion in higher types by R. Gaudy (see Hinman 1978). Let b E M: since O(.At~) is inductively generated by the operator F of 7.3, we apply backwards to b the reductive clauses which specify F, just as in the standard generation of a semantic tableau. Except for the trivial case where no F-clause is applicable, the reductive procedure produces a "search tree" T(b): r(b) starts with a "root" (labeled by) b and v ( b ) i s well founded (in the usual sense) iff b C O(.At~), i.e. O(.A~)I=Tb. Therefore we can naturally associate to b an ordinal, called I b I, whenever O(.At~)l= Tb: it is the rank of the "direct" (cut-free) proof of Tb. The remarkable fact is that if O(.AI~)I=Ta or O ( ~ ) 1 = Tb, then the ordering relation between l a I and I bl is representable in O(3t~): this is the key property for obtaining (,) and selection, reduction and separation principles for ENV(O(.A~)).
92
Inductive Models and Definability Theory
[Ch.3
14.1. Preliminary notions and conventions. (i)
E(z) := 3 z 3 y ( ( - , P F O R ( z ) A z = (-,x)) V z = [Nz] V z = [-,Nz] V v z = [~ = y] v z = [ ~ ( ~ = y)]); S(z) := 3x(z = [-,--z] V z = [Tx] V z = [-,Tz]); ~ ( z ) := 3~3y(z = ~ ( w ) v H(z) := 3~3y(z = ( w ) v
z = ~(~ ^ ~)); z = (~ ^ y));
(for the definition of P F O R ( z ) : = "z is a p-form", cf. 7.3). (ii)
If b E M,
we say that
b is in E - f o r m (in S-, E-, H - f o r m ) i f f
3(6 I- E(b) (Jli~l= S(b), E(b), II(b)respectively). (iii) According to 7.3, if b, c E M, we adopt the abbreviations be, -,b, Vb, b A c, instead of the proper Jt6(Ap(bc)), .)/b(NEGb), 2~(ALLb), ~6(ANDbc) (respectively); furthermore, id(b,c), nat(b), t r ( b ) s t a n d for Jll~([b=c]), ~l~([gb], .Al~([Tb])(in the given order). (iv)
We stipulate that
b<
forb, c E M i f f
either c - Vd and b - da, for some a E M, or c = -,(Vd) and b - -,(de), for some a E M, or c = (e A f ) and b = e or b = f, or c =--,(e A f ) and b = -,e or b = - ' S , or c = tr(d) and b - d, or c = -,(tr(d)) and b = -,d, or c = -,-,d and b = d.
(v)
If c = - , - , d , t r ( d ) , - ~ t , ( d ) ,
we put
PRD(c) = d = " t h e unique b << c". (vi)
If b << c holds, we say that b is a predecessor of c.
Obviously, there is a formula B(z,y) of ,Lop which defines <<, uniformly in every model of O P - . 14.2. D E F I N I T I O N (i) Let 8+ be the successor cardinal of ~ (8 being the cardinal of M). If b E M and b ~ O(Jtt,), we put: I bl " - a + . (ii) Assume b E O(J16); then we define (by induction on the generation of O(Jlt~)): if b is in E-form, I bl - 0; if b is in S-form, I bl = IPRD(b) I + 1; if b is in H-form, I bl = s u p { I c I + 1: c E M and c << b};
The Uniform Ordinal Comparison Theorem
III.14]
if b is in E-form, (iii)
I bl
93
- i n f { ] c I + 1" c E M and c << b}.
Icl);
b<_c'-(bEO(J~)and
]b] _<
b
]b I < I v ] ) .
Obviously, c < b iff c E O(.flt,) and not ( b < c). I bl is called the norm of b. It is straightforward to verify, by definition of norm and O ( ~ ) : 14.2.1. <,
]b I < 5 + iff b E O(~t,).
< are well-founded relations on Eft, and we have, for every b, c E M:
14.2.2.
b < c iff b E O(~t,) and (if c E O(.At,), ]b I < ]c ]); b < c iff b E O(~t~) and (if c E O ( ~ ) ,
I bl
< I c I).
14.2.3. LEMMA (i) The predicates E, S, E, II are pairwise disjoint: if W r V and W, V E {E, H, E, S}, then for every b E M, r ~(W(b) A V(b)). (ii)
For every b E M, ~ [ = (PFOR(b) A-~E(b)) ~ (S(b) V II(b) V E(b)).
PROOF: apply 7.1.1 and the definition of the logical combinators before 7.1.[3
14.2.4. LEMMA. Let b, c E M and assume
.AhI= E(b) V E(c) V--,PFOR(b) V ~PFOR(c). Then: b < c iff O(.Ab)]= Tb A (E(b) V (Fc A E(c)) V --,PFOR(c)); c < b iff O(~1~)I= Tc A F(Tb A (E(b) V (Fc A E(c)) V -~PFOR(c))).
(1) (2)
P R O O F . The restriction axioms R E S , T.1 and T.3 of 7.10 easily imply, for every d E M"
O(.Ah)I- E(d) A -~Td ~ Fd.
(,)
Ad (1). Assume b _< c. Then O(ait,)l--Tb and hence b is in p-form. If b is an E-form or c is not in p-form, then the right hand side of (1) holds trivially. Else, c is in E-form and b is not in E-form and we must have I bl > 0, whence [c I > 0, which implies O(a?b)l=-~Tc (by 14.2 (ii)), i.e. O(all,)l= Fc with (.). Assume the right hand side of (1). Then clearly b E O(dtl~) and b must be in p-form by R E S . If b is in E-form, [b[ - 0 and trivially b < c. If
94
Inductive Models and Definability Theory
[Ch.3
c is in E-form and O(~)l-Fc, o r c is not in p-form, then c ~ O(Jll~) by consistency of O(~1~): hence b __ c (by 14.2.2). Ad (2)" similar argument, using the assumption from right to left. [3 14.3. T H E O R E M (Uniform Ordinal Comparison). There exists an operator G(u, v) in lhe language 2., such thai if.At, i= OP-, then for every b, c E M:
b <_e iff O(.At~)I= (b, c)rlI(a); c < b iff c G O(Jft~) and O(.At,)I = (b,c)-OI(G).
(,) (**)
(I(G) - the fixed point predicate of 10.4) PROOF. We describe a set of inference rules for deriving statements of the form b _< c. In each rule, the conclusion will depend positively on b'_< c', where b', c' are immediate predecessors of b, c in the sense of <<. G(u,x) will be easily assembled by formalizing the _<-rules. (,)-(**) are verified by transfinite induction.
Initial Rules. These rules handle the cases where b, c E M and Jtt~l= E(b) V E(c) V-~PFOR(b) V-~PFOR(c).
(1)
b E O ( ~ ) , b is in E-form b _ c (c arbitrary)
1.1
1.2.
b E O(Mt~), (-~c)E O(Mt~) and c is in E-form b
1.3
b E O ( ~ ) and c is not in p-form b
By 14.2.4, I.l-I.3 suffice.
Inductive Rules (under the assumption that (1) does not hold). By 14.2.3 (ii) Jtl~l= S(b) V ~(b) V II(b) and ~At~l=S(c) v ~(c) v II(c). Hence, we have to specify nine rules; each rule is labeled by a two-letter word W , V where W, Y E {II, E, S}. W , V denotes the case where W(b), Y(c) hold in ~ . We adopt the abbreviations: (3u << b)(...):= 3u(u ~ b A...) and (Vv ~ c ) ( . . . ) : = Vv(v <~ c---,...).
[S*SI b, c are in S-form" PRD(b) <_PRD(c) . b
III.14]
IS,HI b is
The Uniform Ordinal Comparison Theorem
95
in S-form and c is in H-form: (3c' << c)(PRD(b) < c')
b
b
]S,~] b is in S-form and c is in ~-form: (Vc'<< c)(PRD(b) <_c').
b
b
(vb' << b)(3c' << c)(b' < c'). b
(3b' << b)(Vc' << c)(b' < c') b
(vb'<< b)(Vc' << c)(b' < c') b
(~b' << b)(~c' << c)(b' < c') b
(2.1)
Inductive Models and Definability Theory
96
O(Jtt~)l= (b,c)-ffI(G)
iff
0(.~)1= FG((b,c),I(G)).
[Ch.3
(2.2)
Then b < c implies
O(jll~)l=(b,c)r/I(G);
(3.1)
(b,c)-ffI(G).
(3.2)
c < b implies O(~l~)l=
Indeed, if b, c satisfy (1), (3.1)-(3.2) simply follow from the lemma 14.2.4, (2.1)-(2.2) and the fact that the conditions E(u), S(u), II(u) and E(u) are mutually incompatible. Otherwise, we can assume that b, c are not in E-form and we establish (3.1)-(3.2) by transfinite induction on - min{[b[, [c 1}, whenever b is in V-form and c is in W-form (V, W E {S,E, II}). In particular, (3.1)-(3.2) can be reduced to an inductive verification on a that if b is in V-form and c is in W-form, then b < c implies O(dlt,)[= c < b implies
V,W((b,c),I(G));
O(JII~)I=F(V,W((b,c),I(G))).
We only discuss two significant cases; the remaining ones are obtained by straightforward arguments. E,E" b, c are in E-form, e.g. b - - ~ ( V e ) , c - - ~ ( V d ) . If b < c holds, then b E O(.At~) and inf{l~(ey) l + l ' y E M} <_inf{l--,(dy) l + l ' y E M}. Since O(~6) is a model of T-axioms and O(J?6)l= F(Ve), we can also assume that there exists a y E M such that O(Jll~)[=Fey and [-.(ey)[ <_ [-,da [, for every a E M. By IH,
o ( ~ ) 1 - 3~(~ << b A
Vv(v << ~-~ (~, v),Tz(e))),
which implies O(.AI~)I= E,E((b,c),I(G)). Hence by (2.1) and logic, O(.hl~)l= (b, c)r/I(e). This takes care of (3.1). As to (3.2), if we assume c < b, we must verify O(.At~)l=F(e((b,c),I(e))); since O(Jli~)i= E(b) A E(c), it is enough to check: O(Jll~)l=
F(qu(u << b A Vv(v << c ~ {u, v)rlI(e))), or equivalently, O(dtt,)]=
Vu(u << b ~ 3v(v << c A (u, v)-flI(G))).
By assumption, for some x E M , O(.~)l=F(dx hold for arbitrary y E M, whence by IH O(~hl~)l= 3v(v << c A Vu(u <<
(4)
) and I~(dx) l < I-,(ey) l
b-->(u, v)-ffI(G))),
(5)
which implies (4). II,E. We assume b is in H-form and c in E-form. Ad (3.1). If b <_ c, then b' < c' holds for every b' << b, c' << c, whence by IH o(..,r wvu(= << b A y << c--, (=, y)rlI(C)) , i.e. o(~)1= u,z((b, c), I(G)),
III.15]
Applications of Ordinal Comparison Theorem
97
which yields by (2.1) the required conclusion. Ad (3.2). By assumption we have, for some c' <:< c and some b' << b, c' < b'. It follows by IH that O(Al~)[= 3x3y(x << b A y << c A (x, y)-~I(G)), which readily implies the validity of F(II,E((b,c),I(e)))in O(Jtt,). By (2.2) we obtain O(.Al~)[=(b, c)-~I(G). We then proceed by observing that, for every ordinal 7: O(Jtt~,7)[= (b, c)rlI(G) implies O(.A1,)[= Tb.
(6)
O(Ml,,7 ) is the 7th-stage of O(3t~) (see 7.6 or w ( 6 ) i s checked by transfinite induction on 7. If 7 - 0, the claim holds, as the premise is false, and, if 7 is a limit, we use IH. Assume O(.At~,fl + 1)1--(b,c)~?I(G); by lemma 12.1 we have: o( u,
=
G((b, c), I(e)).
(7)
As above, we must distinguish several cases according to the form of b, c. If b (or c ) i s in E-form, (7)implies O(Jft~)]-Tb (by (1)). In the remaining cases, IH applies and it always entails a sufficient condition to assert O(Jtl~)[-Tb (e.g. if b is in H-form, we have from (II,S), (II,II), (II,E) that every b' << b holds in O(Al~), which implies the conclusion with T-axioms for A and V). Then we prove" O(Al,)l= (b, c)qI(G) implies b _< c;
(8.1)
O(At)[= (b,c)-~I(G) and O(Jft~)[= Tc imply c < b.
(8.2)
Ad (8.1). Assume O(.At~)[=(b,c)riI(e). Were b~_c false, then by (6) O ( ~ ) [ = T b and [c [ < I b[, whence O(At~)]=Tc, i.e. c < b, which implies O(Ah)[= (b,c)-~I(e) by (3.2), against consistency of O(uit~). Ad(9.2). Assume b < c is false and O(.At~)[=(b,c)VI(G), O(Ml~)l=Tc. Then [b[ _~ [ c [ a n d hence O(Al~)[=Tb; by definition, b~_c and by (3.1), O(Jtl~)[= (b,c)~7I(e): contradiction! (8.1)-(8.2), (3.1)-(3.2)prove the theorem. [7
w
Applications of the uniform ordinal comparison theorem
We conclude the recursion-theoretic analysis of w by characterizing the section of an arbitrary inductive model. We then introduce an approximation operation ~r, which splits each non-empty property in a C-chain of subclasses, and we show that zr satisfies six simple conditions, the 7r-approximation axioms. As we shall see in the next chapter, 7r-axioms
98
Inductive Models and Definability Theory
[Ch.3
suffice to derive non-trivial ordinal-free consequences of the ordinal comparison theorem. However, we easily have that r-axioms are still conservative over MF c + G I D (hence over OP), by an obvious extension of the model-theoretic argument of w The basic step for proving the full characterization theorem is a separation lemma for disjoint predicates, which is easily implied by 14.3. 15.1. LEMMA (Separation). We can find a closed term ~x)~y.SEP(x,y) such that if dtt~l= OP-, b, c E M and O(.AI~)]=Vu(-,urlb V ~uzlc), then
O(.~t~) [= Vx(xr/b --, x~SEP(b, c)) A Vx(xr/c ~ z-~SEP(b, c)). PROOF. Choose S E P ( b , c ) ' - { x ' ( b x , cx)rlI(G)}, where I ( G ) i s the predicate, whose existence is ensured by the ordinal comparison theorem. If d e M and O( )l=dnb, we have by assumption O(~l,)l=-,(dr/c); by definition 14.2, bd <_ cd trivially holds and hence O(.~)l=(bd, cd)nI(G) by 14.3 (,), i.e. O(A,)I= dnSEP(b, c). On the other hand, if O(Jtt,)l= dr/c, then cd < bd holds and hence by (**) of 14.3, O ( ~ ) l = d ~ S E P ( b , c ) . [:1 15.2. THEOREM. Let ~
be an arbitrary model of OP-; then
HYP(.AI~)- SEC(O(Jtt~)) - SEC+(O(3b)). PROOF. By lemma 13.6 it suffices to verify SEC+(O(JII~)) c_ S E C ( O(.?$ ) ). Let X C M and assume that
X-
{a" a E M and O(Mt,)l= a t / b } , - X -
{a" a E M and O(Jtt~)l= at/c},
for some b, c e M. By 15.1 and consistency, O(Ml~)l=d~SEP(b,c ) iff O ( ~ ) l = d q b , for every d c M; but S E P ( b , c ) i s a class in O(.&): O(J$)l=~drlSEP(b,c ) implies O ( ~ ) l = d ~ c , whence O(Jtl~)l=d-~SEP(b,c ) again by 15.1. VI 15.2.1. REMARK. If ~ is countable, S E C ( O ( J t b ) ) - A~(Mt~), the collection of subsets of M, which are definable by formulas B Y A ( Y , x ) , V Z B ( Z , x ) , where 3Y, VZ range over subset of M, and A, B are formulas in the language .Lop possibly containing atoms Yt, Zt, Xt. This follows from the generalized Suslin-Kleene theorem of Moschovakis (1974). 15.3. DEFINITION
7r "- l y l x . { u " u - x V (yu, yx)rlI(G)}. Henceforth, it is convenient to adopt the more perspicuous abbreviations: 15.3.1.
xu <_ayv "- (xu, yv)rlI(G);
15.3.2.
yv < G xu "- vr/y A (xu, yv)-~I(G).
Applications of Ordinal Comparison Theorem
III.15]
99
The intuition behind 7r is that, if x is in y, then 7ryx defines those u which satisfy yu < G yx, i.e. which fall under the property y at a level not higher than ]yx I (see 14.2); it turns out that ~yx is a class in O(dtt~). 15.4. THEOREM (Approximation). Let J~ be a model of OP-. Then O(atb) verifies the following sentences:
YxVy(xrpryx); 7F.2.
w v v ( ~ v ~ c t ( ~ v ~ ) ^ ~v~ _c v);
7r.3.
YxYy(~xrly --, y C_ ~yx);
~r.4.
VyVuVv(u~Iryv A vrly --~ lryu C_ ~ryv);
7F.5. ~.6.
v v w ( ~ , v ~ 3z(z,Tv ^ Vv(~,v ~ ~vz c_ ~vv)))
PROOF. lr.1 holds trivially. As to the other sentences, we first observe: O ( ~ ) 1 = WVyW(x~y - ~ ( u ~ y x ~ yu <_ a yx)).
(1)
(r by abstraction and definition of ~r. =~: if x~ly, <_ G is reflexive, and the conclusion follows by abstraction). Ad 7r.2. Assume brla, d~Trab hold in O(dit~), where a, b, c, d E M; for typographical reasons, we keep using the same symbols for elements of M and their names. By (1), O(dtt~)l=ad _< Gab, hence by 14.3 (.), O(dlla)l=d~a , i.e. O(dlt)l= 7tab C_ a. Assume now: O(Mt~) 1= brla A --,drprab.
(2)
o(J~)l=-~d = b;
(3)
O(jtl~)l_.~a d <_ Gab.
(4)
By definition of 7r,
(4) and 14.3 ( , ) i m p l y O(Mg)l=-~drla , or l abl < l a d l . In both cases (with (1), 14.3 (**)), we have O(Mt~)]= ab < Gad.
(5)
Hence from (5) and (3), O(a?t~)]= d-OTrab, which implies that 7tab is a class in
o(.~). Ad 7r.3. Assume O(dtt~)l--~drla A brla. Then
(6)
l abl < l a d l ( b y 14.2(i)), i.e. trivially l abl <_ lad I, which yields,
100
[Ch.3
Inductive Models and Definability Theory
by (6) and 14.3(**), O ( ~ ) l = a b <_ Gad, whence O(~)l=boTrad. Since b is arbitrary, O(.At,)]= a C_fred. Ad 7r.4. Assume
O ( .At~) l= d rlTra b;
(7.1)
O(-ah)l= bqa;
(7.2)
O(.~)l- crprad.
(7.3)
By (7.1)-(7.3), (1) and ordinal comparison, we obtain ]ac ] < ]ad], whence
]ad] < ]ab]and
[acl < labl.
(8)
By (7.2) and 14.2.1, we must have O(~)1= crla.
(9)
From 14.3 (,), (9) and (8), O(.At~)[=crprab, whence O(~)l=Trad C 7rub. Ad 7r.5. Assume O(.At~)l= brla A crla;
( 10.1 )
O(.A~)l=dqTrab A--,drprac, for some d E M;
(10.2)
O(.Al~) l= erlTrac.
(10.3)
By (10.1)and (10.3), (1)and 14.3 (,), l ae I < I ac land O(A,)[= er/a.
(11)
From drprab, (1)(10.1)we infer O(Jfl~)]=dqa and l adl <_ l abl.
(12)
But ~drprac, (1), (12) and (10.1) imply ]ac [ < lad], whence
lac] < lab].
(13)
(13) and (11) entail Lae [ < lab I, i.e. with 14.3 (,) O(Jtt~)]=e~?Trab. Ad 7r.6. Let O(~t~)]= crla, for some c E M. Then the set of ordinals {lad[
9d e M, O(~)[=dT/a and [ ad ] _ ]ac ]}
is non-empty, and it possesses a least element 5. Choose any d such that -lad[ and suppose O(.A~)]=bqaAerlrad; then by ordinal comparison and the choice of d, lee I < lab] and O(Ml~)]=erla (because O(.At,)l=brla), which yields O(.Ah)[=erlTrab. Since b, c are arbitrary, it follows that O ( ~ ) l = Vv(vrla ~ 7red C ray). i"1 Let IIAX be the list 7r.1-r.6 of the approximation theorem 15.4. Then
III.15]
Applications of Ordinal Comparison Theorem
101
we immediately have, with the conservation results of 13.7-13.8: 15.5. T H E O R E M (General Conservation)
Let Ax = EA or Ext op" (i) If A is a formula of s such that M F c + G I D + I I A X ( + A x ) ~-A, then A is already provable in OP of+ Ax). (ii) If f is a combinator such that M F + G I D + I I A X ( + A x ) ~ - f : N ~ N , then f defines a number-theoretic function which is provably recursive in Peano arithmetic PA. (iii) If MF I + G I D + I I A X ( + A x ) F-f:N~N and f is a combinator, then f defines a primitive recursive function (MF 1 being the subsystem of w 15.6. FINAL REMARKS (i) 15.5(i) can be strengthened to a proof-theoretic equivalence by using a refinement of the techniques of part D (see Cantini 1992). (ii) Set /r := )~y)~x.{u: (yu, yx)~lI(G)}. If ~r.i is any sentence of IIAX (where i E {1, ...,6}), let ~.i be the sentence, which is obtained from ~r.i by replacing everywhere 7r with ~. Then we obtain"
if ~
is any model of o e - , O(~1~) verifies ~.2--~.6;
O ( ~ ) 1 = VyVuW(,ny A u~Ty A ~ryu C_ r
~ u~7~ryv).
(~r.7)
Clearly #.4 and #.7 imply:
vyw( ny
un y );
VyVuW(vuy ^
( yu c
(,)
M F - + IIAX is interpretable into M E - + {/r.2-~.7}.
(**)
Using (,), we can show:
(**) is made precise as follows. First of all, let us consider 7r and ~r as new primitive symbols. Then we define a translation ^ from the language of M F - + I I A X into the language of {/r.2-/r.7}: if A is a formula of M F - + {Tr.l-Tr.6}, A ^ is the formula obtained by replacing each occurrence of 7r with the term 7r' := )~y)~x.~ryx U {x}. Then, for each i E {1,..., 6 }, M F - + {/r.2-#.7} ~ (Tr.i)^.
(***)
The verification of (***) is trivial for i - 1,2,3,4; it makes use of/r.7 in the cases of 7r.5 and 7r.6. A consequence of (**) is that we can work with an operator, which satisfies r instead of 7r.1, without weakening the approximation structure.
This Page Intentionally Left Blank
CHAPTER 4
TYPE-FREE ABSTRACTION WITH APPROXIMATION OPERATOR w w w w
Approximating properties by classes The approximation theorem for extensional operations and the fixed point theorem for monotone operations Topology displayed: basic definitions The representation theorem for explicitly CL-continuous operators Appendix: alternative proofs
In chapter III we semantically justified the introduction of a suitable approximation operator 7r with a simple axiomatic description, and we proved that the resulting extension of the minimal framework MF c - to be called P W c b e l o w - i s conservative over OP, even in presence of a generalized induction schema GID for fixed points of positive operators (see 15.5). We now investigate in some detail the extended axiomatic system P W c + GID and we show that it has natural non trivial consequences. As we expect from the basic intuition underlying 7r, the relevant consequences are recursion-theoretic and show that the chosen system yields a kind of axiomatic intensional theory of inductive sets over a combinatory structure. In w we obtain principles of approximation for properties by classes and we get typical results from definability theory. Incidentally, we obtain a strong form of separation for disjoint properties, which is a basic tool for proving the consistency of an interesting property theory, due to Myhill-Flagg (1987). In w we exploit the local structure of properties and we prove a generalized continuity theorem for extensional operations, an abstract version of the Myhill-Shepherdson theorem. Of course, "extensional" operations are those operations which preserve the membership relation r], associated to reflective truth. As a consequence (together with generalized induction), we can prove uniform internal version of the fixed point theorem for monotone operators; it also turns out that
extensional, positive, monotone and (generalized) continuous operators all coincide, provably in P W c + GID. The axiomatic results can be rephrased in denotational style: in w we introduce a natural topology, the class topology on the power set of M (M = support of a given OP-model 3t~), and we show that non-trivial facts
Type Free Abstraction with Approximation Operator
104
[Ch.4
about "constructive objects" of the space can be adequately dealt with in the untyped language of reflective truth. Among others, we characterize the "explicitly" open sets of the space and the explicitly continuous operators of the space into itself (w167 we conclude with an analogue of the Kleene "first recursion theorem" for explicitly continuous operators. The class tdpology is an analogue of the positive information topology (in the sense of Scott-Ershov), where the role of "finite" (or compact) elements is played by the hyperelementary subsets of M, i.e. the extensions of total predicates in the inductive models.
w
Appro~dmating properties by classes
In Ch. III, w we d e f i n e d - w i t h i n inductive m o d e l s - a n operator 7r, which uniformly assigns to every property a chain of subclasses. 7r has its source in this informal idea: in order to verify, by "predicative means", that x witnesses a property b, one employs a portion of b, which is a class and can be determined, uniformly in b and x, by looking at the "search tree", which is naturally associated to (the presentation) of b. Formally, the basic consequence is that we can compare two given elements x, y falling under a property b, according to their "order of generation", and this order is well-founded. A major corollary is that there is an operation ~, which associates to any given non-empty property b a collection of witnesses of b, which is a class (CL-compactness). Below, we explicitly define the generation order and we collect together a few basic facts, inspired by generalized recursion theory. 16.1. D E F I N I T I O N (a)
P W c "- MF c + {Tr.l-Tr.6) (NB: MF c is based on class N-induction of 10.7).
P W is an acronym for prewellordering ; r . l - l r . 6 are the sentences of the approximation theorem 15.4, here restated for reader's sake: 7r.1. VxVy(xri~yx); ~r.2. 7r.3. VxVy(-~x~Ty --, y C_ ~yx); 7r.4. VyVuVv(uri~yv A vriy --~ ~yu C_ ~yv); 7r.5. VyVvVu(ur]y A v~?y ~ ~yu C_ ~yv V ~yv C ~yu); 7r.6.
vyw( y- 3z(z y ^
c
Approximating Properties by Classes
IV.16]
105
As usual, P W - is the subsystem of PW c without the number-theoretic induction axiom, while PWp is P W - + P-NIND ( - the property induction axiom of 10.7). (b)
x < z y "-- xrlz A Trzx C rrzy;
(c) x < z Y " - x~l z A lrzx C 7rzy, where z C b "- z C_ b A 3x(xrlb A - , x T l z ). 16.2. LEMMA. The f o l l o w i n g f o r m u l a s are provable in PW-: (i) (ii) (iii) (iv)
(v) (vi) (vii) (viii) (ix)
(x) (xi) (xii) (xiii)
T(x< zy)~x< zY; ~X
z Y --+x -< zY; A -~y rlz -+ x < z Y; A yrlz ---+x < z Y V y < z x; --+ x <_ z x; V yrlz -+ x < z Y V y < z x; A F ( x < z Y) ~ Y < z x ; V yrlz---+ P r o p ( x < z Y ) (where P r o p ( z ) " ---+V y ( y < z x ---+-, x~rrzy);
3v(v
Tz V Fz);
z ^ Vv(v z--+ v < z v)).
PROOF. (i) =:>: trivial by T-logic. r if x < z Y, then xrlz, whence Cl(~rzx) (by axiom rr.2). It follows that r r z x C ~rzy implies T ( r r z x C rrzy), i.e.
T(. < . v). (ii)-(v): trivial by definition 16.1. (vi): from xrlz and -~yrlz, we have z C_ rrzy (rr.3)and rrzx C_ z (~r.2). But y~rrzy (~r.1); hence (rrzx C rrzy) A x~z. (vii)" it is a restatement of rr.5. (viii)" trivial. (ix)" apply (vi)-(v), (vii). (x) ==>: assume y r l z A F ( x < zY)" If-,xrlz, y < z x (by (vi)); if xrlz , then ~rzx C_ rrzy or 7rzy C rrzx (7r.5). But x ~ z implies - , F ( x r l z ) , whence it follows 3u(urlrrzx A u-~Trzy); then rrzy C ~rzx, i.e. y < z x. r 9 if y < z x is assumed, 3 u ( u ~ r z x A u-~rrzy) and yrlz hold (rr.2); hence yrlz and F ( x < z Y)" (xi)" by (ix)-(x), (i). (xii): assume xrlz and x~Trzy, y < zX; then yrlz and ~rzy C 7rzx. Hence lrzx C_ lrzy (7r.4)" contradiction! (xiii): it is a reformulation of 7r.6. V! 16.3. T H E O R E M ( C L - c o m p a c t n e s s ) . We can f i n d a closed t e r m ~ such that P W - proves" (i) ~zC_z;
106
Type Free Abstraction with Approximation Operator (ii) (iii)
[Ch.4
3x(xr/z) ~ Cl(~z) A 3u(u~I~z); 3 x 3 y ( x - e Y A ~ , ~ x - ~y) (so ~ is non-extensional).
PROOF. We define ~ "-Av.{x" Vy(x < v Y))" Clearly, if u ~ z is assumed, then u~Iz holds (by 16.2 (ii)-(iv)). It is also clear that 16.2 (vi)-(v) entail
Vy(x < zY) iff x~Iz and Vy(yrIz---. x < zY)"
(1)
We assume that z is non-empty and we verify, for every x,
FVy(x < z Y) iff -~Vy(x < z Y)" ~ : trivial by T-logic. r
(2)
suppose that there is an x such that:
3y--,(x <_ zY);
(3.1)
-~FVy(x < z Y)"
(3.2)
Fix an element u of z; then (3.2) and 16.2 (xi) imply x < z u, i.e. x~lz. Hence (3.1) and 16.2 (ix)-(x) yield 3yF(x < z Y), whence FVy(x < z Y)" by classical logic we are done. By (2) and 16.2(i), ~z is a class; moreover, if z is non-empty, ~z is non-empty, by (1) and 16.2 (xiii). We conclude by verifying (iii): we show that, if V x V y ( x - e y ~ ~ x - e ~Y) were assumed, then there would exist a class b - e r - {x"-~xrIx}, which is impossible by 9.3. Choose
W ( x ) "- {y" y - 0 V (y - 1 A x~lr)}, V(x) "- {y" y - 1 V (y - 0 A xrIr)}, and let b - {x" ~ W ( x ) - e~Y(x)}. Since W(x), Y(x) are non-empty, ~ W ( x ) and E.U(x) are non-empty classes by (ii) and hence b is a class. Assume -,xrir: then W ( x ) - e {0} and V ( x ) - e {1}. Since ~ W ( x ) a n d ~V(x) are nonempty and ~W(x) C_ W(x), ~V(x) C_ U(x), then - , ~ . W ( x ) - e ~ U ( x ) ; hence b _C r. Conversely, let xrir: then W ( x ) - e U ( x ) - e {0, 1}. So, if ~ preserves = e, ~W(x) - e ~V(x) i.e. x~b: Hence r C_ b: contradiction. 0 As a consequence of 16.3 (iii), the existence of an approximation operator r, satisfying 7r.1-r.6, is inconsistent with EXT(~r) "- VyVzVx(x~Iy A y -- e z ---*7ryx -- e 7rzx). CL-compactness implies a useful result: 16.3.1. COROLLARY (CL-Reflection Schema). Let A ( x , y ) be an arbitrary formula. Then there is a term )~u)~v.p(A, u, v) such that, provably in P W - :
Cl(a) A Vx~a.3y~Ib.TA(x, y) ---, 3c(c - p(A, a, b) A Cl(c) A c C b A Vx~Ia.3y~Ic.A(x, y)). PROOF" choose H ( A , x , b ) -
{y" yrlb A A ( x , y ) } and define
p(A, a, b) "-xUa~H(A, x, b).
Approximating Properties by Classes
IV.16]
107
Assume Cl(a), YxTla.3yqb.TA(x,y ). Then we have, by abstraction 9.2:
Vxrla3y(yT1H(A , x, b)). By 16.3, since H(A, x, b) C b and yT1H(A , x, b) ---. A(x, y), we conclude:
YxTla. (Cl(~H(A,x,b)) A ~H(A,x,b) C_ b);
(1)
YxTla. 3yTI~H(A , x, b). A(x, y).
(2)
If we set c := p(A,a,b), then (1), 9.14.6 and the assumption Cl(a) imply:
Cl(c) ^ c c_ b; from (2) and the choice of c, it follows Vx~la.3y~c.A(x, y). H We now use 16.3 to give natural uniform counterparts of the classical reduction and separation theorems. 16.4. DEFINITION. RD((y',z'),Iy, z)) ( = l y ' , z ' ) conjunction of the the following sentences:
reduces (y, zl) is the
(i) y' C_yAz' C_z; (ii) y U z C _ y ' U z ' ; (iii) -~3x(xTly' A X~lZ'). 16.5. THEOREM (Reduction). We can find closed terms R1, R 2 such that P W - proves:
YyYz.RD((RlYZ , R2Yz),(y , z)). B
PROOF. Define d ( y , z , x ) " - {i" (i - 0 V i - 1) A (x,i>71(y @ z)} (for @, cf. 9.14.2). Then we choose: m
RlYZ "- ix" O~(d(y,z,x))} n2Yz "- ix" l~/~(d(y, z, x)) A "=OTl~(d(y,z, x))}. Conditions (i) and (iii) of assume XTl(yU z). Then for a non-empty class C_ {0, 1} done. Else, 0 ~ ~(d(y, z, x)) i
16.4 are immediately checked by 16.3. As to (ii), some i C {0,1}, iTId(y,z, u); hence ~(d(y, z, x)) is by 16.3 (ii). If O~l~(d(y, z, x)), xTIRlYZ and we are and hence 17/~(d(y, z, x)), whence xTiR2Yz. 0
16.6. COROLLARY (CL-Separation).
We can find a term C S P ( y , z ) such
that: P W - F- Vx(xr/y V XrlZ) ---, (Cl(CSP(y, z)) A
A Vx(=x~ly ~ x~ICSP(y, z)) A CSP(y, z) C_ z).
(.)
PROOF. We reduce the pair (y, zl: then Vx(xrlRlYZ V xrlR2yz ) and RlyZ , R2Yz are disjoint. If =xTly and -~xTiR2Yz , we should get XqRlYZ C_ y:
Type Free Abstraction with Approximation Operator
108
[Ch.4
absurd. Therefore we have Vx(~x~ly ~ xqR2Yz ) and R2yz C z. Put:
d(y,z,x) "- {u" (x, u)rlRlyz 9 R2yz}; then we get" Vx3!u.(x, u)~d(y, z, x). We choose CSP(y,z) "- {x" lri~d(y, z, x)}. Since ~d(y,z,x) is a class for every x, CSP(y,z) is a class too, and it satisfies (,). O An interesting consequence of CL-separation is the "A-comprehension" schema, which corresponds to hyperarithmetical comprehension in secondorder arithmetic: 16.7. COROLLARY. Let A(u,x), B(u,y) be formulas elementary in x, y respectively. Let A(A, B) "- Vu(3x(Cl(x) A A(u, x)) ~ Vy(Cl(y) ---+B(u, y))).
Then: PW-
F A(A, B ) ~ 3z(Cl(z) A Vu(u~lz ~ 3x(Cl(x) A A(u,x))).
16.8. DEFINITION. z weakly separates the pair (x,y) of disjoint properties (i.e. x A y - e 0), iff x C_ z and y C_ - z . We now prove in the extended axiomatic framework the separation lemma of 15.1:
We can define a term SEP(x,y) such that, if x n y = e 0, then SEP(x, y) weakly separates (x, y).
16.9. PROPOSITION ( P W - ) . PROOF. Define
SEP(x, y ) : - {u: ur/x ~_ uyy} where uyx ~_ u~Iy := (u, x)~?E A 7rE(u, x) C_1rE(u, y) and E := {(u, y): uyy}. If u~x, then -~uyy by assun~ption: hence by 16.2(v), u~x~_uyy, i.e. u~SEP(x,y). If u~y, then F(u~x < u~y) (by 16.2(vi), (x)), which implies
u-~SEP(x, y). 0 16.10. COROLLARY (in P W - , Effective Inseparability). If (x,y) is any pair of disjoint properties such that r'-{u'--,uTlu } C x, - r C y, then -~SEP(x,y)~l(xUy) (where S E P is given by 16.9). We conclude the section with a nice application of reduction and 7r-axioms. Each c trivially defines a pair (d,b I of disjoint properties with d-ec and b - e - C ( - c ' - { x ' - ~ X r l C } ; - e is 7/-extensional equality); conversely, we may wonder whether to each pair (d,b) of disjoint properties we can associate a property c satisfying d - e c, b - ~ - c . We call such a c, if it exists, an exact representation of the pair (d,b). The answer to the problem is positive and shows that the present language is complete with
IV.17]
Approximation Theorem for Extensional Operations
109
respect to exact representability of pairs of disjoint properties. The result generalizes a well-known theorem for recursively enumerable sets of numbers, due to Putnam, Smullyan, Shepherdson (see Smullyan 1961). 16.11. THEOREM. P W - proves:
We can define a closed term A y A z . E R ( y , z ) ,
such that
y gl z - e 0 ~ ( E R ( y , z) - e Y A - E R ( y , z) - e z). PROOF. Define:
~(u, z ) ' - {(v, u). v~y v (v, ~)~u}; ~2(v, z ) . - {(v, u) . v~z v (v, u)~u}. Below we simply write r 1 for rl(Y,Z ) and r 2 for r2(Y,Z ). The definition of R1, R 2 (see 16.5) and CL-compactness imply:
Vu(uTlr 1A-~urlr 2 ---.urlRl(rl, r2));
(1)
Vu(u~lr 2 A -~u~lr1 ---, u~lR2(r 1, r2) ). Since R l ( r l , r2) N R2(rl, r2) - e 0, we find c - S E P ( R I ( r l , r2), R2(rl, r2) ) by 16.9, such that:
Vu((u~rl ^ - u ~ , 2 ) - ~ u~c); Vu((~2 ^ - ~ 1 ) ~
(2)
~Vc).
Let E R ( y , z) "- {v" (v, C)~lC}; we claim
~,y~(v,c)~c.
(3)
(3) ::~" assume v , y and ~(v,c),c. Since-~v,z, we get ~(v,c)yr 2. But v , y implies ( v , c ) , r 1" hence by (2), (v,c),c and the conclusion follows by tertium non datur. (3) r "let (v,c)~c and ~v~y. Then (v,c)r]r2; also, by consistency, ~(v,c)~c, whence-~(v,c)yr 1. By (2)we have (v,c)~c: contradiction. The verification of Vv(vyz ~-, (v, c)-~c)is similar. [:]
w The approximation theorem for extensional operations and the fixed point theorem for monotone operations We consider the following generalized continuity problem: if we have the value of an operation f on a property a, under which condition can f a be approximated by the values of f on the subclasses of a ? The answer turns out to be natural and simple: f must be extensional in the sense of 7/ and the resulting continuity theorem is the analogue of the Myhill-Shepherdson theorem in a general setting. A remarkable consequence
110
Type Free Abstraction with Approximation Operator
[Ch.4
the notions of extensional operation, monotone operation and operation induced by a positive operator (in the sense of 10.3) essentially coincide (modulo r/-extensional equality). In particular the minimal fixed points of monotone operations are already generated by positive operators.
is that
We derive the main result within P W - , as a corollary of a generalized Rice-Shapiro theorem; the neat exposition of Fitting (1981) is our guideline. 17.1. D E F I N I T I O N (i) An operation f is extensional 2 iff x - e Y implies .fx - e fY, for every x, y. (ii) z is extensional I iff x - e Y and yr]z imply xriz. 17.2. L E M M A ( Upward closure). If z is extensionall, then z is C_-upward
closed. Formally: M F - k- EXtl(z ) ~ VxYy((x C_ y A X~lz) --~ yTIZ) (where EXtl(z ) is the obvious formula representing extensionalitYl). P R O O F : assume x C y and x~lz. By the fixed point theorem for properties 10.4, we find a term I depending on x, y, z, such that:
Yu(u~lI +-+(UTIX V (u~ly A DIz))). If -~ITiz, then by (,), I - e x , i.e. ITIz. Hence ITIz , which implies I (because x C y), i.e. by extensionality, y~Iz. [3
(,) eY
17.2.1. R E M A R K . Observe that M F - K Y z Y x ( E x t l ( z ) A -,x~Iz--+-~O~lz). If z is an extensional class, so is the complement - z ; now either 0~/z or 0r/(-z), whence either z - e V or z - e 0; so 10.15 is a corollary of 17.2. 17.3. L E M M A ("Rice-Shapiro.generalized"). If z is extensional 1 and x is in z, then there is a class u in z such that u C_ x. Formally: P W - t- VzYx(EXtl(z ) A xTIz---, 3u(Cl(u) A u~Iz A u C_ x));
(indeed, u is given uniformly in z, x by a term of the language). P R O O F . Fix x in z and define t " - x | z (or, which is equivalent, x | 7rzx). By the fixed point theorem for properties, we can find a term J, which depends on x, z, such that:
Yu(mlJ +-+3y(yTIt A (u, O)Tprty A ~(J, 1)~/Trty)).
(1)
right to left, we apply 7r.2 to show that -~(J, 1)~vrty implies (J, 1)~ 7rty). But (1), the definition of t and 7r.2 again entail
(From
jc_ .
(2)
IV.17]
Approximation Theorem for Extensional Operations
111
Then we obtain
j~z.
(3)
Indeed, if-~J~z holds, we have by r.2"
Vu(u~J ~ 3y(y~t A (u, O)yrty)).
(4)
Moreover, if uyx holds, we have (u, O)yt and (u, O)yrt(u, O) (by r.1), i.e. 3y(y~t A (u,O)~rty), whence by (4), uyJ. By (2), x - e J is true; since x~z and z is extensionall, J~z.
If d - - {~. 3y(y~t(J, 1)^ (~, 0)~ty ^-~(g, 1)~ty)}, w~ claim: d is a class such that d - e J"
(5)
Indeed, as to the classhood of d, let A(u) be the defining condition of d. We show that -~TA(u) implies T~A(u). By T-axioms, this amounts to check that for arbitrary y, (J, 1)~rty follows from the assumptions"
-~yTITrt(J, 1) V -~(u, O)~prty V -( g, 1)~ 7rty;
(6.1)
~y~ 7rt(J, 1) A -~(u, 0)~ 7rty.
(6.2)
Since t is non-empty by (3), ~t(J, 1) is a subclass of t by ~'.2. Hence by (6.2) that rty is a subclass of t (again by ~'.2). By the definition of class, (6.1)-(6.2) transform into
y~t, which implies
-~y~lTrt(g, 1) V -~(u, O)~vrty V (J, 1)Tvrty; y~prt(J, 1) A (u, O)~prty, whence (J, 1)yTrty. As to the claim d _C J, assume uyJ. Then (u,O)rITrty, for some y in t such that (J, 1)~Trty (by (1) and 7r.2). Since J is in z, (J, 1)zIt and hence 7rty C_7rt(J, 1) (by 7r.1, 7r.5); hence y is in r 1), i.e. u is in d. That d C_ g follows from 7rt(g, 1) C_t and g~z. Extensionality 1 of z and (2)(3)-(5) yield (d~Iz A Cl(d) A d C_x). [3 17.4. COROLLARY ( P W - ) (i) Every infinite property contains an infinite class. (ii) CL-compactness again: there is a term Ax.~x such that
~z c z ^ (3~(~z)-~ cl(~z) ^ ~u(u,~z)). PROOF. (i): let INF "-{x" 3f" N ~ x } be the property of being infinite (here f" N~--, x "- f" g---. x and f is 1-1). Then INF is extensional I and we can apply 17.3. (ii) c "-{x" ~U(UTIX)} is extensional1; hence by 17.3 there is a term r such that
Type Free Abstraction with Approximation Operator
112
9~z ~ C l ( r
z)) ^
3~(~r
z)) ^ r
Choose (hint by Minari): ~ z - {x "XrlZ A xrlr
[Ch.4
z) c_ z.
(,)
Then apply (,). F!
17.5. T H E O R E M ("Myhill-Shepherdson"). Let f be extensional 2. Then for
every a, f a - e U {re: Cl(c) A c C_ a). Formally: P W - F- V f V x (Ext2( f ) ---, f x = e U { f y : Cl(y) A y C_ x}),
(~h~r~
E~t2(]):= WVy(~
= ~V-~ f~ = ~fy).
PROOF. Define c ( f , u ) : = {y: urlfy}, where u is in f x . By assumption on f, c(f, u) is extensional 1. If urlfy , for some subclass y of x, then yrlc(f, u) and by lemma 17.2 Xrlc(f, u), i.e. urlfx. If u~fx, then x~c(f, u): hence 17.3 yields a subclass y of x such that urlfy. E] 17.5.1. REMARK. We already know that every operator A(x,a) gives rise to an extensional 2 operation f A a ' - {x" A(x,a)} (see 10.3-10.4). By 17.5, the converse also holds: for every extensional 2 operation f, we can find a
positive operator A$(x,a) such that for every a, f a - e {x" Ay(x,a)}. Of course, we have a uniform choice: A I ( x , a) - 3c(Cl(c) A c C_ a A xrlf c). It is easy to check that the two operations f~--~AI and A~--~fA are inverse to each other. 17.6. DEFINITION (i) M o n ( f ) "- VaVb(a C b---, f a C fb); if M o n ( f ) is assumed, we say that f is C-monotone, or, simply, monotone. (ii)
f-clos(x) "- f x C_ x (in words: x is f-closed).
If B(x) is an arbitrary formula,
f-clos(B) "- VwVu((ur/fw A Cl(w) A Vv(vriw---, B(v)))---, B(u)). (iii)
I(f)"-
I(AI); (here I ( A ) : - fixed point of A, see 10.1).
17.7. FACT (i) (ii)
By 17.5 an operation f is extensional 2 if.]:f is monotone. If f is monotone and B ( u ) " - u r / x (with u, x distinct variables), 17.5 implies f-clos(x) ~-, f-clos(urlx ).
An important application of the continuity theorem and generalized induction (12.4.1) is a uniform version of the fixed point theorem for monotone operations:
IV. 18]
Topology Displayed
17.8. T H E O R E M ("Knaster-Tarski"). P W - + G I D
113 proves:
Mon(f)-~ f ( I ( f ) ) C_I(f) A (f-clos(B)--, Vu(ur/I(f)--, B(u))). In particular, P W - + GID F Mort(f)--, (f-clos(x)--, I(f) C_x). PROOF. If f is monotone, 17.5 and u~f(I(f))imply:
3w(w C I(f) A Cl(w) A ur/fw).
(1)
By choice of I ( f ) , we can conclude:
urII(f).
(2)
If B is f-closed, B is by definition Af-closed and hence the conclusion follows by GID. The second part is a consequence of 17.7 (ii). 0 17.8.1. REMARK. The fixed point operator I, which can be explicitly defined by the term Af .Y(Av.(x" 3c(Cl(c) A c C_v A xrlfc))), is extensional too, in the sense that it preserves the natural pointwise equality on operations. Set f U g "- Vx(fx C gx): then I(f) C_I(g) (apply GID).
w
Topology displayed: basic definitions
We make explicit the topological flavour of the previous results on extensional operations. Thus we try to build a bridge between the present intensional approach and denotational semantics, which relies on topologically restricted notions of partial function and functional. After the definability results of Ch. III (see 13.4), we know that the syntax of s is strongly adequate for representing inductive sets. But there is a more recondite adequacy, which is embodied in the results of w specifically in the MS-theorem 17.5. We prove that, if the power set of the ground combinatory algebra ~ is endowed with a suitably natural topology, then "explicitly continuous" operators, mapping the power set of M into itself, can be adequately mirrored by our logical approach. We work in a fixed model ~ of O P - , while O(~6) is the least inductive model of P W - + GID. Of course, M "-I.At, I is the support of Jl~, while ~P(M) is the power set of M. 18.1. DEFINITION. If b E M, E(b)"- {a" O(atb)l=ar/b } - "the extension of property b". By 13.4 and 15.2, we have I N D ( . ~ ) - {E(a)'a E M} and H Y P - {E(b)" b is a class in O(.AS)}. All the notions introduced depend on ~
(e.g. E "-Ealt, , IND(alI~)). Since
114
Type Free Abstraction with Approximation Operator
is fixed, we can simply omit the explicit indication of ~ we shall speak of classes instead of M-classes.
[Ch.4
and M. Also,
CONVENTION: X, Y, Z range over ~P(M), P, Q, R range over families of subsets of M. We freely use formulas of the language of P W - to state facts about O(.)tl~.); e.g. " assume arlb" means " assume O(Ml~)l-ar/b" , etc... We induce a topology on 9 ( M ) and, by relativization, on I N D . For the topological notions, see any good reference (e.g. Kelley 1955). 18.2. DEFINITION. If O ( ~ ) l - C l ( e ) , a basic open (set).
V(e) . - { x c_ M" E(e) C_ X } is called
18.3. LEMMA (i) The family {V(e)" O(J~)l-Cl(e)} is a basis for a topology CI-~T, the class topology over J?l~. (ii) (~P(M),Cl-~') (and hence the subspace ( I N D , Cl-~)) is a To-space , which is not T 1. (iii) For any class e, if V(e) is covered by a family of basic opens, then V(e) is already covered by a basic open of the given family itself"
if V(e) C_ U {V(ek)" k E I}, then V(e) C_ V(ej), for some j E I. (iv) P C_ ~ ( M ) ) is open in the class topology iff 1. P is upward closed (i.e. Y E P and Y C_ X imply X E P); 2. whenever X E P, then there exists a class e such that E(e) E P and E(e) C_X . The proof is an easy exercise. Clearly (~P(M),CI-~) induces a sort of generalized Scott topology on inductive sets (under the Kreisel-Sacks's analogy "finite" - "to be a class"; see Kreisel-Sacks 1965). It is also useful to regard the subspace I N D as an analogue of f-spaces in the sense of Ershov(1977), where the subset of finite elements is just the collection {E(c)" c is an M-class}. We now state a simple proposition relating classhood to a constructive abstract version of the compactness property; not surprisingly, the proof requires CL-compactness (16.3).
18.4. THEOREM (CL-finiteness). Let X E I N D . Then X - E(c), for some M-class c iff whenever X C_ E( U { f i" irlI} ), then also X C_E( U { f i" ir/Io} ) for ~om~ U-~ubcla~ 10 of I (I, f arbitrary). P R O O F . =~. By assumption X - E(c) and we have Vxrlc.3irlI.xrlfi. Set A(x, i ) " - i r l I A xrlf i and choose I o - p(A, c, I) by C/-reflection 16.3.1.
Topology Displayed
IV. 18]
115
Then I 0 is a subclass of I which meets the condition of the lemma. r : assume that X := E(c) satisfies the right side of the lemma; trivially E(c) = E( U {{x}:xrlc}) and hence for f := )~x.{x} and some M-class b with E(b) C_ E(c), E(c)C_ E( U {{x}:z~b}), i.e. E(c) C_ E(b), for some M-class b, i.e. X - E(b). B Let P S ( X ) "- {E(a)" Cl(a) and E(a) C_ X}. Clearly:
P S ( E ( a ) ) - {E(c)" cTlP+(a)}, where P + ( a ) " - {z: Cl(x)A z C_ a} (see 9.15). It is immediate to verify: 18.5. LEMMA
(i) PS(X)
c-directed: if z, Y c PS(X), such that Z C W and Y C W. (ii) If Y E I N D , Y - U P S ( Y ) . (iii) V(b)n V ( c ) - V(e), for some class e (b, c classes). (iv) I N D N Y(O) - I N D (0 - empty property).
W
PS(x)
I N D can be naturally viewed as a sort of constructive "ideal completion" of H Y P (in the sense of lattice theory). In particular, ideals in H Y P which are explicitly presented by means of arbitrary operations, are already principal ideals in I N D . The point is made precise below. 18.6. DEFINITION. If f" I---,CL shortens VxrlI.Cl(fx), we let"
I D E ( f ) "- {c" Cl(c) A 3I(Cl(I) A f" I ---, CL A c C_ U {fi" i~I})}. 18.6.1. FACT. The following is provable in M F - :
crlIDE(f ) ~-~Cl(c) A 9I(Cl(I) A f" I ~ e L A c C_ U {fi" irlI}). The
I D E ( f ) represents an ideal in the lattice with support {E(a)'a is a class in O ( ~ ) } (and with set inclusion as ordering);
term
HYP-
the definition is justified by the following: 18.7. P R O P O S I T I O N (i)
I D E ( f ) is C-downward closed: yrlIDE(f ) A el(x) A x c_ y ---,xrlIDE(f);
(ii)
I D E ( f ) is closed under U over its subclasses: el(b) A b C_ I D E ( f ) ~
(iii)
( U b)~lIDE(f);
Constructive completeness: we can find a term L such that E(IDE(f))-
E(P+(L(f))).
116
Type Free Abstraction with Approximation Operator
[Ch.4
PROOF. (i) is trivial. (ii) Assume that b is a subclass of I D E ( f ) . Then by definition
b C_ C L -
{x" C/(x)} and Vxyb.3cyVL.A(x,c),
where A(x, c) "- f " c ~ CL A z C U {fi" iyc}. Since A(x, c)is quasi-elementary in x, c, we have by 9.6 (i)"
Vzyb.VcyCL.(A(x, c) ~ T A ( z , c)). Then one can apply CL-reflection 16.3.1 and there exists a class of classes e such that Vxyb.3cye.A(x,c). (1) By 9.14 d - LJ e is a class and U b C_ U {fi" iyd}. Indeed:
uy U b =:~3xyb.uyx; :=~3x3c(xyb A eye A uyx A x C U {fi" iyc});
(by (1))
==~3cye.uy U {fi" iyc}; :=~3cye.3iyc.uy f i; ==~3iyd.uyf i. (iii) Let D ( f ) " - U {c" Cl(c) A f" c ~ CL} and L ( f ) " - U {fi" i y D ( f ) } . I D E ( f ) C f + ( L ( f ) ) is immediate by definition of L ( f ) and I D E ( f ) . As to P + ( L ( f ) ) C_ I D E ( f ) , assume el(d) and d C U { f i ' i y D ( f ) } . Then by CL-finiteness d C U {fi" lye}, for some class c C_ D ( f ) . But f" D(f)---,CL and afortiori f" c ~ CL; hence d y l D E ( f ). 0 18.8. DEFINITION (i) Put ~f(b)"-{E(a)" ayb}. Then P C Z2(M)is an RS-family iff for some extensional 1 b, P - ~f(b); (in short P E RS; R S - Rice-Shapiro). (ii) Let O ( b ) " - U {Y(e)" e E E(b), e class}. Then P C Z2(M) is explicitly open in the class topology iff for some b E M, P - O(b) (b is called index of the open set). (iii)
D(b) "- {x" 3c(Cl(c) A cyb A c C x}.
(iv)
E C L - O P E N "- {O(b)" b E M}; R S "- {~f(b): b E M, b extensional1}.
RS-families are important because they characterize the explicitly open sets of I N D . 18.9. LEMMA (i) D(b) is exlensionall: x - - e Y A y y D ( b ) ~ xyD(b); ( i i ) ) ~ x . D ( x ) is extensional 2" x - e Y ~ D(x) - e D(y); (iii) ~(D(b)) is an RS-family;
IV.19]
The Representation Theorem for CL-continuous Operators
117
(iv) if b is extensional1, then Y ( b ) - Y(D(b)); (v) O(b) - O(D(b)) and O(b) M I N D - Y(D(b)). PROOF. (i)-(ii) follow from the fact that the formula defining D(b) is positive in x and b; (iii) is immediate from (i), while (iv)is a restatement of lemmas 17.3 and 17.2. Proposition (v) is a straightforward application of the definition of O and D(b). [-1 18.10. DEFINITION cr: E C L - O P E N ~ R S and w" R S ~ E C L - O P E N are the maps defined by:
cr(O(b))- Y(D(b)) and w(Y(b))- O(b). 18.11. THEOREM. RS-families are exactly the intersections of explicitly open sets with I N D . More precisely: (i)
if b E M and b is extensionall, then O(b) M I N D - Y(b);
(ii) for every b E M, ~o(~r(O(b)) - O(b)); (iii)
if b E M and extensional1, then ~(w(Y(b)))- Y(b).
PROOF. (i)is a consequence of 18.9 (v)-(iv). (ii): by definition of w, e and 18.9 (v). (iii)" by 18.9 (iv). El Since I N D C Y(V) and the universe V - { x ' x - z} is an extensional 1 class, then we have that I N D U{Y(b)" b is extensionall}; on the other hand, Y(b M c) C Y(b)f3 Y(c)" hence R S is a basis for a topology on I N D , we simply label RS-topology. Once we observe that the intersection of any basic open of C l - ~ with I N D is an RS-family and we keep in mind 18.11 (i), we obtain: 18.12. COROLLARY. The RS-topology coincides with the class topology on IND.
w
The representation theorem for explicitly CL-continuous operators
As usual, an operator F" ~ ( M ) ~ ?P(M) is continuous with respect to the class topology Cl-~T iff the inverse image of a basic open of Cl-~f is open in Cl-~f . 19.1. DEFINITION (i) F - ~ ( M ) - - - , ~ ( M ) i s CL-continuous iff 1) F is C_-monotone; 2) whenever x E F ( X ) ( X C_ M), then z E F(E(c)), for some class c with E(c) C_ X;
118
Type Free Abstraction with Approximation Operator
(ii)
[Ch.4
F : ~ P ( M ) ~ ~P(M)is E C L (explicitly CL-continuous)iff F - F I where F I ( X ) "- U { E ( f c) " Cl(c) A E(c) C_ X}; f is called an index for F.
N O T A T I O N . E C L : - s p a c e of explicitly continuous operators (from Z)(M) to ~ ( M ) ) .
ECL-continuous operators are CL-continuous; as soon as we consider the subspace I N D with ECL-operators restricted to I N D , CL-continuity and continuity in the class topology yield the same notion. 19.2. LEMMA (i) Assume that F" ~ ( M ) - - - ~ ( M )
is continuous with respect to the class topology. Then F is CL-continuous. (ii) If F is ECL-continuous, then F is CL-continuous and the restriction of F to I N D is continuous in the class topology relativized to IND. P R O O F . (i)" straightforward with 18.3 (iv). (ii) Let F - F f"
a E F(X)::~ for some class c with E(c) C_ X, a E E(fc), =V there are classes c, d with E(d) C_ E(c) C_ X, a E E ( f d), =:~ for some class c with E(c) C_ X, a E F(E(c)). Monotonicity is also immediate by definition. As to the second claim, if e is a class, f is a index for F and F is restricted to I N D ,
F - i ( U ( e ) n I N D ) - {E(a)" 3b(E(e) C_ E(b) A F(E(a)) - E(b)}; = { E ( a ) ' e C_ U {fc" Cl(c) ^ c C_ a}} (by ECL-continuity); =
where J(e) "- {x" e C_ U { f c" Cl(c) A c C_ x}}. But g(e) is extensional a and hence F - I ( V ( e ) n I N D ) is an RS-family, i.e. open in the relativized class topology by 18.11. [3 We now see that the restrictions of ECL-operators to I N D have the expected representation, as effective counterparts of RS-continuous operators on I N D ; we write F [ P for the function F, restricted to the domain P. 19.3. DEFINITION. An operator F" I N D ~ I N D is effective (in short F E E F F ) iff F ( E ( a ) ) - E(fa), for some extensional 2 f and every a E M. F is "generated by f" and simply denoted by E l ; thus E I ( E ( a ) ) - E ( f a ) .
IV.19]
The Representation Theorem for Ct-continuous Operators
119
E F F will denote the the space of effective operators. 19.4. LEMMA. Assume F E E F F . Then F is RS-continuous and hence CL-continuous in the class topology relativized to I N D . PROOF. Observe that if F = E , f is extensional 2 and b is extensional1, F - l ( { E ( a ) : a E E ( b ) } ) = {E(c): (fc)rIb } and {c: (fc)rIb } is extensional1; then apply 18.12. E! 19.5. DEFINITION.
f*a "- U { f c" c C_a A Cl(c)}.
19.6. LEMMA (i) f* is extensional2; hence E l , E EFF. f* e *a (ii) If f is extensional2, f*a - efa; hence a - (f*) (a arbitrary) (iii) F I - F I , .
PROOF. (i) f* is extensional 2 because f*a depends positively on a. (ii) fa C_f*a is simply the main theorem 17.5, while f*a C_f a follows by C_-monotonicity of extensional 2 operations (17.7). (iii) 9by definition of F f and f*. [3 We now see that the restrictions to I N D of explicitly CL-continuous operators are effective operators; viceversa, each effective operator has its source in a uniquely determined element of ECL. 19.7. DEFINITION (i) If E I E E F F , let C(EI) .-- F I. (ii) If F$ C ECL, let ~(Fi) "-- E I , . 19.8. T H E O R E M (i) Let F y E ECL. Then ~(F f ) E E F F and
$(Fi)- F$[IND(ii)
FI,[IND.
Let f be extensional 2. Then C(EI) E E C L and r
EI.
(iii) Moreover"
if f
(e(Es) ) -ES;
if F$ E ECL, C($(FI) ) - F I.
(,) (**)
PROOF. (i) ~ ( F I ) E E F F by 19.6(i). Moreover, F I ( E ( a ) ) - E ( f * a ) i s immediate by definition of f* and explicit CL-continuity with index f. On the other hand, F y , ( E ( a ) ) - E ( f * * a ) - E(f*a) by 19.6 (ii).
Type Free Abstraction with Approximation Operator
120
(ii) Let G ' - E ( E f ) . Then we have G E E C L e ( E ( a ) ) - E(fa) is a restatement of theorem 17.5. (iii)
Let
EI,-E
F'-EIEEFF:
$(C(F))-Ef,
I by 19.6(ii). Let F s E E C L :
as then
by
C(F)
lemma
[Ch.4 19.2(ii).
has index
C($(FI))-FI,-F
f;
but
I by
19.6 (iii). [3 If F is a monotone operator from ~ ( M ) to ~P(M), let ](F) denote the (set-theoretic) least fixed point of F. Then we obtain the fundamental: 19.9. T H E O R E M ("First Recursion Theorem"). If F I E ECL, then
~(FI)- E(I(f)). PROOF.
Let F ] be ECL: then
a E F$(E(I(f))) =:r O(,Al~)]=Ay(a,I(f))(CL-continuity); =:r O(MI~)I-- arlI(f), i.e. a E E(I(f)) (by fixed point 10.1); hence E ( I ( f ) ) i s F/-closed and ~(FI) C_E(I(f)). On the other hand,
{a E M" (O(.AI~),~(F$))I=A$(a,X)} C_~(FI). But E ( I ( f ) )
is the
theorem of w
C_-least As-closed subset of i
by the induction
hence E(I(f)) C_~(F$). [3
Theorem 19.9 is a completeness result: as far as we consider continuous operators, which are explicitly given via internal maps of the underlying combinatory algebra, the restriction to the subspace I N D is unessential and we are still able to capture all the explicitly "recursive" objects we have in the full space. Theorems 18.11 and 19.9 establish the adequacy of a s y n t a x - t h e language of operations and reflective t r u t h - to the semantics of ECL-opens and ECL-operators. This should add some evidence in favour of the approximation axioms as reasonable choices. 19.10. R E M A R K (i)
Define:
FUN*(c)(X) "- {a E M" for some class d, with E(d) _C X, (d, a) E E(c)}. It is easy to see that {FUN*(c)" c E M} - { F ] ' f E M}; so one has an alternative definition for explicitly CL-continuous operators. Also, if F, G" ~ ( M ) ~ ~(M), F C_G "- F(X) C_G(X) for every X C_ M. Finally, we define:
IV.19]
The Representation Theorem for CL-continuous Operators Vl(c)
" - {F" (F" ~P(M)~ ~ ( M ) ) and
121
FUN*(c) C_F};
then CLF-% "- { V i ( c ) ' c class} is a basis for a topology on {F" F operator from ~ ( M ) to ~(M)}. One checks that ECL and E F F are homeomorphic as function subspaces via $ and C. (ii) Define: Graph+(f) "- {(c,x)" Cl(c) A x~lf c}; Fun+(a) "- )~u.{x" 3y(y C_u A Cl(y) A (y,x)~a)};
a,b "-(Fun+(a))b. Then: if f C_ g, then Graph+(f) C_ Graph+(g); if f is extensional2, then for every a, f a -
e (Graph+(f))*a.
I N D becomes a )~-model if we interpret application via 9 and )~-abstraction via Graph + . (iii) By 17.8.1, the internal fixed point operation I preserves the natural pointwise equality on operation. This suggests the definition of a hierarchy of extensional operations, in analogy with the classical hierarchy of hereditarily effective operations HEO (see Troelstra 1973). One may wonder whether this hierarchy mirrors the corresponding natural