This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
, at most one morphism p5q from p to q. Posets represent a totally subjective conception of data, which identifies the state with the information to hand. A monoid is a category with only one object, only the morphisms and the (total) operation of composition matters. We use them to represent objectively conceptions of data for which we can recognize that future possibilities for data are independent of the information to hand. Some types of restriction on future data compel us to consider separate states to represent the differing data which is acceptable. In these cases an objective viewpoint amounts to being able to juxtapose two states given independently to give a single process. Formally, given two states A and B, there is a state A X B accessible from A and B by morphisms TA nB A -A X BB which are covers and for each pair e: CA and f: DB there is a unique e x f making the diagram commute A q E Q implies ~ E Q . Then Q , s is a propositional language. Models of Q,< are those models m of P such that for each P E P ,X) : Vx(P1 ( p , x ) tf S1 ( q , x ) t+ x E X I . 1 l 1 Then d e f i n e f o r m u l a s ( e ( A r e a l i z e s ) c p ) f o r a l l f o r m u l a s cp o f t h e language o f EA 1 i n such a way t h a t : (i) ,X) )(Al t ,n> ,X)
k
f A
1 C-B
X
3B
C
tx D
e x f
b
I D
Note that, A x B is not a categorical product since we have no pairing in general. The requirement that the “projection“ maps cover says that, we can always introduce a new process independent of that under consideration. 1.3 Definitions. A spread is a subtree S c N4N with every branch N, we say ~ E S infinite: if aES then a*ns.S for some nsN. For a:N+ iff Va. ( m a 4 aES). If S and T are spreads, a neighbourhood function F: S + T is a monotone function such that for each nsN, the set of nodes aaS such that Lth (F(a))zn is an inductive bar of S. Given a s s and F: ST we define F(a) by asa + F(a) E F(a). Spreads represent subsets of 7 8 , neighbourhood functions represent continuous functions. Composition of neighbourhood functions gives the composition of the associated functions. Some functions are canonically represented: in particular, the open inclusion corresponding to a finite sequence e is represented canonically by Xa.e*a (and in many other ways by merely deferring the information); more generally, if f is an open map it has a canonical representation F(a) = A { b I aEf-’(b) 1 . Countable dependent choice and a suitable form of Bar Induction imply that every continuous function has a neighbourhood function. We write B for the universal spread of all sequences. 12 TYPES
OF DATA
The examples which follow should make clearer the translation from the informally rigorous description of a notion of choice sequence to the appropriate site.
M.P. FOURMAN
94
2.1 Open Data. The simplest data we shall consider, open data, consists of finite sequences a of natural numbers. We can construct a sequence a from such data in many ways, the simplest of which is to consider the information thus far received as an initial segment aEa. We have decided in advance that, having received the information a we will treat subsequent data (another finite sequence, b) in a particular way: we concatenate a*b. Thus there are various states which in this example may be identified with the information to hand. Incoming information takes us from one state to another.
Abstractly, we have a category whose objects are the states and whose morphisms represent finite amounts of information. In our present example this structure is represented abstractly as the tree of finite sequences or, more concretely, as the category of basic opens of Baire space and open inclusions between them. Since, to recognize that aEa*n for some nEN it suffices to recognize that aca, we must let { a*n I nEN 3 cover a for each finite sequence a. These covers generate the open cover topology for formal Baire space (see Fourman & Grayson (this volume) ) . Our analysis has merely served to reconstruct the Scott (1968) - Moschovakis (1973) model. From a more objective view of mathematics the distinction between various states seems unjustified: it portrays the activity of a particular idealized mathematician rather than the mathematics which results from reflection on the general nature of such activity. A more satisfactory model (from this point of view) is given by the monoid of finite sequences. We can picture this concretely as the monoid of neighbourhood functions canonically representing open inclusions. Again the appropriate topology is the open cover topology. This model corresponds to the liberation of the idealized mathematician: realizing her situation, she can transcend it and is free b?
.
-
This conception of open data allows that all possible data can be coded up in a single choice sequence. 2.2 Independent Open Data. We modify our model to consider not a single generating process but a potentially infinite collection. It is essential to distinguish this from a potentially infinite sequence of processes, which we could code as a single choice sequence. The force of this distinction is that, at any stage, the information we have is just the collection of initial segments to hand. They are not taken in any particular order.
The subjective states for this notion consist of finitely much information about finitely many sequences. Concretely we represent such a state by a basic open U c B n modulo any action by a permutation of n.
Notions of choice sequence
95
Actually it is more convenient to consider basic opens as states. At any stage we may introduce finitely many independent generating processes as well as obtaining more information about those already considered. We represent such information by a map
u-v which is induced by the projection corresponding to some injection n r+ m. The morphisms induced by permutations of n have the effect of identifying states which represent different orderings of the same collection. In addition to allowing open covers as before, we stipulate that the projection
u
ni
-
Bm-
T(U)
ni
Bn
is a cover. This reflects the possibility of adding finitely many independent processes to any discussion. In general, a family of morphisms covers iff the union of the images is an (open) cover of V. All the morphisms here are open maps and we shall later consider them as represented canonically by neighbourhood functions. Again, we have arrived at a well-known model: according to Hyland (personal communication), the forcing definition for this model corresponds to the Kreisel-Troelstra elimination of lawless sequences. more objective representation of this type of data is obtained by identifying states in which the same number of generating processes are considered. The site we use to represent this type of data has as objects, the various Bn, and as morphisms, compositions of projections Bm-Bn induced by n-m and open inclusions Bn-Bn induced by n finite sequences. Once more, all the morphisms are open maps canonically represented by neighbourhood functions and we use the topology in which a family of morphisms covers iff its images cover.
A
2.3 Lawless Data. This conception of*data was motivated by the following passage from Troelstra (CS p. 16) : "Suppose we have started two lawless sequences a and 0, alternately selecting values: a0, 00, al, 01, 1x2, 02, Now we may also regard this as a single process y , with y(2n) = an, y(2n+l) = On. However, we cannot regard cx,B,y as all being lawless within the same context: either we have to decide a and 0 to be lawless, and then y is a sequence which is not itself lawless .; or we consider y as lawless, inwhich case a,B are sequences (not lawless ones) constructed from y."
... .
.. .
..
This discussion cannot be expressed in the Kreisel-Troelstra formalisation of choice sequences. This is because, their notion of lawlessness is not an objective one. In our previous example, all the states are, in fact, remarkably similar: Bn is homeomorphic to B. Essentially, the differences between the states arise because we have chosen a coding B Bn in term of which we choose which maps to put in our category. We now take the point of view that different codings
MP. FOURMAN
96
simply reflect different ways of considering the same reality. Thus the controversy as to which of a, B and y are lawless, in our example above, arises from the difference in viewpoint formalized by the pairing B = B x B. We now consider an abstract view of the same kind of data, which is independent of such codings. We call this lawless data, it consists of those endomorphisms e: B + B which can be decomposed as "projections modulo some coding": e = j-1.r,i for some homeomorphisms i and j.
Bm& UI
Bn UI
u-v i\ B
4
A s usual, all our morphisms are open maps and we use the topology in which surjective families cover.
We shall see that lawless sequences for this conception of data behave more sociably than is traditional. For example, two views of the world may at some stage turn out to be the same so equality is not decidable. To formalize our discussion of this type of lawlessness, we shall introduce a notion of independence: basically, a and B are independently lawless iff y = < a , % >is lawless. Returning to Troelstra's example, a, B and y are lawless a and 4 are independent and y is independent of neither of them. 2.4 Spread Data. Here we attempt to formalize Brouwer's description of the generation of a free choice sequence.
...
" the freedom of proceeding, without being completely abolished, may at some time p, undergo some restriction, and later on further restrictions. " Brouwer (Cambridge p. 13)
The restrictions discussed by Brouwer demand that future choices belong to some spread. Spreads correspond to certain sublocales of B. We consider such sublocales F s Bn and morphisms between them induced by projections. We take as covers projections and open covers. This gives us (in this example) the topology in which a family covers iff the interiors of its images cover. This topology involves no new insights, many stronger topologies (more covers) are conceivable: It is certainly plausible that we might justify the conclusion that every member of a spread S belongs to one of the spreads Ti without showing that the interiors of the Ti cover S , by appealing to particular properties of S. This would be reflected in our models by adopting a stronger topology. What we will show is that it is consistent to assume that the only covers are those we have built into the definition of the topology. The main insights justified by this conception of data are the relativisation of V a 3 % choice and continuity for lawless a to lawless elements of some spread and the extension of Bar Induction to give induction over arbitrary spreads. Brouwer's conception of choice sequence has been criticizad for not
Notions of choice sequence
97
b e i n g c l o s e d u n d e r c o n t i n u o u s o p e r a t i o n s . The s p r e a d s w e have i n t r o duced a r e b l a n k o r naked s p r e a d s , which, f o r Brouwer, s i m p l y p r o v i d e a framework f o r t h e g e n e r a t i o n o f m a t h e m a t i c a l e n t i t i e s . By a t t a c h i n g In " f i g u r e s " t o some nodes of a s p r e a d S w e p r o d u c e new o b j e c t s . p a r t i c u l a r , any neighbourhood f u n c t i o n F: S + T p r o d u c e s f o r e a c h c h o i c e s e q u e n c e a€S a s e q u e n c e F ( ~ ) E T . The i n f i n i t e s e q u e n c e s gene r a t e d i n t h i s way a r e c l e a r l y c l o s e d u n d e r t h o s e c o n t i n u o u s o p e r a t i o n s which have neighbourhood f u n c t i o n s . We s h a l l s e e t h a t ( i n o u r models) a l l l a w l i k e f u n c t i o n s have neighbourhood f u n c t i o n s . F u r t h e r more u s i n g s u c h d r e s s e d s p r e a d s ( w i t h S E < S , F > i n t e r p r e t e d a s , f o r some ~ E S , 5 = F ( a ) ) , we s h a l l see t h a t an axiom of " s p r e a d d a t a " i s v a l i d f o r t h e s e sequences. 2 . 5 Continuous d a t a . W e s t a r t from B r o u w e r ' s 1933 d e s c r i p t i o n of a d r e s s e d s p r e a d a s r e p o r t e d by van Dalen (Cambridge p . 1 7 1 . Here A g e n e r a t e s a l a w l e s s sequence and B a p p l i e s t o it a neighbourhood f u n c t i o n t o o b t a i n a s e q u e n c e F ( a ) a s d e s c r i b e d e a r l i e r . W e modify t h i s p i c t u r e by no l o n g e r r e q u i r i n g t h a t A ' s sequence b e l a w l e s s : it may i n f a c t b e g e n e r a t e d a s a c o n t i n u o u s f u n c t i o n of some sequence g e n e r a t e d by X who, i n t u r n , r e f e r s t o Y , and s o on. W e r e q u i r e t h a t a l t h o u g h t h i s c h a i n of dependence may b e p o t e n t i a l l y i n f i n i t e , a l l t h a t B c a n be aware of a t any g i v e n s t a g e i s a f i n i t e c h a i n of dep e n d e n c i e s , r e s u l t i n g i n t h e knowledge t h a t B = r ( a ) f o r some n g e n e r a t e d by someone down t h e l i n e , and some neighbourhood f u n c t i o n
r.
We r e p r e s e n t s u c h d a t a by a neighbourhood f u n c t i o n r : S + T between s p r e a a s . Note t h a t , a l t h o u g h i n p r i n c i p l e w e s h o u l d want t o c o n s i d e r dependence on more t h a n one s e q u e n c e , s u c h d a t a r e d u c e s t o dependence We g i v e t h i s on a s i n g l e s e q u e n c e by means o f t h e p a i r i n g B x B c. B. c a t e g o r y t h e "open c o v e r t o p o l o g y " i n which t h e c a n o n i c a l r e p r e s e n t a t i v e s of a c o v e r i n g f a m i l y of open i n c l u s i o n s form a c o v e r . Of a l l our models w e b e l i e v e t h a t t h i s one b e s t r e p r e s e n t s t h e n o t i o n of c h o i c e s e q u e n c e . N e v e r t h e l e s s , w e d i s c u s s two v a r i a n t s . F i r s t l y , i f w e a r e concerned o n l y w i t h e x t e n s i o n a l p r o p e r t i e s , w e can use c o n t i n u o u s f u n c t i o n s i n p l a c e of neighbourhood f u n c t i o n s . Secondly, i f i n s t e a d of u s i n g a r b i t r a r y s p r e a d s w e c o n s i d e r t h e monoid of c o n t i n u o u s f u n c t i o n s B + B , w i t h t h e open c o v e r t o p o l o g y , w e o b t a i n a model f o r Kreisel and T r o e l s t r a ' s t h e o r y C S . ( T h i s was observed i n d e p e n d e n t l y by Moerdijk & van d e r Hoeven ( 1 9 8 1 ) , Grayson ( 1 9 8 1 ) and t h e a u t h o r ( 1 9 8 1 ) ) . The f o r c i n g d e f i n i t i o n f o r t h i s model c o r r e s p o n d s t o t h e e l i m i n a t i o n mapping f o r c h o i c e s e q u e n c e s of Kreisel and T r o e l s t r a ( 1 9 7 0 ) . I n t h e s e models w e v e r i f y f u l l V a 3 B c h o i c e and c o n t i n u i t y p r i n c i ples. The a d v a n t a g e of t h e e x t e n d e d model i n which w e a l l o w a r b i t r a r y s p r e a d s as domains i s t o j u s t i f y r e s t r i c t e d v e r s i o n s of t h e s e and e x t e n d e d Bar I n d u c t i o n a s f o r s p r e a d d a t a . 2.6. O t h e r t y p e s of d a t a . I n o u r p a p e r C o n t i n u o u s T r u t h (1982) we c o n s i d e r more g e n e r a l t y p e s of d a t a ; i n p a r t i c u l a r , d a t a r e p r e s e n t e d by c o n t i n u o u s maps between opens of Rn. W e a l s o g i v e a g e n e r a l t r e a t ment of t h e " e l i m i n a t i o n mappings" a s s o c i a t e d w i t h e a c h t y p e of d a t a and t h e r e l a t i o n s h i p s between v a r i o u s t y p e s of d a t a m e d i a t e d by geometric morphisms between t h e c o r r e s p o n d i n g t o p o i .
98
M.P. FOURMAN
13 NON-CONSTRUCTIVE OBJECTS
We now embark on the analysis promised in 2.1. An understanding of a collection of objects is merely an understanding of what it is to be presented with such an object and of what it is to show that two such objects are equal. This does not automatically give rise to a determinate collection of predicaterrather we must introduce predicates by explicitly giving their meanings. Other predicates may, of course, be compounded from ones previously understood using the logical connectives. We suppose the meanings of statements involving lawlike parameters, quantification over lawlike objects and the meanings of the logical connectives applied to such statements, to be understood. Traditionally, an explanation is given in terms of an informal notion of construction (for example, Dummett (Elements p . 12ff.)). Our explaination of the meaning of statements involving non-constructive objects is independent of this (and, to a large extent, of its results), similar to it in form, and different from it in content. The meaning of a statement involving non-constructive objects is given in terms of a constructive understanding of which items of data justify a given assertion. 3.1 Non-constructive Objects. Our archetype is given by Brouwer's notion of a dressed spread: A partial function $ assigning lawlike objects to the nodes of some spread S. The idea is that any choice sequence a of the spread S generates successive approximations, $(a) for aca, to a non-constructive object $ ( a ) . Abstractlv, we assume that the constructive objects @(a) have a preorder, x < y if x contains "more information" than y, and that $ is monotone, a 5 implies that $(a) c$(b). For example, any neighbourhood function F represents such a non-constructive object 5 in that it savs what information F(a) about 5 can be justified on the basis of the data ad3. Once the data e has been assimilated, further data will be treated differently; then,on the basis of data a, we may justify @(eCa)). The assimilation o f h e data e causes us to change our renresentation of 5 : we call this change restriction along e and use $.e to represent$le, as (@.e) (a) = $(e(a)). This is why data should be represented concretely by neighbouxhood functions. In general then, a non-constructive object given in state U is (represented by) a monotone map 5 : U + P where P is some partiallyordered domain of lawlike objects, and the assimilation of data is represented by composition of functions. Abstractly, the non-constructive objects based on a given poset of lawlike objects form a presheaf. (For more examples of suitable domains of lawlike objects, see Fourman & Grayson (this volume).) Constructive objects are represented by themselves, as sections of constant presheaves. 3.2 Meaning. For a mathematician in state U, the meaning of a statement @ involving non-constructive parameters is given by saying which We write this relation ell- $ and write items of data e 'ustif definition is inductive. UII- $ for <>(I-
@.
Firstly, we have two basic properties of this notion of justification: if K is a cover of
u and ell- $for each ecK, then
if VII- @le then ell- $ where e: V
+ U
UII-
$
,
and @le is the result of restricting each parameter
,
Notions of choice sequence
99
Secondly, we give the meaning of basic (atomic) predicates. The basic statements we may make concerning non-constructive objects are few (two): intensional equality: if ale = Ole then el1-a-B finite information: if a(e(<>))z p then ell-acp For basic predicates involving only constructive parameters, if $ then ell-$. Finally, we explain the meanings of the logical connectives: A if Ull-$ and 1l-i then \ l - $ ~ I j l V if Uli-$ or /I-$ then /I-$ v Ijl 3
+ V
1
if Ull-$(a) then UII- sx.$(x) if for all e, if ell-$ then ell-$, then Ull-$ +$ if for all e: V +U and each 5 given at V we have Vll-$le(a), then U / I - VX.$(X) is never explicitly justified, although it may become s o at some nodes by virtue of the general clauses above (this eventuality does not arise in our present models).
We claim that this definition reflects the intended meaning of statements involving non-constructive parameters. It coincides with the standard forcing definition for sites. We also define quantification over independently generated free choice sequences: for e: V +B. if UxV/I-$lnl(el.rr2)then U(I-FclEe.4 if UxWII-$lnl( B ~ I T ~then ) UII- ?ase.$ (for any 8: W + B which factors through e) (In 9 3 . 4 we see how to regard e in general as a subset of 78 . ) 3 . 2 . 1 Lemma.
1) fll-$Ie iff e*fll-$ if ell-$ then e*f IF$ 3 ) ell-$ iff $, if $ has no non-constructive parameters or quantifiers. 2)
3 . 3 Basic Types. We have represented non-constructive objects abstractly as (local) sections of certain separated presheaves. We now see that this representation gives us the higher types defined formally in sheaf models. To save space we then treat these models more or less formally. We ask the reader to bear in mind that the models are intended to reflect the meaning of non-constructive mathematics as well as its formalism.
3.3.1 Lemma. If F, G: U T represent non-constructive objects at U then iff F is a neighourhood function UII- F E NN Ull- F = G iff F and G represent the same function -+
Where = is extensional equality. In any sheaf model the discrete spaces N and N < N are represented by constant presheaves. In our present models, the (set of points of) Baire space is represented by the separated presheaf of continuous
M.P. FOURMAN
100
Baire - valued functions (see CT). Thus the non-constructive sequences we have defined correspond extensionally to the abstract sequencesgivenby the higher-order logic in sheaf models, The presheaf IB (U) 2 (U,NGN) of neighbourhood functions represents Baire space intensionally. The representable presheaf 0 (U) 5 IB (U) represents the free choice sequences for the notion of data concerned. The idea is that nothing more is known of them than can be given directly by data. Non-constructive objects are represented extensionally as continuous maps to formal spaces (see Fourman & Grayson). Restriction is given by composition. The basic predicates are given by equality if ale = a l e then ell-a = B finite information if (aIe)-’(p) = T then ell-acp. For consideration of extensional properties it suffices to consider our sites extensionally as categories of continuous maps. 3.4 Lawlike Objects In general, we think of constant presheaves as representing lawlike objects. In most sheaf models there is no canonical way in which to define “the“ collection of lawlike elements of a given sheaf. In our present models we define the collection of lawlike elements of a sheaf X to be the subsheaf L(X)EX generated by global sections of X. We claim that L(X) is a constant sheaf: Suppose a and b are global sections if A //- a=b then AXB 11- a=b whence B I/- a=b (as projections are covers). (For monoid models of course the topology is irrelevant and we always have a notion of “lawlike“ given in this way.) Of course, the discrete spaces N and NCN are lawlike. We now give some other examples: 3.4.1. The lawlike elements of B a r e given by the constant functions in B (u), which are canonical representatives of the constant functions
.
3.4.2. The collection Kx of lawlike operations the Yoneda Lemma: r(K,) = X(B) with the action
0
-t
X is given by
F I ~
u 11- F(c.) 5 iff = 5 Note that these are given intensionally. However, every lawlike operation with non-constructive objects as values is given as a neighbourhood function and thus acts extensionally. 3.4.3. Lawlike data; Morphisms with codomain B may be viewed as subobjects of B as follows: For e: U -c B and 5 : V -+ B if 5 factors through e then V (I- Cce In each model tce is in fact definable: e may be viewed as an element Fe of KU and v (I- vg.(tce++ ~c.E;.F,(~) = 5). (Where g is the representable presheaf.) If u: u w B is monic then CcX(U) may be viewed as a lawlike function defined for all C ~ E Uby U IF F (ulB1 = 5 1 B .
101
Notions of choice sequence
14 P R O P E R T I E S OF THE MODELS All sheaf models provide interpretations of HAH. These ones have special properties. We view this as justifying certain intuitionistic principles on the basis of particular conceptions of data. We assume choice principles for lawlike objects, (which is constructively unexceptionable). This allows us to reduce existence on a cover of U to existence on U itself for lawlike objects (as every open cover of U has a disjoint clopen refinement). For continuous data, existence on a cover always reduces to existence on U, as covering families of monomorphismsgenerate the topology. Below, choice use x, €,ELto
5 , 5 range over non-constructive objects, a, 0 , y over free sequences, e, f over data a, b overB and n-.m over N. We y a s variables for lawlike objects in general, and write signify that €, is lawlike.
4.1 Choice Principles. We obtain countable lawlike choice with non-constructive parameters. ACN*
l k v A(
V
n 3 x.A(n,x)
-t
3 f Vn.A(n,f (n)))
.
From the remarks above, this is standard. For continuous data, the same proof gives 3 f Vn.A(n,f(n))). ACN&* /I-VA(Vn>€,.A(n,€,) It is perhaps surprising that for open data (for example) this is not justified. As 8 is representable, we obtain, for those models in yhich projections are covers, forms of V a 3 x choice: AC& 11- vAEL(VaEU.3X.A(a, X) -+3fEL.VaEu.A(a,f(x))) ACB* \k V A ( yclEU.3X.A(a,X) 3 y 3 f E L F U E U . A ( U , f ( U , y ) ) ) -+
+
For AC& , suppose A is lawlike and U Va3xA(a,x), then E X(B). This UxB IF V a3x.A(a,x) whence B It A(id,a) for some a re resents the required function as in 3 . 4 . For A m * if UxV TF 3 x.Al'iT1 (ulap,x) then UxV IF Alal (ul'rrl,a)for some a E X(UXV). Now introduce parameters 7 for U and view a as a function of these and a m as in 3 . 4 . Note that, for continuous data, and V coincide. For continuous data, the same proofs give V a 3 J 5 choice principles: AC06 IF VAEL( V ~ E U , L ~ ~ . A ( ~ , E ) 3 FEL V ~ E U . A ( ~ , F ( ~ ) ) ) AcB~* 11- VA(V ~EU.LIE.A(~,S) 3 FEL. 3 7 . v ~ E u . A ( ~ , F ( ~ , ~ ) ) ) -+
-+
Forthemonoid model for continuous data,in which we do not allow restrictions to arbitrary spreads, we obtain a stronger form: -+3fEL.Va.A(a, F(a))) ACbb**))-VA('VdE.A(a, 5 ) Suppose BII- va3E.A(a, €,) then BII- A(id, E ) , for some SEX(B) which represents the required function.
U In each case above, we may replace V a by V ai,...an and Y ~ E by. anLun and obtain the corresponding choice principles with Ea1Eu1, the same proofs. The same remark applies to our principles below.
...,
4.2
Continuity Principles.
Data. -
The first principle,we call Existence of
M.P. FOURMAN
102
Given aE M(U) with UlI-A(a), view a as an element of D to justify ED. We also obtain a stronger form for data in which independent generating processes may be introduced: ED* 1)- " _ i , , ,Up(A(Ui ,. ,Up) + 3 Ui,. ,Up
..
..
..
..
cliEUi hy'BiE~1,. ,BpEUp.A(Ei ,. . .'Bp))) up) where W is a basic open and the ui Suppose BPxU WxVIl-Ala(ul, are components of the inclusion. These Ui do the trick: WxWxVII-A(ul,. ,up) as the two possible orders for considering W are isomorphic. ( M
...,
..
:'he second general principle is that every lawlike functicn defined on 0 is given by a neighbourhood function. We have already see (3.4) that elements of B (B) represent lawlike functions. Ey 3.2.1.(3) these nay also be viewed as neighbourhood functions in the model. The application defined in 3.4 is just standard application of neighbourhood functions carried out internally. Thus, K
11-
VFEL: 8
+
B
.
"F
is given by a neighbourhood function."
The same remark holds for functions to other non-constructive domains and for those defined on subspaces of 63 given by monic data u. Note that the F above are a priori given intensionally, it is a consequence of K that they act extensionally. This remark is not deep, it shows how little intensional information we have taken into account. We finish this section with the remark that all objects are lawlike functions of a finite number of free choice parameters U I ~ V E ~ ~ ~ a1F ,..., E Lan.S . ~ = F(a1 an) (U is for Uniformization).
,...,
.
This enables us to make good an earlier promise. Dressed spread data holds in all our models as a consequence of the existence of data for free sequences because if 3?X,F.S = F ( E ) then for any A we have A(S)++A(F(a)).
4.3 Erouwer's Dogma of Bar Induction is also built into our models. We show that IF V K C N < N (K monotone A K inductive + (Va3nEK.aEn -+ < > EK)) Note that K is not required to be lawlike. Suppose that Ull- "K is a monotone, inductive bar". Consider IK = {
~ ~persistence m, of forcing so Now UxB l l - V m ~ K l ~ ~ . nby M * = { < ~ , n >I Vxn 11- ZE ~ 1 A I~ T -1~ for E ~ some rnl covers UXB. But IK * ,C IK because Vxn 11- mE Klal iff V 11- mEK as projections cover and Vxn 11- n 2 e m iff n 7m. Thus we are done. Clearly, the same proof justifies bar induction over any spread which occurs as a state in our representation of data. 4 . 4 Equality. We begin by considering open data, which models the theory LS, lawless data and spread data, which give another kind of lawlessness. For all of these, extensional and intensional equality
103
Notions of choice sequence
-
coincide : ll-.'dct,R
( a =B
a:
a).
The major difference between them is that, for open data free sequences have decidable equality
11- V a , B ( a = R v l a = 0 ) Whereas for lawless and spread data, 11- 1 V a , B ( a = R v l a = B ) In these models we can represent the notion of non-constructive objects generated by independent processes. Given XEX(U) and YEY(V) let uxv 11- XlTl YITZ "x is independent of y". W with Then W 11- x $ y iff locally there is a cover p: UXV xjp = xlnl and y1p = yqliz for some X E X(U) and YE Y(V).
.
+
-f
For free sequences, independence is definable: 11- v a , B ( a $ B ++ l a = B ) for subjective open data, 11- v a,B ( a R ++ 3 y . y = < a , B > ) for lawless and spread data. Note that for other types of data such a predicate becomes trivial since a priori independent processes might later be found to be related.
z,
For these types of data, the quantifiers 3 satisfy the axioms and rules given by Troelstra ( C S , p. 35). They have the effect of quantifying over lawless sequences generated by processes independent of any under consideration 11- 1 a1 r r an( r * * tan)) For lawlike predicates we have
---
I~VAEL
(EE.A(CL)
+
-
++VE
($(z)+ A(G)))
Thus ED* coincides with the usual form of open data. We conclude our discussion of these variations on open data by listing some simple properties whose verification is left to the reader. Free sequences are dense. 11- v a 3 a.aEa ) sequences are very dense. (I-V'lVCi( 7 S = a + 5 ~ ~ 1Free For open and lawless data, we also have, Free sequences are not lawlike. 11- V a . l a € L For continuous data, extensional and intensional equality do not coincide 11- 3 c1,a ( C Y = B A B) every sequence is free 11- v 6 3 a . c : c1 4 . 5 Identification of Data. All the data we have used is given by neighbourhood functions. As we remarked in 4 . 2 , these just act internally as lawlike neighbourhood functions. Thus data is given in general as analytic data with a class of functions restricted appropriately for each notion of data. For open and lawless data, this reduces internally to open data. For spread data it is just spread
104
M.P. FOURMAN
data in the tradional sense. For continuous data it is analytic data. We know the internal and external characterization coincide by 3-2.1 (3)- For each type of data, we have the property of density D ik VeeD. 3 a.aee , triviaily, as c1 can be taken equal to e.
55
CONCLUDING REMARKS
5.1 Metatheory. We have been somewhat cavalier in our use of higher types. In particular, we have stated many principles in universally quantified form, using quantifiers which are constructively unacceptable. The corresponding schemata may be justified by our methods using a metatheory equivalent to IDB (CS p. 31). For a discussion of this see v.d. Hoeven & Moerdijk (1982). 5.2 The Other Kind of Lawlessness.
The model we presented at the Brouwer Symposium, we now view as ad hoc. We considered the monoid of local homeomorphisms of Baire space with the open cover topology, and picked out a domain of "lawless sequences" represented by the local projections. We now view the lawless data presented in 2.3 as a better representation of the notion we had in mind. The free sequences for this notion of data have all the properties we mentioned in our abstract.
5 . 3 Other Models. Once this project was well-advanced, the author
realized that few of the ideas here are really new. The elimination translations of Kreisel and Troelstra coincide with our models for LS (open data) and CS (continuous data) as remarked above. Thus, it cannot be said that there is anything more than a difference in viewpoint distinguishing our approach. More concretely, Dragalin (1974) uses essentially the same ideas as us to construct essentailly the same type of model. We hopethat the presentation of these ideas as sheaf models will at least aid progress by providing a mathematically apt setting fox comparing various notions of choice sequence. It is on the level of philosophical analysis that we hope to have provided something novel. For example, we claim that the verification of the axioms of CS in the monoid model for continuous data, provides an adequate conceptual basis for these axioms: acoherent notion of choice sequence and a verification of the axioms based on this notion. 5 . 4 Acknowledgements. Dana Scott's suggestion, made while discussing an early version of CT, that I consider lawless sequences as abstractly "generic" elements in sheaf models, led to the present paper. I am also grateful to Michael Dummett: both for his lectures which introduced me to intuitionism, and for helpful comments on an earlier draught of this paper. I hope his influence is discernible. I wish to thank Dirk van Dalen and Anne Troelstra for their lectures at Oxford while I was a student, their encouragement and hospitality during many visits to the Netherlands, and a most stimulating conference. Finally, I wish to thank the ZWO and the NSF for their financial support.
Notions of choice sequence
105
REFERENCES
Brouwer, L.E.J., (Cambridge), Brouwer's Cambridge Lectures on Intuitionism, van Dalen, D., ed.(Cambridge Univ. Press, Cambridge 1981). van Dalen, D., An interpretation of intuitionistic analysis, Ann. Math. Logic (1978) 1-43. Diaconescu, R., Change of base for toposes with generators, Journal of Pure and Applied Algebra 5 (1976) 191-218. Dummett, M., (Elements), Elements of Intuitionism (Oxford Univ. Press, Oxford, 1978). Dragalin, A.G., Constructive models for theories of intuitionistic choice sequences, in: Investigations on formalised languages and non-classical logics (Nauka, Moscow, 1974) 214252 (in Russian). Fourman, M.P., (1981) A model for the theory of choice sequences (CS) (abstract), Amer. Math. SOC. Abstracts, to appear. (1982) Continuous Truth, in preparation (abstract, Amer. Math. SOC. Abstracts 2. (1981) 282). - & Grayson, R.J., Formal Spaces, this volume. Grayson, R.J., A sheaf model for choice sequences, manuscript, Mtinster, 1981. van der Hoeven, G.F. & Moerdijk, I., Sheaf models for choice sequences, to appear. Johnstone, P.T., Topos Theory (Acad. Press, London,1977). Kock, A., Synthetic Differential Geometry, London Math. SOC. Lecture Notes =(Cambridge Univ. Press, Cambridge, 1981). Kreisel, G., Lawless sequences of natural numbers, Comp. Math. 2 (1968) 222-248. - & Troelstra, A., Formal systems for some branches of intuitionistic analysis, Annals of Math. Logic 1. (1970) 229-387. Makkai, M. & Reyes, G., First Order Categorical Logic, Lecture Notes in Math. 611 (Springer-Verlag,Heidelberg, 1977). Moschovakis, J.R., A topological interpretation of second order 26 (1970) 261-275, intuitionistic arithmetic, Comp. Math. Scott, D.S., Extending the topological interpretation to intuitionistic analysis, Comp. Math. 2 (1968) 194-210. Tierney, M., Forcing topologies and classifying topoi, in: Heller, A . & Tierney, M. eds., Algebra, Topology and Category Theory: a collection of papers in honor of Samuel Eilenberg (Acad. Press, New York, 1976) 211-219. Troelstra, A., (CS), Choice Sequences, A chapter of intuitionistic mathematics (Oxford Univ. Press, Oxford, 1977).
THE L.E.J. BROUWER CENTENARYSYWOSILM A S . Troelrtra and D. van Dalen (editors) 0 North-Holhnd Publishing Company,1982
107
FORMAL SPACES M.P. Fourman Dept. of Mathematics, Columbia University, New York, NY 1 0 0 2 7 , U.S.A. R.J. Grayson* Inst. fur mathematische Logik und Grundlagenforschung, EinsteinstraBe 64, 4400 Munster, West Germany Infinitary geometric propositional theories are axiomatisations of frames (complete Heyting algebras). Working in the dual category of locales gives rise to the notion of formal space of a theory. This formal space has enough points to distinguish its opens iff the theory is complete. Completeness of the theories of (formal) Baire space, Cantor space and real numbers is equivalent constructively to Bar Induction, the Fan Theorem and compactness of the unit interval. A proof of completeness for countable theories may be viewed geometrically as a covering theorem for separable locales by formal Baire space.
PREAMBLE This paper is an exercise in geometric logic. Treating intuitionistic logic algebraically leads to frames or complete Heyting algebras which are to intuitionistic logic as complete Boolean algebras are to classical logic. Formally "reversing the arrows" gives the dual category of locales, which are thought of as geometric objects or "generalised spaces". These arose from the observation that much of (classical) pointset topology may be expressed in terms of the frame of open subsets of a space, without mention of points. (The literature on locales is now considerable; Johnstone ( 1 9 8 2 ) gives a comprehensive bibliography.) Joyal has pointed out that locales may be viewed as spaces of models for certain propositional theories; these formal spaces are a simple example of the presentation-invariant view of theories as geometric objects which has long been espoused by Lawvere. Our primary concern, however, is with the interplay between presentations of a theory and properties of its formal space, especially with respect to the existence of points, that is, models of the theory. Locales are generalised spaces because they may fail to have points (to distinguish the open sets); from the logical point of view this happens precisely because consistent theories may not have enough (or any) models (even classically, as our logic is infinitary). Formal spaces which classically have enough points may fail to do so constructively. For example, the statement that formal Baire space has enough points is equivalent to a form of Bar Induction, BI. A standard proof that countably axiomatised theories in countable languages are complete (have enough models) may be viewed geometric-
*
Research Fellow of the Alexander von Humboldt-Foundation
M.P. FOURMAN, R.J. GRAYSON
108
ally as constructing an open cover of the corresponding countably presented formal space by a sublocale of formal Baire space. If this sublocale has enough points (a form of Bar Induction) then the theory is complete. From a logical viewpoint we prove various completeness theorems which rely oncertain induction principles. Geometrically we prove, constructively, localic versions of classical covering theorems of general topology. In the presence of induction principles which ensure that our fundamental spaces have enough points, we obtain constructive proofs of the classical theorems for topological spaces. In Fourman and Scott (1979) complete Heyting algebras are used naively as domains of truth-values for modelling intuitionistic higherorder logic. In the interpretation over the formal space of a theory we get a generic model for the theory, giving a systematic way of constructing models in contrast to the ad hoc methods of Fourman and Hyland (1979 )
.
This paper has had a long gestation. Our thoughts have been influenced by Martin Hyland and Dana Scott who have been very patient. The idea of viewing locales as geometric representations of theories is due to Andri? Joyal, whose influence on this paper has also been considerable.
5 1
THEORIES AND MODELS
We begin with an abstract version of propositional logic which corresponds to presentations of locales ( 2 . 3 ) . We shall show by examples how this subsumes and is covered by more traditional syntactic presentations. 1.1 Definitions. A propositional language P , g is a preordered set of formulae with conditional finite meets: if a finite set of formulae has a lower bound then it has a greatest lower bound, in particular, if ! I is J inhabited then it has greatest element T .
PSP
piqsr psr
PST
r r p and r s q rsPAq
preorder rules A-rules
In the A-rule (and always) we interpret mention of p A q strictly (as in Fourman & Scott (1977)), to imply that p A q exists. We say p and q are compatible iff p A q exists. The meaning of such a language will be given in terms of truth. We consider sequents $ * r where $ , T F P and @ i s finite. If m c P is some collection of "true" formulae, we say $ * r is valid in m, @kmr, iff $ G m implies there is some q E r Om. A sequent @ * r should thus be viewed as asserting that M $ implies V r (a finite conjunction of formulae implies an arbitrary disjunction). We shall often write sequents more legibly using these notional conjunctions and disjunctions explicitly. In particular we use 1, "false" , for the empty disjunction. A model of P,< is a subset m of P which forms a filter: in terms of
109
Formal spaces
va 1idity :
P bm q
if P < q
‘=m PI9
km
P Aq.
(The latter clause means: if p,q E m then p hq exists and is in m.) , transWe may also phrase this in terms of truth-values in ~ ( l ) the lation being given by: *€[[pll iff p E m
.
The conditions become
13 c “sll if P _
“P
Later we generalize this definition using other lattices of truthvalues. We give some examples of languages and sequents.
1.2 Examples. 1 ) Syntactic languages. Let P be a set of propositional letters. We take as P the collection of finite subsets of P (viewed as formal conjunctions) ordered by reverse inc1usion:psq iff p a q . This is the traditional notion of propositional language with conjunction. A model is simply an assignment of truth values for which [[p A q]] = Tiff [[PI] = T and “q]] =T, and “TI1 =T; it is of course determined once we know which propositional letters(sing1etons) are true. 2 ) Trees. L e t T be a tree (growing downwards), A model of T is a branch: a linearly ordered subsetl with a t b E m implies a E m , and T Em. This branch is infinite iff a i=,V{blb is an immediate successor of a} for each a € g . 3 ) Function spaces. If A and B are sets let P be the set of partial functions p: A- B with finite domain, ordered (again) by the principle of “more (information) is less (variation)”: p s q iff p a q . A model m of tp is a partial function F: A- B: Let p e m iff p c F . F is total iff TkmVI I b E B} for each a € A F is
F is
1-1 iff for all a,a’,b ,Fmv{TI a=a’) onto
iff
T bmV{
for each b EB.
The effect of the second axiom could be obtained by considering in place of P the collection P ‘ of 1-1 partial functions with finite domain. 4 ) The reals. Let [p = { (p,q)l p < q an: p,qEQ* = Q u { - m , + m } } ordered by (p,q) < (p’,q’)iff p’ < p and q s q I the poset of proper rational intervals. A model m of tp corresponds to a disjoint pair of sets L , U c Q l which are closed downwards, respectively,upwards,with
110
M.P. FOURMAN, R.J. GRAYSON
r E L iff (r,m) E m and r E U iff (-m,r) Em. These sets are open and inhabited iff (p,q) k,VI(p',q') Ip
-.
P
F,VITIPEQ1
.
.
We note that we need really only consider sequents a singleton since, for example, p,q km r iff, if p h q exists, then p h q We now axiomatise the logic of such sequents.
4J-r where $ i s
Fm r.
1.3 Definition. An entailment relation 11-is a collection of sequents closed under the following rules (writing p 11- r for "p * r is in II- " ) :
P 11-9
Pltr
if P _ < 4 if r c A
P Il-A
P ii-r P hq 1l-r hq p 11- r {q 11- A 1q
( localisation)
E
r}
(composition)
PIC A 1.4 Examples. 1 ) Grothendieck topologies. The axioms we have given are equivalent to those for a Grothendieck topology on P, so we will speak interchangeably of entailments and topologies: in topological language p1l-T is read as " r covers p". 2 ) Provability. A theory is any set of sequents. Any theory T generates a least entailment t~ containing T, obtained by closing T off under the rules. We define pkTr iff every entailment containing T contains p* r If p t T r w e may also say that p* r is provable in T. Every entailment I- arises in this way simply by setting T = I - , but we are interested in presentations or axiomatisations of entailments by "simple" theories (e.g. countable ones, for the completeness Theorem 3 . 1 1 ) . 3) Semantic entailment. A model m (of P) is a model of a theory T , written F T, iff each sequent in T i s valid in m. Semantic entailment k T it given by
.
p kT!? iff p km rfor every model m of T. This is an entailment containing T, so kTE; I = T ; the converse inclusion is discussed in 3 . 1
.
We now start on the path which leads to formal spaces. LetII- be some fixed entailment on P. 1.5 Definition. A subset K of P is closed (with respect toll-) iff
pII-K implies p EK.
Formal spaces 1.6
111
Lemma. For any rclP r = {PIpII-r} is the least closed set containing r -
r c r = F r A A = 7 n Z If p < q E
7
where r then p E
IPA~IPE~,~EA}. (We say is a crible.)
A A =
7.
Proof. The only nontriviality is for each q E T , p Aq1l-A A q s r A A, for entailments.
T h a z ? n a . If pll-r and pll-A then, SO
that pl1-r
A
A, applying the rules
1.7 Definition. A frame is a complete lattice (H,<,h,v,A,V) such that
P A V q i = V ( P A q i )* An H-valued model m of lp is an assignment of truth-values [[p]lmEH to the formulae subject to the conditions (compare 1 . 1 )
“PI] “TI1, “PI] sequent $ + r A [[p]lm< q Er PE$ each sequent of holds for every
A
v
5
“~11
if P 5 9
= T A “Sll
T is valid. We say that p forces r frame-valued model of T.
, p k T r r iff plCm.r
(Note: Frames are also called complete Heyting algebras, under which name a good deal of the (constructive) theory of frames and framevalued models is developed in Fourman and Scott ( 1 9 7 7 ) . We discuss applications of this theory in 3 . 8 - 9 . ) Now we want to relate forcing , I k T , to provability,l- T; one direction is immediate.
.
1.8 Lemma. (Soundness) If p I-TT then p IkTI‘. Proof. For any H-valued model m of T the relation pll- r is easily seen to be an entailment relation containing T; but IFTis the least such. For the converse we want to provide a universal (“generic”)framevalued model for T. 1.9 Lemma. The closed subsets of lp with respect to any entailment relation form a frame; in the case of kTthis is denoted O(T),called the formal opens of T.
Proof. Since arbitrary intersections of closed subsets are closed, these form a complete lattice, with KAM = K ~ M and VKi = -~ M hVKi = M n U Ki = M n U Ki = U (M nKi) = v(M AKi). Then
q.
1.10 Corollary. (Completeness) p h , r iff p1I-s. Proof. We write [p] for in O ( T ) , and define an O(T)-valued model m of T b y [[p]]m=[p]. Then pll- r iff [p]cr iff pkTr. This model is called the generic model over ?he formal opens of T . Before proving the universality of the model in 1.10, we need to discuss morphisms of frames, and locales.
F}
M.P. FOURMAN, R.J. GRAYSON
112
5
2
LOCALES AND FORMAL SPACES
We now introduce locales as ~eneralisedspaces, which are given by their frame of open subsets. Of special interest are presentations of a locale as the formal space of a theory, and the relationship between this and the actual space of models of the theory. The following example provides motivation for the definitions. 2.1 Exam le. If X is a topological-space, O(X) is a frame. If f :X--> Y ? s a continuous map then f : O(Y)-> O(X) preserves finite infs,T,A, and arbitrary sups,v. If Y is a sober space then f is completely determined by f-l. Definitions. A morphism of frames is a map f*:H-->K preserving T , h , V . The category of locales is the dual of the category of frames. That is, a locale X is given by giving a frame O(X) called the opens of X. A morphism of locales, called a continuous morphism f : X - > Y , is given by a morphism of frames, called its inverse image map, f*:O(Y)->O(X) For any topological space A we identify A with the locale whose opens are O(A) (Formally this gives a functor Top +Lot.) In particular each discrete space A gives a locale whose opens are arbitrary subsets of A. A point of a locale X is defined to be a continuous morphism t:*-> x that is a map t* : O ( x ) -->P ( 1 ) preserving T , A ,V. 2.2
.
.
2 . 3 Definition. For a theory T, the formal space M(T) ofmodels of T
is defined to be the locale whose opens are O(T) , the I-T-closed subsets of IP (Lemma 1.9); these are also called the formal opens of T.
2.4 Theorem. Points of M(T) are in 1-1 correspondence with models of T. If X is a locale, O(X)-valued models of T are in 1-1 correspon-
.
dence with continuous morphisms X-> M(T) Proof. Since models of T are just P(1)-valued models, the second assertion includes the first. Clearly every frage morphism f*:O(T)-> O(X) induces a model m by [[p$ = f ([PI). Conversely each model m induces a morphism f* by f (K) = V [[PI] m. PEK Viewed algebraically, theorem 2.4 says simply that we have a universal interpretation P- [
I
O(T)
satisfying T. We want to consider it geometrically: our identification of the points of M(T) as models explains the terminology "formal space"; we view an O(X)-valued model as a family of models continuously parametrised by X. 2.5 Definition. For any locale X the points of X form a topological space Pt(X) whose opens are given by u* = {tft*(u) = T 1 , for UEO(X).
Formal spaces
113
2.6 Examples. We refer back to the examples introduced in 1 . 2 . 1) Syntactic languages. Models of a language P are just subsets of
P; these are given the "finite information topology" with basic opens Ve = {ml e c m} , where e is a finite subset of P. By 2 . 4 the points of M(T) are just the models of T, so 2.5 topologises the space of models, denoted by Mod(T) ; the frame O(Mod(T))of open subsets corresponds to the semantic entailment relation, k T ( 1 . 4 (3))
-
2 ) Trees. The space of infinite paths, Path(T), in a tree T i s given
the topology with basis va = {a[a an initial segment of a}, for a E T . The corresponding formal space is denoted by P(T), with topology generated by "immediate successors cover"; we call this the inductive topology onlf. (See 3 . 5 for notation for special cases here.) 3 ) Function spaces. Here the topology on points is the usual product topology. 4) Reals. The points here are real numbers (presented as "Dedekind cuts" (see 3 . 5 - 7 1 , and their topology is the usual one with basis the rational open intervals. Thus our presentation via propositional theories gives various collections of points a natural topological structure. We shall see that, from a constructive point of view, the formal space is often better behaved than the space of points, and that even classically the former may contain more information. 2 . 7 Example. A pointless locale. For any sets A and B let the locale Surj(A,B) be the formal space of the theory of a total function from A onto B (Example 1 . 2 ( 3 ) ) . If A = N and B is uncountable, clearly Surj(A,B) can have no points. On the other hand Surj(A,B) is non-trivial in the sense that T # I in O(Surj(A,B)) (indeed, constructively, it may be shown to be both proper and open, in the sense of Lemma 2.12):for each partial function p: A 7 B, the set [PI = {qlqzp} is closed (for the entailment generated by the axioms)
In this connection we refer forward to 3 . 9 where it is shown that theories which classically have no models may have some constructively. The general relationship between a locale and its points is treated further in 83. Although locales may lack points, many topological notions may be generalised to them more or less straight-forwardly: 2.8 Definition. A locale X is compact iff every cover of T in O(X) has a finite subcover. An open U EO(X) is positive, Pos(U), iff every cover of U is inhabited (this is a constructively positive way of saying U # I). X is connected iff U v V = T and-Pos(U) and Pos (V) together imply Pos (U A V)
.
In what follows we shall take care to use constructively apt versions of such definitions. Morphisms. A continuous*morphism f:X+Y is (X+>Y) surjective (onto) iff f* is 1-1 injective iff f, is onto (XQY) open iff f- preserves A (arbitrary infs). For an open surjection we write f: X 4 Y . 2.9
I14
M.P. FOURMAN, R.J. GRAYSON
For any f:X-Y the map f* has a ri ht ad'oint f*, characterised by f*U -< v iff U 5 f*v, and given by * f V}. Similarly f is open iff f9 has a left ad'oint f, , with f!V
j:O(Y)-->O(Y) given by j U = f*f U (see Fourman and Scott 1 9 7 9 ) ) . Among these generalised subspaces are the open sublocales given by j U = (v+U) , and the closed ones, given by j U = ( VV U) for V E O(X); topologically these correspond to the subspace V and its complement. Note that a sublocale of a topological space need not be topological (i.e. have points) as our pointless example ( 2 . 7 ) shows. From the logical perspective, sublocales arise by considering the subspace of a formal space obtained by imposing additional axioms. For example, the formal closed unit interval [ O , l l results from the formal space of the reals ( 1 . 2 ( 4 ) ) by adding the axioms ( - m , O ) * 1 and ( I , m ) * l
.
2 . 1 1 Products. The product XxY of two locales is obtained by amalgamating the two theories: we take P = O(X) x O(Y) with the product ordering and axioms (U,V) * V (UIVi)for UEO(X) and V < VVi in O(Y) and (U,V) * V (Ui,V) for V E O(Y) and U sVUi in O(X) We leave the reader to check that this defines a product in the category of locales and continuous morphisms. If S,T are theories in languages P,Q the product M ( S ) x M ( T ) can also be more directly axiomatised, by
.
and so on. For any locale X there is just one continuous morphism from X to the one-point space, whose inverse map " : P ( l ) - + O ( X ) is given by PI-+V{TI*EP} = P We characterise (constructive) non-triviality of X in terms of this map.
*,
.
2 . 1 2 Lemma. The morphism X->*
is surjective iff Pos(T) open iff IUlPos(U) 1 is a basis for O ( X ) . If these conditions hold, X is called proper and open,respectively. Proof. By definition, Pos(T) gives (6 = T + * E p) So t j i s gives ( * Eq* Ep), whence is 1-1. Conversely, if T sVW, TcVCTI3u Em] = {*13UEU]"; s o , if is 1 - 1 , { * 1 3 U € X } = { * I , that is, 3 U E U .
"
.
"
Similarly, if V s V U , V g {*13U €%I"; but I*IPos(V)] = ( * I t / covers U of V. 3U E M ) is given by an A in P ( 1 ) , so that, if the morphism is open, V g C*IPos(V%" Then also VrV{VlPos(V)} = V {U i VlPos(U)}, that is, the positive elements form a basis.
.
Conversely we show that, if the positive elements form a basis,then u i $ iff POS u implies * E p, from which openness of is immediate. (Note also that then the left U}.) adjoint to is the map U-{*[Pos The hypothesis gives U 5 V I U l P o s (U) 1 , so, if Pos (U) implies * E p,
Formal spaces
115
U
For the case of the formal space M(T) of a theory T we write Con($) for Pos([@l), which is read as "6 is consistent", since it is a positive version of $kT1. Then M(T) is proper iff Con(T), that is, the theory is consistent. It is easy to see that, if 6 has a model (i.e. bm@) , 0 is consistent; the converse implication is discussed in 3 . 1 2 .
8 3
COVERINGS AND COMPLETENESS
We now start investigating the relationship beiween a locale X and its space of points Pt(X) ( 2 . 5 ) . The map U W U = {tl* E t*(U) 1 clearly gives an injection of locales Pt(X)->X. Definition. A locale X has enough points iff this morphism is surjective (and then, in fact, an isomorphism).
3.1
This condition is clearly equivalent to U* = V* implies u = V, which says that X has "enough points to distinguish opens". For the case of the formal space M(T) of a theory T, having enough points is precisely the equivalence between semantic entailment, b , and provability, I-T, that is, the completeness of T with respecx to its (P( 1 ) -valued) models. Relations between completeness of different theories will mostly be established by giving a "covering" (surjection) of one formal space by another, using the following lemma. 3.2 Lemma. If X covers Y (i.e. there is a continuous surjection from X to Y) and X has enough points, then so does Y.
Proof. Let f*: O(Y)+>O(X) and U * = V*, for q,VEO(Y). Then f*(u)* = f*(V)* (by composinq with f*), so f (U) = f*(V), so U by the assumptions,
=
V.
In general, completeness of a theory T can be read as an induction principle: any crible K such that p kTK (K covers the points of p), which is closedunderall restrictions of axioms of T, must contain p (see Postscript). We consider some special cases. Definition. L e t T be any tree. The principle of monotone bar induction for F , BI ('A) , is the implication
3.3
(1)
A
(2)
A
(3)->(4)
where ( 1 ) VaE K v b s a. bE K ( 2 ) Va(Vb immediate successor
( 3 ) Va E Path(G) (cEa+
3
(K is a crible) of a.bE K-aE K) (K is closed)
a € Kn a )
(K covers paths through c)
116
M.P. FOURMAN, R.J. GRAYSON
(4) c E K for c any node of g a n d K any subset o f T .
3.4 Theorem. The locale P(T) (2.6(2)) has enough points iff BI(m holds. Proof. P(T) has enough points iff any cover of all paths through c covers c in the inductive topology, iff BI(T) (see Postscript). If we now consider the special case of the tree A < N of finite sequences from some set A, the principle BI(A
Formal spaces
117
enough points, these can be treated as partial functions from Pt(X) to Mod(T)
.
Now we want to interpret O(X)-valued models as the internal models of some internal theory, in sheaves over X,_namely the "constant" theory ?. For any set A the constant sheaf A is simply the set A with [[ a=b ]]=V{~la=b} lsee Fourman and Scott ( 1 9 7 7 ) ) ; for any propositional language P,s-,B also inherits its structure trivially, with [[ p - < q]]=V{Tlp " p ]Im, and the remaining conditions for a partial O(X)-valued model are easily checked.
Of course, in general, the theory $ may not at all be the same as that obtained by interpreting some definition of T in sheaves over X. When this is (always) s o , we call T (or rather, the definition) absolute. Sufficient for absoluteness is that P should be countable and that T should be arithmetically defined (in terms of some enumeration). A s examples we have the theories of Baire space, Cantor space and the reals; as a corollary of the above discussion we have the well-known representation of these spaces in topological models as sheaves of partial functions with open domain. Finally we can interpret the internal formal space M($)as the sheaf M(T)X, which is defined as the product locale ( 2 . 1 1 ) (XxM(T)) with the evaluation "W5W'Il =VIUlWuS.w y , where Wu = {(U'h U,V')I (U',V') EW]. 3.9 Applications of Sheaves. Such interpretations have an immediate application in the present context: Fourman and Hyland ( 1 9 7 7 ) have described sheaf models in which FT holds but not BI, and in which FT fails (one may also use recursive realisability), showing the constructive difference in strength of these induction principles. The comparative strength of the induction principles corresponding to other spaces (especially of the reals,R) is discussed in 4.6-11.
Another application, which we mention only briefly here, is to the construction of models of theories which classically have no models. The simplest example is the generic model (Lemma 1.10) over the formal space of the theory of a artial function from N NN Example 1 . 2 ( 3 ) ) ; this theory is not aEsolute, but it turns out that Nd is the constant sheaf in this interpretation, so that one gets a model of the right internal theory, and one has NN subcountable in this model. A more complex example is Joyal's theory of an ideal of rational intervals covering the reals, of measure less than 1 / 2 . Both these formal spaces are proper and open, in the sense of Lemma 2.12.
e
We now describe the construction of a "universal proof tree" for any countably axiomatised theory, in which infinite paths are models and inductive bars are proofs. In localic terms we are covering the formal space of the theory by the tree with its inductive topology. Then when the tree has enough points so does the formal space, that is, the theory is complete. 3.10 Definition. Let T be a theory, in a language with decidable<, with countably many sequents C Bi * TiliEN); for convenience we
MI'. FOURMAN, R.J. GRAYSON
118
assume that each sequent occurs infinitely often in this enumeration. We define a tree of finite sequences of formulae, the admissible sequences, inductively as follows: < > E T <@> E g
for every formula I$. If aEl' is of length i+l and B i * ri is the i-th sequent in T then E T if a(i) d B i a * B i and 0 E Ti and a * E a if a(i)
.
We view the admissible sequences as finite attempts at constructing a model of T. Note that if i < j then a(i) ta(j) for any admissible a. A sequence a of length i+l is said to secure @ iff a(i)i $, and to secure r iff it secures some @ in r . Clearly a(i) is the least formula secured by a; we denote it also by 0,. 3.11 Theorem. Every infinite path a through T g i v e s rise to a model m of T with @ E m iff 9 is secured by a(i) for some i EN.
A sequent @ * r is provable in T iff, for any node a securing 0, the collection of nodes below a securing r is an inductive bar of a.
If" is given the inductive topology (generated by covers by immediate successors - see 2 . 6 ) then there is an open surjection of locales from P ( T ) to M(T), taking each infinite path through 1p to the corresponding model of T. Proof. For any infinite path a the collection m of formulae secured by some a(i) clearly forms a filter. If Oi* ri is an axiom and 0 is secured by a(j) we may suppose that jJ:i las each axiom occursi infinitely often), so that T i is secured by a(i+l), by construction. Thus Bi kmri
.
Next suppose that K = Iblb < and b secures TI is an inductive bar of <$>, and consider K * = {blb 5 <$> and I$b I- TI: K * contains K, since, if b secures T, I$b5 )I for some J, E r, so $bl- r . K * is also inductively closed, since the immediate successors of anode b are either b *<@,> or b * < + b ~ $ >for every $ E r i , with 8 . * T i an axiom and $b s ei In the latter case, by assumption, @bA 41- 1' for each $ Eri; which together with $bl-ri gives $bl- r . Thus + > E K as K is an inductive bar; that is, 0l-r.
.
,
The converse is shown by an induction on proofs. If Bi* r l is an axiom and f3i is secured by a of length j we may assume j < 1, and then ri is secured by all extensions of a of length i+2; these form an inductive bar of a. Closure under the rules is clear since the inductive bars form a topology. Now define f:P('p) ->M(T) by f*(U) = {alt$,I Ef*U.
Formal spaces
119
3.12 Some Applications. By the theorem, if P ( T ) has enough points, so does M(T), that is, T is complete. This will always hold classically; constructively we need various forms of bar induction ( 3 . 3 1 ,
depending on the assumptions about T. Let T now be countably axiomatised in a countable language in such a way that an enumeration of Ti, for Bi e Ti the i-th sequent of T, is given uniformly in i (in order to avoid the use of countable choice). (a) Without further conditions g may be treated as an arbitrary aubtree of N
.
-
.
3.13 Remark. Our preoccupation with pen surjections serves to enable us to extend our completeness results to first-order theories. Let T be a countable geometric first-order theory and E its classifying topos (see Makkai + Reyes ( 1 9 7 7 ) ) . The Diaconescu cover of B gives an open surjection from the category of sheaves on a locale (Johnstone ( 1 9 8 0 ) for example). This locale is itself countably presented so we have an open surjection f:Sh(B) ->E. Since f* preserves first-order logic, this tells us that sheaf models over (formal) Baire space are complete for first-order consequences of countable geometric theories.
0
4
COMPACTNESS PROPERTIES
We now show that the formal space of the reals, R, has enough points iff the point space R , is locally compact (4.10) and that formal Cantor space, C, covers every compact regular separable locale ( 4 . 6 ) . This localic version of a classical covering theorem from general topology arises, from our point of view, because the topological
120
MI'. FOURMAN, R.J. GRAYSON
properties in question may be seen as describing a simple generating family of covers. Definitions. If X is a locale, U,VEO(X) then U is well-below V iff there is a W with U A W = I and W v V = T ; we write this U 7V. We say U is way-below V iff every ideal covering V contains U (i.e. if every cover of V finitely covers U), written U<
The locale X is locally com act iff V = V{UlU<
.
Lemma. In any locale X, the set {UlUeV} is an ideal as is {UlU 7V). The set {VlU 7V) is a filter. If U e V and W 7 U then W e U , so if X is compact 7 implies e . If X is regular, Q: implies 7. 4.2
4 . 3 Definition. A locale X has stable finite covers iff [VIU<
is a filter. This holds, for example, in any compact regular locale. The way-below relation is best looked at from the point of view of the Stone space. 4 . 4 Definition. If X is a locale, its Stone space P i s given by equipping O(X) with the finite cover topology: Ull- V U i iff for some
finite F G I we have U <
v Ui
in O(X)
.
iE I
The closed subsets of O(X)
iE F for this entailment are the ideals of O(X). We have a canonical inclusion f:X->X* with f* (K) = V K ; for the meanings of f, and f! see 2.9. 4.5 Lemma. We have U e V iff,for J an ideal in O(X),V sf*J implies f,U< J. The locale X is locally compact iff f is open (Joyal); in this case f l U = {VIVeU}. The locale X is compact, locally compact, with stable'finite covers (Johnstone ( 1 9 8 2 ) calls this compact; stably locally compact) iff f! is an inverse image map (i.e. a morphism of frames).
Proof. We deal only with the last assertion. As f l is a left adjoint it suffices to show it preserves T (compactness) ind A (stable finite covers). In the terminology of Fourman ( 1 9 8 2 ) this says that X is compact, stably locally compact iff it is an adjoint retract of its Stone space. To make our proof of the next theorem constructive requires some assumptions which we discuss after the proof. Theorem. Any compact, stably locally compact separable locale X is a continuous image of formal Cantor space, C. Hence the Fan Theorem implies that X has enough points. 4.6
Proof. A countable basis for X gives a countable basis for X*,so the Stone space, being generated by finite covers, is covered by C (3.12 (a)). As we have (Lemma 4.5) a retraction f a x we obtain a cover
c ->x.
4.7 Remarks. What we assume here is an explicit enumeration of a collection of finite covers generating x*, and that < is decidable for the basis used for this presentation. There are examples in which X is covered by C but is not stably locally compact: The unit interval, [ O , l l , with the usual topology except that 0 and 1 have only
Formal spaces
121
the neighbourhoods [O,l)and (0,11, respectively, is such an example. On the other hand, among regular locales it is precisely the compact separable ones that are continuous images of C. 4.8 Lemma. The formal reals R are locally compact and regular: formal [ O , 1 ]is compact regular. Proof. For rational intervals (p',q') 7 (p,q) iff p < p ' < q ' < q . Thus, by an axiom, (p,q) I-VC(p',q')I (p',qI).7 (p,q)} , so R is regular. Now we show that for bounded rational intervals, if U 7 V then U e V . Let K be a cover of a bounded interval V. Consider K* = {Wleach U < W is finitely covered by K}. Clearly K* is a covering crible of V. Using denseness of the rationaJs, U 7W1v W2 may be expressed as U = U1 where U1 z W l , a n dU2 <W2; so K is closed un>er finite unionvsy2hso, if V < W implies V E K * , then WE K*, as V < W implies 3V'. V Z V ' <W. Thus K* is closed underall restrictionsof the axioms for R, so V E R * , as K* covers V (see Postscript). This holds for any cover of V, s o ? implies << Now as [0,1] is a bounded closed sublocale of R(i.e. [O,l]cU for some U*: T ) , [0,1 1 is compact.
.
4.9 Corollary. The Fan Theorem implies that R has enough points. Proof. As C->>[O,I I, by 4.6 and 4.8, FT implies that [0,1 1 has enough points; R is covered by such closed intervals (all isomorphic to [O,ll). 4.10 Theorem. R and [0,1] have enough points iff IR is locally compact (equivalently Pt [ 0,1 I is compact)
.
Proof. Suppose OR is locally compact as a topological space. Let V*c VU; and let K = { W EO(R) I WsVUi}. As finite covers in R coincide with those in IR, each W Z V belongs to K. S o , as K is closed, V EK. The converse direction follows from 4.8, since R has enough points means that R and R are isomorphic. 4.11 Concluding Remarks. The picture of the comparative strength of completeness for various interesting theories is still far from complete: for example, even the case "R has enough points" implies "C has enough points" seems to be open still (does R have enough points in the model over K(R2) of Fourman and Hyland (1977)? ) In this connection, we conjecture that a localic version of the Hahn-Mazurkiewicz Theorem on continuous images of [O,ll should be provable, using now the "connected" Stone space ,'X in which the open subsets are those cribles J of O(X) closed under connected finite joins (compare 4.4): U E J and V EJ and Pos(U A V ) implies UV V E J.
.
Other interesting cases arise from products and exponents of locales. In relation to products we remark that, provided X has enough points, the locale YX has enough points in sheaves over X (3.8) iff the product (X x Y) has enough points (2.11) : this holds always if Y is locally compact. On the other hand, it is not known whether BI holds in sheaves over formal Baire space, when BI is not assumed externally The exponent Yx of locales may be constructed (with the compact-open topology) when X is.locally compact; this is best described by axiomatising the relationship U <
122
M.P. FOURMAN, R.J. GRAYSON
Hyland (private communication) has described a topological model in which RR has not enough points, thus showing that this principle is stronger than the Fan Theorem. On the other hand, the special case $ X I where $ i s Sierpinski space, always has enough points: these are exactly the opens of X. There are clearly many questions to be answered here and many directions for generalisation. We hope that, by describing some simple examples, we will have made this area more accessible and may encourage others to further research. REFERENCES Fourman,M.P.(1982): Continuous truth, to appear. Fourman,M.P. and Hyland,J.M.E. (1979): Sheaf models for analysis,% Applications of Sheaves, Springer Lecture Notes 753, 280-301. Fourman,M.P. and Scott,D.S. (1979): Sheaves and Logic, Applications of Sheaves, Springer Lecture Notes 753. Grayson,R.J. (1982): Constructive properties of frames, in preparation. Johnstone,P.T. (1980): Open maps of toposes, Manuscripta Mathematica, vol. 31, p. 214-247. Johnstone,P.T. (1982): Stone spaces, London Mathematical Society Lecture Notes, to appear. Joyal, A . and Tierney,M. (1982): Open maps and descent, to appear. Makkai,M. and Reyes,G.E. (1977): First-order categorical Logic, Springer Lecture Notes 611. Troelstra,A.S. (1980): Extended bar induction of type zero, in The Kleene Symposium, eds. Barwise, Keisler and Kunen, Studies in Logic, vol. 101, p.277, NorthHolland, 277-316. POSTSCRIPT. At various points (immediately before 3.3, in Theorem 3.4 and in Lemma 4.8) we have tacitly made use of the following lemma, which is proved by an induction on the definition of provability I-T: Lemma. If K is a crible of (P,() (that is, closed downwards) and is closed under all restrictions of axioms of a theory T (that is, for p = * T in T and any q, if r h q E K I then phq EX), then K is closed with respect to kT. Note that in the case of trees every restriction of an axiom is again an axiom, so that one need not refer explicitly to restrictions.
THE LBJ. BROUWER CENTENARY SYMPOSICM A S . Tmelstra and D. van Dalen (editorsJ 0North-HolIandPublishing Company, 1982
123
CONSTRUCTIVE MOUELS FOR SET THEORY WITH EXTENSIONALITY
'I
L e v Gohdeew, Miinchen
I NTROOUCT I ON There a r e two well-known methods t h a t can be used t o i n t e r p r e t J . M y h i l l s t y l e e x t e n s i o n a l C o n s t r u c t i v e Set T h e o r i e s w i t h i n subsystems o f a n a l y s i s ( [ F r
31 ),
and S. F e f e r m a n - s t y l e c o n s t r u c t i v e systems o f f u n c t i o n s and c l a s s e s ( [ B e Z ] ) . Both i n t e r p r e t a t i o n s use f a m i l i a r ideas o f a g r o w i n g w e l l - f o u n d e d u n i v e r s e o f s e t s w i t h ( s a y ) s t a n d a r d e x t e n s i o n a l e q u a l i t y and membership r e l a t i o n s . f e r e n t i n t e r p r e t a t i o n s were proposed i n [GZ]. Compared t o [Be21
Somewhat d i f -
, [Fr 3 1 ,
( a ) u n i v e r s e s o f s e t s from [G21 a r e i n no way r e q u i r e d t o be w e l l - f o u n d e d b u t ( b ) t h e i r e x t e n s i o n a l e q u a l i t y and membership r e l a t i o n s a r e b o t h d e f i n e d by elementary f o r m u l a s .
I n accordance w i t h N . S h a n i n ' s c o n s t r u c t i v i s m ,
cf.
[ShZ],
i n [G2] s e t t h e o r i e s were i n t e r p r e t e d i n s u i t a b l e 1 - s t o r d e r e x t e n s i o n s o f HA+ECTO+MPO (see [ G l ] ) . The p r e s e n t m o d i f i c a t i o n g e n e r a l i z e s [ G Z ]
i n o r d e r t o demonstrate t h a t
v a r i o u s CST's a r e i n t e r p r e t a b l e a c c o r d i n g t o t h e t r a d i t i o n a l c o n s t r u c t i v e p o i n t o f view, as e x p l a i n e d ( p a r t i c u l a r l y ) i n [ F 2 ] . Our Main Theorem (see P a r t 11.3. below) g i v e s t h e p r e c i s e i n f o r m a t i o n about a r i t h m e t i c s t a t e m e n t s p r o v a b l e i n v a r i o u s CST's extended by ECTO+MOO. The f o r m a l body of t h e p r e s e n t m o d i f i c a t i o n i s based on K i e e n e ' s 1945 n o t i o n o f r e a l i z a b i l i t y , c o n c e p t s from [ S h l ] Shanin's p r i n c i p l e , formulated i n P a r t 11.1.
(see
b e l o w ) , methods f r o m [FZ] and [BFPS],
and assumes some f a m i l i a r i t y w i t h [ T I .
PART I .
BACKGROUND
1.1. Let -
a structure
S
= (M,E)
be g i v e n f o r an a r b i t r a r y s e t M and an
a r b i t r a r y (not necessarily well-founded)
relation
ECMxM. Consider i n f o r m a l l y t h e
f o l l o w i n g problem. L e t us c a l l M t h e u n i v e r s e o f (codes o f ) s e t s . We s h a l l v i e w
I ) I am i n d e b t e d t o t h e o r g a n i z e r s o f t h i s c o n f e r e n c e f o r p r o p o s i n g t h e i n v i t e d paper and f o r t h e i r h e l p i n many ways. I want t o t h a n k P. A c z e l , M. Beeson, W. Buchholz, S. Feferman, G. J l g e r , W. P o h l e r s f o r s t i m u l a t i n g c o n v e r s a t i o n s . S p e c i a l thanks a r e due t o H. Schwichtenberg.
L.GORDEEV
124.
xEy as the following intensional membership relation on M: "x (codes a set which) is an element of (a set coded by) y " . So our sets are described by their codes
(M) and intensional membership relation (E) between them. We have to find some suitable "extensional cover" 5 of S. To be more precise, we are looking for suitable E-extensional equality =s on M, i.e. (E-ext.)(= S )
:
( V X , ~ () X~ = ~ Ycf (VuEx 3vEy(u= S v) and VvEy 3uE~(u=~v))).
Then we take our E-extensional membership relation ES to be E modulo =s. Then the model 5 = (M,=s, f) is the solution to our problem provided that =s is sufficiently nice. Consider the following definitions Definition 1 . For any a,b from M put a = S b :3WCMxM (aWb and EQR(W))
where
EQR(W) : (Vx/xy)~(xWy+ (VuEx 3vEy(uWv) and (VvEy 3uEx(uWv))). A s mentioned above, we put ~ Definition 2. a E S b : ( 3 x , ~ )(xEy
6
a =S x
&
b = S y), which is in fact equival-
equivalent to Definition 2'. Claim 1 .
sb
a € b : 3xEb(a=Sx). S
(axioms of equality together with the axiom of extensionality).
Particularly, =s is an E-extensional equality. (Cf. the extensional equality in [FrZ]. The related notion of equality as an Eisomorphism has been introduced in [Fi]; according to M. v. Rimscha, it was also in [Mi]).
PJLOO~. (0)
5
(1)
5
b (a=a) holds with W = {<x,x> : x belongs to MI.
b (a= b b=a). Suppose s C (a=b), i.e. a =S b , i.e. aWb and EQR(W) for some relation W C M x M . Put W' := {<x,y> : yWx) and observe that bW'a and
EQR(W'),
-f
so
b = S a, and hence 5 b (b=a).
(2) $ C ( a = b & b = c + a=c). Suppose C (a=b) and S C (b=c), i.e. aWlb, bW2c and EQR(Wl),EQR(W2) for some relations W1 , W 2 C M x M. Put W' :={<x,y>: 3z(xWlz&zW2y)} and observe that aW'c and EQR(W'), i.e. S b (a=c).
( 3 ) s k ( a = b & b E c + a E c ) . Indeed, O C * 3xEc. s C (a=x) * ' S + (a=c).
(a=b&bEc)=*3xEc.^S!=(a=bEb=x)
125
Constructive models for set theory
(4)
f C
(a=b & c E b + cEa).
3xEb.
f I=
(a=b & c=x)
s
3xEb 3yEa.
(5)
C (a= b
3 C (Vx(xEa
++
W ' := { < a , b }
U {<x,y>
s
xEb)
-+
C (a=b
& cEb)
*
(by D e f i n i t i o n 1 . )
& c=x & y=x)
* 3yEa. $
a = b ) . Suppose
C (c=y)
=*
(cEa).
S
f != V x ( x E a * x E b ) .
Put
:X = ~ Y } O . f c o u r s e aW'b. We have t o p r o v e EQR(W').
Suppose uEx and xW'y.
I f <x,y>
t h e n uEx -uEa
i s j u s t
=*
f C
(uEa)
*
*?
C ( u E b ) = * 3 ~ E b ( u = ~ v- )3 ~ E y ( u = ~ v ) . O t h e r w i s e xW'y means X = ~ Y then ,
UEX
*f
& x=y) f C ( u E y ) =* 3 v E y ( ~ = ~ v )S.i m i l a r l y , * 3uEx(uW'v). Thus EQR(W') h o l d s and hence f C
C (uEx
(vEy and xW'y)
Remarks 1.
Indeed,
=*
=$
i n b o t h cases (a = b ) .
.
T h i s p r o o f i s i n t u i t i o n i s t i c , b u t n o t e l e m e n t a r y because i n (5) we use C comprehension.
( ( X ;-
CA)
I t c o u l d s t r a i g h t f o r w a r d l y be f o r m a l i z e d i n t h e subsystem
I ' ) - o f i n t u i t i o n i s t i c a n a l y s i s (as u s u a l ,
"P
"
and
' I - ' '
are
r e s p e c t i v e l y t o denote t h e r e s t r i c t e d i n d u c t i o n and t h e i n t u i t i o n i s t i c l o g i c ) . I n the Part I I .
we w i l l show t h a t i t c o u l d be a l s o f o r m a l i z e d i n a s u i t a b l e
constructive version of ( ( A o
(S
f)
2.
The o p e r a t i o n
3.
In order t o i l l u s t r a t e
+-+
- CA) F ) - .
i s i n v a r i a n t w i t h r e s p e c t t o isomorphisms o f S and
(S I-+
5)
s3?Vb am
c o n s i d e r t h e f o l l o w i n g s i m p l e examples
(sometimes we w i l l use t h e a l t e r n a t i v e a b b r e v i a t i o n
s1 s1 ::
:
s2: s2:
b
0-
@
S5:
<
a
0.
'0
f o r xEy).
S 3 V b s? 4:
d
C
C
d\ :@ 8bs,
e
d
e
d
b One can e a s i l y v e r i f y t h a t : (x=y
++
si
= ( x = y ) ) and ( x E i y
s e t s coded by a,b,v,d,e
0 , l ,2,3,4
s6 f7
s8
* si C
(xEy))
f o r each i < 5 ;
i n t h e s e S i ' s become v. Neumann's n a t u r a l numbers
i n the s i n s ;
C ( b = c ) and a g a i n b o t h b and c a r e v . Neumann's 2 ; C (b#f#afb
observe t h a t
= c = d = e) ;
C ( a E c E b E a and a f b + c # a ) .
L. GORDEEV
126 I. 1 . 1 .
C l a i m 2.
Two nice pfiopemZu
06
(S ++ 3 ) .
Suppose S i s w e l l - f o u n d e d ( w i t h r e s p e c t t o
E). Then t r i v i a l ( r e -
s t r i c t e d ) E - i n d u c t i o n y i e l d s t h e uniqueness o f E - e x t e n s i o n a l e q u a l i t y on M.
s
i n t h i s case o u r d e f i n i t i o n o f
Hence
i s adequate.
C l a s s i c a l l y , g i v e n any w e l l - f o u n d e d s t r u c t u r e S one can v i e w t h e c o n d i t i o n (E-at)
t o be an i n d u c t i v e d e f i n i t i o n of ( s a y ) s t a n d a r d E - e x t e n s i o n a l e q u a l i t y on
M. Hence f r o m t h e c l a s s i c a l p o i n t o f v i e w o u r d e f i n i t i o n o f s t a n d a r d one
coincides w i t h the
- f o r any w e l l - f o u n d e d s t r u c t u r e S .
O f course, we cannot e x p e c t t h e uniqueness p r o p e r t y t o be p r e s e r v e d i n t h e g e n e r a l case. For, c o n s i d e r some two-element
'0,
s t r u c t u r e S which looks l i k e
and o b s e r v e t h a t 5 C ( a = b and a E b ) , i . e . o u r 5 l o o k s l i k e t h e a b u t o f c o u r s e S i t s e l f i s e x t e n s i o n a l i n f a c t o u r problem t r i v i a l cycle
6-
(formulated i n 1.1. t h a t o u r ( S ++
s)
above) has many d i f f e r e n t s o l u t i o n s .
However,
i t can be shown
i s t h e u n i v e r s a l one, w h i c h means t h a t t h e f o l l o w i n g i s p r o v a b l e
i n a s u f f i c i e n t l y r i c h i n t u i t i o n i s t i c metathory.
C l a i m 3.
( f o l l o w s f r o m Lemma 1 below).
e x t e n s i o n a l e q u a l i t y =;
Consider any S and any a l t e r n a t i v e E-
on M. D e f i n e €& by D e f i n i t i o n Z / D e f i n i t i o n 2 ' and s e t
.-
._(M, = s , , E' 1. Then t h e r e i s some s t r u c t u r e S , S p h i c a l l y embedded i n t o 5 , .
Sl
such t h a t S ' can be isomor-
Now c a l l a m e t a t h e o r y s u f f i c i e n t l y r i c h i f i t p r o v e s t h a t f o r e v e r y s e t M t h e r e i s some s t r u c t u r e S o = (M ,E ) and a f u n c t i o n f : M I Mo such t h a t O D into (Vx,ylM ( x = Y ++ C ( f ( x ) = f ( y ) ) ) . Note t h a t a m e t a t h e o r y w h i c h p r o v e s e v e r y
so
s e t M t o be w e l l - o r d e r a b l e ,
i s s u f f i c i e n t l y r i c h ( l o o k a t t h e f i r s t f i v e examples
f r o m Remark 3 above and o b s e r v e t h a t t h e same c o n s t r u c t i o n c o u l d be a p p l i e d t o an arbitrary ordinal). Particularly,
v a r i o u s subsystems o f a n a l y s i s a r e s u f f i c i e n t l y
r i c h since they deal w i t h sets o f n a t u r a l s ;
i t does n o t m a t t e r whether t h e y a r e
i n t u i t i o n i s t i c or classical.
Lemma 1. Suppose o u r m e t a t h e o r y i s s u f f i c i e n t l y r i c h .
S = (M,E) and any e q u i v a l e n c e r e l a t i o n
Consider any s t r u c t u r e
- ( w i t h r e s p e c t t o E) on M.
Then t h e r e i s
some s t r u c t u r e S 1 = (M ,E ) t o g e t h e r w i t h a 1-1 f u n c t i o n g : M + M1 such t h a t 1 1 C ( g ( x ) = g ( y ) ) ) and ( x E y t+ C ( g ( x ) E g ( y ) ) ) , f o r a l l x,y f r o m M. (x-y ++
z1
s1
Ph006. ( a s i m p l e e x e r c i s e i n K u r a t o w s k i ' s o r d e r e d p a i r t e c h n i q u e ) . F i x some So = (MO,EO) Step 1 .
and some f : M
*
M
0
with (VX,~) ( x = y M
D e f i n e S2 = (M ,E ) as f o l l o w s . 2 2
c+
5, C
P u t M2 : = & q ( { i } x M )
( f ( x ) = f(y))). U { 5 } x M and l e t
127
Constructive models for set theory E2 be a r e l a t i o n w h i c h o r d e r s M2 as f o l l o w s ,
,x>
A?> I
x E M 9 and f o r a l l uEx.
<1 ,x>
for
P .
, <5, t>> : s E o t }
...... Note t h a t a s e t coded by < 1 ,x> p a i r
5,
in
i s nothing but Kuratowski's ordered
so.
regarded as an element o f
We show t h a t f o r a l l x , y E M: (i) ( x = y
cf
5,
+
(
Both imp1 i c a t i o n s ( i ) Suppose
s2
C (
=
and ( i i ) ( x E y
S2
(
= < l , y > o r 4 ,x> =
i s t i c ) proof of
=
(
= <5,f(y)>),
(<5,f(x)>
+
(<3,v>~<2,v>))
( i i ) Suppose
5,
5,
(
5, C
(
.
(
i .e.
(<1 ,x>E
o t h e r hand,
s2
(<1 ,x> = <1 ,y>)
= <5,f(y)>)
5, C
* 0=1
<3,x>)
2
Hence
S2
*
NOW
( s i n c e <3,x>
i s empty, a l t h o u g h
c ( = <4,x>) * 0 . = 1 * x = y . 5, C (
+
(
=
*x=v.
Hence i n any
*xEy.
Step 2. P u t S1 := ( M ,E ) , where M1 := M2 and E := E U {<
51 C 51 b
(
=
(
1.2. Consider -
c-f
++
3y'(y'-y 3v(v-x
E. x = y ' )
& vEy)
.tf
s m e universe U o f structures
x-y,
++
t h a t a belongs t o M and (M,E)
belongs t o U.
:
and
xEy.
S
= (M,E).
Define the corre-
sponding u n i v e r s e S e t ( U ) o f s e t s as t h e c o l l e c t i o n o f a l l t r i p l e s (a,M,E)
Set(U)
*
*
(<1 ,x> =
=
f o r some vEy. We have a l r e a d y seen t h a t case
+
C (<5,f(x)>
~ i m i l a r l y ,5
*x=y.
5, C
f o r some vEy. Now, K u r a t o w s k i ' s ( i n t u i t i o n -
a = b & c = d ) yields
while
* 5, * so C ( f ( x ) = f ( y ) ) * x = y . On t h e * S, c ( E < i ,x>) * S, C ( f 2 C (
5, c
S2
Hence
t+
"+".
a r e o b v i o u s . Consider
T h i s means t h a t each (a,M,E)
i s regarded as a s e t coded by a i n s i d e (M,E).
such from
Extend o u r t r e a t m e n t o f =
S
and ES i n o r d e r ' t o o b t a i n e x t e n s i o n a l e q u a l i t y and membership r e l a t i o n s between t r i p l e s from Set(U).
L. GORDEEV
128
Definition and (a,M,E)
S1 = (M1,El) E
0
3. W r i t e (a,M,E) = ( a ,M ,E ) f o r ( S F S ) !=
E (al,Ml,E,)
1 1 1 +
and ( S T S 1 ) = (M ,E ) w i t h Mo =
= {<
Claim
f o r (S1 ; S 2 )
u
: xEy}
0
0
{<<1 ,x>,
,y>>
{O}XM
=
U {l}xM,
and
: xE1y}.
4. Set(U) C (axioms o f e q u a l i t y t o g e t h e r w i t h t h e axiom o f e x t e n -
sionality). The p r o o f i s q u i t e s i m i l a r t o t h a t o f C l a i m 1 above.
1
-
ma1 i z e d i n ((8, CA)
1 I-,see
I t c o u l d a l s o be f o r -
Remark 1 above. We w i l 1 show i n P a r t I I t h a t
((Z; - C A ) P ) - c o u l d be r e p l a c e d by t h e s u i t a b l e c o n s t r u c t i v e m o d i f i c a t i o n o f (
- CA) r
)-.
We s h a l l use t h e o p e r a t i o n ( U
I+
Set(U))
i n o r d e r t o produce v a r i o u s e x -
t e n s i o n a l models o f v a r i o u s ( i n t u i t i o n i s t i c o r c l a s s i c a l ) t h e o r i e s o f s e t s . There a r e a t l e a s t two r e a s o n a b l e d i r e c t i o n s .
T h a t i s , g i v e n some 2-nd o r d e r m e t a t h e o r y
(T) c o n s i d e r : ( a ) a u n i v e r s e U o f a l l s t r u c t u r e s d e s c r i b e d by T, ( b ) i t s w e l l WF founded p a r t UwFCU, i n o r d e r t o g e t e i t h e r a w e l l - f o u n d e d model S e t ( U ) o r a "complete"
model Set(U).
s t r u c t u r e (x,-,r)
o f Set(U) means t h a t S e t ( U ) C ( f o r e v e r y
"Completeness"
w i t h a r b i t r a r y r C x x x and a r b i t r a r y e q u i v a l e n c e r e l a t i o n - o n
x , w h i c h p r e s e r v e s r , t h e r e i s some y such t h a t (x,-,r) ( y , = Fy,EFy)).
O f c o u r s e "completeness"
is i s o m o r p h i c t o
and w e l l - f o u n d n e s s a r e i n c o m p a t i b l e .
These models w i l l be used i n o r d e r t o show t h a t v a r i o u s e x t e n s i o n a l t h e o r i e s o f s e t s a r e c o n s e r v a t i v e o v e r t h e i r s u i t a b l e i n t e n s i o n a l f i r s t o r second-order v e r sions, f o r a l l a r i t h m e t i c statements. We s t a r t w i t h Z e r m e l o - F r a e n k e l ' s
s e t theory.
L e t ZF be t h e c l a s s i c a l f i r s t - o r d e r p r e d i c a t e c a l c u l u s w i t h e q u a l i t y extended by t h e f o l l o w i n g sequence 1 )
- 8)
o f axioms f o r m u l a t e d i n t h e o r d i n a r y = ,€-language
o f s e t t h e o r y e n r i c h e d by t h e c o n s t a n t s :
0 (empty s e t ) and w (a s e t o f a l l n a t u r a l
numbers). (1)
Extensionality
(2)
VX(XF0)
(3)
Pairing
(4)
Union
(5) (6)
CA:Vx3yVu(uEy
+-f
u E x & cp(u)) f o r a l l cp
SC ( s t r o n g c o l l e c t i o n ) : Va(VxEa3ycp
-+
3 b ( V x E a 3 y E b c p A V y E b 3xEacp))
f o r a l l cp
(7)
Power: v x 3 y v u ( u E y
(8)
I n f : ( 0 E w F. V x E w ( x + 1 E w ) ) and V y ( 0 E y & V x E y ( x + 1 E y ) -+ w c y ) ,
++
ucx)
where x + 1 a b b r e v i a t e s X U{XI.
129
Constructive models for set theory
I n a d d i t i o n c o n s i d e r t h e f o l l o w i n g two axioms: I n d ( E ) : ( V x ( V u E x cp(u)
-t cp(x)) -t Vx cp(x)) f o r all cp, 1-1 3z,g(g : xz and V u , v E x ( < u , v > E y * g ( u ) E g ( v ) ) ) ) . onto Note t h a t Cpl proves o u r "completeness" whenever t h e axiom o f f a c t o r i z a t i o n i s
Cpl : V x , y ( y C x x x
provable
T
+
- o f c o u r s e t h i s i s t h e case f o r ZF- ( r e c a l l t h a t T - denotes t h e t h e o r y
w i t h i n t u i t i o n i s t i c l o g i c ) . Obviously, Z F + Ind(E) i s equivalent t o the c l a s s i c a l s e t t h e o r y w i t h t h e axiom o f f o u n d a t i o n , w h i l e ( Z F + I n d ( E ) ) -
Zermelo-Fraenkel
is
equivalent t o i t s i n t u i t i o n i s t i c version presented i n [ F r 2 ] . w i l l be t h e c l a s s i c a l second-order p r e d i c a t e c a l c u l u s w i t h e q u a l i t y ZF2 extended by t h e f o l l o w i n g sequence 1 ) 2 8 ) 2 o f axioms f o r m u l a t e d i n t h e second-
-
o r d e r language whose a t o m i c f o r m u l a s a r e (xEX),
(x=y),
(oc,y>=z),
( x + l =y),
which i n a d d i t i o n c o n t a i n s f i r s t - o r d e r c o n s t a n t s 0.1 and one second-order
constant
n a t u r a l numbers). P a i r i n g : V X , ~3 ! z ( u ~ , y > = z )
A
( u ~ , y > f O ) h V u , v ( o ~ , y > =
x = u E y=v)), P r o d u c t : VX,Y3ZVx(zEZ
t+
3xEX 3yEY(OC,y> = z ) ) ,
Oom, Rg : VX3YVy(yEY ++ 3X(
A
VXilYVy(yEY
t-t
3X(a,y>EX)),
Union: V X , Y ~ Z V Z ( Z E c-t ~ (ZEX v Z E Y ) ) , CA: VX~YVY(YEY
++
YEX 8 cp(y)) f o r all cp,
C ( c o l l e c t i o n ) : VA(VXEA~Ycp(x,Y)
+
~ Z V X E AW ( X , ( Z ) ~ ) ) f o r a l l cp, where
( Z l x a b b r e v i a t e s { y : <x,y>E 21,
1, where ( Z C X ) a b b r e v i a t e s Y zEX) and ( Z E X ) a b b r e v i a t e s ( Z C X and X C Z ) .
Power: VX3YVZCX 3yeDom(Y) ( Z E (Y) Vz(zEZ
-t
( 0 , l ~ N ) and ( 0 + 1 = 1 ) and VXEN 3 ! y ~ N ( x + l = y ) and Vx N ( x + 1 # 0 )
Inf:
and V X ( O E X
& VXEN(XEX + X + lEX)
+
NCX).
The f o l l o w i n g theorem e x t e n d s theorem 1 f r o m [ F r 2
1,
Theorem 1 .
(a) ( Z F + I n d ( E ) / C p l ) (b)
ZF+ I n d ( E ) / C p l
i s c o n s e r v a t i v e o v e r ZF- f o r a r i t h m e t i c a l s t a t e m e n t s . 2 i s c o n s e r v a t i v e o v e r ZF2 f o r a r i t h m e t i c a l statemen'ts.
Paood. Step 1.
O b v i o u s l y , ZF;
We show t h a t ZF; Step 2. WF Set(U ) I= ( Z F + I n d ( E ) ) - , t o g e t h e r w i t h Se.t(UWF)
i s c o n t a i n e d i n ZF- and ZF2 i s c o n t a i n e d i n ZF.
proves S e t ( U )
!= (ZF+ C p l ) - t o g e t h e r w i t h
and t h e n c o n c l u d e t h a t ZF2 p r o v e s Set(U) (ZF+ I n d ( E ) ) .
++
For s i m p l i c i t y we s h a l l d e n o t e by x,y,..
...
.
.
I= ( Z F + C p l )
r e s p e c t i v e l y t r i p l e s ( x 0 ' X 1 ,X 2 ) ,
-+
( y ,Y , Y ) , Thus o u r Set(U) w i l l c o n s i s t o f a l l x w i t h (xOEX1 and X2cX1xX1), O 1 2 W F w h i l e Set(U ) w i l l c o n s i s t o f a l l f r o m S e t ( U ) such t h a t a l s o
L. GORDEEV
130
WF(Z) : VZ(VuEX1 (VvEX1 (
vEZ)
+
V E Z ) + X 1 C Z ) holds.
O ) , 1 ) Axioms o f t h e i n t u i t i o n i s t i c l o g i c w i t h e q u a l i t y t o g e t h e r w i t h t h e WF axiom o f e x t e n s i o n a l i t y a r e a l l t r u e i n b o t h S e t ( U ) and Set(U ) s i n c e Claim 4 above i s p r o v a b l e i n t h e second-order s e t t h e o r y ( ( 2 - CA) i n ZF;
0
For t h e empty s e t
2) y o :=
which i s contained
we t a k e (O,Xo,Yo)
w i t h Xo := {xEN : x = O l and
0=11.
{XEN:
3)
++
Pairing.
z1
Put z o := 0 ,
z2
P ) -,
( r e c a l l t h a t o n l y e x t e n s i o n a l i t y needs a s t r o n g v e r s i o n o f CA).
Given any x , y f r o m S e t ( U ) / S e t ( U
:= I 0 1
u
:= {<
u
101xxl
u
{<<1 ,y0>,O>}
WF
+ ++ ) d e f i n e z = {x,y}
as f o l l o w s
{ l } X Y 1 ,
u
{<
: EX2}
u I<<1
, u > , < l ,v>> :
+
t
< u , v > ~ Y 1 . Observe t h a t i s w e l l - f o u n d e d p r o v i d e d t h i s i s t h e case f o r b o t h x + + + + + + 2 and y. One can e a s i l y v e r i f y t h a t has t h e d e s i r e d p r o p e r t y V u ( u E z ++ u = x o r
t
+ +
u=y).
+
4)
Union. Given any x f r o m S e t ( U ) / S e t ( U := { O }
:= 0 , Y 1
YO {<
U {O}xX1,
Y
WF
:= {<
+
) define y =
t h e d e s i r e d p r o p e r t y VG(;€q
as f o l l o w s .
Put
3 v ( < u , v > ~ X ~and ) < v , x o > ~X 2 }
2 + < u , v > ~ X ~ } Observe . t h a t WF(x) i m p l i e s WF($).
7 has
+
ux
++
U
One can e a s i l y
3;:Ez(cE;)).
5 ) CA. Consider any f o r m u l a cp w i t h t h e d i s t i n g u i s h e d f r e e v a r i a b l e u, w h i c h 1 may a l s o c o n t a i n o t h e r parameters f r o m t h e l i s t z z". Given any sequence + + + WF + x,z1, zn o f t r i p l e s f r o m S e t ( U ) / S e t ( U ) d e f i n e y as f o l l o w s . Put y o := 0,
,...,
...,
Y 1 := { O }
u
{O} x WF
)
Set(U)/Set(U
xl,
Y2
:=
{<
C v,,,Z; ,..., z',[(v,X1
WF(q). One can e a s i l y v e r i f y t h a t
cpm
$
:
+
,X2),z1
E
x2} u
+ ,... ,zn] 1.
{<
:
x2
&
Observe t h a t WF(T) i m p l i e s
++ +
has t h e d e s i r e d p r o p e r t y V u ( u 6 y
+
t+
;Ex
&
1. 6 ) SC.
Consider any f o r m u l a v, w i t h t h e d i s t i n g u i s h e d f r e e v a r i a b l e s x , y
w h i c h may a l s o c o n t a i n o t h e r parameters f r o m t h e l i s t zl,...,zn.
+ +
t h e case o f S e t ( U ) . Given any sequence a , z l ,
+
t h a t s e t ( U ) C (VxE;3ycpZ1,...,Zn holds f o r the formula Ji(u,Y)
Ji
:= 3 y o ( v v ( v E ( Y ) o
+
,...,z n ] ) .
o f t r i p l e s f r o m S e t ( U ) , assume
Then Vu(EA2
c-+
V = y0
~x,y,zl,
A
(yOE(Y)l)
A
c(y!lx ( y ) , ) A Y,..., ~ ~z n ,l ) .~ Y ~ a p~ p l~y
, A , ~ , ~ ~ ~ , ~
+
Using t h i s Z d e f i n e t h e r e q u i r e d t r i p l e b as f o l l o w s .
B2 :=
U {
{<
,v>>>,O>
3Y$(u,Y))
((y),
NOW
c o l l e c t i o n t o conclude t h a t t h e r e i s a 2 such t h a t Vu(EA2
B1 := { O }
+
d e f i n e d as f o l l o w s :
...,, , [ ( u , ~ ~
set(u)
[zl
F i r s t consider
+
...,zn
+
,ZF;-~
Ji(u,(Z),,)).
Put b0 := 0 ,
: ~A2 & V E ( ( Z ) ~ ) ~ } , : EA2 & V E ( ( Z ) ~ ) ~U}
& < < u , < l ,v>>,>>E ,w>>>> : € A O +2 I t i s n o t h a r d t o check t h a t ( V ~ € z 3 ~ : E ~ A vV,y E b b Z E z v , ) h o l d s f o r o u r +++j + zn. a,b,z
{<
,
,v>>>,
((Z)u)2}
,...,
I n t h e case o f Set(UWF) one s h o u l d r e p l a c e t h e above f o r m u l a
Ji by ( J i
and
131
Constructive models for set theory
W F ( Y ~ , ( Y ) ~( Y , )2)),
7) 1
2
Power. Given any
.' < V , X ~ > E
{VEX
2 becomes
and o b s e r v e t h a t t h e r e s u l t i n g from Set(U)/Set(U
From t h i s X ,
X2}.
u s i n g ZF;
WF
we1 I - f o u n d e d .
) d e f i n e t h e c l a s s X as
- p o w e r and comprehension axioms we
o b t a i n some Y such t h a t VZCX 3 y ~ D o m ( Y ) ( Z e ( ( Y ) ) and VyEDom(Y)((Y)
*
+
Y
Y
CX).
Using t h i s Y d e f i n e t h e r e q u i r e d y = P ( x ) as f o l l o w s : Put y o := 0,
u
{O} u {O}xDom(Y)
Y1 :=
{l}x(Dom(Y)XX1),
Y2 := {<
: ysDom(Y)}U
: yEDom(Y) & VE(Y) } u {<>,
{<<1 ,
+ + +
Vu(uEy
tf
8) Y
+ +
UCX). ,Y ) , w i t h Xw := IN and o w O f course w i s well-founded.
I n f . D e f i n e t h e c o n s t a n t w as (0,X
:= {<m,n>
: O<m
U {<m,O>
t h a t N i s i s o m o r p h i c t o w;
: m>O}.
indeed, p u t i ( n ) := ( n + 1 ,Xw,Yu)
Observe
f o r each nEN and
look a t t h e f i r s t f i v e examples f r o m Remark 3 above.
9)
Set(U
WF
) C I n d ( E ) . The p r o o f i s s t a n d a r d : use t h e d e f i n i t i o n o f UwF and
2 - comprehension. -++ 1 0 ) Set(U) C C p l . We a d a p t t h e above p r o o f o f Lemma 1 . Given any x,y f r o m
ZF-
+
Set(U) w i t h ; C z x z
+
we have t o show t h a t t h e r e i s some z f r o m Set(U) and some g
from Set(U) ( r e g a r d e d as a s e t o f o r d e r e d p a i r s f r o m S e t ( U ) as u s u a l i n t h e s e t t h e o r y ) such t h a t
$: 2
2
++ ++
and Vu,v(Ey
F i r s t define a structure Put M :=
-
{VEX
1
:=
++
g(u) E g ( v ) )
.
S = (M,E) and e q u i v a l e n c e ( w i t h r e s p e c t t o E)
-
= ( V , X ~ , X ~ ) }o .f c o u r s e
U-v
+
u
{5}xx1,
z2
:= {<
,v>>
: VEM} U {<
{<<3,v>,<2,~>>
: VEM} U {<<3,~>,<4,v>>:
{<<5,s>,<5,t>>
: <s,t>&X
:
VEM}
u
(Xl,x2)-C
U {<<5,~>,<4,v>>
-
on M .
(u=v)
Put z o := 0,
{<
: VEM} U {<<4,v>,
VEM}
+
: <(u,X1,X2),(V,X,,X2)>EY},
W i t h t h e s e M,E , d e f i n e t h e d e s i r e d z as f o l l o w s .
KyJ({i}x~)
U {<,
tf
E := {EMxM
: (u,x1,x2)
:= { Q , V > E M X M
f o r a l l U,VEM.
Z,
:
++
+
,v>> :
: EE}
: VEM} U
VEM}
U
23 (compare w i t h t h e p i c t u r e f r o m t h e above p r o o f o f
Lemma 1 ) . A s has a l r e a d y been demonstrated (see t h e p r o o f o f Lemma 1 and r e p l a c e t h e i d e n t i t y ,=, (i),(ii)
by o u r -),
:((u-/Ev
*
t h e f o l l o w i n g h o l d s f o r a l l U,VEM (<0,u>,Z,,Z2)
(i),
( (u,Xl,X2)
(ii),
(<(u,Xl,X2),(v,X1,X2)>E;f
f o r a l l u,vsM.
= (v,X1,X2)
++
= /E(<0,v>,Z1,Z2)).
tf
Hence,
= (<0,v>,Zl,Z2))
(<0,u>,Z,,Z2)
(<0,u>,Z1,Z2)
and
E (<0,v>,Z1,Z2))
both hold
+
S i n c e , by t h e d e f i n i t i o n o f M and Z , t r i p l e s (
+
j u s t code t h e s e t z, w h i l e t r i p l e s (v,Xl,X2)
+
f o r v&M code t h e s e t x,
f o r VEM
In o r d e r t o +
complete t h e p r o o f i t i s s u f f i c i e n t t o c o n s t r u c t t h e s e t t h e o r e t i c analogue g o f t h e f u n c t i o n g d e f i n e d by g(v,X
X ) := (<0,v>,Z1,Z2) 1' 2
f o r a l l VEM.
I n order t o
produce such g we i t e r a t e o u r p r e v i o u s c o n s t r u c t i o n o f an unordered p a i r . o b t a i n f o r e v e r y VEM t h e c o r r e s p o n d i n g o r d e r e d p a i r <(v,Xl,X2),(<0,v>,Z
First
1 ' Z 2 )>,
L. GORDEEV
132 i.e.
{{(v,Xl,X2)},
{(v,X1,X2),(<0,v>,Z
p a i r l o o k s l i k e (O,V,Wv)
(W)v f o r some f i x e d c l a s s W. d e f i n a b l e i n ZF;
1
,Z2)}};
o b s e r v e t h a t e v e r y such o r d e r e d
f o r some f i x e d c l a s s V , w h i l e W
c o u l d be regarded as
We w i s h t o emphasize t h a t b o t h V and W a r e e x p l i c i t l y
by u s i n g o n l y ( X U Y ) , ( X X Y )
, Oom(X) , Rg(X)
and Ao-comprehension.
U s i n g t h e s e V,W we now d e f i n e t h e d e s i r e d t r i p l e g as f o l l o w s : p u t go := 0, G1
{o} u
:=
( M X V ) , G~ := {<
Step 3. As mentioned above,
: VEM} U {<
: <X,Y>E
t h e n a t u r a l numbers f r o m S e t ( U ) / S e t ( U
WF
( w ) ~ E VEM}.
) a r e isomor-
p h i c t o t h e ground ones. The p r o o f o f t h e theorem i s now f i n i s h e d . To complete t h i s s e c t i o n c o n s i d e r t h e f o l l o w i n g n i c e example. universe o f a l l f i n i t e structures.
L e t U be t h e
A c c o r d i n g t o o u r n o t a t i o n s f r o m Remark 3 , one
can r e g a r d U as t h e c o l l e c t i o n o f a l l f i n i t e o r i e n t e d graphs.
Then members o f
UwF a r e t h o s e w i t h o u t c y c l e s . The c o n s t r u c t i o n s i n t h e p r o o f o f Theorem 1 show WF t h a t S e t ( U ) and S e t ( U ) a r e r e s p e c t i v e l y models o f Z F - I n f + C p l and
-
I n f + I n d ( E ) . R e p l a c i n g t h e m e t a t h e o r i e s ZF; and ZF by r e s p e c t i v e l y c l a s s i c a l 2 (PA) and i n t u i t i o n i s t i c (HA) f i r s t - o r d e r a r i t h m e t i c (and u s i n g gadelnumbers w h i c h
ZF
code t h e s t r u c t u r e s ) conclude,
( Z F - Inf+Ind(E)/Cpl)-,(ZF-
t h a t every a r i t h m e t i c statement provable i n
Inf+lnd(E)/Cpl),
i s p r o v a b l e r e s p e c t i v e l y i n HA,PA-
w h i c h extends t h e f a m i l i a r r e s u l t o f W . Ackermann.
PART I I .
MODELS FOR CONSTRUCTIVE SET THEORY
According t o
[MI
(see a l s o [ F r 3 ] ) , t h e main d i f f e r e n c e between ZF- and a
c o n s t r u c t i v e s e t t h e o r y i s t h a t i n t h e l a t t e r axioms CA and Power a r e t o be r e p l a c e d r e s p e c t i v e l y by (Z -CA)
0
and E x p o n e n t a t i o n ( i . e .
g i v e n any two s e t s x and y
t h e r e i s a s e t z o f a l l f u n c t i o n s f r o m x i n t o y ) . T u r n i n g t o t h e above r e a s o n i n g f r o m P a r t l , n o t e t h a t i n t h i s case we can assume t h a t a l l o u r s t r u c t u r e s a r e c o u n t a b l e . To be more p r e c i s e , e v e r y
M from
S = (M,E)
i s supposed t o be a s e t o f
n a t u r a l numbers. W i t h t h i s r e s t r i c t i o n we can produce o u r e x t e n s i o n a l models w i t h i n ((Z; -CA)P)-,
as has been a l r e a d y mentioned i n P a r t I .
1
Note t h a t Z1 -comprehension
i s e s s e n t i a l from t h e c l a s s i c a l s t a n d p o i n t - o f
c o u r s e w i t h t h e e x c e p t i o n of t h e case o f f i n i t e S. To r e c o g n i z e t h i s , c o n s i d e r
S = (N,V)
w i t h N = s e t o f a l l n a t u r a l numbers and V = t h e u n i v e r s a l r e c u r s i v e l y
enumerable b i n a r y r e l a t i o n . Then n e i t h e r h x , y . ( x
=s y ) , nor A x , y . ( x E S y )
is a
hyperarithmetic relation. F o r t u n a t e l y , t h e s i t u a t i o n i s q u i t e d i f f e r e n t i n t h e case o f i n t u i t i o n i s t i c logic,
I t c o u l d be e x p l a i n e d as f o l l o w s .
11.1. Consider
t h e f a m i l i a r 2-nd o r d e r i n t u i t i o n i s t i c t h e o r y Elementary
133
Constructive models for set theory
- CA)r)-,
A n a l y s i s , w h i c h i s ((Z,
( = e l e m e n t a r y = bounded 0 and o n l y r e s t r i c t e d i n d u c t i o n on N . We
i t contains only A
i.e.
= p r e d i c a t i v e ) axiom o f comprehension,
s h a l l d e n o t e t h i s t h e o r y by EA. L e t EA* w i l l be EA extended by t h e f o l l o w i n g axioms.
ECTO : (Vn(,cp
+ 3mii))
+.
3eVn(-@
-t
3m(m= { e } ( n )
& @))) f o r a l l cp,@,
where { e l de-
notes (as, u s u a l ) t h e p a r t i a l r e c u r s i v e f u n c t i o n w i t h i n d e x e. SP(Shanin's p r i n c i p l e ) : VX3YVn(nEX
MPO : 1l(3mcp
3m T(
c+
f i x e d p a i r i n g function, f o r instance
-
Y ) ), where hn,m.
i s some
Xr1,m.(2".3~).
f o r a l l p r i m i t i v e r e c u r s i v e cp.
-+ 3mcp)
4. EA* i s c o n s e r v a t i v e o v e r HA+ECTO+MPO.
Remark To see t h i s ,
introduce the notion of
Define formula
e(71
realizes)cp
( 1 1 r e a l i z a b i l i t y ) w h i c h i s as f o l l o w s .
f o r a l l f o r m u l a s cp o f t h e language o f EA i n such
a way t h a t :
(i)
( e ( 1 1 r e a l i z e s ) ( x E X ) ) := T l ( < x , e > E X ) ,
(ii)
(e(7-
realizes)3Xcp/VXcp)
:= %/vX
e ( l 1 rea]izes)cp),
( i i i ) i n t h e case o f a t o m i c a r i t h m e t i c a l f o r m u l a s , l o g i c a l c o n n e c t i v e s and f i r s t - o r d e r q u a n t i f i c a t i o n s i t i s d e f i n e d j u s t as K l e e n e ' s 1945 n o t i o n o f r e a l i z a b i l i t y . One can e a s i l y v e r i f y t h a t EA*
i s provably ( 7 1 r e a l i z a b l e ) w i t h i n
EA+MPO.
Hence f o r e v e r y a r i t h m e t i c a l s t a t e m e n t A , (EA* b A) i m p l i e s
(EA+MPO
k <(-,-
r e a l i z e s ) A ) f o r some numeral
e r e a l i z e s A)
(EA+MPO b
c l u s i o n (HA+ECT + M P
0
0
e, w h i c h
i s equivalent t o
w i t h K l e e n e ' s 1945 n o t i o n o f r e a l i z a b i l i t y .
The con-
k A) f o l l o w s f r o m f a m i l i a r r e s u l t s , i . e . c o n s e r v a t i v i t y o f
EA o v e r HA and t h e c h a r a c t e r i z a t i o n o f K l e e n e ' s 1945 r e a l i z a b i l i ' t y by p r o v a b i l i t y i n HA+ECTO+MPO. The c r u c i a l o b s e r v a t i o n i s
5. (A
Claim
0
-definability
l a t i o n s on S w i t h i n E A * - M P O ) . f r e e v a r i a b l e s (n,m,Z) (01
c-f
5 b
o f t h e e x t e n s i o n a l e q u a l i t y and membership r e There a r e two e l e m e n t a r y f o r m u l a s O o and 0 1 w i t h
such t h a t VS = (M,E)3ZVn,m€M((Q0
( n E m ) ) ) i s p r o v a b J e i n EA*
f-t
Pa006. We d e f i n e an e l e m e n t a r y f o r m u l a P ( r , d l ,d2,d3,el
then p u t
OO(n,m,Z)
: 3 r 3 d 1d 2d 33e 1e 2e 3Vx,y(Y+
3V(3q(<
& yx
3u(3p(<,p>IIZ
& Yx,y~u,vI
o1 (n,m,z) Our
Y
,Y
[U,Vl)))
5 k
(n=m)).
A
- MPO.
A
,e2,e3,x,y,n,m,Z)
(Vu(3p(<,p>IIZ)
vV(3q(<
+.
+
I))),
: 3~3p(<
QO(n,R,Z)
.
i s g i v e n by
Y : 3 k ( 3 f i v e f i n i t e sequences: r = zO,zl,
..., zk , n
= uO,u1,
...,uk
= x
,
and
L.GORDEEV
134
m = v,,vl
,...,vk
,
= y
p1 ,..., pk
E <
zi+l (ui+l pi+l
= {el}(
,zi ,vi+,
= Ie3}(
,qi+l>)
*
&
& qi+l
= {d3}(
,pi+l>))
c zi+l
= te23(
,qi+l>)
or &
,qi+l>)))).
Now, g i v e n any S = (M,E)
+
= {dl } ( a i ,vi ,zi , u ~ ,pi+l>) + ~
= I d 2 } ( < u i ,vi ,zi , u ~ + ,pi+l>) ~
Vx,y(uc,y>~E
?
q1 ,...,qk such t h a t ) V i < k ( < c u i + l , u i > , p i + l > $ Z
,
a p p l y SP i n o r d e r t o g e t a
3p(
? b
( n = m ) ) and (Ql(n,m,Z)
Z such t h a t
W i t h t h i s Z we show t h a t (@,(n,m,Z) (nEm)),
t+
f o r a l l n,meM.
Obviously,
t-t
t h e second
e q u i v a l e n c e f o l l o w s f r o m t h e f i r s t one because o f t h e d e f i n i t i o n o f O1. t h e f i r s t one. The i m p l i c a t i o n
"+"
Consider
Y is just
i s t r i v i a l s i n c e o u r r e l a t i o n hx,y.
t h e r e q u i r e d W from Dfn. 1 p r o v i d e d t h a t @,(n,m,Z)
h o l d s . Now suppose t h a t t h e r e
i s some W C M x M such t h a t
3z(<<x,y>,z>$8)).
++
w) i n o r d e r
Vx,y,z,u,p((,z>tE
& z ' = {d2}(<x,y,z,u,p>)
2)
g
such
t h e r e i s an r such t h a t
Now a p p l y ECTO t o t h e c o n d i t i o n EQR(W) ( b y u s i n g t h e above c o r r e -
spondence between W and
1)
S i n c e
t o get d
d
1 ' 2'
& <,p>$Z)
~x,y,z,v,q((
Q
<
3v,z',q(v
such t h a t :
= {dl}(<x,y,z,u,p>)
+
3u,z',p(u
& <
= {el}((x,y,z,v,q>)
E <,z'>tW
3
,d2,d3,el
and el,e2,e3
E <,z'>tn
p = {e }(oc,y,z,v,q>)
W i t h t h e s e parameters Z,n,m,r,dl
3 +
& q = {d3l(a,y,z,u,p>)
E z l = {e2)(oc,y,z,v,q>)
d
,e2,e3
and
w now a p p l y
E <,p>t~)).
r e s t r i c t e d in-
d u c t i o n i n o r d e r t o p r o v e t h a t @ (n,m,Z) h o l d s . 0 To i l l u s t r a t e t h e s i t u a t i o n c o n s i d e r o u r example of t h e u n i v e r s a l r e c u r s i v e l y enumerable s t r u c t u r e
S
= (N,V).
R e c a l l t h a t i n t h i s case b o t h r e l a t i o n s
Xx,y. ( x = y~) and h x , y . ( x E 5 y ) a r e e s s e n t i a l l y
1
El f r o m t h e c l a s s i c a l v i e w p o i n t .
A c c o r d i n g t o t h e above p r o o f , f r o m a s u i t a b l e c o n s t r u c t i v e p o i n t o f v i e w t h e s e 0 r e l a t i o n s are both B
3'
11.2. Consider -
H. F r i e d m a n ' s b a s i c c o n s t r u c t i v e s e t t h e o r y I B - see [ F r 3 ] ,
b u t remember t h a t we s t i l l use t h e o r d i n a r y = , E - language o f s e t t h e o r y e n r i c h e d by t h e c o n s t a n t s 0,w.
instead o f Let
R e c a l l t h a t IB c o n t a i n s o u r ZF- axioms 1 )
- 41, 8)
, (A, - C A I
5 ) , ( E x p o n e n t a t i o n ) i n s t e a d o f 71, ( A b s t r a c t i o n ) ( = F a c t o r i z a t i o n )
instead o f
61,
and (A,
- DC).
IB* a b b r e v i a t e t h e t h e o r y
IB extended by
Enm : Vx3y(Fne(y)
& Dorn(y) C w & Rg(y) = x )
E C T ~: (vnEo(-,cp
+
3rnEoq)
S P : V X C ~ L J ~ Y (=X R g ( w X w - y ) ) MP:(VnEw(cpv7cp)
,
-+ 3 e E w v n E o ( + p
+
3m(m = { e } ( n ) E
$))I
& 7-,3nEwcp+3nEwcp)
f o r a l l cp.
I n a d d i t i o n we c o n s i d e r t h e axiom o f f o u n d a t i o n f r o m [ F r 2 ] , Fnd : V x , z ( T r a n s ( x )
f o r a l l cp,$
,
& VyEx(yCz
+
yEz)
+
xcz).
i.e.
,
135
Constructive models for set theory
Theorem 2.
PI LOO^.
IB*
5
Fnd/Cpl
i s c o n s e r v a t i v e o v e r HA+ECT + M P 0 0
We adapt t h e p r e c e d i n g p r o o f o f Theorem 1 u s i n g r e s u t s from s e c t i o n
11.1.
IB*.
Step 1 . O b v i o u s l y , HA+ECTO+MPO i s c o n t a i n e d i n
WF as o u r m e t a t h e o r y and d e f i n e models S e t ( U ) and S e t ( U ) as
Step 2. We t a k e EA above
- see p r o o f o f Theorem 1. We show t h a t EA
proves Set(U) C ( IB*+Cpl)
to-
g e t h e r w i t h Set(UWF) b ( IB*+ Fnd).
0),
- 4),
1)
8 ) , 5 ) . To c o n c l u d e t h a t EA*
- MP,
proves Set(U)/Set(U
WF
) C
(axioms o f t h e i n t u i t i o n i s t i c l o g i c w i t h e q u a l i t y t o g e t h e r w i t h t h e axioms o f i n f i n i t y , and A -comprehension), r e 0 p l a c e i n t h e c o r r e s p o n d i n g s u b p r o o f o f Theorem 1 b o t h ( ( Z - C A ) P I - and ZF; by
e x t e n s i o n a l i t y , empty s e t , p a i r i n g , u n i o n ,
EA* - M P O .
Claim
5 shows t h a t
6 ) A b s t r a c t i o n : Vx3y f o r m u l a s cp.
1
Consider any
i t does n o t harm t h e p r o o f .
= { { u E x : cp(u,z
1
,...,z k ) }
:
z
1
,...,z k E x }
for a l l
A,
A, f o r m u l a cp w i t h t h e d i s t i n g u i s h e d f r e e v a r i a b l e s
1 w h i c h may a l s o c o n t a i n o t h e r parameters f r o m t h e l i s t v ,...,vn. + + -+ WF ) c o n s i d e r an a r Given any sequence x,vl, vn o f t r i p l e s f r o m S e t ( U ) / S e t ( U 1 k -+ b i t r a r y sequence z o , z o o f elements o f x , i . e . one such t h a t f o r e v e r y i i 1 k w i t h l Q i Q k , < z 0 , x O > ~ X 2 . For e v e r y such sequence z, zo define the correWF ) by p u t t i n g o f t r i p l e s from Set(U)/Set(U sponding sequence +. *. + -+ -+ 21 := ( z i X X ) ; o b v i o u s l y z ' E x . W i t h t h e s e z I ,..., v l ,...,vn, u s i n g (A,-CA) 0' 1 ' 2 -t WF from Set(U)/Set(U ) such t h a t we can o b t a i n t h e c o r r e s p o n d i n g y ,z; z;, u,z
,...,zk,
...,
...,
...,
3 ,...,3
+.
&,
...
;v
€ ;(
y-+l zo,.
. . ,zi
looks l i k e (O,V,W W z;,
... , z i
+-+
z;,
zez
,. . . ,zT) 1.
+
y = {{u€x : cp(u,a
o+
...,z k
,...,z k ) }
moreover, C l a i m 5 shows t h a t f o r some f i x e d W. W i t h t h e s e V,W we
. .. , z ;
z;,
,..., 2;
2;
together i n order t o obtain the required t r i p l e
0, : z',
-+
...,z k € z } -
p a r t o f t h e p r o o f o f Theorem 1.10).
+
+
Observe t h a t e v e r y such y
) f o r some f i x e d V ;
c o u l d be regarded as (W)
+ z',
+ - +
& cp(u,zl
... , z ;
can c o l l e c t a l l o u r y
+
+-+
c.f.
t h e s i t u a t i o n from t h e f i n a l
Observe t h a t WF(2) i m p l i e s WF(q).
+-+ WF 7 ) E x p o n e n t i a t i o n . Given any x , y f r o m S e t ( U ) / S e t ( U ) we have t o c o n s t r u c t a WF 3-i- + -+
z from Set(U)/Set(U
) such t h a t Vg'sgEz
F i r s t d e f i n e t h e c l a s s e s M1,M2,Rl,R2
t-f
F n c ( g ) & Dom(G) =
2&
Rg($)Cq).
as f o l l o w s .
:= { U : E X 3 , M2 := { V : ~MlxMl : (u 1 ,X 1 ,X 2 ) = (u2,X1 , X 2 ) } ,
M
(vl ,Y1 ,Y2) = (v2,Y1 ,Y2)}
-
here we use C l a i m
e l e m e n t a r y f o r m u l a w h i c h says t h a t F
c
.
R2 := {al, v 2 > € M 2xM2 '
5. L e t Map (F ; M1 ,R, ; M2,R2) be t h e
M1xM2 i s a mapping f r o m M,
i n t o M2 b u t w i t h
L. GORDEEV
136
r e s p e c t t o e q u i v a l e n c e s R1 (on M1) and R (on M2). Observe t h a t t h e f o l l o w i n g 2 2-nd o r d e r v e r s i o n o f t h e axiom o f e x p o n e n t i a t i o n 3ZVF(Map(F;M1,R1
; M2,R2)
Indeed, a p p l y SP i n o r d e r t o g e t such
i s provable i n EA*-MPO. V U ( U E M ~f-t 3 p ( < u , p > t K l ) ) . Z := { < e , a , p > : (tKl
3eEOom(Z)(F?(Z),)
f-t
With t h i s
Vu,p(tM,
*
& < u , u ' > ~ R1
~ , u > ER1 &
VF(Map (F ; M1 ,R1 ; M2,R2)
-
13. 2
Kl
that
put
= veM2 E V U ' , ~ '
3v({el()
< v , { e l ( < u ' , p ' > ) > ~ R2))) R
+
*
Kl
and 3 u , p ( < u , p > t K ,
8
Then ECTO shows t h a t
3 e E Dom(Z) (F:
+ +
Now observe t h a t t h e c o n d i t i o n ( g : x
; t h e imp1 i c a t i o n " + "
(Z),))
.z0 +
i s obvious.
y ) i s e q u i v a l e n t t o 3F(Map ( F ; M1 ,R,
+
;
M ,R ) and V U E M ) M / E M ~eF f-t <(u,X,.X;) , (v,Y1,Y2)>Eg)), w h i c h shows t h a t 2 2 we can proceed as f o l l o w s . F i x a Z as j u s t o b t a i n e d , t h e n f o r e v e r y e E O o m ( Z ) de-f
f i n e t h e s e t t h e o r e t i c analogue g
o f t h e mapping (Z)
f i n a l p a r t o f t h e p r o o f o f Theorem 1 , l O ) .
+
as has been shown i n t h e
F i n a l l y , u s i n g t h e same method, c o l l e c t
*
a l l these g ' s together i n order t o o b t a i n t h e required t r i p l e Z s i t u a t i o n i:
t h e above p r o o f o f A b s t r a c t i o n .
v i d e d t h i s i s t h e case f o r b o t h
-
2 is
-
c.f.
the
well-founded pro-
;and .;
+
9) Enm. Consider any x f r o m S e t ( U ) / S e t ( U t r i p l e s (n+l,N,Yu)
Observe t h a t
WF
f o r a l l n E N , and ( m + l , N , Y
1.
w
Recall t h a t our naturals a r e
) i f and o n l y i f
) = (m+l,N,Y
m = n . Now f o r e v e r y ( 1 - s t o r d e r o b j e c t ) n such t h a t
+
O b v i o u s l y , t h e r e s u l t i n g t r i p l e y i s j u s t a f u n c t i o n w i t h maps some s u b s e t o f
+
o n t o x . Since w i s w e l l - f o u n d e d ,
WF();
) b (ECT +MPO) s i n c e o u r n a t u r a l numbers 0 MP i s o f c o u r s e d e r i v a b l e f r o m ECT + M P 0 0'
l o ) , 11) ECTo, MP. S e t ( U ) / S e t ( U a r e i s o m o r p h i c t o t h e ground ones. 12) Set(U
WF
i m p l i e s WF(q). WF
) b Fnd. The p r o o f i s s t a n d a r d . Use C l a i m 5 and A. -comprehension.
1 3 ) Set(U) I= C p l . Indeed, t h e o n l y p l a c e i n t h e c o r r e s p o n d i n g s u b p r o o f o f Theorem 1 i n w h i c h a non-elementary axiom has been used, was t h e d e f i n i t i o n o f E and
-.
But now we can a p p l y C l a i m 5 t o d e f i n e w i t h i n E A * - M P
F i n a l l y , observe t h a t SP
-
(Ao
- OC)
i s d e r i v a b l e f r o m (A,
0'
- CA) +
I n f + Enm+ECTO+
the proof i s t r i v i a l .
Note t h a t MPO was used o n l y t o p r o v e S e t ( U ) / S e t ( U
Step 3. Since n a t u r a l numbers f r o m S e t ( U ) / S e t ( U f r o m t h e ground model, statements.
IB*+Fnd/Cpl
WF
WF
) C- MP.
) are isomorphic t o the n a t u r a l s
i s c o n s e r v a t i v e o v e r EA* f o r a r i t h m e t i c a l
To conclude t h e p r o o f see Remark 4 above.
137
Constructive models for set theory
The main Theohem.
I I . 3.
IG(E)
1
: Vx3y i ( E ; x , y ) ,
(y =
v
n
Since i ( € ; x , y ) Cpl t h e s e IG(E)E
where i ( E ; x , y ) a b b r e v i a t e s t h e f o r m u l a
~
E
~
means “y
(
~+ uE ~ ~z + () v~~ zE) } ~) ,
~
i s t h e € - a c c e s s i b l e p a r t o f x”,
i n t h e presence o f
and IG(E) a r e j u s t t h e s e t t h e o r e t i c v e r s i o n s o f S .
i n d u c t i v e g e n e r a t i o n axioms IGE
and IG
Feferman’s
- see [ F l 1 , [ F Z ] . O t h e r w i s e , i f t h e
g i v e n s e t t h e o r y i s supposed t o c o n t a i n any v e r s i o n o f t h e axiom o f f o u n d a t i o n then b o t h IG(E) 1 and IG(E) do n o t c o n t a i n any s p e c i a l i n f o r m a t i o n , s i n c e obv i o u s l y Fnd i m p l i e s IG(E) 1 and Ind(€)
i m p l i e s IG(E).
Now c o n s i d e r t h e f o l l o w i n g l i s t o f c o n s t r u c t i v e s e t t h e o r i e s . IB*
5
SC
IB*
+
Ind(w)
2
I II.
IB*
+
Ind(w)
+ Sc 5
IV.
IB*
+
Ind(w)
+
V.
IB*
+
IG(E)
VI.
IB*
VII.
IB*
VIII.
IB*
IX.
IB*
Fnd/Cpl
F+ + Ind(w) + + Ind(w) + + Ind(w) + + Ind(w) +
R e c a l l t h a t H. respectively
5
.
I.
I I.
Fnd/Cpl
+
SC
Cpl
.
RDC
5
Ind(E)
5
Fnd/Cpl.
5
RDC.
SC.
IG(E) 1
+ Cpl.
+ Cpl. I G ( E ) I + Cpl + SC 5 RDC. IG(E) + Cpl + SC 2 RDC. IG(E)
Friedman’s c o n s t r u c t i v e s e t t h e o r i e s T1 ,T2,T3 f r o m [ F r
3 1 are
IB+SC+Fnd, I B + Ind(w) +SC+RDC+Fnd, I B + I n d ( w ) + S C + Ind(E)+ROC.
The Main Theorem says t h a t e v e r y t h e o r y f r o m t h e above l i s t I , s e r v a t i v e over the corresponding theory from t h e f o l l o w i n g l i s t .
I.
HA
II.
HA
+ +
ECTO + MP
0’
ECTO + MPO
1.
+ 0
I I I.
HA
+
ECTO + MPO
+
T I (
IV.
HA
+
ECTO + MPO
+
TI ( < ~ E ~ , + ~ O ) .
V.
HA
+
ECTO + MPO
+
T I (<m w D ) .
- I X . i s con-
L. GORDEEV
138
V VI VI I
. . .
HA HA
IX.
+ +
ECTO + MPO
+
ECTO + MPO
+ T I (<
HA
+
ECTO + MPO
+
HA
+
ECTO + MPO
+
Here T l ( < a )
TI(<
8(nU.EO)0). +
T I (< g
0).
w
0). €0TI(<~((BIEl+lO)O).
denotes t h e t r a n s f i n i t e i n d u c t i o n scheme o v e r t h e s p e c i a l p r i m i -
t i v e r e c u r s i v e system c1 of o r d i n a l n o t a t i o n s , based on t h e t h e o r y o f
-collapsing
Note t h a t ~ E o O < , . . . , < ~ ( ~ ~ E + l O ) Oa r e r e s p e c 1 t i v e l y t h e p r o o f t h e o r e t i c o r d i n a l s o f subsystems (El - A C ) , ID1, (2: - C A I I , 1 1 1 1 (C1 - L A ) , (El C A ) + B I , ( E 2 - A C ) , (E2 - A C ) + B I o f c l a s s i c a l a n a l y s i s the reader
functions,
see [ B ] ,
[ J ] , [JP].
-
-
w i l l f i n d enough i n f o r m a t i o n i n [ BFPS].
P r o o f o f t h e theorem. I I . The r e s u l t f o l l o w s f r o m t h e p r o o f o f Theorem 2 ( i t i s i n f a c t c o n t a i n e d
i n [ G 2 ] , b u t now t h e m e t a t h e o r y EA* I n d ( N ) . O f course,
i s t o be extended by t h e f u l l i n d u c t i o n scheme
Ind(N) i s p r o v a b l y (-,T
r e a l i z a b l e ) w i t h i n E A + Ind(N), w h i l e
) . Hence E A * + Ind(N) i s
t h e l a t t e r i s known t o be c o n s e r v a t i v e o v e r H A + T I ( < E € c o n s e r v a t i v e o v e r HA+ECT + M P + T I ( < € 0 0
)
-
see Remark
0
4
above.
€0
I . Compared t o t h e p r o o f o f Theorem 2, we d e a l w i t h t h e m e t a t h e o r y EA* enr i c h e d by t h e 2-nd o r d e r c o l l e c t i o n axiom C
-
c.f.
axiom
6 ) , o f ZF2 above. Observe
t h a t c o n s t r u c t i o n 6) from t h e p r o o f o f Theorem 1 shows t h a t E A * + C p r o v e s WF S e t ( U ) / S e t ( U ) C S C . Hence we o n l y have t o show t h a t E A * + C s t i l l i s c o n s e r v a t i v e o v e r HA+ECTo+MPO : To see t h i s , a p p l y o u r argument f r o m t h e p r o o f o f Remark 4. F i r s t note that C i s
(77
r e a l i z a b l e ) i n t h e presence o f C . Hence (EA*+C
i m p l i e s (EA+MP + C I-b r e a l i z e s A ) w i t h some numeral
0
s t a t e m e n t s A. Since (B r e a l i z e s A) i s n e g a t i v e ,
e for
I-
A)
arbitrary arithmetical
i t i s s u f f i c i e n t t o show t h a t
every negative a r i t h m e t i c a l statement provable i n E A + M P
0
+C,
i s p r o v a b l e i n PA.
T h i s r e s u l t i s i n f a c t c o n t a i n e d i n [ F r 3 ] , b u t we want t o be a l i t t l e more con1 s t r u c t i v e by u s i n g t h e n o t i o n o f (A r e a l i z a b i l i t y , w h i c h i n t u r n i s i m p l i c i t l y 1 1 1 c o n t a i n e d i n [F2]. T h a t i s , f i x s t a n d a r d u n i v e r s a l r e s p e c t i v e l y II and Z1 p r e d i 1 1 c a t e s P (m,x) and S (m,x) and p u t A, (
(,(A;
(ii)
1 1 ( e ( A l rea1izes)Wcp) := %Vp,q(A, (
reaIizes)(xEX))
Ie}(
( ii i ) ( e ( 4
1
:= ( x E X ) , +
Iel(
&
r e a l izeslcp),
r e a l izes)gXcp) := %Vp,q,n(e
1 n(A, r e a l i z e s l c p ) ,
= <
1
& A1 (
139
Constructive models for set theory
(iv)
i n t h e case o f a t o m i c a r i t h m e t i c a l f o r m u l a s ,
l o g i c a l c o n n e c t i v e s and
1-st o r d e r q u a n t i ' f i c a t i o n i t i s d e f i n e d e x a c t l y as K l e e n e ' s 1945 n o t i o n o f 1
r e a l i z a b i l i t y . One can e a s i l y v e r i f y t h a t E A + M P O + C i s p r o v a b l y (A, r e a l i z a b l e ) 1 1 w i t h i n t h e c l a s s i c a l t h e o r y (Z, -AC) 1 - c . f . t h e p r o o f o f ( E M O P + J G ( 8 , - A C ) ) 1 i n [ F21. F i n a l l y , (C - AC) F i s known t o be c o n s e r v a t i v e o v e r PA see t h e same
-
1
paper f o r p r e c i s e r e f e r e n c e s .
1945
To c o n c l u d e t h e p r o o f r e c a l l t h a t K l e e n e ' s
n o t i o n o f r e a l i z a b i l i t y does n o t change n e g a t i v e f o r m u l a s .
Ill. All v a b l e i n RA-
i n s t a n c e s o f t h e a r i t h m e t i c a l scheme Tl(
(rumified analysis i n levels
< 6 0 ),
are o f course pro-
which i s obviously contained
in
IB+ I n d ( w ) + S C . Hence HA+ECT + M P O + T l ( < g ~ o O ) i s c o n t a i n e d i n IB*+ Ind(w)+SC. 0 To o b t a i n t h e e s s e n t i a l p a r t o f t h e p r o o f we a p p l y t h e above r e a s o n i n g from I . But now, i n s t e a d o f E A * + C ,
RDC: (t/x(cp(X)
+
we c o n s i d e r t h e m e t a t h e o r y E A * + I n d ( N ) + C + R O C , where
3Y(cp(Y) E $ ( X , Y ) ) )
$((Z)n,(Z)n+l)))))
-+
W(cp(X)
-+
3'Z((Z)o
E X E V n E N (cp(Z),,)
6
f o r a l l cp,$
i s t h e 2-nd o r d e r v e r s i o n o f o u r s e t t h e o r e t i c ROC. T h i s m e t a t h e o r y proves WF Set(U)/Set(U ) ( I n d ( w ) + S C + R O C ) . To see t h i s i n t h e case o f ROC, f i r s t p r e s e n t WF 2-nd o r d e r f o r m u l a S e t ( U ) / S e t ( U ) C Vx(w(x) + 3y(cp(y) & $ ( x , y ) ) ) as VX(G(X) + 3'Y(G(Y) E G(X,Y)))
with suitable
t h e 2-nd o r d e r axiom RDC i n o r d e r t o g e t a Vn((P((Z),)
;((Z)",
&
Set(U)/Set(U
WF
(Z)n+l)),
Y
G,;,
then, g i v e n any X w i t h cp(X), a p p l y E X and
Z such t h a t ( 2 )
and t h e n c o n s t r u c t t h e s e t : h e o r e t i c
) of t h e f u n c t i o n hn.(Z),
p a r t o f t h e p r o o f o f Theorem 1 , 1 0 ) .
a
o
r e a l i z a b l e ) i n t h e presence o f Ind(N)+C+ROC.
+ Ind(N)+C+RDC k 0
from
i s provable i n
+ T I ( < ~ E ~ O ) To . see t h i s , f i r s t n o t e t h a t Ind(N)+C+RDC
i m p l i e s (EA+MP
2
To complete t h e p r o o f we have t o show t h a t
every a r i t h m e t i c a l statement A provable i n EA*+ Ind(N)+C+RDC, HA+ECT + M P
analogue
by u s i n g t h e above r e a s o n i n g from t h e f i n a l
is
Hence, ( E A * + I n d ( N ) + C + R O C
e realizes A)
w i t h some numeral
g. Then
(77
k A) apply
t h e above argument f r o m t h e p r o o f o f I i n o r d e r t o show t h a t E A + M P o + I n d ( N ) + C + 1 1 (A, r e a l i z a b l e ) w i t h i n c l a s s i c a l (2, - A C ) . As above, t h i s y i e l d s
RDC i s p r o v a b l e
t h e r e s u l t s i n c e gEoO =
I (El1 -AC) 1 .
V I , V I I . A l 1 i n s t a n c e s o f t h e a r i t h m e t i c a l schemes T I ( < ~ ( ~ w 2 W . ~ O ) O and ) TI
( < g ~ 0)
are provable respectively i n
%+I
observe t h a t t h e c l a s s i c a l systems
(II;
1 - CA)
(111
and (
-CAI-
(II;
, (II,1 - CA) + BI
t h e r e by t h e i r i n t u i t i o n i s t i c v e r s i o n s a s w e l l . Now, a r e d i r e c t l y c o n t a i n e d r e s p e c t i v e l y i n 1B+ I n d ( o )
+
(IT:
- C A I + BI)--see [ BFPSI,
c o u l d be r e p l a c e d
-CAI-
and
IG(E)F + C p l and
((II;
-CA)+BI)-
IB+ Ind(w)
+
I G ( E ) + C p l , a c c o r d i n g t o t h e t r e e theorem. For t h e second ( e s s e n t i a l ) p a r t o f t h e p r o o f , c o n s i d e r r e s p e c t i v e l y t h e metat h e o r i e s EA*+ Ind(N)
+
IGP : VX,R3Y i ( R ; X , Y ) ,
I G I ' and E A * + Ind(N) where i ( R ; X,Y)
+
I G , where
abbreviates the formula
( Y E ~ { ~ : V ~ E X ( V ~ ( < + ~ U , *E Z~ ) R-t ~ E z ) ) ) ,
L. GORDEEV
140
VXR3Y(i(R;X,Y)
IG:
and ( V v ~ X ( V u ( ( < u , v > ~ R + c p ( u ) ) + c p ( v ) ) + V V E Y cp(y))) f o r
a l l cp. I t s h o u l d be c l e a r , t h a t o u r I G P and I G have t h e same meaning a s t h o s e f r o m
,
[Fl]
[FZ]
( t h e o n l y d i f f e r e n c e i s t h a t i n o u r m e t a t h e o r i e s no 1 - s t o r d e r c o d i n g
of classes i s required).
(U,X,.X~)~(V,X~.X~)~.
a p p l y I G E i n o r d e r t o g e t Y such t h a t i ( R ; X , Y )
7 from Set(U)
define the required t r i p l e
Yz := {<
by y o := 0, Y
V E Y } U {<
k i(€;z,;);
Set(U)
Indeed, g i v e n any x
and R := { < u , v > € X :
from Set(U), p u t X := { v E X 1 : < v , x o > E X 2 } W i t h these X,R
-+
k IG(E).
Now, I G I proves Set(U) C I G ( E ) F and I G proves Set(U)
1
holds. F i n a l l y ,
{O} U { O } x X , ,
:=
< u , v > ~ X ~ } .I t i s c l e a r t h a t
moreover, t h e second a s s e r t i o n o f t h e d e f i n i t i o n o f I G ( E )
also
h o l d s i n t h e presence o f t h a t o f I G . We c o n c l u d e t h a t e v e r y a r i t h m e t i c a l s t a t e m e n t A provable i n
IB*+ Ind(w)
+ IG(E)
1 + Cpl,
IB*+ Ind(w)
+
I G ( E ) +Cpl
i s provable,
r e s p e c t i v e l y , i n EA*+ I n d ( N ) + I G P , E A * + I n d ( N ) + I G . i s (-,7 r e a l i z a b l e ) i n t h e presence o f I G / I G .
Now o b s e r v e t h a t I G F / I G
Indeed,
g i v e n X,R d e f i n e Y t o be t h e Y i n d u c t i v e l y g e n e r a t e d by
-X
-
:= {
: - ~ ( < V , Z > E X ) & VU,W(T-I
R := {<,
-
(c.f.
--
is
the d e f i n i t i o n o f I G i s also
(77
(77
+
{{e}(u)}(w)
k)}.
Using t h e r e c u r s i o n theorem i t i s n o t
-
t h e second a s s e r t i o n of
r e a l i z a b l e ) ; moreover,
r e a l i z a b l e ) provided t h a t Y s a t i s f i e s the f u l l
Hence, f o r e v e r y a r i t h m e t i c a l s t a t e m e n t A,
I G scheme w i t h t h e s e X , R .
e realizes A)
I- A ) i m p l i e s ( E A + M P 0 + I n d ( N ) + I G P / I G I(and K l e e n e ' s 1945 n o t i o n o f r e a l i z a b i 1 i t y ) .
+
R)
<,W>E
: -,~(C,w>~ K ) ]
the s i m i l a r construction from [FZ]).
h a r d t o show t h a t i ( R ; X , Y )
(
IGI/IG
(EA*+ Ind(N)
e
f o r some numeral
+ I n d ( N ) + I G P and E A + M P + I n d ( N ) + I G a r e i n an o b v i o u s way 0 O 1 1 c o n t a i n e d r e s p e c t i v e l y i n t h e c l a s s i c a l t h e o r i e s (Itl -CA) = (El - C A ) and
Now observe t h a t E A + M P
- CA) + B I
(I
1
= (Z
1
- CA) + 81.
As above,
since
(e r e a l i z e s A )
i s negative, t h i s
and GE y i e l d s t h e r e s u l t because c(S2w.~O)0 1 1 Qw+1 d i n a l s of CA) and (II, CA) + B I r e s p e c t i v e l y .
0 are j u s t the proof theoretic o r -
(n, -
-
IX. For s i m p l i c i t y l e t a , p , y denote r e s p e c t i v e l y t h e o r d i n a l s ( s y s -
V, V I I I ,
mwO
, p (aE1+,0)0.
,gS2 0 €0 HA + E C T +~ M P +~ T I (
+
spectively contained i n
IB*
+
Ind(w)
+
IG(E)
IB*+ I G ( E )
+ Cpl + SC.
E +
We f i r s t have t o show t h a t
H A + E C T +~ M P +~ T I ( < y ) a r e r e -
(
IB*+ I n d ( w )
Cpl,
I n t h e case o f
a = I (I(
+
E+
IG(E)
- CA)
E
I
=
can a p p l y t h e argument f r o m t h e f i r s t p a r t o f t h e p r o o f o f V I .
6=
l(Zi-AC)l
= IIO-+o(W)l
d i r e c t l y contained i n
(see [BFPS],
[BPI
1,
IB+ I n d ( w ) + I G ( E ) +Cpl + S C .
Cpl
+ SC,
1
1 (El - CA) F I
one
Next, s i n c e
o b s e r v e t h a t t h e o r y 10-Go(W) Finally,
t h e r e s u l t f r o m [ J ] w h i c h says t h a t a l l i n s t a n c e s o f t h e a r i t h m e t i c a l scheme
Tl(
is
i n t h e case o f y a p p l y
a r e p r o v a b l e i n t h e i n t u i t i o n i s t i c t h e o r y To f r o m [ F Z I . Note t h a t t h e
Constructive models for set theory
p r o o f f r o m [ J ] c o u l d be f o r m a l i z e d i n
I B + Ind(w)
+
141
IG(E) + C p l + S C as w e l l , by r e -
placing i n [J] the 'recursion theorem-definition'of
the operation ' w '
by t h e o r -
d i n a r y s e t t h e o r e t i c d e f i n i t i o n by i n d u c t i o n ( h e r e SC p l a y s t h e r o l e o f t h e J o i n axiom f r o m To): I n t h e second p a r t o f t h e p r o o f we proceed as i n t h e above p r o o f o f V I , V I I , but now we c o n s i d e r r e s p e c t i v e l y m e t a t h e o r i e s EA*+ IG1
+
ROC, E A * + I n d ( N ) + I G + C + R D C .
Then we a p p l y
(77
show t h a t f o r e v e r y a r i t h m e t i c a l s t a t e m e n t A,
+
C,
E A * + Ind(N)
realizability)
(EA*+ I G I
+
+
+ C
IGF
i n order t o
C k A), ( E A * + Ind(N)+
I G ! + C + R O C k A ) , ( E A * + I n d ( N ) + IG+C+RDC k A ) i m p l y r e s p e c t i v e l y (EA+MPO+ IG
e r e a l i z e s A ) , ( E A + M P 0 + Ind(N)+ I G F + C + R D C k e r e a l i z e s A), (EA+MPO+ I n d ( N ) + I G + R D C t e r e a l i z e s A). Next we m o d i f y i n an o b v i o u s way t h e above
+Ck
1 d e f i n i t i o n o f (A, r e a l i z a b i l i t y ) i n o r d e r t o d e f i n e t h e c o r r e s p o n d i n g n o t i o n o f 1 (Az r e a l i z a b i l i t y ) , w h i c h i s a l s o i m p l i c i t l y c o n t a i n e d i n [ F Z ] . One can e a s i l y EA+MPO+ Ind(N)+ I G 1 + C + R D C , EA+MPO+ Ind(N)+ I G 1 1 a r e p r o v a b l y (A' r e a l i z a b l e ) w i t h i n t h e c l a s s i c a l systems (X2-AC)P,(Sz-K), 2 1 ( Z 2 - A C ) + B I r e s p e c t i v e l y . As above, t h i s y i e l d s t h e r e s u l t s i n c e B and y a r e 1 1 j u s t t h e p r o o f t h e o r e t i c o r d i n a l s o f r e s p e c t i v e l y (E2- A C ) and (Ez -AC) + B I , w h i l e 1 1 ( E i - A C ) E i s known t o be c o n s e r v a t i v e o v e r (Il - C A I ! = (2, - C A I E f o r a r i t h m e t i c a l 1 1 statements ( [ F r 1 1 and ct = (Z1 - C A I
v e r i f y t h a t E A + M P O + IGF + C , +C+ROC
I
IV. ID;(W)
I t i s known t h a t ~
E
I.
~
~= IID;(W)I + ~ O
i n [ F r 3 1 , where t h e o r y
lO-(O)
(see [BFPS], [ B P I ) . Now, t h e t h e o r y
I B + Ind(w) + S C + I n d ( E )
i s d i r e c t l y contained i n
-
a p p l y t h e same method as
was shown t o be c o n t a i n e d i n T3 (one can r e g a r d W
as an a c c e s s i b l e p a r t o f some s p e c i a l p r i m i t i v e r e c u r s i v e system o f o r d i n a l notations,
+
s i m i l a r t o t h e one w h i c h a c c e s s i b l e p a r t i s K l e e n e ' s
MPO+TI(<&nl+lO)
i s contained i n
0 ) . Hence, HA+ECTO
IB*+ Ind(w) + S C + I n d ( E ) .
To g e t t h e e s s e n t i a l p a r t o f t h e p r o o f one c o u l d proceed as above by u s i n g t h e metatheory EA*+ Ind(N) + C + R D C + B I ,
and then showing t h a t t h e l a t t e r i s i n f a c t
c o n s e r v a t i v e o v e r H A + E C T O + M P O + T I(
by u s i n g t h e method d e s c r i b e d i n
[ZI . I t s h o u l d be i n t u i t i v e l y c l e a r
s l i g h t l y more c o n s t r u c t i v e way
-
however,
t h a t we can g e t t h e r e s u l t i n a
namely, by a s u i t a b l e c o n s t r u c t i v i z a t i o n o f t h e
s t a n d a r d e x t e n s i o n a l v e r s i o n o f t h e whole h y p e r a r i t h m e t i c h i e r a r c h y o f subsets o f N. T h i s can be done by u s i n g an a p p r o p r i a t e m o d i f i c a t i o n
O*
o f K l e e n e ' s 0, i n
o r d e r t o i n t e r p r e t SC i n t h e c o r r e s p o n d i n g e x t e n s i o n a l model. From t h e c l a s s i c a l v i e w p o i n t t h e m o d i f i e d system (i.e.
O*
w i l l d e s c r i b e t h e same s e t o f o r d i n a l s as 0
t h e r e c u r s i v e o r d i n a l s ) . So o u r p r o o f r u n s as f o l l o w s . F i r s t c o n s i d e r ( i n o r d e r t o i l l u s t r a t e t h e d i f f e r e n c e between 0 and
f o l l o w i n g 1 - s t o r d e r e x t e n s i o n ID-(O,H) (1)
O ( 0 ) & Vk(O(k)
+
O(Zk))
&
o f HA,
Vm(Vi(O({m)(i))
+ 0(3.Sm)),
O*)
the
L. GORDEEV
142
(do)
(3)
& Vk(cp(k)
+
~ ( 2 ~ 6) V) m ( V i c p ( { m } ( i ) )
+
~ ( 3 . 5 ~ ) ) Vn(O(n)+cp(n))) +
for a l l cp, where 0 and H a r e new r e s p e c t i v e l y u n a r y and t e r n a r y f i r s t - o r d e r p r e d i c a t e s ( f o r t h e s i m p l i c i t y we w r i t e cp({m)(i)) proves Vn(O(n)
+
V P , X ( H(p,n,x) ~ ~
f o r {m>(i)+ & cp({m}(i))).
Obviously,
IO-(O,H)
+H(p,n,x)).
Now o u r second-order o b j e c t s ( c l a s s e s ) a r e t o be i n t e r p r e t e d i n t h e language o f ID-(O,H)
f o r a l l p,n w i t h O(n).
as Xx.3zH(p,n,<x,z>)'s
Since the universe U o f
a l l s t r u c t u r e s (M,E) i s d e t e r m i n e d by t h i s i n t e r p r e t a t i o n , b o t h t h e u n i v e r s e s WF Set(U) and S e t ( U ) a r e d e t e r m i n e d as w e l l . However, t h e l a t t e r c o u l d be d e f i n e d WF i n a more i n f o r m a t i v e way. T h a t i s , i n s t e a d o f S e t ( U ) we w i l l c o n s i d e r Set(UWF(0)) by p u t t i n g WF(O)(Z) t o be t h e i n t e r p r e t a t i o n o f t h e f o r m u l a : 3m,s(O(m)
& VU,VEX,(EX~
{n : n + O m).
+
t o t h e ( r e c u r s i v e l y enumerable) s e t
Having i n mind o u r i n t e r p r e t a t i o n o f t h e second-order
s i d e r t h e m e t a t h e o r y IO-(O,H) Vn(T-,O(n)
{ s ) ( u ) 4 O p m { s } ( v ) ) ) , where d o r mdenotes
+
t h e r e s t r i c t i o n o f standard r e l a t i o n
O(n))).
+
+ ECTO+MPO(0), where
Observe t h a t ID-(O,H) +ECTO+MPO(0) p r o v e s S e t ( U ) / S e t ( U
C ( IB* + I nd ( w ) + R O C ) .
Set (UWF(') )
language, con-
MPO(0) a b b r e v i a t e s ( M P O +
Indeed, (
I=
IB*
+ I nd ( w ) )
WF
)/
f o l lows f r o m t h e p r o o f
of Theorem 2 s i n c e o u r i n t e r p r e t a t i o n o f E A * + Ind(N) i s p r o v a b l e i n ID-((I,H)+ ECTo+MPO(0) (remember t h a t H(p,n,x)
i s provably negative f o r O(n)),
s t r u c t i o n s ( e x c e p t t h a t f o r C p l ) p r e s e r v e WF(O) as w e l l as WF.
t h i s i s s t i l l t r u e because t h e r e (see t h e p r o o f o f I I I ) we g e t a f u n c t i o n w i t h range C O , w h i c h codes t h e d e s i r e d f u n c t i o n
and a l l con-
I n t h e case o f ROC
total r e c u r s i v e
"t";t h e r e f o r e
the
supremum o f t h i s f u n c t i o n does e x i s t as an element o f 0, w h i c h shows t h a t t h e structure
ID-(O,H)
t
i s i n t e r p r e t a b l e and p r e s e r v e s a l s o WF(O).
F i n a l l y , axiom 3 ) o f
t o g e t h e r w i t h t h e r e c u r s i o n theorem p r o v e s Set(UWF(o))
every a r i t h m e t i c a l statement provable i n
IB*+ Ind(w)
+
b
Ind(E) + R D C ,
I n d ( O ) . Hence, i s provable i n
ID-(O,H) + E C T ~ + M P ~ ( ~ ) . However, i n o r d e r t o i n t e r p r e t SC by u s i n g t h e same r e a s o n i n g we need t h e boundedness theorem ( t h e r e c u r s i v e image i n 0 o f an a r b i t r a r y h y p e r a r i t h m e t i c s e t i s e f f e c t i v e l y bounded i n
O),
w h i c h does n o t seem t o be p r o v a b l e i n I O - ( O , H ) +
ECTO+MPO(0). T h i s i s t h e reason why i n s t e a d o f ID-(O,H) version (1)*
IO-(O*,H*),
O*(O) +
we c o n s i d e r t h e m o d i f i e d
w h i c h i s g i v e n by
& Vk(0*(k)
O*(39.5R.7m))
( 2 . 1 ) * Vp,x(H*(p,O,x)
+
-
O*(2k))
& Vk,q,m(O*(k)
,
{p}(x) = 01,
&
Vi(H*(q,R,i))+0*({m}(i))
143
Constructive models for set theory k
) +(H*(p,Zk,x)
(2.2)*
Vp,k,x(O*(Z
(2.3)*
V p , q , R , r n , ~ ( O * ( 3 ~ . 5 ~ . 7 ~ )-+ ( H * ( ~ , 3 ~ . 5.7 , x )
R
u = {m}(i)
(3)*
(cp(0)
& H*(q,L,i)
-+
* cp(2 1) vn(O*(n)
Observe t h a t ID-(O*,H*)
{m} : Ai.H*(q,R,i)
-+
O*
m
c-t
173i,u,v(x
=
&
E H*(p,u,v)))),
k
& Vk-(cp(k)
cp(3q.5R.7m))
O*,H*
++Vu~~3vH*(p,k,-%,u,v>))),
& Vq,R,m(cp(R)
+
& V i (H*(q,R,i)
+
v({m}(i)))
-+
9 ( n ) ) ) f o r a l l cp.
p r o v e s t h e boundedness theorem, s i n c e now e v e r y
i s bounded i n
O*
by 3q.5R.7m.
Hence, r e p l a c i n g O,H by
one can a p p l y t h e above argument i n o r d e r t o show t h a t e v e r y a r i t h m e t i c a l IB*+ Ind(w)
statement p r o v a b l e i n
+ SC+
Ind(E)
+ RDC,
i s p r o v a b l e i n ID-(O*,H*)
+
ECTO+ MPO (O*). The n e x t s t e p i s r o u t i n e .
(O*
Define the notion o f
r e a l i z a b i l i t y ) t o be t h e t r i v -
i a l e x t e n s i o n o f K l e e n e ' s 1945 r e a l i z a b i l i t y by ( e ( O * r e a l i z e s ) O * ( n ) ) := O*(n) := H*(p,n,x).
and (e(O* r e a l i z e s ) H * ( p , n , x ) ) i s p r o v a b l y (0* r e a l i z a b l e )
i n ID-(O*,H*)
a r i t h m e t i c a l s t a t e m e n t A, (ID-(O*,H*) MP
(O*) I-
e realizes A)
Observe t h a t ID-(O*,H*)
+ECTO+MPO(O*)
f o r some numeral
e and
I- A )
Lemma 2. L e t ID(O*,H*)
I- A ) ,
be ID-(O*,H*)
m e t i c a l s t a t e m e n t p r o v a b l e i n IO(O*,H*),
P/r00,4.
+ECTO+MPO(O*)
w i t h classical logic.
I- A )
Then e v e r y a r i t h -
i s p r o v a b l e i n PA+TI(
By a f a m i l i a r t r i c k ( s u g g e s t e d t o t h e a u t h o r by S . Feferman and ( i n d e i s contained i n ID,.
( (a) v (b) v (c)
1,
( b ) : 3 k ( r 1 = 2 ~& O*(k) & ( j = O
X
E. v i ( x ( l , q , R , i )
j = o E, l i , u , v ( x = < u , v > & u = { m } ( i ) j = 1 E. V i , u , v ( x = < u , v >
E u=Cm}(i)
X
( i i ) (vj,p,n,x(A(cp;
*
- CA)
-+
x(I,q,Il,i)
E,
x(o,p,u,v)).v.
v X(I,p,u,v)))),
v X ( l ,z,n,y)
).
- e x t e n d e d by
P(j,p,n,x)
j,p,n,x)
v Oz({m}(i)))
E, X(O,q,R,i)
where O*(n) a b b r e v i a t e s Vz,y(X(O,z,n,y) L e t I D1 (A) be (A,
.v.
I),
E. o,*(L)
= 3q.5L.7m
&4{pI(x)=o))),
& Vu3vX(O,p,k,<x,u,v>)
j = 1 6 3uVvX(1 ,p,k,*,u,v>)
A(P ; j , p , n , x )
E
where
( n = ~ & ( j = ~ & { p } ( =x o ) . v . j = l
( c ) : 3q,R,m(n
Consider t h e
:= ( j = O v j = 1 )
f o l l o w i n g p o s i t i v e second-order p r e d i c a t e A ( X ; j , p , n , x )
(i)
+
i t i s s u f f i c i e n t t o prove the following
p e n d e n t l y ) P . Aczel ), we show t h a t IO(O*,H*)
(a):
i m p l i e s (ID-(O*,H*)
K l e e n e ' s 1945 r e a l i z a b i l i t y . As
0 u s u a l , i n o r d e r t o g e t t h e r e q u i r e d c o n c l u s i o n : (ID-(O*,H*) implies ( H A + E C T O + M P O + T I ( < ~ ~ S i l + , O )
+ECTO+MPO(O*)
+MPO(O*) and c o n c l u d e t h a t f o r e v e r y
+
, cp(j,p,n,x))
f o r a l l cp a r i t h m e t i c a l i n P,
-+
vj,p,n,x(P(j,p,n,x)
* cp(j,p,n,x))
L. GORDEEV
144
where P i s a new f i r s t - o r d e r & - p l a c e p r e d i c a t e . Now p u t O*(n) proves ID(O*,H*),
:= O:(n)
and H*(p,n,x)
:= O*(n)
& P(O,p,n,x).
F i r s t use ( i ) i n o r d e r t o d e r i v e ( 1 ) * o f IO(O*,H*). O*(n) & P ( l , p , n , x )
and use ( i ) ,
*
Vp,x(H*(p,O,x)
(2.1)'
(2.2)'
k
Vp,k,x(H*(p,2
,x)
* Vu3vH*(p,k,o(,u,v>)
v i ,u,v(x= Then p u t O+*(n) := O*(n)
(2.2)',
tf
(2.2)'
o*(P,)
O*
vi(~(l,q,E,i) v +
,
*
O*
v
{m}(i)))
&
and
{m}(i)))
E,
v Fir(p,u,v))).
F(q,k,i)
& Vz,y~(P(O,z,n,y)
v O*({m}(i)))
,x)
& F(p,u,v))
& P(l ,z,n,y))
( 2 . 3 ) ' , a p p l y ( i i ) i n o r d e r t o d e r i v e Vn(O*(n)
i m p l y (2.1)*,
k
o*(k) & Vi(P(l,q,k,i)
tf
E u = Cm}(i)
i n o r d e r t o d e r i v e ( 3 ) * o f ID(O*,H*) Vi(P(l,q,k,i)
~ ( { p } ( x )= 0))
and F ( p , Z
& u = { m } ( i ) & H*(q,k,i)
~(p,3q.5'.7~,x)
*
,
Vp,q,k,rn,~(H*(p,3~.5'.7~,x) 3i,u,v(x=
:=
Then p u t F i r ( p , n , x )
( i i ) i n order t o derive
{ p } ( x ) = 0 and F ( p , O , x )
3 u V v F ( p , k ,o(,u ,v>)) (2.3)'
Then ID,(A)
w h i c h can be shown s t e p by s t e p as f o l l o w s .
+
and, u s i n g (2.1)', OT(n)).
Then a p p l y ( i i )
- use t h e above i m p l i c a t i o n t o t r a n s f o r m
i n t o Vi(P(O,q,R,i)
( 2 . 2 ) * o f ID(O*,H*),
+
O*({m}(i))).
Finally,
w h i l e ( 1 ) * + ( 3 ) * + (2.3)'
(2.1)O,
implies (2.3)*
o f ID(O*,H*). To complete t h e p r o o f o f t h e lemma r e c a l l t h a t e v e r y a r i t h m e t i c a l s t a t e m e n t
-
p r o v a b l e i n ID1, i s p r o v a b l e i n P A + T I ( < ~ E ~ ~ + ~ see O ) [ BFPS]. T h i s f i n i s h e s t h e p r o o f o f t h e theorem.
I I .4. Find -
RematLh6.
1. The s t r o n g e s t s e t t h e o r y i n [ F r 3 ] was T4 = T 3 + ( f u l l ) CA.
Combining ( i n
f a c t , s i m p l i f y i n g ) t h e p r o o f s o f t h e above theorems one can e a s i l y p r o v e t h a t
T$-= lB_*+ I n d ( w ) + S C + R D C + I n d ( E ) + C A , as w e l l as any o t h e r c o n s i s t e n t e x t e n s i o n of
IBf+CA by axioms f r o m t h e above l i s t I - I X .
m e t i c a l s t a t e m e n t s as ( f u l l ) second-order
,
a l l have t h e same p r o v a b l e a r i t h -
i n t u i t i o n i s t i c a r i t h m e t i c HA2 extended
by ECTO+MPO. (N.B. IBT = B * - S P ) .
2 . A l l c o n s e r v a t i o n r e s u l t s from t h i s p a r t ( i n c l u s i n g t h e above remark) a r e preserved i f TC :
IB* i s supposed t o i n c l u d e a l s o Vx3y(Trans(y) & x C y & Vz(Trans(z) & x C z
Exp, :
Vx,y3zVg(gEz
AC! :
Vx,y(VuEx3!
t-f
ycz))
,
Fnc(g) & D o m ( g ) = x & R g ( g ) C y ) ,
v E y cp
cpvP,[g(u)l)) , f o r
-t
-+
3 g ( F n c ( g ) & Dom(g) = x & Rg(g) C y & V u E x
a l l cp.
The p r o o f i s an o b v i o u s m o d i f i c a t i o n o f t h a t o f Theorem 2.
145
Constructive models for set theory
3. A l l
s e t t h e o r i e s f r o m t h i s p a r t ( i n c l u d i n g t h e ones i n remark 1 , 2 )
have
t h e d i s j u n c t i o n p r o p e r t y , e x i s t e n t i a l d e f i n a b i l i t y p r o p e r t y f o r n a t u r a l numbers, and a r e c l o s e d under C h u r c h ' s R u l e CRo.
T h i s s i m p l y f o l l o w s f r o m t h e above p r o o f s
o f t h e theorems and t h e well-known p r o p e r t i e s o f t h e n o t i o n o f r e a l i z a b i l i t y .
4. I n a few words, t h e c r u c i a l s t e p i n t h e above p r o o f s f r o m P a r t I I . 2 , 3 . was as f o l l o w s .
Given an e x t e n s i o n a l c o n s t r u c t i v e s e t t h e o r y T ,
i t s suitable
S was d e f i n e d i n such a way t h a t f o r e v e r y a r i t h m e t i c a l s t a t e m e n t A , (T+ECTO+MPO k A ) * (S+ECTO+SP+MPO I- A) * r e a l i z e s A ) , w h i l e ECT + SP was used t o p r o v e t h e A. - d e f i n a b i 1 i t y o f (S+MP 0 k 0 e x t e n s i o n a l e q u a l i t y and membership r e l a t i o n s ( C l a i m 5 ) o f S e t ( U ) , f o r s u i t a b l e U. i n t e n s i o n a l ( s a y ) second-order v e r s i o n
e
The n o t i o n o f r e a l i z a b i l i t y was based on t h e p a r t i a l r e c u r s i v e f u n c t i o n s .
k
observe t h a t t h e d e s i r e d c o n c l u s i o n ( S + M P o
e r e a l i z e s A)
Now
c o u l d be proved d i -
r e c t l y , w i t h o u t u s i n g ECTO+ SP, because t h e A - d e f i n a b i l i t y o f = , E i s p r o v a b l y 0 r e a l i z a b l e i n S -which f o l l o w s d i r e c t l y f r o m t h e p r o o f o f Claim 5. Moreover, t h e l a t t e r does n o t depend on any s p e c i a l model o f A - c a l c u l u s w h i c h i s assumed t o determine t h e c o r r e s p o n d i n g n o t i o n o f r e a l i z a b i l i t y . choose i t s Feferman - s t y l e e x t e n s i o n SApp
Hence,
i n s t e a d o f S one can
based on t h e a b s t r a c t n o t i o n o f a p p l i -
c a b i l i t y (compared t o [ F l ] , [ F2] no f i r s t - o r d e r c o d i n g o f c l a s s e s i s r e q u i r e d i n SApp). Then c o n c l u d e t h a t f o r e v e r y a r i t h m e t i c a l s t a t e m e n t A , (sAPp F
t
r e a l i z e s A ) f o r some a p p l i c a t i v e t e r m
According t o t h e " r e a l i z a b i l i t y t h e l a t t e r i m p l i e s (SApp
+
+
I- A) *
p r o v a b i l i t y " arguments f r o m [ B e 1
1,
I- A ) . Next t h e m a i n s t e p i s t o show t h a t e v e r y a r i t h -
m e t i c a l s t a t e m e n t p r o v a b l e i n SApp, w i t h t h e corresponding o r d i n a l M.
forcing
(T
t.
i s p r o v a b l e e i t h e r i n HA o r i n H A + T l ( < a )
a ( c f . t h e Main Theorem). ( T h i s method, due t o
Beeson, was used ( i n a l i t t l e more c o m p l i c a t e d f o r m ) i n [ B e 2 1 i n o r d e r t o
prove t h a t
IB i s c o n s e r v a t i v e o v e r HA).
The(proof-theoretic) proof o f t h i s re-
d u c t i o n does n o t seem t o be e s p e c i a l l y d i f f i c u l t e x c e p t f o r t h e case when S con1 t a i n s C o l l e c t i o n ; one c o u l d n o t succeed i n (A. - r e a l i z a b i l i t y ) because o f t h e
1
e s s e n t i a l r o l e o f c l a s s i c a l l o g i c i n t h e p r o o f o f (Xi -AC)
*
1
(Ai - C A I .
The p a r t i a l r e s u l t a l o n g t h e s e l i n e s i s as f o l l o w s I.
lB+SC+Fnd/Cpl
II
,
i s c o n s e r v a t i v e o v e r HA.
V I , V I I . Unstarred versions o f s e t t h e o r i e s from the f i r s t l i s t
I I , V I , V I I ( c f . t h e Main Theorem) a r e r e s p e c t i v e l y c o n s e r v a t i v e o v e r HA+Tl(
w i t h the corresponding o r d i n a l
c1
f r o m t h e second l i s t I I ,
VI, VII.
O f course a l 1 these conservation r e s u l t s a r e preserved f o r TC, Expl,
AC!.
Moreover,
this i s s t i l l true ( [ G 3 ] ) with
IB extended by Enm,
IB extended a l s o by t h e
axiom o f c h o i c e f o r a l l f i n i t e t y p e s , w h i c h i s known t o be i n c o m p a t i b l e w i t h CTO.
L.GORDEEV
146
B I BL I OGRAPHY. Beeson, M.
Goodman's Theorem and beyond. Pac. Journ. of Math.
(841,
1979, 1-16. Beeson, M. E x t e n s i o n a l i t y and choice i n c o n s t r u c t i v e mathematics Pac. Journ. o f Math., (88), 1980, 1-28. Buchholz, W. Normalfunktionen und K o n s t r u k t i v e Systeme von Ordinalzahlen. Proof Theory Symposium, K i e l 1974. Springer L e c t u r e Notes i n Math., i+ 500, 1975, Springer V e r l a g B e r l i n , 4 -25. Buchholz, W., Pohlers, W. Provable w e l l - o r d e r i n g s o f formal t h e o r i e s f o r t r a n s f i n i t e l y i t e r a t e d i n d u c t i v e d e f i n i t i o n s . J . o f Symb. L o g i c , (431,
1978, 118 - 125.
Buchholz, W., Feferman, S., Pohlers, W., Sieg, W. Iterated inductive d e f i n i t i o n s and subsystems o f a n a l y s i s ; recent p r o o f - t h e o r e t i c a l studies. Springer L e c t u r e Notes i n Math. # 897, Springer Verlag B e r l i n , 1981. Feferman, S. A language and axioms f o r e x p l i c i t mathematics. Algebra 450, 1975, 87 -139. and Logic. Springer Lecture Notes i n Math., i# Feferman, S. C o n s t r u c t i v e t h e o r i e s o f f u n c t i o n s and classes. In M. Boffa, 0. van Oalen, K. McAloon (eds.). L o g i c Colloquium '78. North-Holland Publ.
Co., Amsterdam, F i n s l e r , P. ( 2 5 ) , 1926,
1979, 159 - 224.
uber d i e Grundlagung der Mengenlehre. Math. Z e i t s c h r i f t ,
683-713, 1
Friedman, H. I t e r a t e d i n d u c t i v e d e f i n i t i o n s and Z2 - A C . I n A. Kino, J. M y h i l l , R.E. Vesley (eds.), I n t u i t i o n i s m and Proof Theory. NorthHolland Publ. Co., Amsterdam, 1970, 435 - 442. Friedman, H. The consistency of c l a s s i c a l s e t theory r e l a t i v e t o a s e t t h e o r y w i t h i n t u i t i o n i s t i c l o g i c . J. o f Symbolic Logic, (381, 1973,
315-319. Friedman, H. Set t h e o r e t i c foundations f o r c o n s t r u c t i v e a n a l y s i s , Ann. o f Math., (l05), 1977, 1-28. Gordeev, L. A m a j o r i z i n g semantics f o r h y p e r a r i t h m e t i c sentences. Nauchn. Semin. LOMl, (68). 1977 (Russian).
Zap.
Gordeev, L. An approach t o c o n s t r u c t i v i z a t i o n o f C a n t o r ' s Theory o f Sets. The same volume. Gordeev, L .
IB+ACFT
i s s t i l l c o n s e r v a t i v e over HA. (unpublished n o t e ) ,
1980. J l g e r , G. A w e l l - o r d e r i n g p r o o f f o r Feferman's theory T o . To appear i n A r c h i v f a r Math. L o g i k und Grundl. Jzger, G. & Pohlers, W.
(4-
CA)
+ 81
Eine beweistheoretische Untersuchung von
und verwandter Systeme. To appear i n S i t z u n g s b e r i c h t e der
Bayerischen Akad. der Wissenschaft, MUnchen. [Mi
1
M i r i m a n o f f , D. Les antinomies de Russell e t de B u r a l i - F o r t i e t l e probliime fundamental de l a t h e o r i e des ensembles. L'Ens. Math., (191,
1917, 37-52. M y h i l l , J.
374 - 382.
C o n s t r u c t i v e s e t theory. J . o f Symbolic Logic,
(401, 1975,
Shanin, N. On t h e c o n s t r u c t i v e i n t e r p r e t a t i o n o f mathematical judgements, Trudy Math. I n s t . Steklov, (521, 1958.
Constructive models for set theory [Sh2]
Shanin, N. On a hierarchy of methods of interpreting propositions in constructive mathematics. Trudy Math. Inst. Steklov, (129), 1973, 203 266.
[TI
Troelstra, A. Metamathematical investigation of intoitionistic arithmetic and analysis. Springer Lecture Notes in Math., 344, Springer Verlag Berlin, 1973.
[Z]
Zucker, J . Iterated inductive definitions, trees, and ordinals. In [TI, 392 453.
-
-
147
THE LXJ. BROUWER CENTENARY SYMPOSIm A S . Troelsira and D. van Dalen (editors) 0 North-Holland Publishing Company, 1982
149
A NOTE ON BAR INDUCTION RULE susumu
HAY AS HI^)
Institute of Mathematics, University of Tsukuba Sakura-mura, Niihari-gun, Ibaraki, Japan
The bar induction rule (BIR) is a derived rule corresponding to the principle of bar induction. BIR for HA(f) was noted by Kreisel [19651, 3.341. BIR for HAS and HAH was proved by Hayashi [1977, 19801 and BIR for HAw was proved by Howard [1980]. On the other hand, Schwichtenberg [1977] proved the bar recursion rule for HAw. The purpose of this paper is to prove BIR for the systems which are introduced
by Feferman and Friedman to formalize Bishop's constructive analysis (BCM) and also for some stronger systems of intuitionistic set theory. The proofs of BIR mentioned above are syntactical. The proof of Hayashi [1977] is very similar to Brouwer's 1 'proof' of the bar theorem, i.e. any normal derivations of 111 theorems of HAS or HAH are very similar to the so-called fully analyzed proofs. This will be an advan-
tage of the syntactical method. However, the proof theoretical method (Gentzen's method) is not flexible. It seems to be impossible to apply such a method directly to the systems considered in this paper. We will overcome this difficulty in the following two methods. For the systems without sufficent inductive definitions we will reduce BIR for them to BIR for subsystems of analysis by the methods in Feferman [1978], Friedman [1977], and prove BIR for such systems by Gentzen's method. For the systems with sufficent inductive definitions we will use semantical methods. In Beeson [1977], Beeson used a forcing method (uniform forcing) to prove the rule of uniform continuity, which is a generalization of the fan rule. The semantical proofs of BIR for various systems were found by some people independently. Their ideas were essentially same, but the ways of presenting the ideas were different. Beeson used K-forcing, Grayson used Heyting valued models over formal Baire space, Troelstra used the elimination of choice sequences and the author used a topos theoretic method, which is equivalent to Grayson's method. Fourman and Joyal used a beautiful topos theoretic method which is a refinement of the method of Grayson and the author. Unfortunately, none of them is suitable for all systems considered in this paper. For this reason, all versions of the proof will be used in this paper.
I would like to thank the people who helped me. Especially, I would like to 1) The author is partly supported by Grant in Aid for Scientic Research Proj.
No. 434007.
1so
S. HAYASHI
thank Prof. M.J. Beeson, Prof. M.P. Fourman, Dr. R.J. Grayson and Prof. A.S. Troelstra for information on their unpublished work on BIR and for their permission to make use of it. I am grateful to Dr. Grayson and Prof. Troelstra for critical comments and suggestions on this paper.
I . PRELIMI;\IARI€S The systems considered in this paper are divided into three groups as follows: 1. Feferman’s systems for BCM,
2. Friedman’s systems for BCM, 3. proof theoretically strong subsystems of IZF+RDC. Feferman’s systems are based on the notions of functions and classifications.
A ECA 5
The systems considered in this paper are EN;-’/ and EM:-)
+J+ IG(-)r?
t ECA
IG(-)
J , EML-)l+
variants of these with choice principles will be studied EM:-)
+ J + IG(-)
by Th-) and TA-’
J 4. IG(-)r+
ECA
in the notation of Feferman [1978]. Some
+ ECA by
too.
We will denote
To as in Feferman [19781.
Friedman’s systems for BCM are subsystems of IZF
+
RDC (intuitionistic ZF set
theory with the relativized dependent choice). They are distinguished from the systems in the third group by their considerable lack of proof theoretic strength. The systems in the second group considered in this paper are B, T1’ T2’ T3, T4 in the notation of Friedman [1977]. The systems in the third group are not adequate for BCM, but adequate for topos theoretic investigiations. We will study IZF, IZ, 1Z and their variants with 0
or without ACC or RDC. IZF is the intuitionistic ZF set theory with collection, IZ is intuitionistic Zermelo set: theory, IZ is the system obtained from I2 by 0 restricting separation to A -separation, ACC is the axiom of countable choice and 0
RDC is the axiom of relativized dependent choice. We will consider the following forms of BIR for these systems. Let S1 and
S
2
be classes of formulae of a theory T. (S1, S2)-BIR: if Vf 3n A(&) & A & U < ~ is a theorem of T and A is a unary formula in the set S1 then the following is also provable in T: (AcB where Ind(B) is wzu
Vu E
w
<w
&
A : monotone &
( Va
E
w(u*
L E X)
+
Ind(B)) u
E
-f
W < ~ ~ B ,
X) , B belongs to the set S2 and
is the set of finite sequences from w. If S1 and S2 are both the class of arbitrary formulae, then (S1,
be denoted by FBIR. If S1 is the class of arbitrary formulae and
S2
S2)-BIR will is the class
of formulae which are permitted for the comprehension or separation in the system T, then (S1,
S2)-BIR will be denoted by FBIRO. Hence the conclusion of FBIRO is
equivalent to the one which is obtained through replacing the formula B by a new class or set variable. For the systems B, T1, T2 in the group 2, we will consider
151
Bar induction rule
(D, S2)-BIR where D is the class of definable formulae in the sense of Beeson [1978] and S2 is the same in the case of FBIRO. We will denote this by DBIRO. Note that the full bar induction rule FBIR does not hold for all systems considered in this paper. We list here the systems for which FBIR does not hold. PROPOSITION 1. FBIR does not hold for the following systems: 1. all of the systems in the group 1 except Ti-), To, 2. B, T1, T2 in the group 2 , 3 . I2 in the group 3 . 0
PROOF. Let T be one of those systems in this proposition. Let< be a pnnitive recursive ordering on the natural numbers. Define Ax by x€w<' & x=<xl, ,xn> & l(xl Z
...
... > xn).
If WF(<) is provable in T and BIR holds for T, then TI(< ,F) is provable in T for any formula F. (WF and TI are defined as in Feferman [1977],
&
<
be the although we use the following version of WF: Vf 3n( lf(n+l)< fn).) Let standard ordering on the natural numbers. Of course 1WF(<). If FBIR holds for EMi-)b, then the schema of full induction holds for it. Then EM;-)\ to EM;-).
However, EM:-)
is stronger than EMi-'r.
is identical
Indeed we can prove the consist-
ency of the latter in the former. (Cf. Feferman 119781). Similarly for the systems without full induction, e.g. B, T1, IZo. The proof theoretic strength of each of these systems was estimated in terms of a subsystem of analysis with the same proof thoretic strength in Feferman [1978], Friedman [1977]. By these results we can see that full induction increases the proof theoretic strength of these systems. For I20 the proof thoretic strength is just equivalent to that of HAH. Indeed we can prove Consis(HAH)
Consis(IZo) in HAH by means of the semantics in Hayashi [1981].
Since a model of HAH is constructed in IZ0 system. Let T be the system EMo
+J+
+
full induction, IZ0 is weaker than this
IG(-)r.
The elementary comprehension ECA for
all elementary formulae can be replaced by a finite number of special cases without loss of effect. (The special cases of ECA are essentially equal to the axioms generating classes in BG.) So we may assume that T is finitely axiomatized except for full induction. So we can use the well-known argument of Kreisel and Levy [1968]. Namely, there is an instance of a formula F such that TI(< ,F) is not provable in T, where
<
is the cannonical ordering up to
FBIR does not hold for the systems EM(-) 0
+
J
cO.
Since WF(<) is provable in EM(-) 0 ' ECA. Finally we deal the
+ IG(-)b
system T2, which is not finitely axiomatized. Obviously WF(<)
is provable in it.
Hence, if FBIR holds for it, then the schema of full induction up to cb holds for it. Then we can construct than
E )
a
model of R A ( < E ~ )(ramified analysis with levels less
in T2. However, T2 and RA(
152
S. HAYASHI
other systems mentioned in Proposition 1, we will prove the full bar induction rule FBIR. For the above three systems DBIR holds. 0
Now we prove an important lemma, by which we can reduce our monotone BIR to a recursive BIR. LEMMA 1 (recursive continuity rule). Let T be one of our systems except B, T1' T2. If Vf 3n A(5n) is a theorem of T, then there is a natural number e such that the following formula is also provable in T: Vf cww(f={e1
&
Vgcww(!f(g) & A(f(g)))), where f(g) and !f(g) are defined as in Troelstra [1977]. For B, T1 and T2 this rule holds provided that the formula A is definable in the sense of Beeson [1978]. PROOF. This lemma is a direct consequence of the results on the formalized explicit definibility property in Beeson [1977, 19781. Some systems in the group 1 and 3 do not appear in Beeson 11977, 19781, but this is not a problem. Note that the method of constructing the model of IZF + RDC in the corresponding non-extens i o n a l theory in Beeson [1978] does work even for T3 and T4, although Beeson used
other models for these two systems. Thus we can prove this lema for these two systems without restriction on the formula A. By means of this l e m a we can reduce the monotone BIR to a recursive BIR. Assume that the assumption of the l e m a holds and e is the number obtained by the lemma. If we set R = {uE w<(": 3f(uL{e)(f))>, then the following formulae are provable in T: <w R is a monotone subset of w , Vf iIn(Fn E R,) , if A is monotone then RegA. Hence it is sufficent to prove the following versions of BIR. RBIR (RBIRO): Let R be a formula representing a primitive recursive predicate. We denote the formula Vf 3n(Fnc R) & R:monotone by WM(R). If WM(R) is a theorem of T then the following formula is also provable in T: (RGF & Ind(F)) -+ U < ~ S F , where F is an arbitrary unary formula (F is a formula permitted in the rule BIRO). We will prove these versions of BIR in the following sections. 2 . WEAK SYSTEMS: SYiWACTlCAL PROOFS
In this section we will prove RBIRO for EM:-)I'
kJ
ECA, EM:-)
+ J 5 ECA,
B, T1 and T2. We will consider also some variants with choice principles. First we prove a lemma, by which we can reduce BIR for systems with choice to BIR for systems without choice.
Bar induction rule
153
2 IG(-) 5 IG(-) 1 ACFT is conservative over T for Ill formulae.
2
LEMMA 2. Let T be one of the systems EMi-)F+ J tion). Then T
2
5
ECA
(full induc-
1 PROOF. By Ill formulae we mean the formulae which are logically equivalent to one of the following form: Vf 3n t(’in)=O, where t is an application term of EM:-) representing a primitive recursive function. Since formulae of the form f
Yl F
are essentially (V,3)-free, the soundness theorem of 71-realizability for To* in Feferman [1978], IV, 11.1-12.2 can be refined so that T,,*
+
(AC~~)*CF +
Furthermore, we can find a term
3f T:-) s
t
f tl F
for
L*.
FE
such that
(-+- Vf E 8 (f,sf)E#. TO 1 So the i- -realizability does not change the essential meaning of I$ formulae. Hence 1 Lemma 2 holds for T:-’, and similarly for the other systems. It should be noted that this result is implicit in Beeson [1977], Theorem 1.6.5.
PROPOSITION 2. RBIRO holds for EMi-)p
5
J
5
ECA
+ J 2 ECA 5
2 ACFT, EM;-)
ACFT, B, T1 and T2. PROOF. By Lemma 2 it is sufficent to prove RBIRO for EMi-)r
5 J,
EM:-)
+ J,
B,
T1 and T2. Firstly we deal with Feferman’s systems. Assume that WM(R) is provable in EM(-) + J, where R is a formula representing a primitive recursive predicate. 0 1 Feferman [1978] constructed a model of EM$-)r + J in (I1-AC)rby interpreting the 1 classes as Al-indices. We may relativize this construction to any number theoretic 1 1 functions. Hence WM(R) is provable in (X1-AC)r. It is known that (X1-AC)l is conservative over PA. Furthermore we can show that (E:-AC)P
is conservative over
PA(f),
where PA(f) is the system obtained from PA by adding a function variable f. 1 Note that we consider f as a variable of (Z1-AC)t. (We will use the notation T(f) for other systems with the same meaning, and we will also use the notation T(X), where X is a predicate variable.) This conservation result will be proved by various methods. We adopt Friedman’s argument. In Friedman [1977] he showed Kj which 0 1 is an extension of (Z1-AC)r is a conservative extension of PA for II2 sentences. It is fairly easy to relativize this result. Namely K3 (f) is a conservative extension
0
of PA(f) for 112 formulae. Let M be the set I~Ew<~:uERVlth(u)<2}. Note that M is infinite and recursive. Let i be a bi-recursive isomorphism from w to M such that iy, i< >=O. We define a recursive ordering R on w such that x XR y iff ix where * is the Brouwer-Kleene ordering on Then the ordering 4R on w has
<*
<
the maximum element 0. Let TI(
be the sequent Vx( Vy(ydRx
It is not so difficult to see that TI(IR,X) is provable in PA(X).
+
Xy)
+
Xx)=?XO.
Let Zm(X) be the
infinitary system of first order arithmetic Zm with X. (Cf. Schwichtenberg [19771.) Let Il be a cut free derivation of TI(XR,X) in the system Z_(X).
As in Hayashi
[1977a], we analyze the structure of this derivation. First we define a subtree P of Il as follows:
S. HAYASHI
154
1. The end sequent of II belongs to P. 2. If the lower sequent of the following inference belongs to P:
r * x, s
r then an upper sequent
r
=)
=)
X,
x,
s<
+
for all s e
Xs
vy(y
+
w
XY)
t + Xs belongs to P iff s X R t is true.
R
3 . If a lower sequent of an occurrence of another kind of inference belongs
to P, then all upper sequents of it belong to P. Second we replace each occurrence of formula in P according to the following translation F b F*: Xt* s<
R
=
Xt, ( Vy(y<,t
-f
Xy))*
=
Xt, ( s d R t
-f
Xs)*
=
Xs, where
t is true, and F* is empty, i.e. F is eliminated, for the other formulae. Let
11* be the resulting tree of sequents. Then it is a recursive infinitary derivation
with the following inferences: 1. If s and t represent the same number, then Xs 2.
* Xt is an initial sequent.
The usual structural rules, the rule of cut, and the rules of repetition,
i.e., S/S and
r
-e A
0
-:/re
A n , are permitted.
3 . The progression rule, i.e.
r *TI,
Xs
for all s such that s i R t
r * n,
xt
I
is permitted. If t represents the minimum element, then this rule turns into an initial sequent
r * II,
Xt. (Note that we can find the minimum element
effectively.) Weeliminateall cuts in TI* by the standard method (cf. Schwichtenberg [ 1 9 7 7 ] , 3.5) and eliminate all rules of repetition by the trivial method. Let l’l 0 be the resultXsn* ing derivation of *XO. Then all sequents in IIo have the form * Xsl, Set min( *Xsl,...,Xs ) = minIXsl, Xs }. Assume that {x:FxI is a class and min( * A ) + Fz) for all Vx( Vy‘yiRxFy Px) holds. Then we can prove V z ( z
...,
...,
-f
sequents * A
in IIo, since llo has an ordinal assinment less than e O . Hence we can
conclude VxFx. These arguments can be formalized in EMk-’p.
Hence we have proved
V X(TI(
+
(C
U < ~ E X is ) prov1 -AC) instead of 1
1 (hl-AC)p. Next we use the following result of Friedman 119701 : (Zt-AC) is a conser1 vative extension of RA(<E 0) for 112 formulae. Then we see that TI(dR,X) is provable
in R A ( < E ~ ) if Vf 3n R(%)
is provable in EM-:’
+ J.
By SchUtte 119771, Theorem
22.7 and the inequality $aB < $ E ~ O for any a, B < e O , we can prove RBIRO for EM;-’
+J
if TI(a,X) is provable in EMo
+J
for each a < 0 ~ ~ This 0 . condition is
easily verified, since SchUtte [ 1 9 6 5 ] , L e m a 5 is easily formalized in EM:-) + J. Note that Schiitte formalized his proof of TI(0e.O) in an intuitionistic version of RA(
Using ECA(-)
+
Ga <
E ~ .
and the join axiom, we can construct a model of the intuitionistic
Bar inductionrule
155
RA(
contain existential quantifiers and there are no essential uses of disjunctions in his proof of the transfinite induction. So ECA(-) is sufficient for the model 1 construction. The II2 theorems in B, T1, T 2 are also provable in PA(f), PA(f), RA(<E~), respectively. This is proved by relativizing the proof of Friedman [1977],
Theorem (p. 2 3 ) . Hence by the same arguments as for Feferman's systems, we can prove RBIR,,
for these systems. Note that we can perform the above formalization of
Schiitte's proof of the transfinite induction in T2, using A 0 -separation and strong collection. As a byproduct of the above proof, we can estimate the suprema of provably recursive well-orderings of those systems.
+
COROLLARY 1. The suprema of provably recursive well-ordeings of EMi-)b+ J + J ECA f. ACFT, B, T1 and T 2 are, respectively, E ~ , E
ECA f. ACFT, EM:-) E~
and
~ ,
$goo.
3 . STRONG SYSTEMS: SEMANTICAL PROOFS
In this section we will prove RBIRO for EMh-)f & J
+
IG(-)E+
+ ACFT
ECA
(full inducrion) and RBIR for the remaining systems by semanticel methods. We will prove RBIR for IZF precisely and will give brief sketches of proofs for the other systems. To prove RBIR we will use the cHa of formal opens of Baire space. We will denote this cHa by 0. The theory of formal spaces is developed by Fourman and Grayson [198?]. We do not consider the general theory. We will define Cl directly. In the following u, v, w... are used to denote finite sequences of natural numbers, uzv means 'u is an extension of v' and [u] denotes {v:v
Set
Ju = {R: R is a well-founded monotone bar of u, i.e.
Vv
&
Then J is a Grothendieck topology on the poset
w<',
VX((R5X
&
Ind(X))
+
vu~R([u]cR)
&
RS[u]I.
i.e. it satisfies the following
four conditions:
1. Ju is a family of monotone subsets of [u], 2.
[u] E J U ,
3. if R
E
Ju and v
4 . if R E Ju, R' is monotone subset of [u] and Vv ER(R' n [v] E Jv), then R' E Ju. Note that Ju is a filter by these properties, i.e. R n S E J U for R, S s J u and if S Z R E J U and
S
is a monotone subset of [u], then S E J U . Set 0 = {S:Scw
<w
Let R be a monotone subset of
& w
S:monotone
. Set
<w
&
V R E J U (Rc_S-tu~S)l.
S.HAYASN
156
jR = {u:Rfl[u] E J u I .
By the above properties of J. we see that R G j R and jR belongs to Q. Furthermore, jR is the smallest set in R that contains R as a subset. Hence j is identical on R. LEMMA 3. R is a cHa, i.e. Q, a,
A
,v exist and vx (RA
A
S)=VRA
x
S.
A
PROOF. If R, S E Q , then R n S E n . Hence RAS=RES. If RA E R , then j( U R ) E R . Hence \ / R a = j (
u
x
Rx).
Let Rh,
If u belongs to
S EQ.
VRa and S ,
A E
X
R n S n [u]
V(RAh S).
x
LEMMA 4 . Let RA, R E G and XSw<'.
If V R A = R , U R C X and Ind(X),
x
A UE
U
a x
A
belongs to Ju, i.e. u
PROOF. If
A
then
then RSX.
A-
R, then u RAn [u] belongs to Ju, i.e. it is a well-founded bar
of u. Hence u belongs to X.
x
Note that these facts are provable in IZ0. Hence we can construct)'(V
in IZF.
(Cf. Grayson [1979] for V(n).) Assume that a unary formula R satisfies the assumption of RBIR. By the formalized soundness theorem, IZF k'V(')k WM(R)'. From now on i.e. we will work in IZF. Let f be the generic element of uw in V"), dom(f)=~x~, f(<&ii>)={u:u= & u =n}. m
,...
Then it is easy to check (f:w + d = 1. Assume that Ind(X) and R E X . Let n be a natural number and let v be an finite sequence of natural numbers. Set Rn,v = f ? R~ & >?n'n. Then
v
Rn,v = 1,
v
g./
V
v
Thus u is an extension ,l[fO=v & fl=vl &...& f(n-l)=vn-lJ, where V=
E
+ ACC k
'V(')k
ACC'. Assume that u belongs to the set
w 3y E a A(x,y)l.
Then u belongs X ={u:
to
Fix a natural number m and set R = aynBA(g,y)] for y dom(a). Y Y R y , where y runs through dom(a). Set
31viIi wIyili ,(i#j
+
[vil A [v, 1 4 .
v Ivil=Iul and vi
E
1A(g,yi)l)l.
i
Then obviously
h,Ii
w,
hiIi
5 X and Ind(X) by ACC. By Lemma 4 u belongs to X. Take Y Y such that they satisfies the condition in the definition of X
U R
for U. We denote these by {vm,ilm,i E u , on m. (ACC is used!) Set
1m,iE
to indicate the dependence
Bar induction rule
157
v
v
dom(f)=wxdom(a),
f(<m,y>)= V[vm,ilh UY=Y~,~]. i Then u belongs to the set [f:w-+a & Vx cwA(x,fx)D. Similarly RDC is valid in)'(V by RLIC itself. So RBIR holds for IZF t ACC RDC. Similarly for the other systems. For the system T4, there are some problems. Since T does not have the axiom 4 of power set, is not a set but a class. So we must modify the definition of V"). For technical reasons, we will use the sheaf theoretic formulation of V(n) in Grayson [1975], Takeuti and Titani [19811. (See Grayson [1981] for a general theory of forcing in intuitionistic systems without power-set.) In T4 the supremum of any subclass { R X I A E Aof Sa is also given as in Lemma 3 , since there exists a set I s h such that U R = U R Note that the recursion ?,€A AcI theorem in Grayson [1975] holds in T4. So by transfinite induction on E , we can define V F ) E TC({a}) for any set a as follows: x=
.
&
Ex€
xyLExA Ey.
&
Define V(n) by iff a E V y ) . aE We can define [at:bl , b=bj as in Takeuti and Titani [1981]. The axioms of T 4 except the axiom of exponentiation are satisfied as usual in the Heyting valued model, and this is easily verified in T 4 . We will show the validity of the axiom of exponentiation in T4. and {RiIiE IgSa such that [u]= V R i , there i €1 I such that [u]= Rfn. And this fact is provable in T 4' n EW
LEMMA 5. For any element u of w<' exists a function f:w
-+
v
PROpF. Standard and left for the reader. Note that we need ACC to prove this. Let a, bc V").
Without loss of generality, we may assume that a is a presheaf,
i.e. a is definite in the sense of Takeuti and Titani 119811 and for any p e wcw and x E dom(a) the element x b of V(n) also belongs to dom(a). Furthermore, we assume that b is definite. By the exponentiation axiom the collection of all denumerable subsets of dom(b) which are compatible in the sense of Takeuti and Titani [1981] is a set. We denote it by X. Set
n =n,
B = {VA:A< X I / [ = obtained glueing the elements of A (cf. Takeuti where V A is the element of)'(V and Titani [1981]). Of course B is a set, and E and 1 = 1 on the elements of B are induced from E and 1 = 1 on V(*).
For any a E V(n) we define a* E V")
dom (a*)=Ix cdom(a*):Ex=[u]}, dom(a*)= Then ua*=a]= 2 . Let Y be the set
"w
UE
<w
{
For any
[u]7:
u <wdomu(a*), a*(x)=ax, UE
w
Ey=Efy, Ef A [y=y'I(
we define Ffc V(n),
nfy=fy']l 1 .
say g, by
by
Ea*=Ea.
158
S. HAYASHI Eg=Ef=[u], dorn(g)={<x,y>':
Define
C E)'(V
[c=ba] =
by dom(c)=F"Y,
1. This
x cdomu(a*) & y cfx), u(<x,Y>)=ExA Ey. cx=Ex, and Ec= %. Then it is straightforward to show
completes the proof of FBIR for T4. Note that the fundamental
ideas of this verification is due to Beeson [1978]. REMARK 1. Since we needed ACC in Lemma 5. The above proof is not applicable to T -RDC. However, T4 is reducible to HAS and BIR for HAS is known. So we can 4 prove BIR for T -RDC by a syntactical method.
4
REMARK 2. The proof of BIR using the cHa
is due to Grayson. The author's
original proof was topos theoretic. He used models in the Grothendieck topos over the site (w<',J).
By the aid of the comparison lemma in SGA 4, it is easily <w ,J) is equivalent to the topos over 62. Hence
checked that the topos over (w
Grayson's method and the author's method are practically equivalent. However, Grayson's approach is more understandable for logicians. REMARK 3. Fourman and Joyal [198?] have obtained a refinement of the above proof. Their proof does not use Lemma 1. They use the glueing method which was used by Freyd to prove the explicit definability property for intuitionistic simple type theory. Roughly speaking, Fourman and Joyal used the rule of continuous local choice in Hayashi 119801 instead of Lemma 1 and performed the two steps in our proof at once by using more sophiscated cHa. However, it seems impossible to
apply their method to T4 and weaker systems. It is impossible to apply the above proof to T3, since full separation is
necessary to show the validity of A -separation in 0
So we cannot prove BIR of
it directly as for the above systems. Friedman [1977] reduced T3 to ID(o), which 1 does n o t have separation axioms. As in section 2 we can prove that 111 theorems of T are also provable in the system BI in Friedman [1977] by using a relativized 3 version of the [ I-realizability in Friedman [1977], Lemma 3.4. By the reduction 1 steps in Zucker [1973], p.443, we see that 111 theorems of T3 are also provable in EL
+ BIO. Assume
that a formula R satisfies the assumption of RBIR for Tg. Then we
see that CS
t
Va 3n(ineR)
by the above argument. Using the elimination theorem (cf. Troelstra [1977], 6.16), we see that IDBl I- 3e E K Vn(en#O
-f
Va
E
n(a(en-1)
E R)).
We can construct K in T just as in constructed in T3 in Friedman [1977]. So we 3 can interpret IDBl in T3. Hence we can prove the conclusion of RBIR f o r R by using the induction principle for K in T 3' REMARK
4. By the above,argumentusing the elimination theorem, we can prove
RBIR for IDB1. This is due to Troelstra. Note that ACC in IDBl is necessary for the
Bar inductionrule
elimination theorem,
so
159
also in this case we needed ACC. In general ACC is used in
the weak systems,in which the topology J is not small or does not exist,to replace J by more convenient covering families. It should be noted that the elimination method is not equivalent to the semantics over the cHa of formal opens of Baire space. G. van der Hoeven and I. Moerdijk have shown that it is practically equivalent to a monoid forcing. Finally we will prove BIR for Feferman's systems with inductive generation axioms with the aid of Beeson's K-forcing. K is the class of the neighbourhood functions defined by the inductive definition IG(-)r
or IG(-).
K-forcing is essen-
tially equivalent to sheaf semantics (Kripke-Joyal semantics) over the site (w<',J),
if we assume ACC. In K-forcing, only the covering families induced by the
members in K are used, so we need ACC to prove the soundness theorem for it. However, Feferman's systems considered here have no choice principles. So we need the following lemma.
J + IG(-)t'? IG(-) 5 (full LEMMA 6. Let T be one of the systems EMi-)I + ECA + ACFT is conservative over T for formulae of the form
induction). Then T Af.{e}(f)
E K , where e is a numeral.
PROOF. Assume that Af.{e)(f)
E
K is provable in T
+ ECA + ACFT.
As in Lemma 2,
u ,
we see that 3z((z,hf.{e}(f))
EK) is provable in T, where
is defined as in
Feferman [1978], 11.3. Note that K is inductively defined. Take the classes A and R such that K=i(A,R). XE
A
iff 3z((x,z)
It is easily checked that A and R are self realizable, i.e.
e l # ) , since they are defined by essentially .(V,3)-free
It is straighforward t o prove the following in T: (x,z) self realizable A and R. So hf.{e}(f)
E
formulae.
~ r f i , x )+ X E i(A,R)
for any
K is provable in T.
K-forcing is defined like the uniform forcing in Beeson [19771, 1.8 except for the following modifications: P IkA B i s Vqsp(qikA + 3aE K(q,alkB)), p Ik VxA i s Vx3a E K(p,a IF A ) ) , +
where p,abA means Vq(aq#O
-+
W I C h ) . Then the following soundness theorem holds.
PROPOSITION 3 (Beeson). Let S be one of the systems in Lemma 6, and let T be
S
+ ECA + ACN.
If TaCA, then T k 3 a ~ K ( < >,alkA), where Ta is defined as in
Beeson [1977], 0.3. We may add ACFT to T in this soundness theorem. PROOF. The soundness theorem is proved as in the case of uniform forcing. We need ACN to prove the K-forcing version of Lemma 1.8.2 of Beeson [1977]. With the above lemma and proposition, we can easily prove RBIR
0
or RBIR for
the systems considered here. The details ere left for the reader. It should be
S. HAYASHI
160
noted that BIR for the systems with ACN are due to Beeson and only Lemma 6 is due to the auther. Thus the following proposition has been proved in this section.
2J
PROPOSITION 4. RBIRO holds for FM:-r'
+
IG(-)r 2 ECA k ACN A ACFT
2 J +IG(-) % ECA induction) and RBIR holds for EM:-) T k ACC 2 RDC, where T is IZo, 12 or IZF.
t ACN 2 ACFT,
2 (full
Tj, T4 and
4 . SUMMARY
We have proved the following theorem. THEOREM. FBIR or FBIR holds for the systems considered in this paper except 0
B, T1, T2. For these three systems DBIRO holds. Furthermore, there are counterexamples of FBIR for the systems for which FBIR is not proved in this paper. FBIR for the above three systems, EM:-) 0
2 ECA and FBIR for intuitionistic set
theories with only replacement are open problems.
APPENDIX
Troelstra showed in an unpublished note that a generalized bar induction rule (GBIR) for IDB* is an easy consequence of Troelstra [1980]. This appendix was written to present his proof and sketch how to extend it to some of the systems in this paper. Let IDB* be the system in Troelstra [19801 and let A be an almost negative arithmetical formula. Then Troelstra's GBIR is as follows: if k if e AW 3nP(h), then
k(
h/n'E'A
Vxx'e.A(Pn+. P(n*p))
where P c A Q is VxcACW(Px
+
&
P c A Q & IndA(Q))
Qx) and IndA(Q) is VncA<'(
-+
A<Wc_P,
Vyc A(P(n*9))
-+Pn).
THEOREM (Troelstra). IDB* is closed under GBIR. PROOF. Assume that Vf E A" 3nP(?n)
is provable in IDB*. In Troelstra [19801
it was shown how to handle realizability by numbers for IDB*; exactly the same methods can be used for functional q-realizability to obtain a generalized recursive continuity rule for IDB*. So the following is provable in IDB*: 3f ew"(f-{e) & Vge AW(!f(g) & A(f(g))). Hence we may assume that P is a recursive predicate. By Troelstra [1980], 5.8 we see that CS* t vu E A~ jnP(in). By the generalized elimination result Troelstra [19801, 4 . 3
161
Bar induction rule
IDB*k 3e E K Vn E A<"(en#O -+ Va E nP(a(enL1))). [A] Then by the principle of induction over unsecured sequences, we can prove the conclusion of GBIR. The semantical proof of BIR which does not use ACC can be used to prove GBIR without any modifications except that it uses the generalized recusive continuity rule instead of Lemma 1. Indeed we can prove recursive GBIR (i.e. P is recursive) for any arithmetical formula A for IZo, IZ and IZF. The semantical proofs which use ACC can be used to prove GBIR, if ACC is replaced by the axiom of partial choice APC. For example, let APCar be the schema b={xE w:Bx)
&
V x E b 3yc cA(x,y)
-+
3f:b+cA(x,fa),
where B is an almost negative arithmetical formula. Indeed T4 + APCar is closed under GBIR. Furthermore we can prove GBIR for Feferman's systems in Proposition 4 without adding APC. Let ACm be the choice schema in Feferman's language corresponding to APCar. Let T be one of Feferman's systems in Proposition 4. Then we can prove GBIR for T + ACm by KLA1-forcing.Similarly to Lemma 6, we can prove the conservation result on T with respect to the sentences Af.{e}(f) eKLA1,where A is ess. ( v
, 3)-free. Hence we can prove GBIR for T as in Proposition 4 .
On the other hand, we cannot extend the proofs of BIR which use the conserva1 tion results. We used the conservation results with respect to ll -formulae for 1 1 such systems. Now we need the conservation of extended IIl-formulae of the form
vf E A" gnP(?n),
where P is recursive and A is almost negative and arithmetical.
The author does not know how to prove this except for EMOF and B. Beeson [1980] has proved that these two systems are conservative over HA. His proof can be relativized, so these systems are conservative over HA(f). EMh-)r+
Hence.GBIR holds for
ECA and B. The rules GBIR for the other systems are still open problems.
BIBLIOGRAPHY Beeson, M.J. [1977] Principles of continuous choice and continuity of functions in fqrmal systems for constructive mathematics, Annals of Math. Logic 12, 249-395. [1978] Continuity in intuitionistic set theories, in: D. van Dalen, M.Boffa and K. MacAloon, Eds., Logic Colloq. 78 (North-Holland, Amsterdam), 1-52. [1980] Extensionality and choice in constructive mathematics, Pacific J. Math. 88, 1-28. Feferman, S . [19771 Theories of finite type related to mathematical practice, in:
S. HAYASHI
162
J. Barwise, Ed., Handbook of mathematical logic (North-Holland, Amsterdam), 913-971. [1978] Constructive theories of functions and classes, in: D. van Dalen, M. Boffa and K. MacAloon, Eds., Logic Colloq. 78 (North-Holland), 159-224. Fourman, M.P. and Grayson, R.J. [198?] Formal spaces, in this volume. Fourman, M.P. and Joyal, A. [198?] Metamathematical applications of sheaf theory, in preparation. Friedman, H 1
[19701 Iterated inductive definitions and C1-AC, in: A. Kino, J. Myhill and R.E. Vesley, Eds., Intuitionism and Proof theory (North-Holland, Amsterdam) 435-442. [1977] Set-theoretic foundations for constructive analysis, Annals of Math. 105, 1-28. Grayson, R.J. [1975] Sheaf appraoch to models of set theory, M. SC. thesis, Oxford. [1979] Heyting-valued models for intuitionistic set theory, Springer Lecture Notes 753, 402-404. [1981] Forcing in intuitionistic systems without power-set, Report August 1981, Institut fiir Math. Logik, Mlinster. Hayashi, S. [19771 On derived rules of intuitiinistic second order arithmetic, Comment. Math. Univ. St. Pauli 26, 77-103. [1977a] A note on provable well-orderings in first order systems with infinitary inference rules, Tsukuba J. Math. 1, 125-135. [19801 Derived rule related to a constructive theory of metric spaces in intuitionistic higher order arithmetic without countable choice, Annals of Math. Logic 19, 33-65. [19811 On set theories in toposes, Springer Lecture Notes 891, 23-29. Howard, W.A. [19801 Ordinal analysis of terms of finite type, J. of Symbolic Logic 45, 493-504. Kreisel, G. [19651 Mathematical logic, in: T.L. Saaty, Ed., Lectures on modern mathematic vol I11 (John Wiely and Sons, New York), 95-195. Kreisel, G. and LBvy, A.
[19681 Reflection principles and their use for establishing the complexity of axiomatic systems, 2. Math. Logik Grundlagen Math. 14, 97-142.
Bar induction rule
163
Schiitte, K. [19651 Predicative well-orderings, in: J.N. Crossely and M.A.E. Dummet, Eds., Formal systems and Recursive Functions (North-Holland, Amsterdam) 280-303. [1977] Proof theory (Springer, Berlin). Schwichtenberg, H. [1977] Proof theory: Some applications of cut elimination, in: J. Barwise, Eds., Handbook of mathematical logic (Norith-Holland, Amsterdam), 867-895. [1979] On bar recursion of type 0 and 1, J. of Symbolic Logic 44, 325-329. Takeuti,
G.
and Titani, S .
[1981] Heyting valued universes of intuitiionistic set theory, Springer Lecture Notes 891, 189-306. Troelstra, A . S . [1977] Aspects of constructive mathematics in: J. Barwise, Ed., Handbook of mathematical logic (North-Holland), 973-1052. [1980] Extended bar induction of type zero, in: J . Barwise, H.J. Keisler and
K. Kunen, Eds., The Kleene Symposium (North-Holland, Amsterdam), 277-316. Zucker, J. [19731 Iterated inductive definitions, trees and ordinals, Springer Lecture Notes 344, 435-450.
THE L J J . B R O W E R CENTENARY SYMPOSIOM A.S. TroehRa and D. van Dalen (editors) 0North-HolhndPubiiShing C O m p l ~ ~1982 y,
165
THE EFFECTIVE TOPOS
J. M . E .
Hyland
Department of Pure Mathematics, Cambridge, England.
10
Introduction. The s u b j e c t of t h i s paper i s t h e most a c c e s s i b l e of a series
of toposes which can be c o n s t r u c t e d from n o t i o n s of r e a l i z a b i l i t y : it i s t h a t based on t h e o r i g i n a l n o t i o n of r e c u r s i v e r e a l i z a b i l i t y
i n Kleene C19451.
O f c o u r s e t h e r e a r e many o t h e r k i n d s of r e a l i z a -
b i l i t y (see Kleene-Vesley C19651, K r e i s e l C19591, T a i t C19751).
All
t h e s e (and even t h e D i a l e c t i c a I n t e r p r e t a t i o n ) f i t i n t o a very abs t r a c t framework d e s c r i b e d i n Hyland-Johnstone-Pitts C19801.
(Since
w e w i l l r e f e r t o t h i s paper f r e q u e n t l y , w e s h o r t e n t h e r e f e r e n c e t o H J P C19801.)
I n t h i s a b s t r a c t framework one p a s s e s e a s i l y ( a s i s
becoming customary, see Fourman C19771, Makkai-Reyes C19771, BoileauJ o y a l C198ll) between l o g i c a l and c a t e g o r y t h e o r e t i c f o r m u l a t i o n s , using whichever i s most a p p r o p r i a t e .
One good example i s worth a
h o s t of g e n e r a l i t i e s , so i t i s t h e aim of t h i s paper t o p r e s e n t t h i s a b s t r a c t approach t o r e c u r s i v e r e a l i z a b i l i t y i n some d e t a i l .
The
b a s i c s t r a t e g y r e a d i l y extends t o o t h e r cases. Many p e o p l e , most n o t a b l y Beeson (see f o r example Beeson C19771, have c o n s i d e r e d r e a l i z a b i l i t y extended t o g i v e i n t e r p r e t a t i o n s of complicated formal systems.
The f l a v o u r of t h e more c a t e g o r y theo-
r e t i c t r e a t m e n t i s t o have one t h i n k i n t e r m s of models.
Thus t h e
approach l o o k s l i k e sheaf models f o r i n t u i t i o n i s t i c l o g i c (see Fourman-Scott C 1 9 79 1 , where one only h a s n a t u r a l a c c e s s t o the models. (This p a r a l l e l between r e a l i z a b i l i t y and s h e a f models was f i r s t made e x p l i c i t , f o r set t h e o r y , i n an u n t i t l e d manuscript, by Powell.)
J.M.E. HYLAND
166
A s i n t h e c a s e of s h e a v e s , w e w i l l f i n d o u r s e l v e s l o o k i n g a t genuine
mathematical s t r u c t u r e s ( w i t h t h e i r non-standard l o g i c ) when w e investigate t r u t h i n the e f f e c t i v e topos.
W e w i l l be p r e s e n t i n g
" t h e world of e f f e c t i v e mathematics" a s it a p p e a r s t o t h e c l a s s i c a l (Of c o u r s e , it i s p o s s i b l e t o p r e s e n t t h e i d e a s i n
mathematician.
t h e c o n t e x t of more o r less any m a t h e m a t i c a l i d e o l o g y . ) While t h e l o g i c a l approach t o c a t e g o r i e s e n a b l e s us t o work w i t h c o n c r e t e s t r u c t u r e s and a p p l y o u r e x p e r i e n c e of e l e m e n t a r y l o g i c , t h e c a t e g o r y t h e o r e t i c approach t o l o g i c e n a b l e s us t o do away w i t h much l o g i c a l c a l c u l a t i o n and t o use i n s t e a d s i m p l e f a c t s about c a t e g o r i e s ( i n p a r t i c u l a r f a c t s a b o u t t o p o s e s and g e o m e t r i c morphisms).
I t h a s become c l e a r i n r e c e n t y e a r s t h a t much of con-
s t r u c t i v e l o g i c can be t r e a t e d v e r y e l e g a n t l y i n t h e c o n t e x t of topos theory.
This i s i n harmony w i t h work i n t h e i n t u i t i o n i s t
t r a d i t i o n on Beth a n d Kripke models (see van Dalen C19781, and t h e r e w e r e many c o n t r i b u t i o n s t o t h e Brouwer Centenary Conference i n t h i s
area.
T h i s p a p e r s i m p l y does t h e same k i n d of t h i n g f o r r e a l i z a -
bility.
Of c o u r s e t h e r e
&
a s u r p r i s e h e r e : t h e t o p o s of t h i s p a p e r
i s most u n l i k e a Grothendieck t o p o s , and it i s n o t i n i t i a l l y
p l a u s i b l e t h a t t h e o r y a b s t r a c t e d from n o t i o n s of c o n t i n u i t y s h o u l d have any a p p l i c a t i o n i n t h i s most n o n - t o p o l o g i c a l
setting.
The f i r s t t h r e e s e c t i o n s of t h e p a p e r s e r v e t o i n t r o d u c e t h e e f f e c t i v e t o p o s a s a world b u i l t o u t o f t h e l o g i c of r e c u r s i v e realizability. f o r the subject.
Much d e t a i l i s o m i t t e d i n t h e hope of g i v i n g a f e e l The main c a t e g o r y - t h e o r e t i c i d e a s axe e x p l a i n e d
and i n t e r p r e t e d i n 5 8 4 - 6 .
I n p a r t i c u l a r we show why t h e n o t i o n o f
a n e g a t i v e formula a r i s e s n a t u r a l l y i n t h e t h e o r y o f s h e a v e s .
In
887-13, w e apply t h i s work t o a s t u d y of a n a l y s i s i n t h e e f f e c t i v e topos.
W e show t h a t i n e s s e n c e it i s c o n s t r u c t i v e r e a l a n a l y s i s
( i n t h e s e n s e of Markov).
I am g r a t e f u l t o P r o f e s s o r T r o e l s t r a f o r
some a d v i c e on t h i s t o p i c ( I f i n d t h e p u b l i s h e d m a t e r i a l unreadable:
The effective topos
167
and i n p a r t i c u l a r f o r d e t e c t i n g a n e r r o r i n an e a r l y d r a f t o f t h i s paper.
5514-17 a r e c o n c e r n e d w i t h f e a t u r e s of t h e e f f e c t i v e t o p o s
where t h e power s e t m a t t e r s : u n i f o r m i t y p r i n c i p l e s and p r o p e r t i e s of j-operators.
The p a p e r c l o s e s w i t h some g e n e r a l remarks on the
mathematical s i g n i f i c a n c e o f t h e e f f e c t i v e t o p o s . F i n a l l y I would l i k e t o thank t h e o r g a n i z e r s o f t h e Brouwer Centenary Conference f o r t h e o p p o r t u n i t y t o p r e s e n t t h i s p a p e r ( i n such p l e a s a n t s u r r o u n d i n g s : ) and t o a p o l o g i z e t o everyone f o r b e i n g so long i n w r i t i n g it.
51 R e c u r s i v e r e a l i z a b i l i t y . R e c u r s i v e r e a l i z a b i l i t y i s b a s e d on t h e p a r t i a l a p p l i c a t i v e where a s i n H J P 119803 w e w r i t e n.m = n(m) f o r t h e
s t r u c t u r e (IN ,.)
r e s u l t o f a p p l y i n g t h e n ' t h p a r t i a l r e c u r s i v e f u n c t i o n t o m. s a v e s on b r a c k e t s compared w i t h t h e n o t a t i o n { n l n . ) a n o t i o n of A-abstraction
i n ( I N ,.)
(This
One c a n d e f i n e
i n t h e u s u a l way from t h e
com-
b i n a t o r s , and w e w i l l u s e it f r e e l y i n what f o l l o w s , s o t h a t ( f o r example) Ax.x w i l l d e n o t e a n i n d e x f o r t h e i d e n t i t y f u n c t i o n .
We
a l s o t a k e f o r convenience a r e c u r s i v e p a i r i n g f u n c t i o n <
,
>:
INxIN->
IN; (n,m)
-->
and l e t n1,n2 be ( r e c u r s i v e i n d i c e s f o r ) t h e c o r r e s p o n d i n g u n p a i r i n g €unctions. R e c u r s i v e r e a l i z a b i l i t y i s u s u a l l y f o r m u l a t e d i n terms o f t h e notion e realizes
0
where e i s a n a t u r a l number and @ i s a s e n t e n c e o f ( H e y t i n g ' s ) arithmetic.
The c r i t i c a l c l a u s e s i n t h e i n d u c t i v e d e f i n i t i o n a r e
implication
e r e a l i z e s 4 ->
$ i f f f o r a l l n, i f n realizes @ then e ( n ) i s
d e f i n e d and r e a l i z e s $,
JM.E. HYLAND
168
universal quantification e r e a l i z e s Vn.$(n) i f f f o r a l l n , e ( n ) i s d e f i n e d and r e a l i z e s
@ ( g )Cg t h e numeral f o r n l . The o t h e r i n d u c t i v e c l a u s e s a r e and -
e realizes
$A$
i f f n ( e ) r e a l i z e s $ and n 2 ( e ) r e a l i z e s $,
1
or e r e a l i z e s @vJ, i f f e i t h e r a , ( e )
or
IT^ ( e )
= 0
and n 2 ( e ) r e a l i z e s $
= 1 and n 2 ( e ) r e a l i z e s $,
falsity no numbers r e a l i z e
1,
existential quantification e r e a l i z e s h . $ ( n ) i f f n 2 ( e ) r e a l i z e s @ ( r l ( e )) [ n l ( e ) t h e
- -
numerical f o r
I T ~ ( I ~. )
F i n a l l y w e g i v e t h e i n i t i a l c l a u s e f o r e q u a l i t i e s between c l o s e d terms
e r e a l i z e s s = t i f f b o t h s and t d e n o t e e . For a c a r e f u l t r e a t m e n t o f t h e r e a l i z a b i l i t y i n t e r p r e t a t i o n of a r i t h m e t i c t h e r e a d e r may c o n s u l t T r o e l s t r a C19731.
W e w i l l see i n
53, t h a t t h i s i s t h e i n t e r p r e t a t i o n of a r i t h m e t i c w i t h i n t h e
e f f e c t i v e topos.
For an a c c o u n t of t h e o r i g i n a l m o t i v a t i o n see
Kleene 119731; it i s i n t e r e s t i n g t o t r y t o u n d e r s t a n d i t i n t e r m s o f t h e p r e s e n t paper. Apparently Dana S c o t t f i r s t n o t i c e d t h a t r e a l i z a b i l i t y c o u l d be understood " m o d e l - t h e o r e t i c a l l y ' '
{ e ( erealizes @ I . truth-values,
i n terms of t h e t r u t h - v a l u e s
T h i s g i v e s u s a s e t C = P ( l N ) of non-standard
and so f o r e a c h s e t X , a s e t Zx of non-standard p r e -
d i c a t e s on X.
W e w r i t e $ = ($,lx
e l e m e n t s o f C"
and can r e f o r m u l a t e o u r e a r l i e r d e f i n i t i o n f o r t h e
E
X) and J,
=
( Q X \ x E X) f o r
p r o p o r t i o n a l c o n n e c t i v e s by d e f i n i n g o p e r a t i o n s p o i n t w i s e on Zx as follows:
169
The effective topos
$ x ~ $ x= { < n , m > l n E $x and m
( $ A $ ) ~ =
( $ v $ l X = $xv$x
$x+$x
($+I))~ =
e(n)
$,I,
E
=
t < ~ , n > l nE $ x I u t < l , n > j n
=
{el i f n
t h e n e ( n ) i s d e f i n e d and
,$,
E
E
E
= t h e empty s e t .
IX
The r e a d e r may a l s o l i k e t o have TX = IN.
lk
There i s a r e l a t i o n
of e n t a i l m e n t ( a p r e - o r d e r ) d e f i n e d on each
Cx by
I-,$
i f f n { ( $->
$),lx
E
XI i s non-empty.
The soundness of t h e r e a l i z a b i l i t y i n t e r p r e t a t i o n of i n t u i
-
t i o n i s t i c propositional logic i s the following proposition. X
P r o p o s i t i o n 1.1.
(Z
i s a Heyting p r e - a l g e b r a :
as a c a t e g o r y
t h e p r e o r d e r h a s f i n i t e l i m i t s ( m e e t s ) , f i n i t e c o l i m i t s ( j o i n s ) and
i s C a r t e s i a n c l o s e d (Heyting i m p l i c a t i o n ) . Proof:
The s t r u c t u r e i s g i v e n e x p l i c i t l y i n t h e d e f i n i t i o n s above.
W e now i n t r o d u c e t h e a b s t r a c t n o t i o n of q u a n t i f i c a t i o n from
categorical logic.
Y of sets w e d e f i n e
For any map f : X ->
s u b s t i t u t i o n a l o n g f , f * : C y ->
CX a s composition w i t h f :
( f * $ ) , = $ f (x) f * i s a f u n c t o r ( i n f a c t a map of Heyting p r e - a l g e b r a s ) from Y X ( Z , I - y ) t o ( C , I-x ) and q u a n t i f i c a t i o n a l o n g f i s g i v e n by t h e adjoints t o f*.
As shown i n HJP C19801 t h e s e are d e f i n e d by
right adjoint (vf.+)y = n t f ( x ) = y
->
$X
IX
E
xl,
E
XI,
l e f t adjoint (3f.$)y = U { f(X) = y
A
$xlX
where T,
f f ( x ) = Y]l
= '-JITlf(X)
= yj =
tL,
i f f ( x ) = y, otherwise,
i s t h e n a t u r a l i n t e r p r e t a t i o n a s a non-standard p r e d i c a t e of
J.M.E. HYLAND
170
Note t h a t w h i l e U { ~ $ ~ l f ( = x )y} i s a s a t i s f a c t o r y a l t e r -
f ( x ) = y.
n a t i v e d e f i n i t i o n of t h e l e f t a d j o i n t , r l { $ x l f ( x ) = y} i s d e f i n i t i o n of t h e r i g h t a d j o i n t u n l e s s f : X -->
=
a
Y is surjective.
However u s u a l q u a n t i f i c a t i o n i s q u a n t i f i c a t i o n a l o n g t h e obvious p r o j e c t i o n , and almost a l l p r o j e c t i o n s are s u r j e c t i v e , so t h i s nuance w i l l c a u s e t h e r e a d e r (and a u t h o r ) no f u r t h e r t r o u b l e . The r e a d e r w i l l see t h a t what w e have j u s t d e s c r i b e d i s an i n t e r p r e t a t i o n of i n t u i t i o n i s t i c p r e d i c a t e l o g i c : w e have s t a n d a r d f u n c t i o n s and sets, a (non-standard r e p r e s e n t a t i o n o f ) s t a n d a r d e q u a l i t y and a c o l l e c t i o n of non-standard p r e d i c a t e s . a " g e n e r i c p r e d i c a t e " namely t h e i d e n t i t y i n E L .
W e a l s o have
W e can e n c a p s u l a t e
a l l t h i s structure i n the following proposition. Proposition 1 . 2 .
The
t o g e t h e r w i t h t h e f * and t h e i r a d j o i n t s
3f and Vf and t h e " g e n e r i c p r e d i c a t e " , form a t r i p o s on t h e c a t e g o r y of
Sets
Proof:
( i n t h e s e n s e of H J P C19801. See H J P C19801.
I n what w e have s a i d , w e have n o t needed t o d i s t i n g u i s h f o r mulae from t h e i r i n t e r p r e t a t i o n s , d i s t i n c t i o n as f a r as p o s s i b l e . i n d i c a t e an
and w e w i l l c o n t i n u e t o b l u r t h i s ( W e w i l l u s e open f a c e b r a c k e t s t o
i n t e r p r e t a t i o n when n e c e s s a r y t o p r e v e n t c o n f u s i o n . )
W e say t h a t $
I-x$.
E
.Ex i s v a l i d i f f
E
Zx i s v a l i d i f f T l-lVX.$,
T
By a d j o i n t n e s s w e have
9 where X:
X -->
1 i s a unique map from X t o a one element s e t .
That
i s , I$ i s v a l i d i f f Vx.I$(x) , t h e u n i v e r s a l g e n e r a l i z a t i o n of $ is
valid or realizable.
W e w i l l use t h i s n o t i o n b o t h t o d e s c r i b e and
s t u d y t h e t o p o s which w e can c o n s t r u c t on t h e b a s i s of ( 1 . 2 ) . 12
D e s c r i p t i o n of t h e e f f e c t i v e t o p o s . When c o n s t r u c t i n g a t o p o s from a t r i p o s a s i n H J P C19801, one
The effective topos
171
must ( i )add new s u b o b j e c t s of t h e s e t s one h a s s t a r t e d w i t h t o
r e p r e s e n t t h e non-standard p r e d i c a t e s , and (ii) t a k e q u o t i e n t s of t h e s e by t h e non-standard
relations.
equivalence
T h i s l e a d s t o t h e d e s c r i p t i o n of t h e o b j e c t s of e f f e c An o b j e c t of t h e e f f e c t i v e t o p o s i s a s e t X with a
t i v e topos.
non-standard p r e d i c a t e = on X x X such t h a t symmetry
x = y -->
transitivity
x = Y A Y = z ->
are v a l i d .
y = x x = z
Note t h a t w e do n o t have r e f l e x i v i t y :
( a s i s t h e case
f o r Heyting a r i t h m e t i c ) t h e r e need be no uniform r e a l i z a t i o n of W e r e g a r d and w i l l w r i t e t h e p r e d i c a t e x = x
(reason why) x = x.
a s an e x i s t e n c e p r e d i c a t e , Ex, and a s a membership p r e d i c a t e , x
E
X.
There i s a u s e f u l d i s c u s s i o n of t h e l o g i c of e x i s t e n c e p r e d i c a t e s i n S c o t t C19791.
Of c o u r s e w e need t o c o n s i d e r a l l non-standard maps t o o b t a i n t h e e f f e c t i v e t o p o s , and t o do t h a t w e a r e reduced t o c o n s i d e r i n g functional r e l a t i o n s .
The - m
from (X, =) t o ( Y , = ) i n t h e
e f f e c t i v e topos a r e e q u i v a l e n c e c l a s s e s of f u n c t i o n a l r e l a t i o n s where (a) G
6
cxXy
i s a functional relation i f f = y ' ->
relational
G(x,y)AX =
X'AY
strict
G ( x , y ) ->
E XAE Y
single-valued
G ( x , y ) ~ G ( x , y ' )-->
total
E X -->
G(X',y')
y = y'
+y.G(x,y)
are a l l valid, (b) 6 i s e q u i v a l e n t t o H i f f G(x,y) <-->
is valid.
H(xrY)
W e w i l l s a y t h a t G r e p r e s e n t s t h e map [GI: ( X , = )
-->(Y,=).
I t i s u s e f u l t o n o t e t h a t i f G and H a r e both f u n c t i o n a l r e l a t i o n s
J.M.E. HYLAND
112
(from ( X I = )
to (Y,=),
t h e n t o show G and H e q u i v a l e n t , i t s u f f i c e s
t o show t h a t an i m p l i c a t i o n i n one d i r e c t i o n i s v a l i d . F u n c t i o n a l r e l a t i o n s can be composed: i f G
E
Xxxy
are f u n c t i o n a l r e l a t i o n s , t h e n s o i s 3 y . G ( x l y ) A H ( y , z ) =
i s a f u n c t i o n a l r e l a t i o n from ( X , = )
to itself.
and H E
Cyxz
E
Cxxz.
Also
These g i v e t h e
composition and i d e n t i t i e s , and s o w e have a c a t e g o r y .
I n view of
( 2 . 1 ) , w e c a l l t h i s c a t e g o r y t h e e f f e c t i v e t o p o s and d e n o t e it by
Eff h e r e a f t e r . Theorem 2 . 1 . Proof:
Eff
is a topos.
See H J P C19801 f o r d e t a i l s .
W e can e x t e n d t h e non-standard
i n t e r p r e t a t i o n of 91 t o g i v e an
a c c o u n t of t h e i n t e r n a l l o g i c o f t h e c a t e g o r y
Eff.
T h i s goes a s f o r
t h e l o g i c of s h e a v e s e x c e p t f o r obvious m o d i f i c a t i o n s t o d e a l w i t h t h e f a c t t h a t f u n c t i o n s are ( o n l y ) r e p r e s e n t e d by f u n c t i o n a l r e l a tions.
A g e n e r a l account of t h e i n t e r n a l f i r s t - o r d e r
l o g i c of
c a t e g o r i e s i s g i v e n i n Makkai and Reyes C19771, and a c c o u n t s o f t h e h i g h e r o r d e r l o g i c of t o p o s e s can be found i n Fourman C19771 and B o i l e a u - J o y a l C19811.
A s t h e s e a c c o u n t s make c l e a r , c a t e g o r i c a l
c o n s t r u c t i o n s can be d e f i n e d by means of t h e i n t e r n a l l o g i c .
Thus,
n o t o n l y can ( a n e x t e n s i o n o f ) v a l i d i t y i n t h e s e n s e o f 9 1 , be used t o d e t e r m i n e what i s t r u e i n categorical constructs.
Eff,
b u t i t can a l s o be used t o d e f i n e
(Now c o n t i n u i n g t h e i n t e r p l a y , t h e s e c a t e g o r i -
c a l c o n s t r u c t s can t h e n b e used t o e s t a b l i s h f u r t h e r f a c t s a b o u t what is true i n
Eff.)
W e now g i v e some s i m p l e examples o f t h e l o g i c a l
description of the structure of
Eff.
(On a few o c c a s i o n s w e w i l l
need t o q u o t e some more c o m p l i c a t e d f a c t s o f t h e same k i n d . ) 1) A map [GI:
(X,=) -->
(Y,=) i s monic i f f
G ( x , y ) ~ G ( x ' , y )-->
x =
X'
is valid. A s u b o b j e c t of
(X,=) can always b e r e p r e s e n t e d (though n o t
u n i q u e l y ) by a c a n o n i c a l monic of t h e form
The effective topos
[='I:
(X,=') -->
173
(X,=)
where I[ x = ' x q
f o r some A
E
=
ux
A(X)A
=
x l n
Zx s t r i c t and r e l a t i o n a l f o r (X,=).
Thus s u b o b j e c t s
always a r i s e by r e s t r i c t i n g t h e membership p r e d i c a t e w h i l e (as f a r as p o s s i b l e ) l e a v i n g t h e e q u a l i t y a l o n e . 2 ) Given two maps CG1,CHI:
(Y,=)
(X,=) -->
,
t h e i r e q u a l i z e r is
r e p r e s e n t e d by t h e c a n o n i c a l monic o b t a i n e d from t h e s t r i c t and relational 3y.G(x,y)hH(xfy)
E
Ex.
The c o n s t r u c t i o n of o t h e r f i n i t e l i m i t s i s a n a l o g o u s . The diagram
W,=)
1
[H'I
[G">
V
(Xr=)
->
(Z,=)
1
[HI
(Yr=)
[GI
i s a p u l l b a c k i f f CHIo[G'I = CGIo[H'I,
(CG'1,CH'I):W ->
ZXX is
a
monic and G ( x , y ) ~ H ( z , y )-->
is v a l i d .
3W.G'
(W,Z)AH'
(w,x)
The c o n d i t i o n t h a t o t h e r diagrams g i v e f i n i t e l i m i t s can
be e x p r e s s e d s i m i l a r l y i n t h e l o g i c . 3 ) A map [GI:
(Y,=) i s s u r j e c t i v e i f f
(X,=) --> Ey ->
3x.G(xry)
is valid. A q u o t i e n t c a n always be r e p r e s e n t e d as [-I: where
(Xr=)
-->
(Xv-)
- i s s t r i c t r e l a t i o n a l f o r (X,=) and s u c h t h a t "- i s an e q u i v a l e n c e r e l a t i o n on (X,=)"
is valid.
Thus q u o t i e n t s are a m a t t e r of e x t e n d i n g t h e e q u a l i t y
r e l a t i o n and l e a v i n g t h e membership p r e d i c a t e a l o n e .
J.M.E. HYLAND
174
W e can now show t h a t any o b j e c t ( X I = )
Eff i s a q u o t i e n t of a
of
s u b o b j e c t of an " o r d i n a r y s e t " , j u s t i f y i n g t h e e x p l a n a t i o n a t t h e s t a r t of t h i s s e c t i o n . o b j e c t of
Eff
For a s e t X w e l e t AX ( a s i n 5 4 ) be t h e
with underlying s e t X and (non-standard r e p r e s e n t a t i o n
o f ) standard e q u a l i t y . Proposition 2 . 2 .
Any o b j e c t ( X , = )
of
Eff
i s a q u o t i e n t by
s u b o b j e c t EX of AX o b t a i n e d from t h e e x i s t e n c e p r e d i c a t e of Proof:
Note.
=
of t h e (X,=)
.
Obvious i n view of 1) and 3 ) above. W e have s t a r t e d using open f a c e b r a c k e t s t o e n s u r e r e a d a b i l i t y
( e s p e c i a l l y i n connection w i t h e q u a l i t y ) , a s promised i n §I. W e a l s o abuse n o t a t i o n and w r i t e X f o r ( X , = )
where c o n t e x t makes t h e
meaning obvious. 53.
-Some
Eff.
o b j e c t s and maps i n
W e can e a s i l y d e s c r i b e a t e r m i n a l o b j e c t 1 i n
52, 1 is
( I * } , = ) where { * I [I*
=*I
= T
1*
p would do a s t h e v a l u e
T
=
in Z{*'
.
*I
{*I is
Since
W e now c a l c u l a t e t h e g l o b a l
Ef f ,
t h a t i s t h e maps from
a s i n g l e t o n , such maps a r e r e p r e s e n t e d by
degenerate f u n c t i o n a l r e l a t i o n s G G ( Y ) A Y = y ' -->
G(y)
t h a t i s , any non-empty
= Z,
s e c t i o n s of an a r b i t r a r y o b j e c t (Y,=) of
.
I n view of
i s a s i n g l e t o n , and
Of c o u r s e any p e q u i v a l e n t t o
1 t o (Y,=)
Eff.
E
Zy,
such t h a t
G(y') Ey
-->
G(y)AG(y') -->
y = Y'
3y.G(y) are a l l valid.
The t o t a l c o n d i t i o n t e l l s us t h a t f o r some y , yo s a y ,
G(yo) i s non-empty.
The r e l a t i o n a l and s i n g l e - v a l u e d c o n d i t i o n s
imply t h a t G(Yo)
-->
(G(y) <-->
and hence ( s i n c e G(yo) i s non-empty)
yo
=
y)
175
The effective topos
G(y) <--> are valid.
i s non-empty,
[I yo = y l l
Clearly i f
Yo = Y <->
is valid.
yo = y then
Y1 = Y
W e deduce a t once t h e f o l l o w i n g c h a r a c t e r i z a t i o n .
Proposition 3.1.
Each map [ G I :
(Y,=) d e t e r m i n e s and i s com-
1 ->
p l e t e l y determined by [y I G(y) non-empty}, which i s an e q u i v a l e n c e class f o r the ( p a r t i a l ) equivalence r e l a t i o n
Uy
"
i s non-empty".
= y'l
Conversely any such e q u i v a l e n c e c l a s s d e t e r m i n e s a map from 1 t o (Y,=).
Finite colimits i n
Eff
a r e h a r d t o g e t used t o because f o r a
s t a r t c o p r o d u c t s a r e odd: t h e r e a l i z a b i l i t y i n t e r p r e t a t i o n of d i s j u n c t i o n is v e r y r e s t r i c t i v e .
I n p a r t i c u l a r , t h e c o p r o d u c t 2 of 1
with i t s e l f i s n o t t h e obvious o b j e c t A2 w i t h s t a n d a r d e q u a l i t y (see 54). of
Eff.
L e t us look a t maps from A2 t o an a r b i t r a r y o b j e c t IY,=)
Suppose G ( i , y ) r e p r e s e n t s such a map (where 2 = { O , l } ) .
Then s i n c e EO yo,yl
= E l = T,
t h e t o t a l c o n d i t i o n t e l l s us t h a t t h e r e a r e
such t h a t G(O,yo)nG(l,yl) i s non-empty.
Arguing a s f o r t h e
terminal object we find t h a t G ( i , y ) <--> is valid.
yi = y
However [GI does n o t c o r r e s p o n d simply t o a p a i r o f
e q u i v a l e n c e c l a s s e s i n IylEy non-empty?:the union of t h e e x i s t e n c e of t h e two e q u i v a l e n c e c l a s s e s must i n t e r s e c t n o n - t r i v i a l l y ,
and t h i s i s
a real restriction. In f a c t the object 2 i n EO =
101, E l
(Of c o u r s e any p,,pl An
=
{l},
Eff
can be r e p r e s e n t e d as ( 2 , = ) where
[li = j]l
= EinEj.
w i t h p0 npl empty would do as t h e v a l u e s EO, E l . )
argument a s above shows t h a t maps from 2 a r e p a i r s of maps from 1.
Note a l s o t h a t t h e o n l y maps from A2 t o 2 are c o n s t a n t ( t h a t i s , f a c t o r through 1 ) . There i s an obvious monic from 2 t o A2.
I n 516
J.M.E. HYLAND
176
w e w i l l show t h a t t h e whole s t r u c t u r e of
Eff
depends on 2 -->
A2
n o t b e i n g i s o , i n t h e s e n s e t h a t t h e topology i n v e r t i n g 2 -->
A2
collapses
Eff
Sets.
back t o
S i n c e 2 i s n o t A2, w e would h a r d l y e x p e c t t h e n a t u r a l number
Eff
object N i n
Am.
t o be
I n f a c t it i s t h e o b j e c t ( I N , =) where
En = i n ] , There are maps 0: 1 -->
[n
=
= EnnEm.
m]
and s : IN->
IN
IN
in
Eff
r e p r e s e n t e d res-
p e c t i v e l y by Go and Gs where G o ( * , n ) = I O j n I n ) and G,(n,m) Proposition 3.2.
IN
g:
(X,=)
G
E
4
Eff.
Suppose t h a t w e are g i v e n maps a : 1 -->
1'.
-->
(X,=)
IN i s a
IN and s : IN->
t o g e t h e r w i t h 0: 1 -->
n a t u r a l number o b j e c t i n Proof:
= In+l)n{m).
(X,=)
r e p r e s e n t e d r e s p e c t i v e l y by Ga
E
and
Cx and
W e can d e f i n e r e p r e s e n t a t i v e s Gn f o r gn i n d u c t i v e l y by
GO(X,XI)
=
U X
=
x8n
,
G n + l( x , x l )
g 9 Now w e can d e f i n e a f u n c t i o n f : IN->
9
= ~ X ~ ~ . G ~ ( X , X ~( X ~ ~) *A, X G').
(X,=)
9
9
r e p r e s e n t e d by
G f ( n , x ) = EnA3x'.Ga(x')AGn(x',x). 9
W e claim t h a t
fi
a
commutes.
(X,=)->(X,=) 9
fl
T h i s amounts t o showing t h a t G ( x ) <-->
3n.Go(*,n)AGf(n,x)
and
3 x ' . G f ( n , x ' ) A G ( x ' , x ) <--> 9
are both valid.
3m.Gs (n,m) A G f (m,x)
These can b o t h be e s t a b l i s h e d by use of e l e m e n t a r y
logic.
It remains t o show t h a t f i s unique s u c h t h a t ( * ) commutes. suppose t h a t f
'
r e p r e s e n t e d by Gf
l o g i c w e see r e a d i l y t h a t
I
i s a n o t h e r such map.
SO
By use of
177
The effective topos G f ( 0 , x ) <->
Gf
I
(0,x)
i s v a l i d and t h a t
G f ( n + l , x ) <-> G f , (n+l,x)<->
a r e both v a l i d .
3x'.Gf(n,x')AG ( x ' , x ) g 3 x ' . G f , ( n , x ' ) AG ( x ' , x ) g
But i n t e r m s o f t h i s d a t a w e can d e f i n e , by p r i m i -
t i v e r e c u r s i o n , a p a r t i a l r e c u r s i v e f u n c t i o n u n i f o r m l y mapping Gf ( n , x ) t o G f , ( n , x )
Remark.
,
and t h i s i s enough t o show t h a t f
=
f',
S i n c e q u a n t i f i c a t i o n i n o u r l o g i c (see Fourman-Scott
C 19791
and S c o t t C19791) i n v o l v e s t h e e x i s t e n c e p r e d i c a t e , w e see a t once on t h e b a s i s o f ( 3 . 2 ) t h a t t h e r e a l i z a b i l i t y i n t e r p r e t a t i o n c o r r e s ponds t o t h e l o g i c of t h e n a t u r a l number o b j e c t i n Corollary 3.3.
Eff.
A s e n t e n c e of Heyting a r i t h m e t i c i s r e c u r s i v e l y
r e a l i z e d i f f i t i s t r u e of t h e n a t u r a l number o b j e c t i n
Eff.
A l l t h e s p e c i f i c o b j e c t s w e have looked a t s o f a r have been
o b j e c t s (X,=) where
[x = x'J
non-empty i m p l i e s x = x '
( i n X).
Indeed a l l t h e o b j e c t s w e c o n s i d e r u n t i l 1 1 4 w i l l be ( i s o m o r p h i c t o ) ones o f t h i s s o r t (see 5 6 f o r a d i s c u s s i o n of what t h e c o n d i t i o n means). form.
I t i s a s w e l l t o have an example of an o b j e c t n o t o f t h i s
The most o b v i o u s example i s t h e s u b o b j e c t c l a s s i f i e r i n
( t h a t i s , t h e o b j e c t of t r u t h v a l u e s ) . t h i s i s t h e o b j e c t (X ,<->),
A s i n d i c a t e d i n H J P C19801
t h a t is, the set X
= P(JN )
e q u a l i t y g i v e n by t h e non-standard b i - i m p l i c a t i o n . an e a s y e x e r c i s e t o show t h a t (I,<-->) o b j e c t (X,=) where
I[x = x ' l
Eff
W e leave it a s
non-empty i m p l i e s x = x ' .
examples i t i s n a t u r a l t o c o n s i d e r (EA,<->)
of which w e c o n s t r u c t e d
with
i s n o t i s o m o r p h i c t o any
f i r s t t h a t X would have t o have j u s t two e l e m e n t s . )
the pointwise bi-implication.
Eff
(Show
As f u r t h e r
where now e q u a l i t y i s
These are e s s e n t i a l l y t h e o b j e c t s o u t
i n the f i r s t place; they a r e i n f a c t the
power s e t s of t h e o b j e c t s A X (see 9 4 ) .
J.M.E. HYLAND
178
54.
The i n c l u s i o n of t h e c a t e g o r y o f s e t s i n t h e e f f e c t i v e t o p o s . I n t h e l a s t s e c t i o n w e s a w glimpses of a f u n c t o r A from t h e
Sets o f
category
Definition.
sets t o
Eff,
t h e e f f e c t i v e topos.
For a s e t X, d e f i n e AX t o be ( X , = A x ) l
i s t h e n a t u r a l i n t e r p r e t a t i o n of t h e e q u a l i t y i n
f : X ->
Y in
Sets, d e f i n e
A f : AX ->
where
Sets.
For a map
AY t o be t h e map r e p r e s e n t e d
by t h e f u n c t i o n a l r e l a t i o n ,
This d e f i n i t i o n can be made whenever w e c o n s t r u c t a t o p o s from a t r i p o s (see P i t t s [ 1 9 8 l l ) , and w e always have o w f i r s t r e s u l t . Proposition 4 . 1 .
A:
Sets ->
Eff
functor preserving f i n i t e l i m i t s ) Proof:
is a Cartesian functor ( t h a t i s ,
.
F u n c t o r i a l i t y i s obvious.
That A i s C a r t e s i a n f o l l o w s
e a s i l y from t h e way f i n i t e l i m i t s a r e d e f i n e d l o g i c a l l y i n 53.
For
d e t a i l s see H J P C19801 o r P i t t s C19811. The n e x t r e s u l t i s a g e n e r a l f e a t u r e of r e a l i z a b i l i t y t o p o s e s .
Propcsition Proof:
4.2.
A:
Sets ->
i s va1i.d. =
Then
y i f f g(x)
yn
AX t o A Y .
=
T
y: t h u s f = g.
To show t h a t A i s f u l l , l e t G
E
Sets, and
ug(x)
<-->
I[f(x) = y l =
i s f u l l and f a i t h f u l .
Y in
Suppose t h a t f , g : X --> =
f(x)
Eff
iff
=
that
y~
f g ( x ) = yl] =
T
whence
This shows t h a t A i s f a i t h f u l .
Zxxy
be a f u n c t i o n a l r e l a t i o n from
The r e l a t i o n a l and s t r i c t c o n d i t i o n s axe a u t o m a t i c a l l y
s a t i s f i e d , t h e s i n g l e - v a l u e d c o n d i t i o n i m p l i e s t h a t f o r given x t h e r e i s a t most one y w i t h G ( x , y ) non-empty
( c o n s t r u c t i v e l y , in-
h a b i t e d ) , and t h e t o t a l c o n d i t i o n imples t h a t t h e r e is a t l e a s t one such y f o r g i v e n x. non-empty
Thus w e have g: X ->
i f f g(x) = y .
Then c l e a r l y
~ ( x , y )-->
u g w = yn
Y such t h a t G ( x , y )
is
179
The effective topos
i s v a l i d : an i n d e x f o r t h e i d e n t i t y r e a l i z e s i t .
But t h e t o t a l
c o n d i t i o n becomes E x ->
G(x,g(x))
i s v a l i d , whence
Ig ( x ) is valid.
Remark.
=
yn
->
G
Thus G r e p r e s e n t s t h e map Ag. ndr6 Joyal has pointed out t h a
XIY)
T h i s shows t h a t A is f u l l . A i s analogous t o t h e
Yoneda embedding: it i s C a r t e s i a n , f u l l and f a i t h f u l , and ( s o ) p r e serves exponentiation.
But I do n o t u n d e r s t a n d t h e f o r c e of t h i s
analogy. The main r e s u l t o f t h i s s e c t i o n i s a n o t h e r g e n e r a l f e a t u r e o f r e a l i z a b i l i t y toposes.
R e c a l l t h a t i n ( 3 . 1 ) w e showed i n e f f e c t
t h a t t h e g l o b a l s e c t i o n f u n c t o r on
r : Eff
-->
Sets d e f i n e d
(i)r ( X , = )
= {XIEX
Eff
i s n a t u r a l l y isomorphic t o
by
i s non-empty]/_
where x
- x'
if
[Ix = x i ]
'
i s non-empty; ( i i ) i f G i s a f u n c t i o n a l r e l a t i o n from ( X , = )
t o (Y,=)
representing g, then T ( g ) ([XI)
= {ylG(x,y)
i s non-empty} where [ X I d e n o t e s
t h e equivalence c l a s s of x.
r
i s a c o n c r e t e v e r s i o n of t h e g l o b a l s e c t i o n f u n c t o r , w i t h which
w e can work, even c o n s t r u c t i v e l y : s t a r t i n g from an a r b i t r a r y b a s e
topos E , T ( X , = )
s t i l l makes s e n s e a s t h e i n t e r p r e t a t i o n i n E of
" t h e set o f maps from 1 t o ( X I = ) " . r e p l a c e d by " i n h a b i t e d " ) Theorem 4 . 3 .
.
A is t h e d i r e c t image f u n c t o r of a g e o m e t r i c morphism,
whose i n v e r s e image f u n c t o r i s Proof:
r
(Of c o u r s e , "non-empty" must be
r.
The g l o b a l s e c t i o n f u n c t o r i s always C a r t e s i a n : a l t e r n a t i v e l y ,
a s d e f i n e d i s C a r t e s i a n by t h e l o g i c a l c o n s t r u c t i o n of f i n i t e
l i m i t s d e s c r i b e d i n 53.
So w e c o n c e n t r a t e on the a d j o i n t n e s s .
J.M.E. HYLAND
180
W e define t h e u n i t of t h e adjunction
ny:
ATY f o r (Y,=) i n
Y -->
Eff
by t h e f u n c t i o n a l r e l a t i o n (y,[y'l)-->
U{Eyly
Cy'l}={yy'
E
,
-
if y y' otherwise.
Now l e t G b e a f u n c t i o n a l r e l a t i o n from (Y,=) t o AX.
The t o t a l and
s i n g l e - v a l u e d c o n d i t i o n s imply t h a t i f Ey i s non-empty, i s a unique x
X w i t h G ( y , x ) non-empty.
E
implies t h a t i f
y
=
y']
then t h e r e
The r e l a t i o n a l c o n d i t i o n t h e n w e g e t t h e same x
is non-empty,
Thus w e have a w e l l - d e f i n e d map g: rY -->
for y' as for y.
X.
By
l o g i c , t h e composite A ( 9 ) o r l y i s r e p r e s e n t e d by ~ ( y , x )= U I E ~ Aug(cy11)
=
xn
~y
E
iy11
E
~YI.
By t h e s t r i c t c o n d i t i o n G(y,X)
-->
EY
i s v a l i d ; s o s i n c e G ( y , x ) i s non-empty i f f x
=
q(Cy1) and s i n c e
clearly Ey
H(y,g(cyl))
-->
is v a l i d , w e deduce t h a t
G ( y , x ) --> is valid.
H(y,x)
S i n c e b o t h G and H a r e f u n c t i o n a l r e l a t i o n s , t h i s shows
( a s remarked i n 5 2 ) t h a t t h e y r e p r e s e n t t h e same f u n c t i o n , and w e have o u r f a c t o r i z a t i o n [GI
=
A(q) o n y .
I t remains t o show t h a t q i s unique w i t h t h i s p r o p e r t y .
9 ' : TY -->
But i f
X is such t h a t G(Y,X)
<-->
U{EYA u g i ( c y i i ) =
xn
i s v a l i d , t h e n G ( y , g ' ( C y l ) ) i s non-empty,
Iy
E
cy'i
E
TY}
so t h a t g ' = q .
This
completes t h e p r o o f . Remark.
I t is an e a s y c o r o l l a r y of t h e proof of
Eff
(4.3)
t h a t maps
have a s i m p l e c a n o n i c a l r e p r e s e n t a t i v e .
( Y , = ) -->
AX i n
g: TY -->
X c o r r e s p o n d under t h e a d j u n c t i o n t o a map IY,=) ->
Let
Then t h i s l a t t e r map i s r e p r e s e n t e d by t h e f u n c t i o n a l r e l a t i o n
AX.
T h e effective topos ( y , x ) -->
XI
UiEylg([yl) =
181
{y:
=
W e can now i n d i c a t e how c a t e g o r y t h e o r y may be a p p l i e d t o s t u d y
realizability.
( 4 - . 2 ) and ( 4 . 3 ) t o g e t h e r s a y t h a t A :
Sets -->
i s an i n c l u s i o n of t o p o s e s (see Johnstone C19771) so t h a t j-sheaves
on
Eff
f o r a s u i t a b l e topology j .
c a t i o n of j , which depends on t h e f a c t t h a t Proposition 4 . 4 .
The topology j such t h a t
Eff
Sets
is
W e g i v e an i d e n t i f i -
Sets h a s c l a s s i c a l l o g i c , Eff. Sets i s t h e double -J
negation topology Proof:
In the f i r s t place,
Sets i s
dense i n
Eff s i n c e
A
p r e s e r v e s t h e i n i t i a l o b j e c t (see ( 8 . 1 ) ) ; s o j is a t most g r e a t e s t dense t o p o l o g y ) . But
it f o l l o w s t h a t j must be
T-,
Sets i s
71
(the
b o o l e a n , and from t h i s
.
W e can now d e s c r i b e what t h e use o f " c l a s s i c a l o b j e c t s " i n
i n t u i t i o n i s m amounts t o i n our c o n t e x t : s i n c e t h e y are d e f i n e d by l i b e r a l use o f 7-,, t h e y are when i n t e r p r e t e d i n the image o f A .
Thus A ( = )
c l a s s i c a l mathematics w i t h i n 15.
Eff,
the objects i n
s h o u l d be r e g a r d e d a s t h e world of
Eff.
B a s i c f a c t s from t h e l o g i c o f s h e a v e s . While the material p r e s e n t e d i n this s e c t i o n i s i m p l i c i t i n t h e
topos t h e o r e t i c l i t e r a t u r e , i t can n o t be found i n t h e form w e r e quire.
With Grothendieck t o p o s e s one h a s t y p i c a l l y a subtopos E
j of a t o p o s E which one u n d e r s t a n d s ( E i s u s u a l l y a f u n c t o r c a t e g o r y ) and one r e q u i r e s r e s u l t s which e n a b l e one t o d i s c u s s E E and t h e topology j . It is t h e topos E
j
j
i n terms of
For us however t h e s i t u a t i o n i s d i f f e r e n t .
( t h a t is
Sets) which
obtain information about E ( t h a t i s
w e understand and w e wish t o
Eff)
i n terms o f E
and j . j W e p r e s e n t t h e material i n t h e following general context.
E is
a t o p o s w i t h a topology j , E . i s t h e f u l l s u b c a t e g o r y of E c o n s i s t i n g J of j-sheaves and L: E -> E j i s t h e sheafification functor l e f t
182
J.M.E. HYLAND
adjoint t o the inclusion E
E.
->
W e give t h e b a s i c d e f i n i t i o n s
i n a number o f u s e f u l e q u i v a l e n t forms which a r e i m p l i c i t e i t h e r i n Johnstone C19771 o r i n Fourman-Scott Definition.
119791.
o b j e c t F of E i s j - s e p a r a t e d
An
i f f any of t h e f o l l o w i n g
equivalent conditions is s a t i s f i e d : ( i )f o r any j-dense monic m:
with fm = gm, w e have f (ii)t h e u n i t (iii) E
I=
nF:
Vf,f'
A subobject
Y' >-->
F
Y -->
g;
=
L ( F ) of t h e a d j u n c t i o n i s monic;
F -->
~ . j ( f= f ' ) -->
E
Y and maps f , g :
(monic) A
(f = f ' ) .
E o f an o b j e c t E of
>--Z
E i s j-closed
i f f any one o f t h e f o l l o w i n g e q u i v a l e n t c o n d i t i o n s i s s a t i s f i e d : ( i )i f a: E -->
R c l a s s i f i e s A >-->
( i i ) t h e commutative s q u a r e
(iii)E Of
I=
Ve.j(e
E
A) -->
e
E
these d i f f e r e n t formulations,
t h e o r e t i c one,
E , then j a = a;
A
-->
L(A)
E
-->
L(Ej
i s a pullback;
A.
(i) i s the t r a d i t i o n a l category
(ii)i s p a r t i c u l a r l y u s e f u l f o r understanding
Eff
and (iii) i s t h e l o g i c a l f o r m u l a t i o n ( t r e a t i n g j a s a p r o p o s i t i o n a l operator)
.
I t i s obvious from t h e d e f i n i t i o n s t h a t F i s j - s e p a r a t e d
iff
t h e e q u a l i t y on F i s j - c l o s e d ,
and t h a t a s u b o b j e c t of a j - s e p a r a t e d
o b j e c t i s i t s e l f j-separated.
W e c o l l e c t some f u r t h e r f o l k l o r i c
f a c t s about t h e s e n o t i o n s i n t h e n e x t theorem. Theorem 5 . l . ( a ) I f E and F are j - s e p a r a t e d ,
nExF:
ExF -->
L(ExF) = L ( E ) x L ( F ) i s (b) I f F i s j-separated,
t h e composite of nFE: L ( F ~ )%>
->
FE
--5
t h e n SO i s EXF.
Also
nEXnF.
t h e n s o i s FE f o r any E .
Also
L(FE) w i t h t h e n a t u r a l map
L ( F ) L ( E ) followed by t h e isomorphism L ( F ) n E : L ( F ) L ( E )
E L ( F ) E i s t h e monic q F : FE -->
L ( F ) E , and t h e e v a l u a t i o n map
183
The effective topos E F X E -->
F i s o b t a i n e d by f a c t o r i n g evo(aon
Xn
)
through q F .
FE ( c ) If
c
i s j-closed.
F i s j - c l o s e d and a: E -->
>-->
E.
t h e n SO is
E.
E i s j - c l o s e d t h e n s o i s ( A -->
2->
Also L ( A -->
B) = L ( A ) -->
E i s j-closed
( f ) I f A >--> j-closed.
E are j - c l o s e d
E and B >-->
A l s o L(AAB) = L ( A ) A L ( B ) .
(e) I f B any A >-->
E
Also L(a*(C)) = L(a)*(L(C)).
( d ) I f A >--> AAB >-->
F t h e n Cr*(C) >-->
>-->
E for
L(B).
and a: E -->
F t h e n V a . A >-->
F is
= tlL(a) .L(A).
A l s o L(Va.A)
( 9 ) I f R >--z
B)
ExE i s a j - c l o s e d e q u i v a l e n c e r e l a t i o n on E l
Also the image ( o r s u r j e c t i v e
t h e n t h e q u o t i e n t E/R i s j - s e p a r a t e d . monic) f a c t o r i z a t i o n of E-
> L(E)
->
L(E) /L ( R )
> E/R
->
L(E/R)
nE is E-
n E/R
Proof: A l l t r i v i a l by t h e l o g i c of j - o p e r a t o r s of Fourman-Scott
C19791).
= L ( E ) / ~ ( ~ ) .
( s k e t c h e d a t t h e end
Category t h e o r e t i c p r o o f s are ( i m p l i c i t )
i n Johnstone C19771. L e t us now e x p l a i n why w e a r e i n t e r e s t e d i n c l o s e d s u b o b j e c t s .
Our u n d e r s t a n d i n g of Grothendieck t o p o s e s rests on t h e f a c t t h a t i n v e r s e image f u n c t o r s p r e s e r v e c o h e r e n t l o g i c ( t h a t i s t h e i n c l u s i o n of see some of t h e
A , v , ~ ) .
But
Sets i n Eff i s i n t h e wrong d i r e c t i o n i f W e wish t o l o g i c o f Sets p r e s e r v e d i n Eff. I n g e n e r a l a d i r e c t
image f u n c t o r p r e s e r v e s l i t t l e , b u t w e can g e t r a t h e r s t r o n g r e s u l t s , --> E l by r e s t r i c t i n g a t t e n t i o n t o j T h i s is s i g n i f i c a n t because a j - c l o s e d s u b o b j e c t
when d e a l i n g w i t h i n c l u s i o n s E j-closed subobjects. A >-->
E " a g r e e s w i t h i t s meaning i n
nE*(LA)
(This i s v e r s i o n
E" j
= A.
(ii) of t h e d e f i n i t i o n . )
i n t h e sense t h a t
J.M.E. HYLAND
184
Given an i n t e r p r e t a t i o n of t h e atomic formulae of a f i r s t o r d e r language i n E w e g e t
U $ 1 of an a r b i t r a r y formula i n E
( i )an i n t e r p r e t a t i o n
, and
by applying L an i n t e r p r e t a t i o n of t h e atomic formula i n E hence an i n t e r p r e t a t i o n
.
3'
W e a r e i n t e r e s t e d i n when
tation
II $ ]I
in E
j
"
j
and
j
of an a r b i t r a r y formula i n E .
II $ 1 i s a s u b o b j e c t of E , t h e n
Clearly i f L(E)
[$I
(ii)
I[ $ ]I
B$
i s a s u b o b j e c t of
j "agrees with t h e i n t e r p r e -
i n t h e sense t h a t
nE*( 1 4
n j)
=
u$n .
The r e l e v a n t d e f i n i t i o n i s of a form f a m i l i a r from T r o e l s t r a C19731. Definition.
I n a f i r s t o r d e r language, t h e n e g a t i v e formulae ( o r
formulae i n t h e n e g a t i v e fragment) a r e t h o s e b u i l t up from atomic formulae u s i n g Theorem 5 . 2 .
->,V.
A,
I f an i n t e r p r e t a t i o n of a f i r s t o r d e r language i n E
i n t e r p r e t s t h e atomic formulae a s j - c l o s e d s u b o b j e c t s and $ i s a
I$ 1
negativeformula with
>->
E, then
r l E * ( v ~ n j =) ~ $ 1 . Proof:
I n d u c t i o n on t h e complexity of $ u s i n g (5.1) (c) ( d ) ( e ) and
(f).
Remarks
1) W e can only have e q u a l i t y f o r j - s e p a r a t e d o b j e c t s . 2) As
to
n+nj
$
n
i s j-closed,
nE*(
I$
1j)
=
f
$ ]I i s e q u i v a l e n t
= L ( u $ D ) .
3 ) The r e s u l t i s j u s t a consequence of t h e " j - i n t e r p r e t a t i o d ' of t h e l o g i c of E.
For n e g a t i v e formulae w e a r e r e a d i n g it n o t a s a
p r e s c r i p t i o n f o r d e r i v i n g t h e l o g i c of E
j
from t h a t of E , b u t a s t h e
s t a t e m e n t t h a t t h e l o g i c of E a g r e e s w i t h t h a t of E
16
S e p a r a t e d o b j e c t s and c l o s e d s u b o b j e c t s i n
j'
Eff.
I n t h i s s e c t i o n , w e d e s c r i b e what (5.1) means f o r t h e p a r t i c u l a r
topology.
Eff
i s Sets so t h a t j i s t h e double n e g a t i o n j ( I n f a c t w e do n o t use t h i s l a s t f a c t , so t h a t t h e
c a s e when E i s
and E
The effective topos
185
m a t e r i a l r e l a t i v i z e s t o an a r b i t r a r y base t o p o s E . ) . W e w i l l say J t h a t an o b j e c t of Eff is s e p a r a t e d when it i s j - s e p a r a t e d and t h a t a subobject of an o b j e c t is c l o s e d when i t i s j - c l o s e d .
t o one of t h e form ( X , = ) Proof:
i s s e p a r a t e d i f f it i s isomorph
An o b j e c t of Eff
Proposition 6.1.
where
fi
x = x' 1
non-empty
C
implies x = x '
By v e r s i o n (ii) of t h e d e f i n i t i o n of j - s e p a r a t e d ,
w e see
t h a t i f an o b j e c t i s s e p a r a t e d , it i s a s u b o b j e c t of some A X . any c a n o n i c a l monic i n t o A X i s of t h e r e q u i r e d form.
But
Conversely any
o b j e c t of t h e r e q u i r e d form is a s u b o b j e c t of a AX Cthe obvious map
is monic), and s u b o b j e c t s of s e p a r a t e d o b j e c t s a r e s e p a r a t e d . Definition.
An
object (X,=)
of
Eff,
where
1[ x = x ' i
i m p l i e s x = x', i s a c a n o n i c a l l y s e p a r a t e d o b j e c t of
non-empty
Eff.
(Such an o b j e c t i s completely determined by t h e v a l u e s
[Ix E X i
for
each x i n X, and i s e s s e n t i a l l y ( t h a t i s , modulo t r i v i a l coding) given a s a c a n o n i c a l monic i n t o A X . ) Proposition 6 . 2 .
If
(X,=)
and (Y,=) a r e c a n o n i c a l l y s e p a r a t e d , t h e n
so i s t h e u s u a l product ( X x Y , = )
u Proof:
(x,y)
=
where
( x l , y ~ ) n
=
IIX
=
x l n
A
uy =
y l n
.
Immediate from ( 5 . 1 ) ( a ) and t h e d e f i n i t i o n of t h e product of
maps i n t h e l o g i c . The c a s e of f u n c t i o n s p a c e s i s more complex t h a n t h a t o f p r o d u c t s . Since t h e g e n e r a l d e s c r i p t i o n of a f u n c t i o n space (see HJP C19801 i s too clumsy, w e must use ( 5 . 1 ) ( b ) t o c o n s t r u c t a s u i t a b l e r e p r e s e n tation. Proposition 6.3.
L e t (Y,=)
canonically separated.
and (Z,=)
be o b j e c t s o f
Then t h e f u n c t i o n s p a c e (Z,=)
Eff ("=)
w i t h (Z,=) may be
taken t o be t h e c a n o n i c a l l y s e p a r a t e d o b j e c t ( r Z r Y , = ) where ( t a k i n g
r ( z , = ) 5 2) I n = II V
(cYn n
~ ~ Y . ~ ( C ~ I ) = ~ I =
n~ II
Ey-->a(Cyl)=a' ( c y i ) i l y c ~ i
and where t h e e v a l u a t i o n map i s r e p r e s e n t e d by t h e f u n c t i o n a l r e l a t i o n
J.M.E. HYLAND
186
I [ E ~A
EY
A
n .
a(cy1) = z
( 5 . 1 ) ( b ) g i v e s us a monic from (Z,=)
Proof:
("=)
t o rZrY d e f i n e d
i n t h e l o g i c by
uvY
Y . ~ C C ~ I )z
n
which i s e q u i v a l e n t t o t h e formulae g i v e n a s CZ,=) separated.
is canonically
The r e p r e s e n t a t i o n of t h e e v a l u a t i o n map f o l l o w s from
t h e d e f i n i t i o n i n t h e l o g i c o f t h e map d e s c r i b e d i n ( 5 . 1 ) ( b ) by elementary l o g i c . Remark.
I f f o r e v e r y y i n Y , Ey i s non-empty
(and w e may a s w e l l
disregard the o t h e r s ) , then the following a l t e r n a t i v e representation of t h e f u n c t i o n s p a c e i s c a n o n i c a l l y s e p a r a t e d : I Z y , = ) a = a l n
=
n{
where
n
I I ~ = ~ ~ - - > ~ ( ~ ) l =y , ~y l~ E (~ ~~ ~ )
and where t h e e v a l u a t i o n map i s r e p r e s e n t e d a s above.
(We g e t t h i s
a l t e r n a t i v e r e p r e s e n t a t i o n by c o n s i d e r i n g t h e obvious map from rZ(yl=)
(Y,=)
t o Z E Y l where EY i s t h e c a n o n i c a l s u b o b j e c t o f AY o f which
is a quotient,)
E a is non-empty,
Then i f w e d i s r e g a r d t h o s e a i n Z y such t h a t
w e can c o n t i n u e t h i s p r o c e s s and o b t a i n a s i m p l e
d e s c r i p t i o n of i t e r a t e d f u n c t i o n s p a c e s of s e p a r a t e d o b j e c t s .
We
c o n s i d e r t h i s f u r t h e r i n 5 5 7 and 11. W e next consider closed subobjects i n
Proposition 6.4.
A s u b o b j e c t o f an o b j e c t
Eff. (X,=) of
Eff i s
i f f i t i s r e p r e s e n t e d by a c a n o n i c a l monic determined by A
closed E
Cn o f
f o r s o m e A 5 I'(X,=). ( I t does no harm t o l e t A d e n o t e t h e s u b s e t o f r ( X , = )
,
the canonical
monic as d e f i n e d and t h e c l o s e d s u b o b j e c t which it r e p r e s e n t s ) . Proof: By v e r s i o n (ii) of t h e d e f i n i t i o n of j - c l o s e d , o b j e c t of (X,=) must b e of t h e form rlx
-1
a c l o s e d sub-
(AA) f o r some A
TIXI=).
The effective topos
187
But what w e have d e s c r i b e d i s e a s i l y s e e n t o b e e q u i v a l e n t t o t h e d e f i n i t i o n of
nx -1 (AA)
Definition.
A monic o f form (X,=')
Ix='x']
i n the logic.
= U{ I[x=x'JJ
f o r some A 5 T ( X , = )
[=">
IlxleA} = {
(X,=) where
[x=xD, i f [ X I E A , I , otherwise,
i s a c a n o n i c a l c l o s e d monic.
( ( 6 . 4 ) shows
e s s e n t i a l l y t h a t t h e closed subobjects a r e j u s t those represented by c a n o n i c a l c l o s e d m o n i c s ) . On many o c c a s i o n s i t i s more n a t u r a l t o d i s r e g a r d i n (X,=')
Remark.
t h e x which a r e n o t i n A.
W e s h a l l s u i t t e r m i n o l o g y t o need and
r e f e r t o t h i s m o d i f i c a t i o n a l s o a s a c a n o n i c a l c l o s e d monic.
Note
t h a t t h e n o t i o n becomes p a r t i c u l a r l y s i m p l e i n c a s e (X,=) i s c a n o n i c a l l y s e p a r a t e d , a s t h e n w e may t a k e A 5 X ( t a k i n g r(X,=)
5 X again).
We now s a y what ( 5 . 1 ) ( c ) , ( d ) , ( f ) mean f o r t h e e f f e c t i v e t o p o s . Proposition 6.5. of
(x,=), C
a map i n
>-->
L e t A >->
(X,=) and B >->
(Y,=) a s u b o b j e c t o f
(X,=) be s u b o b j e c t s
(Y,=) and [GI:
Eff.
I f C i s a c a n o n i c a l c l o s e d monic ( d e f i n e d from C 5 r ( Y , = ) ) , [Gl-l(C)
(Y,=)
(X,=) -->
then
i s t h e c a n o n i c a l c l o s e d monic d e f i n e d from (r(G)-l(C)
=
{ C x l l { y l G ( x , y ) non-empty)
E
C).
I f A , B are c a n o n i c a l c l o s e d monics ( d e f i n e d from A , B 5 r ( X , = ) ) ,
A A B i s t h e c a n o n i c a l c l o s e d monic d e f i n e d from AnB. c a n o n i c a l c l o s e d monic ( d e f i n e d from B 5 r ( X , = ) ) ,
If B
then
is a
t h e n A ->
B is
t h e c a n o n i c a l c l o s e d monic d e f i n e d from
TA -> and VCG1.B
B = {Cxll i f [ X I
rA t h e n [ X I
E
B},
i s t h e c a n o n i c a l c l o s e d monic d e f i n e d from V r ( C G 1 ) .B =
Proof:
E
{Cyll i f G(x,y) non-empty t h e n [-XI
E
B}.
( 5 . 1 ) t e l l s us t h a t t h e r e l e v a n t s u b o b j e c t s are c l o s e d and
t h a t w e g e t a r e p r e s e n t a t i o n by a p p l y i n g T, d o i n g t h e r e q u i r e d construction i n monic.
Sets, and
taking t h e corresponding canonical closed
J.M.E. HYLAND
188
Remark.
The c o n s t r u c t i o n s d e s c r i b e d i n 6 . 5 are p a r t i c u l a r l y s i m p l e and (Y,=) are c a n o n i c a l l y s e p a r a t e d .
i n case the objects (X,=)
F i n a l l y w e c o n s i d e r t h e meaning o f ( 5 . 1 ) (9) f o r t h e e f f e c t i v e topos.
I t g i v e s a c o n v e r s e t o t h e o b v i o u s remark t h a t i f
is
(XI=)
canonically separated] then the equality ( o r diagonal) i n (Xl=)x(Xl=)
i s t h e c a n o n i c a l c l o s e d monic d e f i n e d by t h e d i a g o n a l i n
xxx. Proposition 6.6.
-
Suppose t h a t
l e n c e r e l a t i o n on ( X , = )
Eff.
E
in
Cxxx
r e p r e s e n t s a c l o s e d equiva-
Then t h e q u o t i e n t ( X , - )
is iso-
morphic ( i n t h e o b v i o u s way) t o t h e c a n o n i c a l l y s e p a r a t e d o b j e c t
( r (XI-)
, z ) where
1 ~ x l ~ C x Jl l = U { Proof:
I[ x ' - x l ' J
Ix'
->
The composite ( X , = )
E
[ X I and xl' > rl ( X I - )
(X,-)
[-I
t e d by H(x,Cxll)
x-xl')
=U{
Ixl'
E
E
[xll}.
Ar(Xl-)
i s represen-
Ixll).
By ( 5 . 1 ) (9) w e r e q u i r e t h e image f a c t o r i z a t i o n of [HI, and what w e have i s a s t a n d a r d d e f i n i t i o n of t h i s f a c t o r i z a t i o n i n t h e l o g i c .
57.
The e f f e c t i v e o b j e c t s . Since
Sets i s
i n c l u d e d i n Eff,
c o n t a i n s c l a s s i c a l mathema-
Ef
t i c s so much of it i s n o t p a r t i c u l a r l y " e f f e c t i v e " .
In t h i s section
w e c o n s i d e r o b j e c t s whose c l o s e r e l a t i o n t o t h e a p p l i c a t i v e s t r u c t u r e (IN ,. )
e n s u r e s t h a t o p e r a t i o n s on them a r e g e n u i n e l y " e f f e c t i v e " .
I n l a t e r s e c t i o n s w e w i l l show t h a t t h e o b j e c t s of a n a l y s i s i n
Eff
a r e ( q u i t e f a m i l i a r ) o b j e c t s of t h i s k i n d . Definition.
An o b j e c t
1x
E
XJ
(ii) U x
E
XJ n fx'
(i)
(X,=)
is (strictly) effective i f f
i s non-empty each x
and (iii)U x = x ' l = II x
E
X,
X J non-empty i m p l i e s x = x ' ,
E
E
XI
n Ux'
E
XI
.
( O c c a s i o n a l l y w e may d e s c r i b e an o b j e c t as e f f e c t i v e when it i s isomorphic t o one of t h e above form. l o o s e s e n s e i s meant.)
I t w i l l be obvious when t h i s
189
The effective topos
C l e a r l y e f f e c t i v e o b j e c t s a r e ( c a n o n i c a l l y ) s e p a r a t e d , and w e can e a s i l y show t h a t t h e y s h a r e t h e c l o s u r e p r o p e r t i e s of s e p a r a t e d
.
objects
Proposition 7 . 1 .
(a) I f (X,=)
and (Y,=) a r e e f f e c t i v e , then so i s
(b) I f
i s effect'ive, then so i s t h e function
t h e i r product. (Z,=)
f o r any (Y,=) i n ~ f f .
space (z,=) (',=)
( c ) A s u b o b j e c t of an e f f e c t i v e o b j e c t i s effective. ( d ) A q u o t i e n t of an e f f e c t i v e o b j e c t by a c l o s e d equivalence r e l a t i o n i s e f f e c t i v e . ( a ) i s t r i v i a l : look a t ( 6 . 2 ) .
Proof:
( b ) f o l l o w s by i n s p e c t i o n of (6.3). a
E
r Z r Y with
I f w e restrict t o those
non-empty, t h e n w e g e t an o b j e c t s a t i s f y i n g
Ea
( i ) (ii) , and (iii)above.
( c ) r e q u i r e s more work. l e t ( X I = ' ) --> [ x
='XI
Write x
Since
L e t ( X I = ) be s t r i c t l y e f f e c t i v e and
be a c a n o n i c a l monic w i t h
(X,=)
Il x=x'n
II
= R(x)A
E'
X f o r x ='x and p u t X ' = Ix
for some s t r i c t r e l a t i o n a l R
[ x E ' x n n [x' € ' X I
E
E
cX
.
XI Ux E ' X 1 i s non-empty}.
non-empty i m p l i e s
Ilx
E
xDn [ x u E xn
non-empty which i m p l i e s x = x', w e g e t a s t r i c t l y e f f e c t i v e o b j e c t (XI,=) with
[x
E
= I[ x E ' X 1
X'l
.
I t i s isomorphic t o ( X I = ' )
because
n ( (ux is non-empty
E
x'I
n Ux'
.
( d ) f o l l o w s from ( 6 . 6 ) .
If
E
xi] 1
<-->
I[x
I t follows t h a t
x
E
X
I
( r ( X I = ),%)
n I[ X'E X
)
- i s a closed equivalence
r e l a t i o n on (X,=) which i s s t r i c t l y e f f e c t i v e , t h e n non-empty imples
='x'II
[x-xi n [xl-x'D
1 non-empty which i m p l i e s x
=
is strictly effective.
The f u l l s u b c a t e g o r y of
Eff
whose o b j e c t s a r e t h e e f f e c t i v e
ones has a c o n c r e t e r e p r e s e n t a t i o n f a m i l i a r t o l o g i c i a n s i n
x'.
J.M.E. HYLAND
190
connection w i t h t h e e f f e c t i v e o p e r a t i o n s . r e l a t i o n s on IN R,S,
( t h a t i s e q u i v a l e n c e r e l a t i o n s on t h e i r f i e l d s )
... and w r i t e
m/R
= { C n l R ( n E F i e l d ( R ) } f o r t h e set of
e q u i v a l e n c e c l a s s e s of R . such t h a t t h e r e i s f
E
L e t a m x F: R ->
Field(R).
E
S be a map F:
N/R->lN/S
IN w i t h
F(CnlR) for a l l n
Take p a r t i a l e q u i v a l e n c e
=
[f(n)lS
C l e a r l y w e have a c a t e g o r y .
Each p a r t i a l e q u i v a l e n c e r e l a t i o n R g i v e s r i s e t o a s t r i c t l y effective object ( B / R , = ) F: R -->
of
Eff
where E ( l n l R )
S g i v e s r i s e t o a map (IN/R ,=)
->
=
Cnl,.
( B / S ,=)
A map
represented
by F(CnlR,[mlS) = U{CnlRh[mlSIF([nlR) = [ m l s l , and so w e have a f u n c t o r i n t o
Eff
which i s c l e a r l y f a i t h f u l and i s
f u l l by a p p l y i n g g l o b a l s e c t i o n s t o ( 7 . 1 ) ( b ) .
C l e a r l y any s t r i c t l y
e f f e c t i v e o b j e c t i s isomorphic t o one o b t a i n e d from a p a r t i a l equivalence r e l a t i o n .
L e t u s d e s c r i b e t h e f u n c t i o n s p a c e SR i n t h e
c a t e g o r y of p a r t i a l e q u i v a l e n c e r e l a t i o n . R
I t i s g i v e n by
eS f i f f nRm i m p l i e s e ( n ) S f ( m )
.
A moment's thought shows t h a t t h i s c o r r e s p o n d s t o t h e p r e s c r i p t i o n
f o r f i n d i n g t h e s p a c e of f u n c t i o n s from ( B / R ,=)
.
t o ( N / S ,=)
given
by ( 7 . 1 ) (b)
T h i s i s a u s e f u l way t o t h i n k o f t h e m a t e r i a l i n
§ § l o and
( I n f a c t t h e embedding of t h e p a r t i a l e q u i v a l e n c e
11.
relations in
Eff
p r e s e r v e s t h e l o c a l C a r t e s i a n c l o s e d s t r u c t u r e of
t h e former c a t e g o r y . ) One p a r t i c u l a r e f f e c t i v e o b j e c t i s c r y i n g o u t f o r a t t e n t i o n : t h a t c o r r e s p o n d i n g t o t h e e q u a l i t y r e l a t i o n on N . object. I N =
(IN ,=)
This i s t h e
where [In = mll
=
inlnIm}.
As w e n o t e d i n 13, t h i s i s t h e n a t u r a l number o b j e c t ; w e c o n s i d e r some of i t s p r o p e r t i e s i n l a t e r s e c t i o n s .
F i r s t however, w e w i l l use it
t o g i v e a c h a r a c t e r i z a t i o n of e f f e c t i v e o b j e c t s .
R e c a l l t h a t any
191
The effective topos
object (X,=)
i s a q u o t i e n t o f a s u b o b j e c t o f AX.
o b j e c t s w e c a n r e p l a c e AX by ( I N ,=) Proposition 7.2.
.
Every e f f e c t i v e o b j e c t i s a q u o t i e n t by a c l o s e d
e q u i v a l e n c e r e l a t i o n of a c l o s e d s u b o b j e c t of Proof:
If
(X,=)
For e f f e c t i v e
(IN ,=)
.
c o r r e s p o n d s a s above t o t h e p a r t i a l e q u i v a l e n c e
r e l a t i o n R on I N , t h e n t h e c l o s e d s u b o b j e c t o f
is that
LIN ,=)
determined by F l d ( R ) 5 I N and t h e c l o s e d e q u i v a l e n c e r e l a t i o n
- is
given by
That t h e r e s u l t i n g q u o t i e n t of a s u b o b j e c t of t h e same R i s immediate i n view of
( I N ,=)
g i v e s rise t o
( 6 . 4 ) and ( 6 . 6 ) .
Now w e can s t a t e o u r c h a r a c t e r i z a t i o n theorem. Theorem 7 . 3 .
Eff
The f o l l o w i n g c o n d i t i o n s on a o b j e c t X of
are
equivalent: ( i )X i s isomorphic t o a s t r i c t l y e f f e c t i v e o b j e c t ; (ii)X i s a c l o s e d q u o t i e n t of a c l o s e d s u b o b j e c t of
(iii) X i s a c l o s e d q u o t i e n t o f a s u b o b j e c t of
Proof:
( i )i m p l i e s
(ii) i s ( 7 . 2 ) ,
(ii) i m p l i e s
(IN
,=)
:
(IN , = I . (iii)i s t r i v i a l
and (iii) i m p l i e s ( i ) f o l l o w s from ( 7 . 1 ) ( c ) and ( a ) . Remark.
Since
(m,=)i s
t h e n a t u r a l number o b j e c t , w e have shown
t h a t t h e e f f e c t i v e o b j e c t s are t h o s e subnumerable i n a c e r t a i n way. However t h e e q u a l i t y on an e f f e c t i v e o b j e c t must be c l o s e d (as i t
i s a s e p a r a t e d o b j e c t ) and t h e r e a r e q u o t i e n t s o f
(m,=)
e q u i v a l e n c e r e l a t i o n s which are e m p h a t i c a l l y n o t c l o s e d .
by (The
r e a d e r w i l l know where t o look a f t e r r e a d i n g t h e n e x t s e c t i o n ! ) So t h e e f f e c t i v e o b j e c t s a r e a p r o p e r s u b c l a s s of t h e q u o t i e n t s of
d e c i d a b l e o b j e c t s r e c e n t l y s t u d i e d by P e t e r Johnstone i n a g e n e r a l context.
J.M.E. HYLAND
192 18.
Markov's p r i n c i p l e and almost n e g a t i v e formulae. I n t h i s s e c t i o n w e see how t h e g e n e r a l r e s u l t of (5.2) can be
extended i n t h e c a s e of t h e t o p o s
Effj
j with
Lemma 8.1.
Sets. A: Sets ->
Eff
and (double n e g a t i o n ) topology
=
Eff
preserves t h e i n i t i a l object.
Thus
Il i s always a c l o s e d s u b o b j e c t , and hence d e c i d a b l e s u b o b j e c t s a r e closed. Proof:
T r i v i a l category theory.
Lemma 8.2.
Markov's p r i n c i p l e
VR L P ( N ) . ( V n . R ( n ) v ~ R ( n ) h ~ l 3 n ( R ( n -> )
Eff.
holds i n Proof:
3nRCn))
A s t h e a r i t h m e t i c a l s t a t e m e n t s h o l d i n g i n Ef
a r e those
r e a l i z e d i n t h e o r i g i n a l s e n s e of Kleene (see 13) t h i s i s t h e Note t h a t w e do n o t need t o
s t a n d a r d argument ( T r o e l s t r a C19731). know about P ( N ) 1 Lemma 8 . 3 . 3n.R(n,x) >-> Proof:
I f R >-> X
N x X is a d e c i d a b l e s u b o b j e c t i n E X , t h e n
i s c l o s e d and r ( 3 n . R ( n f x ) ) = 3 n . r ( R ( n f x ) ) .
This amounts t o --3n.R(n,x)
5
3n.R(n,x) which f o l l o w s by
(8.2).
Remark.
Though ( 8 . 2 )
depends on Markov's p r i n c i p l e i n
does n o t r e l a t i v i z e t o an a r b i t r a r y t o p o s ,
w e w i l l always have j ( 3 n . R ( n , x ) )
5
w, and
so
( 8 . 3 ) does r e l a t i v i z e :
3n.R(n,x).
( 8 . 1 ) and ( 8 . 3 ) s u g g e s t t h a t w e e x t e n d t h e c l a s s of n e g a t i v e formulae. Definition.
A formula is c a l l e d almost n e g a t i v e i f f it i s b u i l t up
from atomic formulae u s i n g
A,
->,V,i,
and sequences of 3n a p p l i e d
t o d e c i d a b l e formulae ( t y p i c a l l y e q u a t i o n s between numerical-valued
terms)
.
W e now g i v e o u r e x t e n s i o n of ( 5 . 2 ) . Theorem 8 . 4 .
I f t h e atomic formulae of a f i r s t o r d e r language a r e
193
The effective topos
i n t e r p r e t e d as c l o s e d s u b o b j e c t s i n with
[@
1 >->
Eff
and @ i s almost n e g a t i v e
then
E,
nE*(u+nj) =
t@n.
As f o r ( 5 . 2 ) u s i n g ( 8 . 1 ) and ( 8 . 3 ) a s w e l l .
Proof:
The f o r c e o f (8.4) i s t h a t , f o r @ a l m o s t n e g a t i v e @ i s t r u e in
Eff
i f f t h e c o r r e s p o n d i n g i n t e r p r e t a t i o n of @ i n Sets i s t r u e :
t h a t i s , t h e meaning of @ i n Ef
" a g r e e s w i t h " i t s c l a s s i c a l meaning.
( 8 . 4 ) i s a v e r s i o n of 3 . 2 . 1 1 ( i ) and (ii)of T r o e l s t r a 119731;
w e could o b t a i n a more p r o o f - t h e o r e t i c v e r s i o n by s e l a t i v i z i n g t o t h e f r e e t o p o s ( w i t h n a t u r a l number o b j e c t ) .
For a language which
can " e x p r e s s i t s own r e a l i z a b i l i t y " we c o u l d o b v i o u s l y o b t a i n v e r s i o n s of 3.2.12
and 3.2.13 of T s o e l s t r a 119731.
For t h e sake of
completeness w e g i v e a v e r s i o n of 3.6.5 of T r o e l s t r a C19731. Definition
i s t h e l e a s t class C of
( c f . Hyland C19771) PR(a.n.1
formulae such t h a t ( i )C c o n t a i n s a l l atomic formulae; ( i i )C i s c l o s e d under ~ , v , V , 3 ; (iii)i f @ is almost n e g a t i v e
(more g e n e r a l l y almost n e g a t i v e
preceded by e x i s t e n t i a l q u a n t i f i e r s ) and $ i s i n C, t h e n ( @ ->
$1
i s i n C. P r o p o s i t i o n 8.5.
I@ 1 >->
with
I n t h e s i t u a t i o n of
i f @ i s i n PR(a.n)
then
E,
n+n Proof:
(8.41,
5
nE*(
I@ n
j).
By i n d u c t i o n on t h e complexity of
@.(Note
t h a t v and + ' a r e
from t h e way t h e y are i n E). j Remark. For a g e n e r a l s h e a f subtopos E of E w e have j [ @ I 5 nE*( fi @ 1 . ) f o r a l l @ i n P R ( j - c l o s e d ) . So i f atomics are calculated differently i n E
3
i n t e r p r e t e d as j - c l o s e d , PR(negative)
then w e get the r e s u l t f o r a l l @ i n
.
The f o r c e of
(8.5) i s t h a t , f o r @ i n PR(a.n), i f @ i s t r u e i n
J.M.E. HYLAND
194
Eff,
Sets i s
then t h e c o r r e s p o n d i n g i n t e r p r e t a t i o n of @ i n
true.
T h i s g i v e s r i s e t o a c o n s e r v a t i v e e x t e n s i o n r e s u l t (when r e l a t i v i z e d ) a s i n T r o e l s t r a C19731 53.6. §9
Choice p r i n c i p l e s and t h e r e a l numbers. I n t h i s s e c t i o n w e make a s t a r t towards showing t h a t a n a l y s i s
in
Eff
is j u s t constructive recursive analysis.
Markov's p r i n c i p l e ( 8 . 2 ) . )
(We a l r e a d y have
W e do t h i s i n two s t e p s .
F i r s t w e show
t h a t w e have t h e c h o i c e p r i n c i p l e s t o e n s u r e t h a t t h e Dedekind r e a l s ( t h e r i g h t r e a l s i n a t o p o s ) a r e Cauchy (see Fourman-Hyland Then w e u s e t h e re-
C19791 and a l s o Fourman-Grayson t h i s volume).
Eff
s u l t s of 5 7 t o show t h a t t h e Cauchy r e a l s i n
c a n be i d e n t i f i e d
w i t h a f a m i l i a r s t r i c t l y e f f e c t i v e o b j e c t used i n c o n s t r u c t i v e recursive analysis. F i r s t w e need t o know what t h e s p a c e of f u n c t i o n s from IN
looks l i k e i n
an a r b i t r a r y ( X , = )
Eff.
to
A s s t a t e d i n H J P C19801,
by
l o g i c a l c o n s i d e r a t i o n s it i s
(ZIN x x , = ) where [G =
HI
= EGAn{G(n,x) <->
H ( n , x ) In
TN , x
E
d
XI,
w i t h EG t h e n o n - s t a n d a r d v a l u e of "G i s a f u n c t i o n a l r e l a t i o n " . Suppose now t h a t e r e a l i z e s Vn f o r every n, e ( n ) such t h a t e ( n )
E
E
E
U I E X A[ @ ( n , x ) ] Ix
E X ~ A[ @ ( n , x n ) l
.
IN , 3 x E
E
XI.
S e t G(n,x)
(XI=)
. @ ( n , x ) . Then
F o r e a c h n p i c k xn =
EnA [ x = x n 1
.
Now ( u n i f o r m l y i n e ) w e can f i n d numbers r e a l i z i n g EG and V n . 3 x . G ( n I x ) h $ ( n , x ) : G i s r e l a t i o n a l , s t r i c t and s i n g l e v a l u e d i n a s t a n d a r d way from i t s d e f i n i t i o n : A n . < n , n l ( e ( n ) ) > r e a l i z e s G i s t o t a l ; Xn. , a 2 ( e , n ) > > realizes V n . 3 x . G ( x , n ) h @ ( x l n ) . Thus ( u n i f o r m l y i n e ) w e have a number realizing
195
The effective topos 3g: Ri->
(X,=) .Vn.$(n,g(n))
and so w e have proved t h e f o l l o w i n g r e s u l t . Proposition 9 . 1 .
t h e axiom o f c h o i c e from t h e n a t u r a l
AC(IN,X),
numbers t o an a r b i t r a r y t y p e X , h o l d s i n Remark.
W e used AC ( I N , X )
in
sets i n
Eff.
t h e above p r o o f .
But i f
(X,=)
i s e f f e c t i v e , t h e n no use o f a c h o i c e p r i n c i p l e i n t h e base t o p o s i s needed (compare ( 7 . 1 ) ( b ) : i n t h i s c a s e t h e argument i s c o n t a i n e d
w i t h i n T r o e l s t r a 119731 3.2 1 5 . ( l e f t t o t h e r e a d e r ) w e a l s o have t h e s t r o n g e r
By a s i m i l a r proof result. Proposition 9 . 2 .
DC(X),
t h e axiom of dependent c h o i c e s on a n
a r b i t r a r y type X, holds i n
Eff.
Again D C ( X ) i s used i n t h e p r o o f , b u t i s n o t needed f o r
Remark.
e f f e c t i v e o b j e c t s X. AC(W,IN)
are the same.
is enough t o show t h a t t h e Cauchy and Dedekind r e a l s To g e t an e x p l i c i t r e p r e s e n t a t i o n of
R as a
s t r i c t l y e f f e c t i v e o b j e c t , w e use t h e Cauchy sequence d e f i n i t i o n . Lemma 9.3.
The i n t e g e r s Z and r a t i o n a l s Q i n
s t r i c t l y effective objects
Ex = Proof:
a,=)and
Eff
( Q , = ) where f o r x i n Z o r Q ,
# x i s an e l e m e n t a r y code f o r
# x) where
can be t a k e n a s
X.
They are o b t a i n e d s u c c e s s i v e l y from (IN ,=)
by t a k i n g c l o s e d
( d e c i d a b l e ) q u o t i e n t s of c l o s e d ( d e c i d a b l e ) s u b o b j e c t s o f p r o d u c t s :
so t h e r e s u l t f o l l o w s from t h e p r e s c r i p t i o n s i n v o l v e d i n (7.1) ( a ) , ( c ) [ e a s y c a s e of c l o s e d s u b o b j e c t s l and Lemma 9 . 4 .
The s p a c e of maps from IN t o Q i n
e f f e c t i v e o b j e c t (Qm ,=) Qm
and
[[ c1
E
(a).
QIN!
Eff
is the s t r i c t l y
where
= t h e r e c u r s i v e f u n c t i o n s from
= {eje(n) = # a ( n )1
IN t o Q
, t h e s e t of i n d i c e s f o r a .
J.M.E. HYLAND
196
This i s t h e p r e s c r i p t i o n i m p l i c i t i n ( 7 . 1 ) ( b )
Proof:
.
Since we
have enough c h o i c e t o show t h a t any r e a s o n a b l e n o t i o n s of Cauchy
Eff w e d e f i n e
sequence g i v e t h e same r e a l s i n
C S , t h e c o l l e c t i o n of
( r e s t r i c t e d ) Cauchy sequences by
Thus d e f i n i t i o n i s i n t h e n e g a t i v e fragment and so s i n c e < i s d e c i d a b l e on t h e r a t i o n a l s and hence by (8.1) c l o s e d , d e f i n e s a c l o s e d s u b o b j e c t of Qm
in
Eff.
I n view of (8.4) w e can i d e n t i f y
it.
Lemma 9.5.
The space of Cauchy sequences i n
Eff
is the s t r i c t l y
e f f e c t i v e o b j e c t ( C S , = ) where CS i s t h e set of r e c u r s i v e Cauchy sequences and Proof:
Ur
E
i s t h e s e t of i n d i c e s f o r r .
CS]I
By t h e d i s c u s s i o n above.
To o b t a i n t h e r e a l s IR, w e t a k e t h e q u o t i e n t of CS by t h e equivalence r e l a t i o n r
-
s i f f vn.lrn-snl
<
1 p-3 '
(This c h o i c e of d e f i n i t i o n g i v e s one p l e n t y of "elbow room".) Proposition 9.6.
The space IR of r e a l s i n
e f f e c t i v e o b j e c t (IR ,=)
Eff
is the s t r i c t l y
where
IR = t h e r e c u r s i v e r e a l s ( t h a t i s r e a l s w i t h r e c u r s i v e Cauchy sequences converging t o them) and
Ux
E
IR ]I = t h e s e t of i n d i c e s f o r Cauchy sequences converging t o x.
Proof:
As b e f o r e
- defines a
i s by t h e p r e s c r i p t i o n of
c l o s e d e q u i v a l e n c e r e l a t i o n s o this
(7.1)
(a).
W e have shown t h a t t h e r e a l s i n
Eff
a r e represented j u s t a s
t h e y are i n ( c o n s t r u c t i v e ) r e c u r s i v e a n a l y s i s .
Of c o u r s e , as t h e y
t o o a r e d e f i n e d i n t h e n e g a t i v e fragment, t h e o p e r a t i o n s of a d d i t i o n , m u l t i p l i c a t i o n and so f o r t h a r e what t h e y should b e .
To
do s e r i o u s a n a l y s i s however w e need t o c o n s i d e r f u n c t i o n s which w e
do i n t h e next few s e c t i o n s .
The effective topos
197
I t i s seldom e f f i c i e n t t o g r i n d t h i n g s o u t i n models f o r
Remark.
c o n s t r u c t i v e a n a l y s i s : where p o s s i b l e one should use t h e axiomatic p o i n t of view.
Consider f o r example t h e q u e s t i o n of t h e fundamental
theorem of a l g e b r a i n
Eff.
This theorem i s proved i n Bishop C19671.
One way of r e a d i n g B i s h o p ' s c o n s t r u c t i v e mathematics (though n o t t h e intended one!) i s t o r e g a r d it a s f o r m a l i z e d i n an i n t u i t i o n i s t i c type t h e o r y with e x t e n s i o n a l e q u a l i t y and u s i n g ( D C ) .
Hence i n view
of ( 9 . 2 ) t h e fundamental theorem of a l g e b r a i s t r u e i n
Eff
in other realizability toposes). t a t i o n of C i n
"al,
Eff d e r i v e d from
..., a n
( a s it i s
I n view of t h e obvious r e p r e s e n (9.6)
, and
the fact that
a r e t h e r o o t s of zn+an-lzn-l+.
..+ao = 0"
d e f i n e s a c l o s e d s u b o b j e c t ( i n C 2n) w e can i n t e r p r e t t h i s f a c t a s There i s an e f f e c t i v e p r o c e s s t a k i n g i n d i c e s f o r t h e
follows.
r e c u r s i v e complex c o e f f i c i e n t s of a monic polynomial of d e g r e e n over t h e r e c u r s i v e complex numbers t o i n d i c e s f o r t h e r e c u r s i v e roots.
I t is n o t t r i v i a l t h a t a r e c u r s i v e polynomial has r e c u r s i v e
r o o t s and any n a t u r a l proof would s e e m t o e s t a b l i s h t h e s t r o n g e r r e s u l t and a s such would have t h e (DC)
form
of an a b s t r a c t proof using
E f f e c t i v i t y and Church's T h e s i s .
510.
I t i s t i m e t o g i v e s u b s t a n c e t o t h e c l a i m made i n 17 t h a t W e f i r s t consider
o p e r a t i o n s on e f f e c t i v e o b j e c t s a r e " e f f e c t i v e " . t h e s p e c i a l c a s e of Church's T h e s i s . Lemma 10.1.
The space of maps from IN t o IN i n
Eff
is the s t r i c t l y
e f f e c t i v e o b j e c t ( I N r n ,=) where ININ
and Proof:
6a
E
= t h e r e c u r s i v e f u n c t i o n s from
ININ]
IN t o IN
= { e l e ( n ) = a ( n ) 1 , t h e s e t of i n d i c e s f o r a
This i s t h e p r e s c r i p t i o n i m p l i c i t i n (7.1) ( b )
Proposition 10.2.
,
.
"Church's T h e s i s " t h a t a l l f u n c t i o n s a r e r e c u r s i v e ,
J.M.E. HYLAND
198
mIN . 3 e . V n . 3 y ( T ( e , n , y ) ~ U ( y ) =
~ c Ei
Eff.
holds i n
CT i s X l e e n e ' s T - p r e d i c a t e
Proof: in
ci(n))
and U h i s o u t p u t f u n c t i o n . ]
I n view o f ( 3 . 3 ) e l e m e n t a r y r e c u r s i o n t h e o r y c a n be developed
Eff
as i n T r o e l s t r a E19731.
Eff
in
a(n))
So by
Vn. 3 y . ( T ( e , n , y ) A U ( y ) =
(8.4)
a g r e e s w i t h i t s meaning i n
Sets.
Then Xe.<e,<e,e>>
r e a l i z e s "Church's T h e s i s " . Remark.
Church's T h e s i s a s t r a d i t i o n a l l y f o r m u l a t e d i n H e y t i n g ' s
A r i t h m e t i c (see T r o e l s t r a C19731) i s a n amalgam o f o u r "Church's T h e s i s " and AC(IN ,IN). W e can hope t o g e n e r a l i z e ( 1 0 . 2 ) t o a l l e f f e c t i v e o b j e c t s i n
( 7 . 3 ) which s t a t e s t h a t t h e y can i n a c e r t a i n way be sub-
view of
numerated (by t h e codes f o r t h e i r e l e m e n t s ) . Lemma 10.3. in
Eff,
If
i s s t r i c t l y e f f e c t i v e and ( Y , = )
(Z,=)
t h e n t h e s p a c e of maps from (Y,=) t o ( Z , = )
s t r i c t l y e f f e c t i v e object (ZrY,=)
Eff
i s the
where
= t h e " r e c u r s i v e " maps from T Y t o Z
Zry
in
is a r b i t r a r y
( t h a t i s , t h e maps
with i n d i c e s ) , and
ci E
= {ele(n)
ZTy
E
Eci(y) f o r a l l n
E
Ey}, t h e set o f
i n d i c e s f o r a. Proof:
This i s t h e prescription i m p l i c i t i n (7.1) ( b ) .
Here t h e n i s a g e n e r a l i z a t i o n of Proposition 10.4.
L e t (Y,=) <-
(10.2). B >->
IN r e p r e s e n t t h e e f f e c t i v e
sY
o b j e c t (Y,=) as a q u o t i e n t of a c l o s e d s u b o b j e c t of I N , and l e t (X,=)
A >-->
<s
r e p r e s e n t (X,=) as a q u o t i e n t o f a c l o s e d
IN
X
s u b o b j e c t of I N .
Yci holds i n
E
Then a " g e n e r a l i z e d Church's T h e s i s "
YX.3e.Va
E
A . 3 z ( T ( e , a , a ) h a ( S X ( a ) ) = Sy(U(z)))
Eff.
(One can u s e f u l l y compare t h i s r e s u l t w i t h t h e t r e a t m e n t of t h e extended Church's T h e s i s i n T r o e l s t r a C19731.)
The effective topos Proof:
199
The c o n d i t i o n s g i v e n e n s u r e t h a t a ( S x ( a ) ) = Sy(U(z)) i n t e r -
p r e t s as a c l o s e d s u b o b j e c t . need B c l o s e d . )
(Note t h a t U(y)
E
B is implicit, so we
Since
3 z ( T ( e , a , z ) A a ( S X ( a ) )= Sy(U(z))) is equivalent t o
a ( S , ( a ) ) = Sy(U(z)),
3~.T(e,a,z)AVz.(T(e,a,z) -->
it a l s o i n t e r p r e t s a s a c l o s e d s u b o b j e c t . e from a n i n d e x f o r a . t a k i n g any a
E
I t remains t o d e t e r m i n e
The t o t a l c o n d i t i o n f o r Sx g i v e s a map
A t o an e l e m e n t o f E S X ( a ) :
a n i n d e x f o r a maps t h i s
t o E a S X ( a ) ; t h e c o n d i t i o n t h a t S y i s o n t o p r o v i d e s a map from t h i s t o some b
E
B with Sy(b) = a S x ( a ) .
e i s a n i n d e x f o r t h i s composite
which can c l e a r l y b e chosen e f f e c t i v e l y i n t h e i n d e x f o r a . I n p a r t i c u l a r , w e can see t h a t when e f f e c t i v e o b j e c t s a r e presented ( v i a p a r t i a l equivalence r e l a t i o n s ) a s closed quotients of c l o s e d s u b o b j e c t s o f I N , t h e n maps between them a r e e f f e c t i v e i n t h e i n d i c e s (and t h i s h o l d s i n
Eff).
This i s t y p i c a l l y t h e s i t u a t i o n
i n constructive recursive analysis. 111.
The e f f e c t i v e o p e r a t i o n s . I n t h i s s e c t i o n w e use ( 1 0 . 4 )
a s t h e i n d u c t i o n s t e p t o show
t h a t t h e s t a t e m e n t t h a t t h e f i n i t e t y p e s o v e r IN a r e t h e h e r e d i t a r i l y (extensional) e f f e c t i v e operations holds i n
Eff.
A s s u m e f o r n o t a t i o n a l p u r p o s e s a c o l l e c t i o n of type symbols g e n e r a t e d from 0 by x ( f o r p r o d u c t s ) and --> The f i n i t e t y p e s o v e r t h e n a t u r a l numbers d e f i n e d i n d u c t i v e l y by INo
( f o r function spaces).
( m u la
a t y p e symbol) a r e
= IN,
IN U X T
=
INu+= =
m'xm u 7'
(rnT )
El 0 .
The h e r e d i t a r i l y e f f e c t i v e o p e r a t i o n s ( H E O u l u a t y p e symbol)
(see Kreisel 119591 and T s o e l s t r a C19731) may be d e f i n e d by f i r s t d e f i n i n g a c o l l e c t i o n ( R u I a a t y p e symbol) of p a r t i a l e q u i v a l e n c e
JM.E. HYLAND
200 r e l a t i o n s i n d u c t i v e l y by nROm
iff
n = m,
nRaxTm
iff
r1 ( n )Raml ( m ) and r 2 ( n ) R T r 2(m)
eRa+.rf
i f f i f nRam t h e n e ( n )
, f (m) are
,
d e f i n e d and
e(n)RTf(m). W e can t h e n r e g a r d HEOa a s t h e e q u i v a l e n c e classes I N / R a .
I n view
o f t h e d i s c u s s i o n i n 9 7 , w e can e q u a l l y r e g a r d HEOa a s b u i l t up ( t o g e t h e r w i t h i n d i c e s f o r i t s e l e m e n t s ) from t h e n a t u r a l number
Eff,
object i n i n (10.3).
by t a k i n g t h e u s u a l p r o d u c t s and f u n c t i o n s p a c e s as
Thus i n
Eff
No
= (HEOaI=)where
Ex = t h e i n d i c e s f o r x,
and where nRam i f f n,m a r e i n d i c e s f o r t h e same x
E
HEOg.
Then w e
can r e g a r d HEOa as t h e g l o b a l s e c t i o n s o f t h e f i n i t e t y p e s o v e r JN in
Eff. These d e f i n i t i o n s a l l r e l a t i v i z e and o u r n e x t r e s u l t s t a t e s
that
Eff
"knows t h a t i t s f i n i t e t y p e s a r e t h e e f f e c t i v e o p e r a t i o n s " .
Theorem -11.1. For each a , INa
= HEOa h o l d s i n
Eff,
i n such a way
t h a t t h e p r o d u c t s and f u n c t i o n s p a c e s c o r r e s p o n d . Proof:
The R a t s are d e f i n e d by n e g a t i v e formulae, and so by 18.4)
interpret in
Eff
as c l o s e d p a r t i a l e q u i v a l e n c e r e l a t i o n s a g r e e i n g
w i t h t h e i r meaning i n
Sets.
I f we c a l c u l a t e the equivalence
c l a s s e s i n t h e obvious way u s i n g (7.1) ( d ) w e j u s t g e t (HEOg,=) t h a t i s INa
as i t ought.
in
Eff.
C l e a r l y t h e rest o f t h e s t r u c t u r e c o r r e s p o n d s
( I f t h i s i s t o o a b s t r a c t , t h e r e a d e r can use a
laborious induction, with (10.4)
d e a l i n g w i t h t h e main i n d u c t i o n
step.) Remark.
Something q u i t e deep i s going on behind (11.1) which i s
connected w i t h i t e r a t i o n s of t h e e f f e c t i v e t o p o s c o n s t r u c t i o n a: s t u d i e d i n B i t t s C19811.
I t i s i n connection w i t h t h e e f f e c t i v e
o b j e c t s t h a t w e can g e t a g e n e r a l e x p r e s s i o n of t h e idempotency o f
20 1
The effective topos of r e a l i z a b i l i t y (see T r o e l s t r a (1973) 3 . 2 . 1 6 ) . Sequential continuity.
512.
From ( 8 . 2 ) , ( 9 . 2 ) , ( 1 0 . 4 ) and t h e d i s c u s s i o n i n 19, it s h o u l d be clear t h a t analysis i n
Eff i s
j u s t constructive recursive analysis.
So w e have t h e u s u a l c o n t i n u i t y r e s u l t s which are v e r s i o n s of t h e
Kreisel-Lacombe-Shoenfield theorem. Theorem 1 2 . 1 .
"Brouwer's Theorem" t h a t e v e r y map from IR t o IR i s
Eff.
continuous h o l d s i n
The r e a d e r w i l l have t o do t h i s h i m s e l f
Proof:
(along t h e l i n e s of
below) o r e l s e f i n d ( a s I have f a i l e d t o do) a r e a d a b l e
(12.4)
account from t h e Russian s c h o o l . ( 1 2 . 1 ) i s o n l y moderately s p e c t a c u l a r .
Recursive maps on t h e
r e c u r s i v e r e a l s , w h i l e n o t t h e r e s t r i c t i o n of c o n t i n u o u s f u n c t i o n s on t h e ( c l a s s i c a l ) reals (see ( 1 3 . 4 ) ) , domain.
are c o n t i n u o u s
on t h e i r
( T h i s i s s t a t e d as E x e r c i s e 15.35 i n Rogers 119671.)
w e j u s t need e f f e c t i v i t y t o g e t ( 1 2 . 1 ) .
So
By p a s s i n g t o h i g h e r t y p e s
w e g e t a more i n t e r e s t i n g phenomenon: we g e t e f f e c t i v e maps, which are n o t c o n t i n u o u s on t h e i r e f f e c t i v e domain, b u t which a r e s t i l l continuous from t h e p o i n t of view o f
Eff.
W e consider t h e h e r e d i t a r i l y e f f e c t i v e operations.
in
Eff
t h e s e are j u s t t h e f i n i t e t y p e s .
By (11.1),
(The r e a d e r w i l l see t h a t
much of t h e material can be developed f o r an a r b i t r a r y " t y p e s t r u c t u r e " over IN .)
W e d e f i n e a n o t i o n of sequence c w v e r g e n c e on
each HEOu i n d u c t i v e l y a s f o l l o w s : on HEOO
= IN,
xn ->
x i f f 3k,Vn 2 k.xn = x;
on HEOuxT = HEOuxHEOT, ), on H E O ~ + ~( H= E O ~HE'
W e say t h a t a function f
sequence convergence.
(xn,yn) ->
,f n->f E
( x , y ) i f f xn - > x a n d
i f f xn->x
i m p l i e s f n (xn)->f
yn-->y; (x)
HEOO+T i s c o n t i n u o u s i f f f p r e s e r v e s
.
JM.E. HYLAND
202 Remark.
The meaning o f t h e s e d e f i n i t i o n s i n
t h e meaning i n
Eff
does
not
agree with
Sets.
L e t us i n i t i a l l y r e s t r i c t a t t e n t i o n t o t h e h e r e d i t a r i l y e f f e c -
t i v e o p e r a t i o n s o f p u r e t y p e (HEOklk a p u r e t y p e symbol) where e a c h k + l d e n o t e s (k ->
For f n , f i n HEOk+l,
0).
i s a modulus f o r f n --> Vx
E
f
HEOk.Vn
p(x).fn(x) = f (x).
2
Eff.) x.
L e t xn -->
for a l l n
t
t h i s is f a l s e i n
A s s u m e f u n c t i o n s i n HEOk+l
I f 1.1 i s a modulus f o r f n -> Proof:
f i n HEOk+l:
Eff.)
S e t s , though t r u e i n (In
HEOk+l
E
iff
( W e do n o t assume h e r e t h a t f n -->
Lemma 1 2 . 2 .
we say t h a t p
f i n HEOk+l,
axe continuous.
t h e n f n ->
f.
S i n c e 1.1 i s c o n t i n u o u s , t h e r e i s a k s u c h t h a t
k , p ( x n ) = ~ ( x =) k '
k" s u c h t h a t f o r a l l n
k',
L
say.
f (x,)
A s f i s c o n t i n u o u s t h e r e is
= f (x)
.
Then f o r a l l
n 2 max(k,k',k"), f n (xn) = f ( x n ) = f ( x ) . Remark.
T h i s argument i s e n t i r e l y e l e m e n t a r y and h a s u s e f u l
application t o a v a r i e t y of type s t r u c t u r e s i n a v a r i e t y of toposes. Lemma 12.3.
I f f n -> Proof:
(In
Eff.)
A s s u m e a l l f u n c t i o n s i n HEOk a r e c o n t i n u o u s . t h e n t h e r e i s a modulus 1.1 f o x f n -->
f i n HEOk+l,
The s e q u e n c e w i t h c o n s t a n t v a l u e x c o n v e r g e s t o x i n HEOk,
so w e c a n deduce f n ( x ) ->
f (x), t h a t i s
Vx3kVm 2 k f m ( x ) = f ( x )
.
By b a s i c a r i t h m e t i c c h o o s e k minimal f o r e a c h x . f u n c t i o n p : HEOk -> Remark.
f.
This gives us a
IN which by (11.1) o r ( 1 0 . 4 ) i s i n HEOk+l.
T h i s argument depends on e f f e c t i v i t y i n
Eff.
Again t h e r e
a r e many u s e f u l v e r s i o n s o f i t . Lemma 1 2 . 4 .
F
E
HEOk+2,
(In
Eff.)
I f p i s a modulus f o r f n -->
t h e n t h e r e i s an r such t h a t Vn t r F ( f n ) = F ( f ) .
f i n HEOk+l
and
203
The effective top-
Proof:
f o r f n l p r f , F r e s p e c t i v e l y w e wish
From i n d i c e s bn,m,b,c
t o f i n d an r s u c h t h a t Vn
t
r. F ( f n ) = F ( f ) .
F o l l o w i n g Gandy, use
t h e second r e c u r s i o n theorem t o d e f i n e an i n d e x b ' by, b ( a ) i f m ( a ) < l e a s t y.y shows c ( b ) = c ( b ' ) C =yo s a y ] , b'(a) =
{
bn(a) for n least
t
yo w i t h c ( b n ) # c ( b ) , o t h e r w i s e .
l y shows c ( b ) = c ( b ' ) i f f T ( c , b , ~ l ( y ) ) A T ( c , b ' , ~ ~ ( y ) ) ~ U ( ~ l=( y ) ) U(T2
(Y) )
.I
W e see e a s i l y t h a t yo e x i s t s and t h a t Vn t y o . c ( b n ) = c ( b ) ( u s i n g
Markov's p r i n c i p l e ) . Remark.
Thus yo i s c l e a r l y what w e want.
T h i s e s s e n t i a l l y i s Gandy's p r o o f of t h e Kreisel-lacombe-
S h o e n f i e l d theorem. modulus f o r f n ->
S i n c e b o t h Vn
k F ( f n ) = F ( f ) and p i s a
t
f a r e interpreted a s closed subobjects i n
it makes n o d i f f e r e n c e w h e t h e r w e do ( 1 2 . 4 )
internally in
Eff.
Theorem 1 2 . 5 .
( i )I n
f n ->
f i n HEOr+l
Eff
i f f t h e r e i s a modulus p f o r f n ->
( i i )I n
Proof:
Eff
Sets o r
it h o l d s f o r a l l p u r e t y p e s r + l t h a t
and t h a t a l l m e m b e r s of HEOr+l
members of HEOa+T
externally i n
Eff,
f i n HEOr+l,
are c o n t i n u o u s .
i t h o l d s f o r any t y p e s a , ~ , t h a t a l l
a r e continuous.
( i )f o l l o w s by i n d u c t i o n u s i n g ( 1 2 . 2 ) , ( 1 2 . 3 ) and ( 1 2 . 4 ) .
( i i ) f o l l o w s by e x t e n s i o n u s i n g C a r t e s i a n c l o s e d n e s s o f t h e h e r e -
d i t a r i l y e f f e c t i v e o p e r a t i o n s and o f t h e c o n t i n u o u s f u n c t i o n a l s ( i n t h e s e q u e n t i a l v e r s i o n , see
Hyland C1979 1 ) i
The r e a d e r s h o u l d compare ( 1 2 . 5 ) w i t h t h e example of Gandy (see Gandy-Hyland C19771 o f a t y p e 3 e f f e c t i v e o p e r a t i o n n o t con-
t i n u o u s on t h e t y p e 2 e f f e c t i v e o p e r a t i o n s ) . C o n t i n u i t y h a s a q u i t e d i f f e r e n t meaning i n t e r n a l l y i n Remark.
Eff.
The f i n i t e t y p e s o v e r R i n
hereditarily effective operations i n t i a l l y continuous f u n c t i o n a l s i n
Eff
coincide not only with t h e
E f f , b u t a l s o w i t h t h e sequen-
Eff.
The u s e o f t h e modulus was
i n t r o d u c e d o r i g i n a l l y i n t h e c o n t e x t of r e c u r s i o n t h e o r y on t h e
J.M.E. HYLAND
204
( s e q u e n t i a l l y ) c o n t i n u o u s f u n c t i o n a l s by S t a n Wainer. 513.
F a i l u r e of compactness. A s i s w e l l known, t h e r e a r e d e c i d a b l e s u b s e t s R o f 2'B,
the
s e t o f f i n i t e b i n a r y sequences such t h a t ( i ) any r e c u r s i v e a (ii)t h e r e are a S
E
E
2B
2 R w i l l s a t i s f y (i)).
e x t e n d s some u
2m
which e x t e n d no u
R,
E E
R ( s o t h a t no f i n i t e
T h i s h a s a n immediate consequence f o r
Eff. P r o p o s i t i o n 13.1.
In
Eff
t h e r e i s a d e c i d a b l e s u b o b j e c t R of 2
B
such t h a t ( i ) any a e x t e n d s some u
R,
E
( i i ) f o r any k , t h e r e i s an a which e x t e n d s no u
length
6
Thus i n
E
R of
k.
Eff
t h e r e i s a d e c i d a b l e cover of 2 N , Cantor s p a c e , by
b a s i c clopen s e t s , w i t h no f i n i t e subcover. EITHER ( i ) and ( i i ) a r e almost n e g a t i v e and h o l d i n
Proof:
sets of
the recursive r e a l s , OR immediate from Church's T h e s i s .
Corollary 13.2. F: 2m-> Proof:
I n Eff t h e r e i s a c o n t i n u o u s b u t unbounded f u n c t i o n
IN.
Set F(a)
=
l e a s t l e n g t h of u
E
R with a extending u.
(13.1) shows t h a t t h e Fan Theorem f a i l s a s b a d l y as p o s s i b l e i n
Eff.
T h i s i s why w e g e t (13.2)
.
There a r e Grothendieck t o p o s e s i n
which (13.1) h o l d s w i t h o u t t h e s t i p u l a t i o n t h a t R i s d e c i d a b l e . t h e known e x a n p l e s , a l l c o n t i n u o u s f u n c t i o n s from 2 m uniformly c o n t i n u o u s and so bounded.
In
t o JN are
I t i s n o t known whether t h e r e
are Grothendieck t o p o s e s i n which (13.1) h o l d s . The t r a d i t i o n a l way t o o b t a i n r e s u l t s analogous t o (13.1) and (13.2) f o r t h e reals i s t o use " s i n g u l a r c o v e r i n g s " a s s t u d i e d i n Zaslavskii-Ceitin
C19621.
(Of c o u r s e one c a n s e t up (13.1) and
(13.2) i n a n analogous f a s h i o n . )
The effective topos
P r o p o s i t i o n 13.3.
In
Eff,
205
t h e r e i s a sequence of r a t i o n a l i n t e r -
v a l s c o v e r i n g JR, b u t of a r b i t r a r i l y s m a l l measure. E s s e n t i a l l y a d i a g o n a l enumeration, see Z a s l a v s k i i - C e i t i n
Proof: C19621.
The proof i s a l s o s k e t c h e d i n Rogers C19671 E x e r c i s e s
15.36, w i t h o u t c o n s i d e r a t i o n s of e f f e c t i v i t y .
By t h e c o n d i t i o n s , t o
be s a t i s f i e d by t h e sequence o f r a t i o n a l i n t e r v a l s , can be e x p r e s s e d a s almost n e g a t i v e formulae, so by ( 8 . 4 ) t h i s does n o t matter. C o r o l l a r y 13.4.
Eff
In
t h e r e i s a c o n t i n u o u s f u n c t i o n from IR t o IR
which i s unbounded on some c l o s e d bounded i n t e r v a l , and so i n p a r t i c u l a r i s n o t uniformly c o n t i n u o u s on some c l o s e d bounded i n t e r v a l Proof:
Same r e f e r e n c e s a s f o r ( 1 3 . 3 ) .
Remark.
The r e s u l t s o f t h i s s e c t i o n can a l l be regarded a s proved
internally i n
Eff,
t h a t i s , t h e y f o l l o w from t h e e f f e c t i v i t y w e
e s t a b l i s h e d i n 510. Though w e know Grothendieck t o p o s e s i n which Il? f a i l s t o be l o c a l l y compact (Fourman-Hyland C19791), i n a l l known examples, t h e t y p i c a l consequences of l o c a l compactness f o r a n a l y s i s s t i l l h o l d . C e r t a i n l y c o n t i n u o u s f u n c t i o n s on bounded c l o s e d i n t e r v a l s are uniformly c o n t i n u o u s .
So t h e e f f e c t i v e t o p o s opens up p o s s i b i l i t i e s
unknown amongst Grothendieck t o p o s e s . found i n Z a s l a v s k i y - C e l t i n 814.
F u r t h e r examples can be
C19621.
Q u o t i e n t s o f c l a s s i c a l o b j e c t s , and power o b j e c t s . I t i s a f a m i l i a r f e a t u r e o f i n t u i t i o n i s t i c mathematics t h a t
c o l l e c t i o n s o f s e t s ( s p e c i e s ) can appear f a r more amorphous t h a n c o l l e c t i o n s of f u n c t i o n s .
W e have s e e n i n
Eff
t h a t t h e o b j e c t of
f u n c t i o n s between " w e l l - b e h a v e d " . o b j e c t s i s i t s e l f "well-behaved'' (16.3) and ( 7 . 1 ) ( b ) )
.
W e have s e e n t h i s good behaviour i n o t h e r
c o n t e x t s (Moschovakis C19731, S c o t t C19701, are t h e e a r l y r e f e r e n c e s ) , and it c a n be made t h e b a s i s f o r n i c e p r o o f - t h e o r e t i c r e s u l t s . However, when t h e s u b o b j e c t c l a s s i f i e r i s i t s e l f c o m p l i c a t e d , t h e
J.M.E. HYLAND
206
power s e t of however simple a ( t o some e x t e n t i n h a b i t e d ) o b j e c t w i l l I t i s t i m e t o look a t such o b j e c t s i n
be complex.
Eff. R i n Eff can be
A s w e mentioned i n 13, t h e s u b o b j e c t c l a s s i f i e r
t a k e n a s (Z,<-->) where <--> C = P(W).
i s t h e r e a l i z a b i l i t y bi-implication
on
W e may and so do t h i n k of t h e members o f C a s e x i s t i n g
"globally".
This w i l l
C l e a r l y t h e n (Z,<-->) i s a q u o t i e n t of A C .
Eff
mean t h a t w e can o b t a i n maps t o R i n
from s u i t a b l e maps t o C i n
Sets. Lemma 1 4 . 1 .
Suppose AY -->
-
f : X -->
Y i n d u c e s a map f :
( Y , = )i s a s u r j e c t i o n . (Y,=) i n
-->
(X,=)
such t h a t
J
4
-
(X,=)
Eff
Then a map
>
(Y,=)
commutes
f
f ( x ) = f ( x ' ) is valid.
i f f x = x ' -->
-
Under t h e s e c i r c u m s t a n c e s f i s r e p r e s e n t e d by
equality relation.)
t h e f u n c t i o n a l r e l a t i o n EXA [ I f ( x ) Proof:
(That i s , i f f f p r e s e r v e s t h e
=
y
1
.
By a r o u t i n e use of l o g i c .
I n t h e c a s e of t h e s u r j e c t i o n A C -->
R , e v e r y map a r i s e s a s i n
(14.1).
Proposition 1 4 . 2 .
Any map from (X,=) t o R
a s defined i n ( 1 4 . 1 ) ( i )x = x ' ->
and
(ii)f ( x )
-->
f o r an f : X --> ( f ( x ) <-->
=
(Z,<-->)
in Eff i s
Z such t h a t both
f(x'))
Ex
are valid. Remark.
Given f : X ->
g: X -->
Z with both
g ( x ) = ExAf ( x ) Proof:
C with
( i )v a l i d , one can e a s i l y d e f i n e
( i )and (ii)v a l i d , and such t h a t
z
=
s.
Set
.
S i n c e maps from (X,=) t o R a r e i n b i j e c t i v e correspondence
with maps 1 -->
P(X,=)), ( 1 4 . 2 ) i s immediate from t h e d e s c r i p t i o n
of t h e power s e t i n ( 2 . 1 2 ) o f H J P C19801.
A r e a d e r who f i n d s t h a t
The effective topos
207
proof u n p a l a t a b l e , can t a k e a r e p r e s e n t a t i v e G ( x , p ) f o r a map ( X , = ) t o f2, s e t f ( x ) = 1 v q . ( v p ( G ( x , p )hp --> G ( x , p ) <-->
q ) ->
p) is valid:
Exh ( f ( x ) <-->
q ]I
,
since (i)i s v a l i d f o r f , the
remark above a p p l i e s t o g i v e (ii) f o r g ( x ) = Exhf ( x ) r e l a t i v i z e d , t h i s i s a proof of From ( 1 4 . 2 ) w e see t h a t i f
within
.
(Suitably
( 2 . 1 2 ) of HJP L19801.)
i s s e p a r a t e d t h e n any map
(X,=)
t o R f a c t o r s through q : A X -->
(X,=)
and check t h a t
Our n e x t r e s u l t g i v e s t h i s
R.
Eff.
P r o p o s i t i o n 14.3.
The map q ( ' ' = ) :
f o r any s e p a r a t e d (X,=) i n Proof:
Eff.
From ( 6 . 3 ) w e see t h a t AZ"")
A ( Z rx)
Then q ( x ' ' ) : H(f,R)
P((X,=))
-->
ERhn{R(x) <->
=
is a surjection
R (',=)
-->
AC(xr=)
i s (isomorphic t o ) A ( Z r X ) .
i s r e p r e s e n t e d by
E x A f ( [ x l ) Ix
But w e can t a k e I'X 5 X (assuming ( X , = )
E
XI.
c a n o n i c a l l y s e p a r a t e d ) and so
by s e t t i n g f t o b e t h e r e s t r i c t i o n of R t o I ' X , we see a t once t h a t 3f .H(f , R )
ER -->
i s v a l i d , s o t h a t [HI i s s u r j e c t i v e .
§15.
The Uniformity P r i n c i p l e . F i r s t a general uniformity principle f o r
P r o p o s i t i o n 15.1.
L e t AX ->
an e f f e c t i v e o b j e c t . VtJlVX
holds i n Proof: (X,=)
be a s u r j e c t i o n and l e t ( Y , = )
be
Then
( X , = ) .3y
E
(X,=)
Eff.
E
( Y , = ) $ J ( x , y )-->
3y
E
(Y,=) .vx
E
(X,=)$J(x,y)l
Eff. Take (Y,=) s t r i c t e f f e c t i v e and c o n s i d e r f i r s t t h e c a s e when Let e
i s AX.
b = vl(e(0)) t i v e ; and c
=
E
E
[Vx.i'y.$J(x,y)
Ey f o r some y i n Y ,
v2(e(0)) is in
1
.
Then 0
E
Ex each x i n X ,
unique as ( Y , = )
1$(x,y) 1
.
is s t r i c t effec-
B u t t h e n i f d = Xn.c, w e
f i n d t h a t h e . < b , d > r e a l i z e s t h e formula i n s q u a r e b r a c k e t s .
i s no dependence on E + . )
(There
The r e s u l t f o r a q u o t i e n t of AX is an
immediate consequence of t h e s p e c i a l case.
so
J.M.E. HYLAND
208
W e have an immediate c o r o l l a r y .
C o r o l l a r y 15.2.
The "Uniformity P r i n c i p l e "
\d$"dX E P ( I N ) .3n
IN $ (X,n) -->
3n
E
IN .VX
E
P(IN ) $ ( x , n I l
Eff.
holds i n Proof:
E
i s an e f f e c t i v e o b j e c t and by (14.3) P ( R ) i s a q u o t i e n t
IN
of A ( Z m ) . The u n i f o r m i t y p r i n c i p l e i s an extreme form o f c h o i c e p r i n c i p l e : t h e c h o i c e f u n c t i o n i s c o n s t a n t because t h e domain i s amorphous w h i l e t h e range i s well-behaved. domain a r e n e c e s s a r y . from IN t o N .
C o n d i t i o n s on both t h e range and t h e
Obviously t h e r e are non-constant f u n c t i o n s
As r e g a r d s c o n d i t i o n s on t h e r a n g e , t h e r e a d e r may
l i k e t o show t h a t t h e q u o t i e n t map from A E t o 62 does n o t s p l i t . 916.
j-operators:
I n a topos, j-operators P
5
A2 t o be i s o .
f o r c i n g 2 -->
j(p)
a r e maps j : 62 -->
o r equivalently
p -->
j(phq) = j ( p ) h j ( q )
q i j ( p ) -->
j(j(p))
j(p).
5
c o u r s e t h e r e i s a l s o an i n t e r n a l o b j e c t o f j - o p e r a t o r s , n
of 62"
Eff
which w e can d e s c r i b e i n
P r o p o s i t i o n 1 6 . 1 . ( i )The o b j e c t '26
j(q)
5 j ( T )
T
j ( j( p ) ) = j ( p ) Of
62 s a t i s f y i n g
a subobject
as f o l l o w s . in
Eff
can be t a k e n as ( E x , = )
where Bf =
n
=
t v p . f ( p ) <-->
gip) 1
(ii)The o b j e c t o f j - o p e r a t o r s
of
in
Eff i s
t h e subobject
r e p r e s e n t e d by t h e c a n o n i c a l monic d e € i n e d by e i t h e r o f t h e
(Ex,=)
above ways of g i v i n g t h e n o t i o n of j - o p e r a t o r .
Alternatively it is
(J,=) where J i s t h e set of j - o p e r a t o r s and where
t j = k l with Ej = Proof:
= E j h [ V p . j ( p ) <-->
I[j i s a j - o p e r a t o r
]I
( i ) f o l l o w s from ( 1 4 . 2 )
t h e n immediate.
k(p)J
. i n t h e manner o f (14.3) and (.ii)i s
The effective topos
209
Remark. A s e x p l a i n e d i n J o h n s t o n e [ 1 9 7 7 ] j - o p e r a t o r s correspond t o t o p o l o g i e s and s o t o s u b t o p o s e s . j-operators
under p o i n t w i s e
(internally).
I t i s known t h a t t h e l a t t i c e of
i s a complete Heyting a l g e b r a
2
The r e a d e r s h o u l d r e f e r t o Fourman-Scott [ 1 9 7 9 ]
I t i s perhaps worth commenting
an e x p l i c i t c o n s t r u c t i v e t r e a t m e n t . f u r t h e r on t h e o r d e r r e l a t i o n . B j
6
kj
W e have
= EjAEkA
n Vp.j(p)
defining t h e appropriate subobject i n external j-operators,
then j
k(p)J
-->
Eff.
I f w e are l o o k i n g a t
k iff
6
k(p)
Vp.j ( p ) --> is valid.
for
F i n a l l y n o t e t h a t i f j ( i ) i s non-empty
d e g e n e r a t e topology which c o l l a p s e s t h e t o p o s
then j is t h e
.
L e t us look a g a i n a t t h e double n e g a t i o n topology.
( W e do n o t
bother with a c o n s t r u c t i v e v e r s i o n . ) ( 7 7 ) p = U I T i~ s ~ non-empty)
=
{I:
i f p non-empty,
C l e a r l y then w e have t h e f o l l o w i n g lemma. Lemma 1 6 . 2 . empty
For any j ,
(-,-,)
5
j i f f n { j ( p ) / p non-empty}
.
Proof:
Trivial.
W e now c o n s i d e r how t o f o r c e monics t o be i s o .
of
i s non-
L e t a subobject
(X,=) be given by a c a n o n i c a l monic A and d e f i n e a map R t o @
A
(p) =
C l e a r l y i f j f o r c e s A >-->
-->
p
n .
(X,=) t o be i s o , t h e n
@ A ((jp ) ) --> is valid.
(x,=). A ( X )
112x
by
j (p)
This g i v e s us a way t o d e s c r i b e t h e l e a s t j - o p e r a t o r
f o r c i n g A >-->
( X I = ) t o be i s o .
Proposition 16.3. f o r c i n g A >->
I n t h e above s i t u a t i o n , j A , t h e l e a s t j - o p e r a t o r
(X,=) t o be i s o , i s jA(p) =
Uvq. CC@,q ->
q ) h ( p -->
q ) -->
q) l
.
J.M.E. HYLAND
210
Proof:
Obvious, a s i n t h e l o g i c t h i s s a y s l A ( P ) = A {Sl@,q
a.
where A i s t a k e n i n t e r n a l l y i n (
(9A ( p ) ->
9) s
->
qAp
5
5
ql
I t i s e a s y t o check t h a t ( a s
@ , ( q ) ) i s v a l i d ) j,
W e now show t h a t f o r c i n g 2 >->
is a j-operator.
A2 t o be is0 c o l l a p s e s
Eff
to
Sets. The l e a s t j - o p e r a t o r f o r c i n g 2 >->
Proposition 16.4. is (
A2 t o b e is0
17).
Proof:
L e t j be t h e l e a s t j - o p e r a t o r
i n ( 1 6 . 3 ) from @ :
->
@ ( p )=
u
{01+p
a.
nI j I n 1 ) In
1
E
VP,q. ( p ->
Il1-t~
= Iele(0)
( 7 7 )
i s non-empty:
E
p o r e(1)
E
PI.
s j , t h a t i s by ( 1 6 . 2 )
i s non-empty.
I n f a c t it i s enough t o show t h a t
for i f a is i n
( j ( p ) -->
q ) ->
A2, o b t a i n e d a s
Here
C l e a r l y i t s u f f i c e s t o show n { j ( p ) Ip non-empty]
f o r c i n g 2 >->
j (9)
and x i s i n n { j { n I ) In
N
E
1,
t h e n ( a ( X n . n ) ) x i s i n n { j ( p ) lp non-empty].
,
c in
Now t a k e b i n
1 V p . p ->
t a k e as 2 >->
A2 i s j - d e n s e d i n j ( { O } ) n j ( { l l ) . Note t h a t
e
=
Xx.c( ( a x ) d ) i s i n
j(p)]
l[Vp.@( j ( p ) ) ->
" d p . j ( j ( p ) ) -->
.
j ( p )1
j(p)J
,
and
Define u s i n g t h e
s e c o n d r e c u r s i o n theorem an i n d e x f by (fk) (0)
=
b(k)
1 ( f k ) (1) = U ( l e a s t y . T ( e , S l ( f , k + l ) , y ) ) . Now by a s t a n d a r d k i n d o f argument, w e c a n show t h a t 1 Sl(f,k) (0) = (fk) (0) = b(k)
and
E
j(Ik1)
S1 l ( f , k ) (1) = ( f k ) (1) = e ( S1 l(f,k+l))
1 a r e a l l d e f i n e d , and t h e n w e see t h a t S l ( f , O ) i s i n @ ( j ( { n I ) )f o r 1 a l l n and so e ( S l ( f , O ) ) i s i n n { j ( { n } ) In E m l as r e q u i r e d .
517.
j - o p e r a t o r s and d e c i d a b i l i t y . (16.4)
appears t o restrict t h e j-operators i n
w e c a n show t h a t t h e y have a r i c h s t r u c t u r e .
Eff,
but i n fact
A p p a r e n t l y it w a s
21 1
The effective topos
Powell who f i r s t r e a l i z e d t h a t t h e r e i s a c o n n e c t i o n between n o t i o n s of d e g r e e and t h e f o r c i n g of d e c i d a b i l i t y i n r e c u r s i v e r e a l i z a b i l i t y .
W e c o n t e n t o u r s e l v e s w i t h a p r e c i s e s t a t e m e n t and a s k e t c h of a proof. F i r s t w e g i v e a lemma o f Andy P i t t s which s i m p l i f i e s t h e p r e -
s e n t a t i o n of t h e p r o o f . I n t h e s i t u a t i o n of (16.3) j, can a l t e r n a t i v e l y be de-
Lemma 1 7 . 1 .
f i n e d by @,*(p)
*
where
=
I p ~ { * l5 q and 0,Cq)
n{q 5
5 qlr
i s an i n d e x f o r t h e empty p a r t i a l f u n c t i o n , so l o n g as Ex
non-empty i m p l i e s A(x) non-empty. Proof: sion.
L e t us d r o p t h e s u b s c r i p t
A.
Note t h a t $ p r e s e r v e s i n c l u -
Hence because P -->
(PA{*))
5
$ ( P ) -->
@(PA{*))
i s v a l i d , w e can deduce t h a t @(P)5 @*(P) is v a l i d .
Also w e have
@ ( @ * ( P )5) n { @ ( q )IpAI*l 5 q and @ ( q ) 5 ql
-c n{qjpAt*} 5 q
and @ ( q )5 q l = @ * ( P I ,
so t h a t
@ ( $ * ( P ) )5 @ * ( P )
is v a l i d , r a t h e r t r i v i a l l y .
w e have j s
@ *i n Eff,
and i t remains t o show t h a t $ * s j .
W e can t a k e a
E
[ V p , p ->
w e can t a k e b
E
UVx
E
Thus by t h e d e f i n i t i o n of j i n ( 1 6 . 3 )
j (p)J
and s i n c e @ Cj Cp))
(X,=). ( A ( x ) ->
j C p ) ) -->
S
j (p) i n
jCp) 1
.
Eff,
NOW
d e f i n e an i n d e x e by t h e second r e c u r s i o n theorem a s f o l l o w s . a ( n ) , i f x = -a,*> e ( x ) = ' b ( m ) ) (Xy.e(z(y))), i f x = <m,z>, z Cons i de r f o r any p , t h e s e t SCp) = I x l e ( x ) t h a t ( i )PAC*) 2 S ( P ) , and (ii)$ ( S ( P ) ) 5 S ( P ) ,
E
j(p)}.
# *. W e see e a s i l y
J.M.E. HYLAND
212
s o w e can deduce t h a t $ * ( p ) 5 S ( p )
.
Thus c l e a r l y e r e a l i z e s
Vp.@*(p) 5 j ( p ) , and t h i s completes t h e p r o o f . Now f o r A 5 I N , l e t DA ( n ) = { < O , n > l n E A } u { < l , n > l n
4
A} s o t h a t
DA r e p r e s e n t s c a n o n i c a l l y t h e s u b o b j e c t AV
We write
t h e " d e c i d a b i l i t y of A " . $,(PI
m,
A >->
i
U3n
=
E
IN .DA(n) -->
n ,
p
t h a t is, the l e a s t
and kA f o r t h e l e a s t j - o p e r a t o r g e n e r a t e d by $,, j - o p e r a t o r f o r c i n g A t o be d e c i d a b l e . $A* i n
By ( 1 7 . 1 ) k A i s e q u a l t o
Eff.
Theorem 1 7 . 2 .
(External v e r s i o n ) .
kA 5 kB i n
Eff
i f f A i s Turing
r e d u c i b l e t o B. Proof:
Note f i r s t t h a t kA
(holds i n
Eff).
Suppose t h a t e ( n )
5
kg i n
Eff i f f Vn.$,*(DA(n)) is v a l i d
*
E
JIB ( D A ( n ) ) f o r each n.
W e wish t o show how t o
compute A from B , t h a t i s how t o determine DA(n) from a knowledge of DB ( m ) f o r f i n i t e l y many m.
Let x = e(n)
*
E
Q B (DA(n); t h e n
e i t h e r x i s of form < y , * > and w e e a s i l y see t h a t y must be DA(n) so
w e a r e home,
or x
i s of form < m , e l >
s a y i n which c a s e e l
so w e t a k e x1 t o be e l ( < O , m > ) x1
E
E
D B ( m ) -->
$B* (DA(n))
o r e l ( < l , m > ) a s appropriate,
JIB* ( D A ( n ) , ) and r e p e a t t h i s p r o c e s s .
From t h e d e f i n i t i o n of
qB*, t h i s t e r m i n a t e s i n a f i n i t e number of s t e p s g i v i n g DA(n) a s required. Suppose c o n v e r s e l y t h a t A i s Turing r e d u c i b l e t o B v i a an i n d e x f . Define using t h e second r e c u r s i o n theorem e Cn,y) where y i s ( a code f o r ) a f i n i t e set of numbers of form <m,O> o r < m , l > as f o l l o w s . < k , * > , i f t h e r e i s a computation { f } Y ( n ) ( u s i n g only i n f o r m a t i o n i n y ) , e(nfy) =
1 i
<m,q>,
=
k
i f t h e computation { f l Y ( n ) a s k s f o r a v a l u e n o t i n y f and g i s an i n d e x for < m , i > -> e(n,yuI<m,i>l).
213
The effective topos I t i s e a s y t o see t h a t f o r a l l n , and f o r y i n f o r m a t i o n t r u e of B,
I n p a r t i c u l a r f o r y t h e empty
e ( n , y ) i s d e f i n e d and i n @,*(D,(n)).
set, w e have f o r a l l n , e (n,y) i n
@*,
(DA(n))
.
Thus Vn.QB* ( D A ( n ) ) i s v a l i d . This completes t h e p r o o f . Remark. I n f a c t t h e r e i s a proof of t h e i m p l i c a t i o n from r i g h t t o l e f t along t h e following l i n e s : i f j f o r c e s B decidable, then the s t a t e m e n t t h a t A i s r e d u c i b l e t o B and t h a t t h e computation i s always d e f i n e d , a r e almost n e g a t i v e f o r E f f . and so h o l d i n E f f . . hence i n -1 I -1 ' E f f . A i s decidable, t h a t is j f o r c e s A decidable. -1 W e cannot f i n d a crude i n t e r n a l v e r s i o n of ( 1 7 . 2 ) i n view of Goodman C19781.
However t h e proof of
g e t something o u t of i t .
( 1 7 . 2 ) is e f f e c t i v e , so w e can
C l e a r l y t h e f u n c t i o n which a s s o c i a t e s kA
with A i s i n t e r n a l l y d e f i n e d i n
Eff.
W e must s a y what w e mean by
"A Turing r e d u c i b l e t o B": w e mean t h e n a t u r a l n o t i o n of c o m p u t a b i l i t y
r e l a t i v e t o ( p a r t i a l ) c h a r a c t e r i s t i c functions.
W e obtain a result
by r e s t r i c t i n g a t t e n t i o n t o c l o s e d subsets of I N , t h a t i s t o P ( I N ) = {A 5 IN IVn. 9 - n
P r o p o s i t i o n 17.3. VA,B
holds i n Proof: 118.
E
B
n
A -->
E
A].
The s t a t e m e n t
F(IN).
(A Turing r e d u c i b l e t o B ) <-->
kA
' kg
Eff. By t h e e f f e c t i v i t y of t h e proof o f ( 7 . 2 ) .
General remarks on t h e e f f e c t i v e t o p o s . The p l e a s i n g f e a t u r e of t h e e f f e c t i v e t o p o s i s t h a t i n i t ,
i d e a s about e f f e c t i v i t y i n mathematics,seem t o have t h e i r n a t u r a l home.
W e mention t h e two main examples.
1) C o n s t r u c t i v e r e a l a n a l y s i s . i s what a n a l y s i s i n
Eff
W e have t r i e d t o i n d i c a t e t h a t t h i s
i s i n e s s e n c e i n 118-13.
I t i s worth n o t i n g
how t h e r e a l i z a b i l i t y l o g i c makes d i s t i n c t i o n s f o r us.
Consider t h e
J.M.E. HYLAND
214
examples (Kreisel 119591 t h a t t h e i n t e r m e d i a t e v a l u e theorem h o l d s c l a s s i c a l l y but not e f f e c t i v e l y f o r recursive (continuous) functions on t h e r e c u r s i v e r e a l s . vf
E
In
Eff,
lRIR .f (O)
3X
E
(0,l)f
(X)
= 0
is f a l s e while
vf
E
~ l R . f ( 0 ) < O A f ( l ) >-->O
i s t r u e ( a s it i s t r u e i n
2 ) Effective algebra.
- 1 - 1 3 xE
Sets and
(O,l)f(X) = 0
equivalent t o a negative formula).
W e have n o t d i s c u s s e d t h i s a t a l l , b u t i t
seems worth p o i n t i n g o u t t h a t t h e d e f i n i t i o n s have a n a t u r a l meaning in
Eff.
A r e c u r s i v e l y p r e s e n t e d f i e l d (see Metakides-Nerode
i s an enumerable ( d e c i d a b l e ) f i e l d i n
Eff.
C19791
I t has a s p l i t t i n g
a l g o r i t h m i f f i r r e d u c i b i l i t y of polynomials i s d e c i d a b l e i n
Eff.
Thus t h e e f f e c t i v e c o n t e n t o f a r e c u r s i v e l y p r e s e n t e d s t r u c t u x e c o r r e s p o n d s t o p r o p e r t i e s of it which h o l d i n
Eff.
This suggests
t h a t p o s i t i v e r e s u l t s i n e f f e c t i v e a l g e b r a s h o u l d be e s t a b l i s h e d by proving r e s u l t s i n c o n s t r u c t i v e l o g i c from axioms which h o l d i n and i n t e r p r e t i n g t h e r e s u l t s i n a x i o m a t i c method.
Eff.
Eff,
T h a t i s , one s h o u l d u s e t h e
Of c o u r s e , n e g a t i v e r e s u l t s o b t a i n e d i n e f f e c t i v e
a l g e b r a can be i n t e r p r e t e d i n
Eff t o g i v e independence r e s u l t s .
What w e l a c k , above a l l , i n o u r t r e a t m e n t o f t h e e f f e c t i v e topos,
i s any r e a l i n f o r m a t i o n a b o u t a x i o m a t i z a t i o n analogous t o t h e r e s u l t s o b t a i n e d i n T r o e l s t r a 119731 a x i o m a t i z i n g r e a l i z a b i l i t y o v e r b o t h Heyting and Peano a r i t h m e t i c .
Of c o u r s e , one would e x p e c t t o look a t
t h e e f f e c t i v e t o p o s d e f i n e d o v e r a t o p o s o t h e r t h a n Sets ( s a y o v e r t h e f r e e t o p o s w i t h n a t u r a l number o b j e c t ) t o g e t a r e s u l t c o r r e s ponding p r e c i s e l y t o a n a x i o m a t i z a t i o n .
But a l l I wish t o p o i n t o u t
i s t h a t ( d e s p i t e t h e s u g g e s t i v e work of P i t t s C19811 on i t e r a t i o n )
w e have no good i n f o r m a t i o n i n t h i s area.
W e can n o t p r o p e r l y be
s a i d t o u n d e r s t a n d r e a l i z a b i l i t y u n t i l w e do.
215
The effective topos REFERENCES
Beeson C19771, P r i n c i p l e s o f c o n t i n u o u s c h o i c e , Ann. Math. Log. 1 2 , 249-322.
M.J.
E. Bishop C19671, A . B o i l e a u & A.
D.
Foundations o f C o n s t r u c t i v e A n a l y s i s (McGraw-Hill).
J o y a l 119811, La l o g i q u e d e s t o p o s , J.S.L.
El
6-16.
van Dalen C19781, An i n t e r p r e t a t i o n of i n t u i t i o n i s t i c a n a l y s i s , Ann. Math. Log. 13, 1-43.
M.P.
Fourman C19771, The l o g i c o f t o p o i , i n Handbook of Mathematical Logic ( e d . Barwise) (North-Holland)
M.P.
Fourman & R . J .
M.P.
Fourman & J.M.E. Hyland 119791, Sheaf models f o r a n a l y s i s , i n A p p l i c a t i o n s of Sheaves ( S p r i n g e r L e c t u r e Notes 7 5 3 ) .
.
Grayson, t h i s volume, Formal s p a c e s .
M.P. FQUrman & D . S . S c o t t C19791, Notes on Sheaves and Logic, i n A p p l i c a t i o n s of Sheaves ( S p r i n g e r L e c t u r e Notes 7 5 3 ) . Gandy & J . M . E . Hyland C19771, Computable and r e c u r s i v e l y c o u n t a b l e f u n c t i o n s of h i g h e r t y p e , i n Logic Colloquium ' 7 6 ( e d . Gandy, Hyland) (North-Holland)
R.O.
.
N.D.
Goodman C1978 1, The n o n - c o n s t r u c t i v e c o n t e n t of s e n t e n c e s of a r i t h m e t i c , J.S.L. 43, 497-501.
J.M.E.
Hyland C19771, Aspects of c o n s t r u c t i v i t y i n mathematics, i n Logic Colloquium '76 led. Gandy, Hyland) (North-Holland)
J.M.E.
Hyland 119791, F i l t e r s p a c e s and c o n t i n u o u s f u n c t i o n a l s , Ann. Math. Log. 16,1 0 1 - 1 4 3 .
J.M.E.
Hyland, P . T . J o h n s t o n e & A.M. P i t t s C19801 CHJP C198011, T r i p o s t h e o r y , Math. P r o c . Carnb. P h i l . SOC. E, 205-232.
P.T.
J o h n s t o n e C19771, Topos Theory (Academic P r e s s )
S .C.
Kleene C 1945 1 , On t h e i n t e r p r e t a t i o n of i n t u i t i o n i s t i c number t h e o r y , J.S.L. E l 1 0 9 - 1 2 4 .
S.C.
Kleene C19731, R e a l i z a b i l i t y : A R e t r o s p e c t i v e Survey, i n Cambridge Summer School i n Mathematical Logic ( S p r i n g e r L e c t u r e Notes 3 3 7 ) .
S.C.
Kleene & R.E. Vesley C19651, The f o u n d a t i o n s o f i n t u i t i o n i s t i c mathematics (North-Holland)
G.
.
.
.
Kreisel C19591, I n t e r p r e t a t i o n of a n a l y s i s by means of c o n s t r u c t i v e f u n c t i o n a l s of f i n i t e t y p e , i n C o n s t r u c t i v i t y i n Mathem a t i c s ( e d . Heyting) (North-Holland)
.
M. Makkai & G.E.
Reyes 119771, F i r s t o r d e r c a t e g o r i c a l l o g i c ( S p r i n g e r L e c t u r e Notes 6 1 1 ) .
G. Metakides & A . Nerode C19791, E f f e c t i v e c o n t e n t of f i e l d theory,
Ann. Math. Log.
17, 289-320.
JM.E. HYLAND
216
J.R.
Moschovakis C19731, A t o p o l o g i c a l i n t e r p r e t a t i o n of second o r d e r i n t u i t i o n i s t i c a r i t h m e t i c , Comp. Math. 26, 2 6 1 - 2 7 6 .
A.M. P i t t s C19811, The t h e o r y o f t r i p o s e s , Cambridge Ph.D. H.
Thesis.
Rogers j n r . C19671, Theory o f r e c u r s i v e f u n c t i o n s and e f f e c t i v e computability ( M c G r a w - H i l l )
D.S.
S c o t t C19701, E x t e n d i n g t h e t o p o l o g i c a l i n t e r p r e t a t i o n t o i n t u i t i o n i s t i c a n a l y s i s 11, i n I n t u i t i o n i s m and Proof Theory ( e d . Xino, M y h i l l , Vesley) North-Holland)
.
D.S.
S c o t t C19791, I d e n t i t y and e x i s t e n c e i n i n t u i t i o n i s t i c l o g i c , i n A p p l i c a t i o n of Sheaves ( S p r i n g e r L e c t u r e Notes 7 5 3 ) .
W.W.
T a i t C19751, A r e a l i z a b i l i t y i n t e r p r e t a t i o n of t h e t h e o r y of
s p e c i e s i n Logic Colloquium ( S p r i n g e r L e c t u r e Notes 4 5 3 ) . A.S.
T r o e l s t r a C19731, Metamathematical I n v e s t i g a t i o n of I n t u i t i o n i s t i c A r i t h m e t i c and A n a l y s i s ( S p r i n g e r L e c t u r e Notes 3 4 4 ) .
I.D.
Z a s l a v s k i ? & G.S. C e x t i n C19621, On s i n g u l a r c o v e r i n g s and p r o p e r t i e s o f c o n s t r u c t i v e f u n c t i o n s connected w i t h them, Trudy hat: I n s t . S t e k l o v 67, 458-502 ( t r a n s l a t e d i n AMS T r a n s l a t i o n s (2) 41-89 ( 1 9 7 1 ) ) .
=,
'THEL.E.J. BROUWER CENTENARY SYMPOSIUM A S . TroeoeLrmand D. van Dalen (editors) 0 North-HollandPublishing Company, 1982
217
CONSTRUCTIVE LOGIC VERSUS ALGEBRAIZATION I
G. Kreisel
*
and A. MacIntyre
S t a n f o r d U n i v e r s i t y and Yale U n i v e r s i t y USA
The I n t r o d u c t i o n e x p l a i n s t h e i s s u e s r a i s e d by c o n s t r u c t i v e l o g i c f o r d i f f e r e n t t r a d i t i o n s ; p r i n c i p a l l y , f o r mainstream c o n s t r u c t i v e mathematics t r e a t e d h e r e , and f o r t h e f o u n d a t i o n a l t r a d i t i o n , t h e s u b j e c t of P a r t 11. The m a t e r i a l i s arranged under t h e following headings. 1. Flashy metatheorems and some n e g l e c t e d i m p l i c a t i o n s . For example, c l a s s i c a l proofs of I$theorems a r e e s s e n t i a l l y no h a r d e r t o unwind t h a n corresponding c o n s t r u c t i v e , more p r e c i s e l y , i n t u i t i o n i s t i c p r o o f s . In s h o r t , i n t u i t i o n i s t i c r e s t r i c t i o n s t e n d t o be t o o weak i n p r a c t i c e , i n c i d e n t a l l y d e s p i t e t h e ( l i t t l e known) 2. Weakelegance of t h e i r metatheory documented i n a d i g r e s s i o n . ness of t h e c o n s t r u c t i v e meaning of IIg + I$ This i s i l l u s t r a t e d by r e f e r e n c e t o v a r i o u s elementary i m p l i c a t i o n s of t h i s form between f a m i l i a r f i n i t e n e s s theorems i n a r i t h m e t i c . A p r o v i s o i s formulated which c o r r e c t s t h a t weakness. and i s o f t e n s a t i s f i e d i n practice. 3. Metamathematics of c l a s s i c a l systems: modern v a r i a n t s of H i l b e r t ' s program without detour v i a c o n s t r u c t i v e . l o g i c . For example, some r e c a l c i t r a n t proofs o f $I theorems have i n f a c t been unwound by s u i t a b l e f u n c t i o n a l i n t e r p r e t a t i o n s such a s t h e n . c . i . ; c u t e l i m i n a t i o n i s g e n e r a l l y l e s s e f f i c i e n t . 4. Applying t h e n.c.i.: r e a s s u r a n c e s (about a d d i t i o n a l s k i l l s needed for s u c c e s s f u l a p p l i c a t i o n s , beyond knowing t h e metatheory of t h e n . c . i . ) . A t t e n t i o n i s drawn t o proof s t r a t e g i e s used i n o r d i n a r y mathematics, o f comparable g e n e r a l i t y t o l o g i c a l metatheorems, where similar a d d i t i o n a l s k i l l s a r e needed, and have proved t o be a v a i l a b l e . Much t h e same a p p l i e s t o s u c c e s s f u l a p p l i c a t i o n s of model t h e o r y which, c o n t r a r y t o s u p e r f i c i a l i m p r e s s i o n s , a r e shown t o i n v o l v e o p e r a t i o n s on p r o o f s , and not 5. A l g e b r a i z a t i o n : reminders and only on t h e theorem proved. s u r p r i s e s ( p r i n c i p a l s e c t i o n ) . By r e f e r e n c e mainly t o r e c e n t l i t e r a t u r e , t h e p o t e n t i a l o f a l g e b r a i z a t i o n and a couple o f o t h e r g e n e r a l mathematical s t r a t e g i e s i n t h e s e n s e o f 4. above i s documented, and c o n t r a s t e d w i t h l o g i c a l c o n t r i b u t i o n s t o t h e c o n s t r u c t i v e t r a d i t i o n i n mathematics. Remarkably many s i g n i f i c a n t and g e n e r a l p o i n t s a r e i l l u s t r a t e d by work on sums o f squares and by t h e Appendix. The l a t t e r supplements s e c t i o n 2. by r e f e r e n c e t o t h e most s o p h i s t i c a t e d i m p l i c a t i o n between f i n i t e ness theorems i n t h e number-theoretic l i t e r a t u r e . P a r t i c d a r a t t e n t i o n i s given t o r e a l i z i n g t h e ' p r o v i s o ' mentioned i n 2 . , or, equiv a l e n t l y , t o making a proper choice between v a r i o u s meanings o f t h e popular phrase: from a counterexample t o t h e conclusion we g e t one t o t h e premise. - The Appendix can b e r e a d independently o f t h e main t e x t .
.
*
This work w a s p a r t i a l l y supported by a National Science Foundation g r a n t , MCS81-04869.
218
G. KREISEL, A. MACINTYRE
INTRODUCTION Many years ago Bourbaki s a i d somewhere t h a t i n t u i t i o n i s m would come t o be seen
as a mere h i s t o r i c a l c u r i o s i t y .
Though a b i t offhand t h e remark makes a good
suggestion: t o look at t h e s u b j e c t i n d i f f e r e n t h i s t o r i c a l contexts.
W e shall
consider t h r e e obvious candidates. The present paper ( P a r t I) concerns t h e 2000 year o l d t r a d i t i o n of s o c a l l e d main stream c o n s t r u c t i v e mathematics.
This picks out p a r t i c u l a r kinds of
operations o r constructions t o be used f o r solving problems; f o r example. t h e humble r i n g operations i n t h e days o f Pythagoras o r t h e r e c u r s i v e operations which, by now, c o n s t i t u t e an i n t e g r a l p a r t o f t h e modern main stream.
Inci-
d e n t a l l y , t h e s e 'extremes' a r e n e a t l y connected by i d e n t i f y i n g t h e diophantine and t h e r e c u r s i v e l y enumerable r e l a t i o n s .
T r a d i t i o n a l advertisements f o r those
two c l a s s e s were, indeed, exaggerated, but can be r e f i n e d . t o have claimed t h a t number i s t h e measure o f a l l things. s u f f i c i e n t l y many t h i n g s .
Not q u i t e ; b u t of
Recursive operations were s a i d t o correspond t o t h e
p o s s i b i l i t i e s of t h e i d e a l i z e d ( f i n i t e ) mind. i n g t o non-recursive laws.
Pythagoras is s a i d
Perhaps not, if it grows accord-
But r e c u r s i v e operations are c e r t a i n l y w e l l s u i t e d
f o r s t a t i n g f a c t s about f i n i t e l y presented groups, chosen t o 'grow' t o recursive laws.
according
I n c o n t r a s t , i n t u i t i o n i s m p r e s e n t s a c o n f l i c t f o r t h e tra-
d i t i o n of c o n s t r u c t i v e mathematics by emphasizing c o n s t r u c t i v e proofs (not only: o p e r a t i o n s ) , involved i n c o n s t r u c t i v e
m.
Quite simply, it i s t h i s .
Any
r e s t r i c t i o n on proofs may exclude t h e p o s s i b i l i t y o f e s t a b l i s h i n g optimal sol u t i o n s ; and i f t h e r e s t r i c t i o n s have l o g i c a l c h a r a c t e r , not geared t o any s p e c i f i c subject matter, they may b e t o o weak i n p r a c t i c e .
I n s h o r t , one i s
l i a b l e t o fall between two s t o o l s ; i n accordance with t h e o l d warning t h a t , what i s t r u e i n general i s l i a b l e t o be t r i v i a l i n most p a r t i c u l a r cases.
Put
a l i t t l e less brashly: e l a b o r a t i o n s of g e n e r a l i t i e s tend t o reach t h e p o i n t of diminishing r e t u r n s very soon. The two f i r s t s e c t i o n s below document t h e c o n f l i c t i n question i n two ways.
Quite generally, i f r e s t r i c t i o n s on proofs a r e r e l e v a n t f o r t h e c o n s t r u c t i v e t r a d i t i o n i n mathematics a t a l l , t h o s e made by ( i n t u i t i o n i s t i c ) c o n s t r u c t i v e l o g i c tend t o be t o o weak.
But so i s ( t h e extension of c o n s t r u c t i v i t y t o ) t h e
meaning o f l o g i c a l l y complicated expressions which have no p l a c e i n t h e main stream t r a d i t i o n at all.
So, f o r t h e h i s t o r i c a l context considered here,
Bourbaki's remark has not been r e f u t e d up t o now.
( A t t h e end o f t h e paper
reasons are given why it seems premature t o a s s e s s t h e p o t e n t i a l o f c o n s t r u c t i v e l o g i c ; more p r e c i s e l y , even f o r t h i s context.)
But unlike Bowbaki w e do not
rely on o b i t e r d i c t a , l e t alone, ignore c o n s t r u c t i v e l o g i c (as Bourbaki's remark
219
Constructive logic versus algebraization might s u g g e s t ) , b u t u s e metatheorems o r i g i n a l l y proved f o r q u i t e d i f f e r e n t purposes: give them rope
...
Here it i s t o b e emphasized t h a t t h e formal meta-
theory o f c o n s t r u c t i v e l o g i c i s e x c e p t i o n a l l y r i c h and e l e g a n t , i l l u s t r a t i n g t h e This p o i n t i s f u r t h e r under-
truism t h a t elegance does not guarantee r e l e v a n c e . lined i n t h e t h i r d section.
I t reminds t h e r e a d e r o f t h e much l e s s e l e g a n t
metamathematics o f c l a s s i c a l systems which unwinds non-constructive p r o o f s , f o r example, t o e x t r a c t bounds (without d e t o u r v i a c o n s t r u c t i v e l o g i c ) .
This kind
of metamathematics avoids t h e l o g i c a l symbolism o f c o n s t r u c t i v e l o g i c ; b u t u n l i k e
main stream c o n s t r u c t i v e mathematics it b u i l d s up i t s f u n c t i o n a l equations from a crude s o t o speak l o g i c a l s t o c k o f o p e r a t i o n s .
Nevertheless, used w i t h d i s -
c r e t i o n t h i s has helped s o l v e problems t o which s p e c i a l i s t s wanted an answer. The a d d i t i o n a l s k i l l s which c o n s t i t u t e t h e d i s c r e t i o n r e q u i r e d , i n c i d e n t a l l y , not t o o d i f f e r e n t from t h o s e needed t o apply ( f o r m a l ) t h e o r y elsewhere, a r e discussed i n t h e f o u r t h s e c t i o n .
Granted,
-
This l e a d s t o t h e p r i n c i p a l p o i n t o f t h e paper.
a s always: f o r t h e c o n s t r u c t i v e t r a d i t i o n o f mathematics
i v e l o g i c has f a i l e d on almost every s p e c i f i c s c o r e .
- construct-
To l e a r n from t h e s e f a i l -
ures o f what had appeared t o be an a t t r a c t i v e p r o j e c t , one a s k s : What l i m i t a t i o n s of any g e n e r a l a i m behind it can b e rewarding?
Must one switch t o completely
d i f f e r e n t methods? O r i s some combination w i t h knowledge o f c o n s t r u c t i v e l o g i c fruitful?
More c o n c r e t e l y , t h o s e o f us who know died-in-the-wool
o r born-again
c o n s t r u c t i v i s t s , can ask: What do t h e y imagine t h e y have c o n t r i b u t e d t o t h e broad c o n s t r u c t i v e t r a d i t i o n i n mathematics?
Without exaggeration: t h e y a r e
under t h e impression t h a t l o g i c has n o t only formulated s i g n i f i c a n t g e n e r a l p r i n c i p l e s o f mathematical reasoning b u t t h a t it i s t h e only p a r t o f mathematics which has them: perhaps t h e o n l y p a r t which has t h e means t o formulate such principles.
Viewed d i s p a s s i o n a t e l y , p r o o f s i n non-constructive mathematics
would be a p e r f e c t l y a p p r o p r i a t e s u b j e c t h e r e even f o r c o n s t r u c t i v i s t s s i n c e such p r o o f s a r e c o n s t r u c t i o n s t o o .
But i n o r d e r n o t t o o f f e n d s e n s i b i l i t i e s
(by mentioning t a i n t e d o b j e c t s ) , we c o n t i n u e t o r e l y on m a t e r i a l from t h e constructive tradition.
I n t h e l a s t and p r i n c i p a l s e c t i o n o f t h i s paper, con-
s o l i d a t e d by t h e Appendix, g e n e r a l proof s t r a t e g i e s i n main stream c o n s t r u c t i v e mathematics a r e shown t o b e , r e a l i s t i c a l l y speaking, of q u i t e comparable 5 e n e r a L i t y t o t h e l o g i c a l kind, b e s i d e s b e i n g more e f f i c i e n t .
The p r i n c i p a l
example i s a l g e b r a i z a t i o n , mentioned i n t h e t i t l e , w i t h a couple o f q t h e r s thrown i n .
This choice i s p e r f e c t l y orthodox; c f . t h e f i r s t sentence o f
Bourbaki's Algbbre: F a i r e de l ' A l g S b r e , c ' e s t e s s e n t i e l l e m e n t c a l c u l e r . - Our p r e s e n t a t i o n c o n f l i c t s w i t h t h e canons o f s o c a l l e d exact methodology which req u i r e such l i t e r a r y forms as metatheorems.
f o r formulating
I f t h e s e forms are not w e l l s u i t e d
t h o s e g e n e r a l proof s t r a t e g i e s , e x a c t methodology d r a w s
220
G. KREISEL, A. MACINTYRE
attention away from the latter, thereby introducing a systematic error; a hopelessly lopsided view, a false philosophy of mathematics in the sense of Schopenhauer. The talk above of a possible systematic error certainly has some empirical support. Not only constructivist logicians have the impression that logic is uniquely suited for formulating general insights. Many model theorists think of logical transfer principles as so to speak qualitatively more general than, say, Hasse's local/global principle though, by realistic standards, the latter is more than competitive. Also, there is a plausible theoretical reason. The impression is plainly fostered by the foundational tradition, that is, the project of logical foundations which goes back roughly a century. This is the second obvious candidate for an historical context suggested by Bourbaki's remark at the beginning of this introduction. of Part I1 of this paper.
It will be the principal subject
In this context Brouwer's constructive logic is by
no means a curiosity but an historic necessity; nothing less than an essential 'antithesis' to the then-dominant 'theses' of Frege or Russell.
(Viewed from
outside they are variants, not rivals since they are all much more like each other than like ordinary conceptions of mathematics, then or now; cf. the story of French politics in 1968 when each of the 6 Trotskyite parties reputedly considered itself more different from any of the others than from Pompidou's position.) Furthermore, Brouwer's constructive logic has a direct bearing on questions raised by Aristotle, whose specifically logical scientific
-
-
as opposed to broad
interests are taken up in the modern foundational tradition.
In
fact, constructive logic applies to propositions about such incompletely defined objects as choice sequences, the principal topic of Brouwer's mature work; giving at least one memorable answer to the issues, on incompletely defined terms, raised by Aristotle in Met I'8, 1012-1023 (which has survived 2000 years). This obvious interest of choice sequences for the foundational tradition does not ensure any broader significance. They do not belong to the mathematical tradition at all for the simple reason that propositions about them have been at least, so far: successfully ditions. NB.
-
-
paraphrased by appropriate continuity con-
This qualification, on the broader significance of principal
objects in the foundational tradition, is not a mere innocent aside.
It con-
flicts with the claim that the foundational version is a successful or, perhaps, even the only legitimate heir of the heroic philosophical tradition; in particular, of the broad philosophy of mathematics concerned with the nature of mathematical structures and our knowledge about them; or - as Bourbaki's manifesto put it
-
with understanding the architecture of mathematics and our
intuitive resonances to it, as heroic an aim (or claim) as any.
This heroic
tradition is the third candidate for an historical context adumbrated at the beginning of this paper.
We see no evidence that the foundational tradition,
22 1
Constructive logic versus algebraization not . t o speak o f i t s c o n s t r u c t i v e p a r t , i s more t h a n a c u r i o s i t y h e r e , i f one t a k e s modern knowledge o f ( h e r o i c q u e s t i o n s a b o u t ) t h e n a t u r e of m a t t e r o r I n o t h e r words, l o g i c a l o b j e c t s do not have a p l a c e i n
h e r e d i t y as a s t a n d a r d .
For t h e r e c o r d it should be
t h e h e r o i c t r a d i t i o n comparable t o atoms or DNA.
added t h a t , by t h e s e s t a n d a r d s , t h e e f f o r t s advocated i n Bourbaki's manifesto may come t o be seen as an h i s t o r i c a l c u r i o s i t y t o o .
There i s a p o s i t i v e s i d e t o a l l t h i s n e g a t i v e s t u f f
(which, i n c i d e n t a l l y , i s
not out o f p l a c e i n a s u b j e c t known f o r independence, incompleteness o r unde-
It e x p l a i n s t h e e s s e n t i a l r o l e o f t h e s e a r c h f o r
c i d a b i l i t y theorems!). broad a r e a s s u i t e d t o
-
-
a p p l i c a t i o n s o f l o g i c a l g e n e r a l i t i e s , and p r e p a r e s us
f o r t h e imagination demanded by t h i s s e a r c h .
When o b j e c t s a r e genuinely fund-
amental f o r t h e h e r o i c t r a d i t i o n , and t h u s g e n e r a l i n t h e s e n s e of a few s e r v i n g as b u i l d i n g blocks f o r many d i f f e r e n t t h i n g s , a p p l i c a t i o n s w i l l r e a l l y look a f t e r themselves.
One can h a r d l y know t o o much about such o b j e c t s , and so t h e l a w These o b j e c t s are f a r from our
of diminishing r e t u r n s can u s u a l l y be ignored. ordinary view, and so l i t e r a l l y n o t s u p e r f i c i a l . discovered, u s u a l l y by extending experience.
T h e i r p r o p e r t i e s have t o be
I f t h e y ' c o n f l i c t ' w i t h common
sense, it has t o be remembered t h a t t h e y a r e not p a r t o f o r d i n a r y , common experience e i t h e r .
Logical n o t i o n s a r e almost a t t h e o p p o s i t e extreme, and a
good p a r t o f t h e i r a t t r a c t i o n may f a i r l y be a t t r i b u t e d t o t h i s f a c t .
They a r e
i n t e l l i g i b l e from elementary experience o r , e q u i v a l e n t l y , from viewing b r o a d e r experience s u p e r f i c i a l l y .
To i n t e g r a t e such n o t i o n s s u c c e s s f u l l y with t h e r e s t
of knowledge, one must expect t o pay a p r i c e , f o r example, t h e imagination mentioned e a r l i e r i n t h i s paragraph.
Conversely, s e g r e g a t i n g t h e n o t i o n s , and
studying them ( r e l e n t l e s s l y ) as i f t h e y were fundamental, l e a d s u l t i m a t e l y t o a parody o f fundamental t h e o r y , however b e g u i l i n g l y e l e g a n t it may be.
Readers
w i l l f i n d many examples i n t h e l i t e r a t u r e on a l l branches o f l o g i c ; we recommend
t h e two gems, i n S e c t i o n
4 below,
concerning ' u n i v e r s a l c a l i b r a t i o n s ' i n proof
theory and ' t h e o r i e s o f t h e o r i e s ' i n model t h e o r y .
We do not s e e them as mere
a b e r r a t i o n s ; b u t as i n s t a n c e s of t h a t 'profound i n t e l l i g i b i l i t y ' of mathematics
so prominent i n Bourbaki's manifesto, p a r t i c u l a r l y because o f t h e many s t r i k i n g p a r a l l e l s i n d i f f e r e n t branches o f foundations.
Here a p r e - e s t a b l i s h e d harmony
of e r r o r s , o v e r s i g h t s and misjudgmnknts i s no l e s s r e l e v a n t t h a n t h e more popular variety.
FLASHY METATHEOREMS AND SOME NEGLECTED IMPLICATIONS The f i r s t p a r t of t h i s s e c t i o n concerns t h e r i s k , mentioned i n t h e i n t r o d u c t i o n , of f a l l i n g between two s t o o l s when ( v a l i d ) methods o f proof a r e r e s t r i c t e d .
i s obvious t h a t o p t i m a l . s o l u t i o n s m a y be excluded.
-
Reminder.
Trivially, i f
It
222
G . KREISEL, A. MACINTYRE A
' o p t i m a l ' means: minimal,
0
is
111
and undecided by t h e r e s t r i c t e d methods, 3.x [ x = 1 v ( x = 0
t h e optimal s o l u t i o n ( r e a l i z a t i o n ) o f but only
x 5 1 can be proved.
A
A)]
is:
x = 0
,
Less t r i v i a l l y , s e v e r a l algorithms a r e known t o 0
be c o r r e c t o r e f f i c i e n t only modulo some so f a r undecided
conjecture, for
111
example, algorithms f o r p r i m a l i t y t e s t i n g modulo t h e g e n e r a l i z e d Riemann hypoWhat i s t r u e f o r r e s t r i c t i o n s t o a c t u a l l y known p r o o f s a p p l i e s q u i t e
thesis.
well' t o p r o v a b i l i t y by r e s t r i c t e d methods o f t h e kind considered here.
The second r i s k , of choices which a r e t o o weak (when any r e s t r i c t i o n s a r e app r o p r i a t e a t a l l ) , i s e s t a b l i s h e d i n ( a ) and ( b ) f o r t h e c a s e o f H e y t i n g ' s r u l e s This i s seen by two
f o r c o n s t r u c t i v e o r , more p r e c i s e l y , i n t u i t i o n i s t i c l o g i c .
metatheorems which a r e w e l l known, b u t u s u a l l y p r e s e n t e d f o r q u i t e d i f f e r e n t reasons. (a)
The n e g a t i v e t r a n s l a t i o n goes back t o Kolmogorov, Gadel, Gentzen.
It i s
u s u a l l y p r e s e n t e d as e s t a b l i s h i n g t h e adequacy of t h e i n t u i t i o n i s t i c ideology:
a l l c l a s s i c a l mathematics (covered by t h e t r a n s l a t i o n ) can a l s o b e done by use of Heyting's r u l e s ( w i t h t h e corresponding axioms); i n c i d e n t a l l y , without i n o r -
But, by s t a n d a r d s a p p r o p r i a t e t o t h e
d i n a t e i n c r e a s e i n t h e l e n g t h of p r o o f s .
c o n s t r u c t i v e t r a d i t i o n , t h e t r a n s l a t i o n has simply uncovered a loophole: an 0 easy paraphrasing o f obviously non-constructive p r o o f s , f o r example, o f
111
theorems.
( i ) and ( i i )below come from two extremes o f mathematics.
( i ) E u c l i d ' s proof o f t h e i r r a t i o n a l i t y of
/?
by r e d u c t i o ad a b s u r d m .
As a
m a t t e r of h i s t o r i c a l f a c t t h i s has f i g u r e d as a paradigm o f a non-constructive proof (probably e v e r s i n c e E u c l i d ) . pq
# 0
+
o f mVqA
p2
# 2q2
, say
from 1 3 p q - 1 A
A
.
, is
Since, f o r i n t e g r a l
p
and
q
,
n e g a t i v e , Heyting's r u l e s permit t h e i n f e r e n c e
No changes i n t h e t r a d i t i o n a l proof need b e made.
-
On t h e o t h e r hand, it i s obvious what i s r e q u i r e d by t h e c o n s t r u c t i v e t r a d i t i o n : a measure o f i r r a t i o n a l i t y , t h a t i s , a lower bound f o r The missing s t e p i s :
if
, according
p2 to
# 2q2
, then
2
Ip -2q
2
1
lfi-p/q\
1. 1 .
i n terms o f q ,
The l o g i c a l c l a s s i -
q u a n t i f i e r complexity, d r a w s a t t e n t i o n away from t h e
e s s e n t i a l requirement. ( i i ) Deligne's proof o f (A. W e i l ' s v e r s i o n o f ) t h e Riemann h y p o t h e s i s f o r vari e t i e s over f i n i t e f i e l d s .
This can indeed b e formalized i n c l a s s i c a l f i r s t
o r d e r a r i t h m e t i c , c o n t r a r y t o s t r a n g e s p e c u l a t i o n s , f o r example, by Manin i n I ( a ) on p. 36 o f Browder (1976).
It!
Since Deligne's theorem, l i k e t h e o r d i n a r y RH, i s i n
form, t h e n e g a t i v e t r a n s l a t i o n a p p l i e s .
Whatever doubts t h e r e may b e about
t h e p r e c i s e e x t e n t o f t h e c o n s t r u c t i v e t r a d i t i o n , t h e r e i s no doubt t h a t t h e n e g a t i v e t r a n s l a t i o n o f Deligne's proof l i e s o u t s i d e i t ; c f . P a r t I1 f o r a l e s s s t e r i l e way o f a n a l y s i n g p r o o f s of
IIy
theorems.
223
Constructive logic versus algebraization
(b)
Closure under Markov's r u l e .
Over t h e l a s t 25 y e a r s o r s o t h i s has been
v e r i f i e d f o r l a r g e c l a s s e s of i n t u i t i o n i s t i c systems, t h e r e b y extending ( a ) t o
0
( t h e non-negative) 112
formulas.
The r e s u l t w a s u s u a l l y p r e s e n t e d as e s t a b l i s h -
ing t h e s t a b i l i t x of t h e n o t i o n o f a demonstrably t e r m i n a t i n g Turing program, and hence of: provably r e c u r s i v e f u n c t i o n .
Another i n t e r p r e t a t i o n , which i s much
more r e l e v a n t t o t h e c o n s t r u c t i v e t r a d i t i o n i n mathematics, uses t h e f a c t t h a t , for quantifier-free
(*I
A
, the
passage 'Jni'Jmi A
from a proof (by H e y t i n g ' s r u l e s ) of t h e n e g a t i v e formula t o a proof of
Vn 3m A
is quite short.
Corollary on e x t r a c t i n g an a l g o r i t h m
rx
:n
+
m
satisfying
tln A [ n , a ( n ) ]
.
This
job i s e s s e n t i a l l y e q u a l l y d i f f i c u l t whether one s t a r t s w i t h an i n t u i t i o n i s t i c
Vn 3 m A
proof o f
o r one i n t h e corresponding c l a s s i c a l system.
Now, e x t r a c t i n g such a l g o r i t h m s , a l s o c a l l e d : unwinding non-constructive e x i s t ence p r o o f s , i s a p r i n c i p a l concern of t h e c o n s t r u c t i v e t r a d i t i o n .
-
of r e l a t i v e l y simple ( c l a s s i c a l ) proofs can be t e d i o u s .
The unwinding
Thus t h e i n t u i t i o n i s t i c
r e s t r i c t i o n s a r e t o o weak; so weak t h a t a r e d u c t i o n t o i n t u i t i o n i s t i c r u l e s i s not even a u s e f u l i n t e r m e d i a t e s t e p towards unwinding c l a s s i c a l proofs (of theorems). structive
NB.
$
No more could b e expected i n any case s i n c e t h e use o f con-
i s c e r t a i n l y not p a r t of mainstream c o n s t r u c t i v e mathematics
where t h e o p e r a t i o n s 'hidden' i n t h e l o g i c a l symbolism a r e made e x p l i c i t . Remark.
I n t h e s p e c i a l case o f formal a r i t h m e t i c t h e c o r o l l a r y follows from
Gentzen's o b s e r v a t i o n , almost 40 y e a r s ago, t h a t , f o r each
c1
<
EO
, winduction
can b e proved q u i t e simply i n Heyting's a r i t h m e t i c ; so we have r e l a t i v e l y s h o r t proofs o f
IIE
theorems with bounding f u n c t i o n s which a r e not & r e c u r s i v e (and
hard t o c a l c u l a t e ) .
But nowadays t h e r e i s a much n e a t e r way o f e s t a b l i s h i n g t h e
c o r o l l a r y , by t h e very d i r e c t , g e n e r a l proof o f ( * ) , both by Dragalin and H. Friedman.
noticed i n t h e seventies
A s so o f t e n w i t h p r e t t y p r o o f s , people d i d
not look f o r such i m p l i c a t i o n s as i n t h e c o r o l l a r y above, although t h e t o p i c , e x t r a c t i n g a l g o r i t h m s , s t a r e s one i n t h e f a c e . Digression i l l u s t r a t i n g f u r t h e r t h e p o i n t above on p r e t t y p r o o f s .
It seems t o
be a w e l l k e p t s e c r e t t h a t t h e metamathematical p r o p e r t i e s o f Heyting's r u l e s a r e very e l e g a n t (and can be b e g u i l i n g ; c f . t h e g e n e r a l r e p o r t on mathematical l o g i c i n K r e i s e l (1965) where proof t h e o r y i s t r e a t e d p r i n c i p a l l y f o r Heyting's r u l e s ; f o r p u r e l y formal r e a s o n s , i n 3.242 on p. 156, without much concern f o r wider i s s u e s ) .
The following two e x c e p t i o n a l l y p r e t t y metatheorems, discovered
224
G. KREISEL, A. MACINTYRE
s i n c e t h e n , p i n p o i n t s t r i k i n g d i f f e r e n c e s between t h e s e r u l e s and t h e c l a s s i c a l rules. c f . Mints (1979).
( a ) S t a b i l i t y o f E-theorems;
This answers a q u e s t i o n , r a i s e d
a t t h e Buffalo conference i n 1968, which a r i s e s as follows. different
-
f u n c t i o n a l and r e a l i z a b i l i t y
i t i o n i s t i c systems.
other?
interpretations
I
They e x t r a c t r e a l i z a t i o n s
an e x i s t e n t i a l formula occurring i n
-
A ).
3xA
, possibly
How a r e t h o s e
I
xd
xd
There a r e s t r i k i n g l y I
o f formal i n t u -
from any d e r i v a t i o n
of
d
w i t h a d d i t i o n a l parameters ( b e s i d e t h o s e
, for
different
I
, related
t o each
Work by s e v e r a l a u t h o r s s e t t l e d t h e m a t t e r very s a t i s f a c t o r i l y i n terms
o f a p p r o p r i a t e equivalence r e l a t i o n s , b u t without r e g a r d f o r t h e f o l l o w i n g b a s i c limitations. For one t h i n g , mathematically t r i v i a l changes i n d can a f f e c t xd , t h e common I v a l u e o f xd (up t o e q u i v a l e n c e ) considerably; c f . p. 149 of Suppes (1981). I
More i n t e r e s t i n g l y , all t h e maps: d xd have t h e s y s t e m a t i c p r a c t i c a l d e f e c t o f r e t a i n i n g redundancies; c f . Goad ( 1 9 8 0 ) . S i g n i f i c a n t l y , t h e p a r t i c u l a r correction lor. cit.,
c a l l e d ' p r u n i n g , ' v i o l a t e s s e v e r a l familiar l o g i c a l i d e a l s i n
t h e s u b j e c t , f o r example, s o - c a l l e d s t r o n g normalization (which r e f u s e s t o d i s t i n g u i s h between s e n s i b l e and s i l l y r e d u c t i o n s ) .
(B)
Demonstrable a r i t h m e t i c t r a n s f i n i t e i n d u c t i o n on
well-foundedness o f
<
<
.
0 ( c1 -0rderings)
< and
F o r almost 30 y e a r s , it has been known t h a t , f o r some
which a r e not well-founded,
each non-empty a r i t h m e t i c s e t
P
can be proved
in f i r s t o r d e r c l a s s i c a l a r i t h m e t i c t o have a f i r s t element; i n o t h e r words, t h e contrapositive o f arithmetic t r a n s f i n i t e induction, can be proved f o r all
P
T I ( lP, < )
for short,
(demonstrably i n p r i m i t i v e r e c u r s i v e metamathematics);
1 1
c f . p. 128 o f K r e i s e l (1953) u s i n g aC - t r u t h d e f i n i t i o n f o r a r i t h m e t i c . t h i s i s c e r t a i n l y not s u r p r i s i n g . s p e c i f i c ( e v i d e n t l y : non-negative) systems
S
, if
All
In c o n t r a s t , by Friedman (19751, t h e r e i s a
Po
s.t.,
TI(PO,<) i s d e r i v a b l e i n
f o r a wide c l a s s of i n t u i t i o n i s t i c
S
, then <
i s well-founded;
in
f a c t , demonstrably embeddable i n t h e a s s o c i a t e d c a n o n i c a l o r d e r i n g ( f o r example,
of o r d i n a l
E~
i n t h e c a s e of a r i t h m e t i c ) .
- To
add t o t h e a e s t h e t i c a p p e a l ,
So
Po f u n c t i o n s l i k e a p r e d i c a t e
i s obtained by a d a p t i n g Sackst Po proof o f t h e d e n s i t y theorem f o r Turing degrees of r . e . s e t s ( a s u b j e c t n o t variable.
famous f o r i t s use i n o t h e r p a r t s o f l o g i c o r mathematics).
-
We have h e r e a
p r e t t y analogue t o t h e f a m i l i a r use i n a l g e b r a o f a l g e b r a i c a l l y independent s e t s o f p a r t i c u l a r numbers t h a t f u n c t i o n l i k e v a r i a b l e s .
But, a t l e a s t so f a r , t h e
most p e r t i n e n t q u e s t i o n has been n e g l e c t e d . Are t h e r e o r d e r i n g s
< f o r which a proof i n
S of
TI(PO,<) i s e a s i e r t o find
o r t o w r i t e dotm t h a n , s a y , a proof of an embedding of < i n t h e canonical ordering associated with
S ?
Constructive logic versus algebraization
225
In s h o r t , i s t h e p r e t t y r e s u l t a l s o a s c i e n t i f i c t o o l ? Reminder. ComFor example, F r i e d b e r g (1957) on P o s t ' s
parisons a r e not n e c e s s a r i l y odious.
problem r a i s e s t h e same q u e s t i o n a s Friedman ( 1 9 7 5 ) , s o t o speak on t h e s c i e n t i s t ' s r e s p o n s i b i l i t y o f u s i n g t o o l s f o r s e n s i b l e aims; a t l e a s t i n h i s own
-
domain of competence.
Conjecture.
The k i n d o f exact methodology, mentioned
i n t h e i n t r o d u c t i o n , draws a t t e n t i o n away from t h e a c t u a l p o s s i b i l i t i e s o f e s t a b l i s h i n g s i g n i f i c a n c e ; by t a l k about g e n e r a l ' p r i n c i p l e s ' For example,
one p o s s i b i l i t y
would be t o d i s c o v e r an equations i n
(1957)
s . t . t h e d e c i s i o n problem f o r q u a r t i c diophantine
N
v a r i a b l e s i s o f i n t e r m e d i a t e degree.
N
f o r doing t h i s .
o f enhancing t h e s i g n i f i c a n c e of F r i e d b e r g
( T h i s would not only be
f r u i t f u l f o r number t h e o r y , b u t a l s o f o r t h e t h e o r y o f Turing degrees.)
WEAKNESS OF THE CONSTRUCTIVE MEANING OF
ni
+
fl;
The weakness documented in t h e l a s t s e c t i o n concerned i n t u i t i o n i s t i c r e s t r i c t i o n s Here it w i l l b e shown t h a t , i n p r a c t i c e , t h e g e n e r a l re-
on r u l e s of proof.
flo 3
quirements on c o n s t r u c t i v e v a l i d i t y a r e i n a d e q u a t e , a l r e a d y f o r
$
(though not f o r
+
no3
) implications.
+
no
3
This i s done by r e f e r e n c e t o G8del A t t h e end o f t h e s e c t i o n t h e a n a l y s i s
(1958) which r e a d e r s a r e l i k e l y t o know.
w i l l be used t o e x p l a i n (and c o r r e c t ) t h e views on t h i s m a t t e r i m p l i c i t i n t h e informal l i t e r a t u r e on c o n s t r u c t i v e mathematics. - Reminder.
vx p m ( x , y , z )
from
+
Vu 3v VwD(u,v,w)
Vu Vy 3v Vw 3x 32 { A [ x , Y ( x ) , z ) ]
Y
where
: x
, and
y
G8del (1958) passes
t o t h e formally s t r o n g e r formula D(u,v,w)I
+
-
,
r e q u i r e s a r e a l i z a t i o n by c o n s t r u c t i v e f u n c t i o n a l s
v
:
such t h a t , f o r a l l u,y,w,
, x,z
(u,Y) I+ v (with
7,
: (u,Y,w)
x,z
x s h o r t f o r V(u,y) and X ( u , Y , w ) ,
etc.)
(t) NB.
holds.
The l e t t e r s
A
and
s t a n d f o r ( p r o p e r t i e s o f ) a l g e b r a i c numbers
D
and diophantine e q u a t i o n s considered below. F i n i t e n e s s theorems.
To judge t h e s i g n i f i c a n c e o f
( t ) ,it
i s b e s t t o apply it
to
f a m i l i a r examples where n e i t h e r a b s t r a c t nor formal nonsense h a s much chance t o t u r n our heads.
w
2v
-t
resp.
w
Let
7DO(u,w) indexed
A
and
D
be, resp.:
, where A. and by x , r e s p . u
Suppose f i r s t a bounding f u n c t i o n
for z
1. y ( x )
terms o f
y
.
.
Then
( t ) provides
All i s w e l l .
Do
z 'y
+-I
AO(x,z)
,
a r e thought o f a s decidable s e t s o f
. y
f o r t h e premise i s known:
1 AO(x,z)
a bounding f u n c t i o n f o r t h e conclusion i n
z
,
226
G. KREISEL, A. MACINTYRE
Suppose next we have no e x p e c t a t i o n o f f i n d i n g such a bounding f u n c t i o n . we t a k e t h e c o n t r a p o s i t i v e o f
I n words:
i f , f o r any
then we have
X
u
( t ) ,t h a t
, some
'sufficiently'
t . some 'Large'
S .
z
large
w
-
satisfies
Do(u,w)
y , no l o n g e r assumed t o be a
This i s u s e f u l i f , f o r example, s u f f i c i e n t l y l a r g e elements
{w : D 0 ( u , w ) } a r e a t hand ( f o r some u ), and l a r g e elements of x ) , w i t h an obvious p r o v i s o .
{ z : A O ( x , z ) } a r e i n demand ( f o r some
-
V ).
' l a r g e ' agrees w i t h t h e t e c h n i c a l meaning above (determined by more, t o pass from w
, one
x
I t must
y so t h a t t h e a p p r o p r i a t e meaning o f
b e p o s s i b l e t o choose t h e parameter
t i v e l y on
,
A O ( X , z ) ; b o t h terms i n in-
satisfies
v e r t e d c o m a s depend on t h e f u n c t i o n parameter bounding function. of
Then
is,
t o 'corresponding'
o f t h e arguments o f
X
u
.
,
X
Further-
must not depend t o o s e n s i -
The l i t e r a t u r e on i m p l i c a t i o n s
between f i n i t e n e s s theorems i l l u s t r a t e s convincingly how t h e proviso can be met; c f . b ( B ) of t h e l a s t s e c t i o n f o r an example which does & s a t i s f y
-
t h e proviso t o
(1958). Though i n comment (iii)o f t h e next s e c t i o n some s e v e r e l i m i t a t i o n s o f G8del (1958)f o r i t s own aims w i l l come up,
t h e same e x t e n t .
Remark on G8del
it should be remembered t h a t , for t h e p r e s e n t purpose, it has a l r e a d y p a i d o f f by b r i n g i n g out t h e need f o r t h e p r o v i s o above. Famous examples: bad approximation theorems w i t h f i n i t e l y many exceptions ( o f a l g e b r a i c by r a t i o n a l numbers) and f i n i t e n e s s theorems for c e r t a i n c l a s s e s , s a y ,
8
o f b i n a r y diophantine equations.
Here a l l r e f e r e n c e s w i l l b e t o t h e ex-
c e p t i o n a l l y elementary e x p o s i t i o n o f s t a n d a r d r e s u l t s i n Mordell
(1969), [MI f o r
s h o r t , while t h e Appendix goes i n t o t h e most r e c e n t and incomparably more so-
263 of [MI. We now
p h i s t i c a t e d discovery i n t h i s a r e a ; r e f i n i n g Theorem 2 on p . change n o t a t i o n :
a
x
above means now a p a i r
(a,m)
where t h e a l g e b r a i c number
i s given by t h e c o e f f i c i e n t s o f i t s d e f i n i n g equation,
o f any r a t i o n a l approximation simply, when
where
T
p/q
p/q
, and
y
z
t h e denominator
a bound on t h e denominator (most
i s p u t i n i t s lowest t e r m s ) .
Then
( f o r 'Thue') depends on t h e p a r t i c u l a r bad approximation theorem under
d i s c u s s i o n ( S i e g e l , Roth, e t c . ) .
Note t h a t
A.
i s decidable.
u codes ( t h e c o e f f i c i e n t s o f ) t h e diophantine equation, s a y , class
fiT
covered by t h e bad approximation theorem. DO(u,w) : 3w'[D1(w,wI)
D1
i n the
Then
= 01
i s a g a i n ( p o i m i t i y e ) r e c u r s i v e l y decidable f o r each p a i r u and
W
, provided
it
221
Constructive logic versus algebraization i s so decidable whether
,n D1
consists of binary equations
+
P
, and
> 2
1 'm
where
Q
Q )
(over
c f . [MI, Theorem of degree
4 on
-
188 ( a l s o , for s m a l l n
p.
< n/2-1 ) .
< n
i s of degree
Q
where
186 o f [MI; t h e
D1
Given
and i r r e d u c i b l e
, Theorem
5 on p . 198, f o r
Q
was s o l v e d e a r l i e r by Thue;
( t ) above
i s s a t i s f i e d beyond
.
P(l,a) = 0
To a p a i r
(w,w')
corresponds, i n t h e s i m p l e s t s e n s e p o s s i b l e , an ex-
D1
c e p t i o n a l l y good approximation
p/q
with ' l a r g e '
t r a p o s i t i v e o f ) ( ? ) , X and Z a r e independent o f
u and Y w1
n
, coded by u , t h e corresponding
a l g e b r a i c number i s simply one o f t h e zeros o f
depends on
is the
a c t u a l l y needed i s i n ( 5 ) on p. 187.
T
The p r o v i s o mentioned i n connection w i t h
o f l a r g e solutions of
n
The corresponding
2 6 ;
Q
The c a s e o f c o n s t a n t s
t h e most o p t i m i s t i c e x p e c t a t i o n s .
V
n
of t h e form
i s homogeneous of degree
P
and
cf. Theorem 1 on p.
and
5
a ; cf. [MI, Theorem 2 , p. 187 (due t o S i e g e l ) .
degree of
aT
.
codes a n element of &I
u
m + n/(m+l)
T(a,rn) =
Example 1.
&&
.
9 : q =
Y ,X
W
.
So, i n ( t h e con-
a l s o independent o f w
+
I n s ~ b o l s :for n-tuples x,n depending on u
, ,
.
ZIv WY k ( 3 x ~ z ) [ A ( x , y , z )+ D ( u , v , w ) ]
The example i l l u s t r a t e s most convincingly t h e s i g n i f i c a n c e o f reducing t h e s e t of p a r a m e t e r s , e s p e c i a l l y i n combination w i t h r e s t r i c t i o n s on v and z as f u n c t i o n s of y , r e s p . o f w (as above, where t h e y a r e e q u a l ) . - I n p l i f i c a t i o n p a r a l l e l s t h e case of
- r ( a , m ) = 2 + m-'
Example 2.
II;
l o g i c a l terms, t h e s i m -
implications.
, independent
o f t h e degree o f
c o n s i s t s of e q u a t i o n s
corresponding c l a s s P + Q Q
-f
a
.
By [MI, p. 189, 1. 5 (and r e p e a t e d i n 1. -10 on p.
due t o Roth.
Exercise.
1;
where
D1 o f t h e form
i s as i n Example 1 and
P
-2 , find
< n
i s of degree
For given
This form i s
198) t h e obvious
D1
.
t h e corresponding a ( e a s y ) , and t h e a p p r o p r i a t e
m. Warning concerning Theorem 22 on p. 278 o f [MI (due t o S c h i n z e l ) .
&IT o f Example 2 i s extended t o a l l ducible, t h a t i s ,
Q
i s o f degree
C
D1 n
Here t h e . c l a s s
whose p a r t o f h i g h e s t degree i s i r r e -
.
But t h e proof i s much more complicated,
and a s e p a r a t e i n v e s t i g a t i o n i s needed t o check whether t h e b a s i c p r o v i s o i s s a t i s f i e d ; perhaps along t h e l i n e s o f t h e Appendix where t h e a l g e b r a i c numbers corresponding t o
P + Q
a r e d e f i n e d by d e l i c a t e a l g e b r a (independently o f t h e
s i z e o f h y p o t h e t i c a l s o l u t i o n s of Reminders.
p
+
Q
1.
( i ) The d i s c u s s i o n o f t h e p r o v i s o e a r l i e r on a p p l i e s d i r e c t l y t o
Example 2 s i n c e t h e r e i s no h i n t i n s i g h t of an e f f e c t i v e bounding f u n c t i o n
for arbitrary
a , i n Roth's theorem.
Beyond t h i s t h e r e i s t h e q u e s t i o n o f
Y
,
G. KREISEL, A. MACINTYRE
228
s p o t t i n g diophantine e q u a t i o n s , s p e c i f i c a l l y , s u i t a b l e
Q
, which
have l a r g e
s o l u t i o n s , and t h u s e x c e p t i o n a l l y good approximations w i t h l a r g e denominators
up
t o a l g e b r a i c numbers
for which t h i s i s needed.
( i i ) The p a r t i c u l a r c a s e of Thue's equations: P = m ( i n Example 1) i s more
By ( B a k e r ' s ) Theorem 7 on p. 199 o f [MI, t h e o l d i m p l i c a t i o n i s
delicate.
superseded i n two w w s .
F i r s t , t h e conclusion i t s e l f i s now e f f e c t i v e l y es-
t a b l i s h e d , w i t h bounds on t h e s i z e o f t h e s o l u t i o n s of
P= m
.
Secondly,
Baker's argument d e r i v e s t h i s from an e f f e c t i v e v e r s i o n of a 'weakened' form o f Thue's approximation theorem, t h a t i s , for a l a r g e r
T
t h a n Thue's
So t h e c o n t r a p o s i t i v e provides even b e t t e r approximations t o
solutions of
.
P = m
%
n/2 + 1.
from l a r g e
So t h e i n t e r e s t o f t h e c o n s t r u c t i v e i m p l i c a t i o n i n
Example 1 depends on i t s s i m p l i c i t y , and i s , of course, confined t o c a s e s where a l s o l e s s p r e c i s e bounds:
la-p/ql
5
q-(n'2+1)
a r e good enough; c f . t h e
Appendix f o r a more c o n c r e t e d i s c u s s i o n , f o r diophantine e q u a t i o n s of genus
1
,
f o r which Baker and Coates provide ( o u t r i g h t ) e f f e c t i v e bounds.
(iii) Another way of p u t t i n g t h e i s s u e i n ( i i )i s t o r e c a l l t h a t a proof of an implication i s
not
always superseded by a proof o f t h e conclusion:
t o t h e c a s e where ' a p r o o f ' i s r e p l a c e d by ' t h e v a l i d i t y . '
i n contrast
E v i d e n t l y , some
obviously e s s e n t i a l information i n such p r o o f s i s l o s t by s t a t i n g t h e r e s u l t as
I I + ~
a mere
no3
implication.
Broad conclusions about t h e mathematical and l o g i c a l l i t e r a t u r e on c o n s t r u c t ivizations.
Mathematicians t e n d t o b e e x c e s s i v e l y s u s p i c i o u s of any b u t t h e
most s t r a i g h t f o r w a r d c o n s t r u c t i v e meaning, f o r
0
112
o r o t h e r prenex formulae.
The passage t o t h e c o n t r a p o s i t i v e , d i s c u s s e d above, i s c e r t a i n l y u n f a m i l i a r . Even t h e switch from bounds for t h e s i z e t o bounds for t h e number of s o l u t i o n s i s dismissed out o f hand simply because t h e l a t t e r ( o b v i o u s l y ) do not ensure t h e
former; c f . 1. 4-5 on p. 199 o f [MI.
But t h e r e can be imaginative u s e s f o r
-
bounds on t h e number t o o ; for example, i n Baker (1964) f o r provement i n Davenport and Roth (1955) o f s t r a i g h t f o r w a r d Even i f pure ideology l i k e Bishop
theorem.
-
t h e p a r t i c u l a r im-
bounds i n Roth's
(1967) i s d i s r e g a r d e d , t h e l o g i c a l
l i t e r a t u r e t e n d s t o e r r i n t h e o p p o s i t e d i r e c t i o n ; going a f t e r wholesale cons t r u c t i v i z a t i o n , and i g n o r i n g t h e need for d i s c r e t i o n , shown by t h e p r o v i s o above.
This a p p l i e s g e n e r a l l y t o v a r i o u s schemes o f s o c a l l e d f u n c t i o n a l i n t e r -
p r e t a t i o n s , b e f o r e and a f t e r G8del (1958). mathematics a r e i n t e r p r e t e d by also: ively).
A
follows from A '
A'
to
A'
There theorems A o f some branch of A'
can b e proved c o n s t r u c t i v e l y , b u t
q u i t e t r i v i a l l y (though g e n e r a l l y not c o n s t r u c t -
The l a t t e r i s b e g u i l i n g :
t h e passage from A
s . t.
.
viewed i n o r d i n a r y t e r m s , nothing i s l o s t by
However, except i n very s p e c i a l c a s e s ,
not
enough i s gained t o make t h e passage worthwhile f o r mainstream c o n s t r u c t i v e mathematics.
The next s e c t i o n c o n t a i n s examples o f such e x c e p t i o n s , b u t without
Constructive logic versus algebraization
229
a t a l l (which, by t h e l a s t s e c t i o n , i s unrewarding even
using c o n s t r u c t i v e a s an i n t e r m e d i a t e s t e p ) .
METAMATHEKATICS OF CLASSICAL SYSTEMS The s u c c e s s f u l exceptions J u s t mentioned belong t o a, by now w e l l known, v a r i a n t of H i l b e r t ' s program p r o v i d i n g c o n s t r u c t i v e ( f u n c t i o n a l ) i n t e r p r e t a t i o n s o f
formally non-constructive proofs.
Readers a r e assumed t o b e f a m i l i a r w i t h t h e
e a s i e s t example o f t h i s v a r i a n t , t h e s o c a l l e d no-counter example-interpretation, n.c.i.
The main purpose o f t h i s s e c t i o n i s t o give away some t r i c k s
for short.
of t h e t r a d e which a r e needed f o r an e f f i c i e n t u s e of t h e method i n p r a c t i c e .
'
( i ) The v a r i a n t uses techniques o r i g i n a l l y developed Reminders. f o r H i l b e r t ' s program, b u t w i t h a t o t a l change o f d i r e c t i o n . S p e c i f i c a l l y , f o r t h e o r i g i n a l program p r o o f s o f theorems were r e l e v a n t , w h i l e h e r e such theorems (and proofs o f IIO-lemmas) a r e ignored completely; f o r more d e t a i l , c f . r e c e n t p u h c a t i o n s by one o f us, f o r example, on pp. 131-163 o f Suppes (1981) o r i n viewed i n t h e forthcoming Herbrand volume. ( i i ) The n.c.i. = b e terms o f c o n s t r u c t i v e l o g i c by use o f G8del (1958) which came up a l r e a d y i n t h e l a s t s e c t i o n . G e n e r a l l y , i n a r i t h m e t i c o r pure l o g i c , t h e same negations o f prenex formulas can b e proved c l a s s i c a l l y or i n t u i t i o n i s t i c a l l y . I f A* i s prenex and c l a s s i c a l l y e q u i v a l e n t t o 1 A , t h e n t h e n.c.i. o f A reduces t o t h e i n t e r p r e t a t i o n o f -A* i n G8del (1958). But, as f i r s t shown i n Shoenfield (1967), t h i s view i s i n e f f i c i e n t s i n c e G8del (1958) i s v e r y simply adapted t o c l a s s i c a l systems. A s it happens, t h e pedagogic v a l u e o f t h i s a d a p t a t i o n can be documented by an ( i m p r e s s i v e ) example. G i r a r d had seen v a r i o u s e x p o s i t i o n s which followed a d e l (1958) c l o s e l y , b e f o r e r e a d i n g S h o e n f i e l d (1967), b u t l e a r n t t o use t h e i d e a s e f ( i i i ) Another d e c e p t i v e a t t r a c t i o n f e c t i v e l y only from t h e l a t t e r . i s i t s g e n e r a l i t y : by o f G8del ( 1 9 5 8 ) , compared t o t h e n.c.i., using f u n c t i o n s o f all f i n i t e t y p e s , t h e formal scheme provides a (To b e r e c u r s i v e i n t e r p r e t a t i o n o f second o r d e r a r i t h m e t i c t o o . p r e c i s e , t h i s does not apply t o t h e very s p e c i a l c l a s s o f c o n s t r u c t i v e rules d e s c r i b e d i n G8del (1958) b u t t o t h e more n a t u r a l c l a s s o f r e c u r s i v e l y continuous o r countable f u n c t i o n s . ) However, i n p r a c t i c e , h i g h e r t y p e s a r e not convenient f o r unwinding a t a l l ; reminiscent o f i t e r a t e d i m p l i c a t i o n s , which, according t o f o o t n o t e 2 on p. 109 o f K r e i s e l (1953), a r e l i a b l e t o make one's head s p i n . Worse s t i l l : when comprehension i s used i n a n e s s e n t i a l way ( t o prove a I@ theorem, n o t merely some I@ lemmas) t h e c o n s t r u c t i v e c o n t e n t i s t o o marginal t o be worth e x t r a c t i n g a t all, i n accordance w i t h t h e warning a t t h e end o f t h e l a s t s e c t i o n . (a)
The l i t e r a t u r e c o n t a i n s b o t h
Learning t o unwind by use o f t h e n . c . i .
formal metamathematical arguments, a p p l i e d t o f u l l y formalized p r o o f s , and f a i r l y e l a b o r a t e unwindings o f i n f o r m a l arguments which experienced mathematici a n s had found p a r t i c u l a r l y h a r d t o handle. be pedagogically u s e f u l . Example.
(*)
For
0
5
c < 1
Neither o f t h e s e extremes seems t o
We have had some s u c c e s s w i t h t h e following
, prove
the
Il02-formula
Vk 3n ( c n < k ' )
,
G. KREISEL, A. MACINTYRE
230 where
k
and
n
range o v e r p o s i t i v e i n t e g e r s , b y means o f t h e s t e p s ( i ) ,( i i ) ,
NB.
( i i i ' ) ,( i v ) below.
(m
n) (0
5
a
bounded, say = cn
a
(iii) i f
en
since
0
-t
cm 5 c " ) .
( i ) sequences
( i i )f o r
( * ) i s t r i v i a l l y equivalent t o :
converge, if t h e y a r e monotone, s a y , d e c r e a s i n g , and
5 an -<
0
1 ;
, ( i )a p p l i e s ;
i s t h e l i m i t of
F
,F =
{cn}
CF, hence
(l-c)T= 0
,
and s o
F = 0;
a l t e r n a t i v e l y , working w i t h subsequences i n s t e a d o f limits: ( i i i ' ) {en+'}
i s a subsequence o f
{c"} ; s o , by ( i i ) , c n ( l - c )
Vh 3n [ c n ( l - c ) < h - l ] (iv)
If, i n (iii), h
Now, t h e n . c . i .
1. k (l-c)-'
which i s s a t i s f i e d by t h e f u n c t i o n a l the least
a
operat?on: en of
II
u(i)
0 < a -a
P
m
, and
,
e n < k-'
, and
so ( * ) .
< k-l) i s
II
: (k,p)P p
, where
p
-+
0 < au(i+l)
< k-l
, and
is
H
i
cn+l
i n ( i i i ' )i s t h e successor, say
i s , by ( i v ) , t h e s m a l l e s t i n t e g e r
2 k(l-c)-'
U
.
.
The o t h e r argument
This y i e l d s a bound
for ( * ) : (3n
5
II[k(l-c)-',o])
(en < k-l)
.
u(j) = ~'(1)
, actually
< a k ( n o t only < k ) . When t h i s i s a p p l i e d 1 = cn , by ( i i ) ,t.hen t h e f u n c t i o n u which corresponds t o t h e s h i f t
There i s such an to:
i < k : u(i+l)
-t
0
.
cn(l-c) < hml
and
of ( i ) ,Vk Bp 3 m ( m > p
-+
.
Comments. ( a ) By an easy c a l c u l a t i o n t h i s bound i s not o p t i m a l ; Put d i f f e r e n t l y : f o r example, it i s o f o r d e r k i n s t e a d o f l o g k ( B ) t h e bound i s n o t a p r o p e r t y of t h e theorem ( * ) , b u t o f t h e p a r t i c u l a r proof above: ( i ) ,( i i ) ,( i i i l ) , ( i v ) . ( y ) Optimal bounds cannot b e expected s i n c e II a p p l i e s t o a r b i t r a r y monotone sequences, ( 6 ) Conversely, (y) i s not d e c i s i v e and n o t o d y t o : an = cn s i n c e bounds a r e c e r t a i n l y n o t t h e sum t o t a l o f a l l t h a t one wants t o know about (*I! R e a l i s t i c a l l y , optimal bounds from ( * ) a r e e a s i e r t o come by t h a n ( i ) ,l e t a l o n e any r e l a t i o n between ( * ) and ( i ) . More g e n e r a l l y , ( E ) proofs provide much more knowledge t h a n t h e v a l i d i t y , c o n s t r u c t i v e o r otherwise, o f t h e theorem proved; b u t v a l i d i t y i s t h e p a r t of t h i s knowledge which i s e a s i e s t t o s t a t e ; c f . t h e n e x t s e c t i o n f o r more d e t a i l s on such a d d i t i o n a l knowledge NB. Unwind( o v e r and above t h e v a l i d i t y of t h e theorem proved). i n g makes only a q u i t e s p e c i a l kind of t h a t knowledge e x p l i c i t . For t h i s purpose t h e r e i s a f a m i l i a r a l t e r n a t i v e t o t h e n . c . i . which i s t h e s u b j e c t o f ( b ) below.
.
.
Warning. Though t h e n.c.i. i s e s t a b l i s h e d - and t h u s t h e n o t i o n o f 'unwinding' d e f i n e d - f o r p r o o f s o f a r b i t r a r y formulas, i t s p r i n c i p a l uses come from $ formulas proved by means o f l o g i c a l l y more comp l i c a t e d lemmas, l i k e ( i )i n t h e proof above; f o r an exception, c f . c e r t a i n Z g formulas d i s c u s s e d by one o f us i n t h e Herbrand volume i n
23 1
Constructive logic versus algebraization t h e s p e c i a l c a s e where t h e f u n c t i o n s used i n t h e n.c.i. appropriate arithmetic conditions.
satis0
B i b l i o g r a p h i c a l remark. The n.c.i. of IIB formulas i s s u f f i c i e n t t o r e p l a c e t h e t r a d i t i o n a l h e a r t s e a r c h i n g concerning a s e n s i b l e cons t r u c t i v e meaning o f i m p l i c a t i o n s w i t h u n i v e r s a l premisses (and IIO2 c o n c l u s i o n s ) , f o r example, on pp. 358-361, e s p e c i a l l y f o o t n o t e 1 on p. 361, o f Hilbert-Bernays, v o l . 2 (second e d i t i o n ) . Since c l a s s i c a l l o g i c i s considered, Vx A + 3y B , w i t h parameters p , reduces t o a IIQ formula. Unwinding a proof provides bounds x yp s . t . P '
(Vx 5 xp)A
+
(3y
5 YP )B
.
I n s h o r t , one simply has a s t r o n g e r p r o p o s i t i o n ( b y bounding i n t h e premise). (b)
x
Functional i n t e r p r e t a t i o n s versus c u t e l i m i n a t i o n (and i t s v a r i a n t s , such
as n o r m a l i z a t i o n ) : needs of unwinding.
a c o n f l i c t between ' t h e o r e t i c a l ' e x p o s i t i o n s and p r a c t i c a l Generally speaking, it i s easy t o pass from c u t - f r e e
proofs t o i n t e r p r e t a t i o n s s i n c e t h e l a t t e r , l i k e Kleene's r e c u r s i v e r e a l i z a t i o n s , suppress many d e t a i l s of p r o o f s .
Thus if b o t h c u t e l i m i n a t i o n and i n t e r -
p r e t a t i o n s a r e t o be p r e s e n t e d , it i s most economical t o s t a r t w i t h t h e former; c f . Schwichtenberg
(1977). But i n p r a c t i c e , e s p e c i a l l y when o p e r a t i n g on
sketches o f p r o o f s , c u t e l i m i n a t i o n i s q u i t e inconvenient s i n c e it i s hard t o check whether o r not some proposed c u t - f r e e proof i s anything l i k e t h e normal form o f t h e given s k e t c h .
The reason i s t h a t c u t e l i m i n a t i o n r e b u i l d s a
given p r o o f , and key theorems, which a r e l o g i c a l l y more complicated t h a n t h e end r e s u l t , g e t l o s t i n t h e process.
In contrast, i n functional interpretations
t h e ( f u n c t i o n a l ) equations corresponding t o key theorems remain prominent, w i t h r e l a t i v e l y s h o r t l o g i c a l i n f e r e n c e s b e i n g r e p l a c e d by a s e r i e s o f d e f i n i t i o n s of f u n c t i o n a l s and v e r i f i c a t i o n s o f t h e r e l e v a n t i d e n t i t i e s .
The d i f f e r e n c e i s
s t r i k i n g l y i l l u s t r a t e d i n G i r a r d ' s unwinding o f t h e proof by t o p o l o g i c a l dynamics o f van d e r Waerden's theorem, s i n c e c u t e l i m i n a t i o n i s used t o unwind some o f t h e s t e p s , t h e n . c . i .
for others.
I n c i d e n t a l l y , h i s work a l s o e x h i b i t s
t h e phenomenon, a l r e a d y mentioned i n ( a ) o f t h e f i r s t s e c t i o n , how mathematica l l y t r i v i a l changes can a f f e c t d r a m a t i c a l l y t h e unwinding process and even t h e r e s u l t i n g bounds; c f . p. 1 5 3 o f Suppes (1981).
This i s i n accordance w i t h com-
ment ( y ) i n ( a ) above i f , by o r d i n a r y mathematical s t a n d a r d s , t h e b u s i n e s s of unwinding c o n s t i t u t e s a t r i v i a l a s p e c t o f t h e proof i n q u e s t i o n . p o s i t i v e s i d e of t h e phenomenon i s t h i s :
NB.
The
once one has l e a r n t t o s p o t s u i t a b l e
t r i v i a l changes ( i n informal p r o o f s ) t h e b u s i n e s s becomes more l u c r a t i v e : a b e t t e r r a t i o of r e s u l t t o e f f o r t .
G. KREISEL, A. MACINTYRE
232 APPLYING THE N . C . I . :
REASSURANCES
Experience shows t h a t t h e r e a r e at l e a s t two k i n d s of o b s t a c l e s t o applying t h e n.c.i.
o r related interpretations i n practice.
One i s t h e i d e a t h a t p r o o f s ,
i n c o n t r a s t t o theorems,are h o p e l e s s l y e l u s i v e o b j e c t s , n o t amenable t o any t h e o r e t i c a l processing a t a l l .
I n terms of
a ( E ) o f t h e l a s t s e c t i o n , t h e most
t h a t could be hoped f o r i s t o paraphrase a d d i t i o n a l knowledge c o n t a i n e d i n a proof i n terms o f g e n e r a l i z a t i o n s o f t h e theorem proved, a s i n ( a ) o r d i n a r y axiomatic mathematics, and ( b ) model t h e o r y , f o r example, o f f i r s t o r d e r axiom systems.
The i d e a , s u r e l y v a l i d f o r t h e b u l k o f q u e s t i o n s about proofs t h a t
occur t o us n a t u r a l l y , overlooks t h e p o s s i b i l i t y t h a t t h e very s p e c i a l p r o j e c t o f unwinding may be an exception (and obvious p a r a l l e l s i n o t h e r domains; f o r example, ' h e r o i c ' p r o g r e s s w a s needed t o answer such n a t u r a l q u e s t i o n s as: Why i s g l a s s t r a n s p a r e n t ? ) needed t o apply t h e n . c . i . metatheorems about it.
The second o b s t a c l e i s t h a t a d d i t i o n a l s k i l l s a r e e f f e c t i v e l y , over and above knowledge o f g e n e r a l
L i t t l e i s s a i d about t h o s e s k i l l s : t h e thought of them
c r e a t e s a c e r t a i n malaise. The p r i n c i p a l purpose o f t h i s s e c t i o n i s t o d i s p e l t h e malaise,emphasizing
( a ) t h o s e a s p e c t s of axiomatic a n a l y s i s which make it q u i t e a k i n t o a t h e o r y o f proofs i n t h e n a t u r a l s e n s e o f t h e word, and ( b ) t h o s e s t e p s i n a p p l i c a t i o n s of model t h e o r y which i n v o l v e digging i n t o p r o o f s , and not o n l y l o o k i n g a t t h e form o f t h e theorem proved.
It w i l l be apparent t h a t h e r e t o o a d d i t i o n a l s k i l l s
a r e needed ( o v e r and above t h e g e n e r a l scheme o f axiomatic a n a l y s i s o r g e n e r a l metatheorems about, say, u l t r a p r o d u c t s ) w i t h obvious p a r a l l e l s i n a l l t h e o r e t i c a l schemes, i n n a t u r a l s c i e n c e and technology; f o r example, t h e t h e o r y i t s e l f does not t e l l you whether it i s r e l e v a n t t o a g i v e n c o n c r e t e s i t u a t i o n . These f a c t s a r e r e a s s u r i n g because ( a ) and ( b ) have proved s u c c e s s f u l d e s p i t e t h e need f o r t h o s e a d d i t i o n a l s k i l l s s i n c e t h e y a r e i n f a c t a v a i l a b l e ; and d e s p i t e manuals on exact methodology which l e a v e us unprepared f o r t h a t need (and f o r t h e e x i s t e n c e and r e l i a b i l i t y o f t h e a d d i t i o n a l s k i l l s at is s ue).
( a ) Axiomatic a n a l y s i s :
neglected aspects.
Instead o f seeing t h e significance
o f an axiomatic p r e s e n t a t i o n p r i m a r i l y i n t h e g r e a t e r g e n e r a l i t y o f t h e theorem proved, l e t a l o n e i n some dubious d o c t r i n e o f g r e a t e r ' p r e c i s i o n , ' it as a s t r a t e g y b o t h f o r f i n d i n g and remembering proofs. Cartan
we recognize
Elementary example:
(1967),a f i r s t y e a r course i n c a l c u l u s , has t h e s u b t i t l e : d i f f e r e n t i a l
c a l c u l u s i n Banach spaces.
This means t h a t , f o r t h e p a r t of c a l c u l u s covered,
only few
a r e needed, v i z . t h o s e o f Banach s p a c e s , an e f -
p r o p e r t i e s o f lfi
f i c i e n t summary o f t h e key s t e p s i n t h e p r o o f s of t h e t e x t .
A t t h e same time
t h i s c o n s t i t u t e s a proof s t r a t e g y s i n c e one can c o n f i n e o n e s e l f t o u s i n g only those properties.
More g e n e r a l l y , r e l a t i v e l y few p r o p e r t i e s , Bourbaki's few,
s o c a l l e d b a s i c s t r u c t u r e s , have been found adequate f o r similar s t r a t e g i e s i n a very broad domain o f mathematics.
The need f o r ' a d d i t i o n a l s k i l l s ' i s e v i d e n t
Constructive logic Venus algebraization
233
s i n c e t h e proper choice of terms i n which some given proof o r branch o f mathematics i s t o be g e n e r a l i z e d , i s n o t o r i o u s l y d e l i c a t e .
For an understanding o f
t h e a c t u a l p o s s i b i l i t i e s o f mathematical reasoning t h e f a c t t h a t t h e s e s k i l l s a r e a v a i l a b l e i s more d i r e c t l y r e l e v a n t t h a n d i s c o v e r i e s , f o r example, i n a r t i f i c i a l i n t e l l i g e n c e which t r i e s t o t r e a t such s k i l l s a s ' b l a c k boxes' t o be replaced by e a s i l y mechanized processes with s i m i l a r end r e s u l t s . Comments. ( i ) The use of axiomatic a n a l y s i s a s a proof s t r a t e g y does not seem t o be w e l l known t o people w r i t i n g on h e u r i s t i c s , l i k e Polya, nor t o t h o s e i n t h e education b u s i n e s s i f pp. 170-171 of Suppes (1981)a r e r e p r e s e n t a t i v e . The l a t t e r i l l u s t r a t e , very convincingly, a t l e a s t two important consequences of t h a t ignorance. F i r s t , t h e s t a n d a r d s o f t h e 'new' p r o p o s a l s for proof s t r a t egies a r e d e s p e r a t e l y low, a s so o f t e n when one i s under t h e i l l u s i o n t h a t nobody e l s e has e v e r thought about o n e ' s t o p i c . More s p e c i f i c a l l y , on p. 170 axiomatic s e t t h e o r y i n t h e s t y l e o f t h e f i f t i e s i s p r e s e n t e d as i f it were even remotely t y p i c a l o f axiomatic mathematics although i n f a c t it i s a parody of t h e l a t t e r . What makes t h e s e ( m i s t a k e n ) views and much more l o c . c i t . o f genuine i n t e r e s t f o r t h e time b e i n g i s t h a t t h e same i d e a s a r e widely h e l d among l o g i c i a n s , b u t r a r e l y a r t i c u l a t e d s o i n n o c e n t l y . ( i i )N a t u r a l l y , t h e r e i s p l e n t y of r e l e v a n t l i t e r a t u r e on t h e m a t t e r , p a r t i c u l a r l y i n r e c e n t y e a r s ; f o r example, or t h o s e h i s t o r i e s where (some) survey l e c t u r e s and reviews i n t h e B u l l . A.M.S. t h e author l i k e s t o i d e n t i f y himself w i t h t h e hero (and so has a l o p s i d e d h i s t o r i c a l view), b u t happens t o have something s i g n i f i c a n t t o say about t h e (iii)P. 170 of Suppes (1981) mathematical c o n t e n t o f t h e h e r o ' s thoughts. explains why ( i i )has not become widely known, at l e a s t t o t h o s e accustomed t o t h e e x p o s i t o r y i d e a l s o f t h e s o c i a l s c i e n c e s o r o f academic philosophy d e s c r i b e d l o c . c i t . as ' s o p h i s t i c a t e d and s u s t a i n e d d i s c u s s i o n s , ' and by o t h e r s as pret e n t i o u s and longwinded d i s q u i s i t i o n s . Be t h a t as it may,such r e a d e r s w i l l simply not n o t i c e t h e r e l e v a n t p o i n t s i n ( i i ) ,formulated w i t h extreme d i s c r e t i o n a s i f t h e a u t h o r s were a f r a i d o f a l l t h e wrong people clapping at t h e wrong p l a c e s (as S a l i n g e r p u t it i n The Catcher i n t h e Rye). I n c i d e n t a l l y , p. 170 l o c . c i t . a l s o shows t h a t t h i s danger e x i s t s . (b)
Model t h e o r y : a c l o s e r look at i t s a p p l i c a t i o n s .
No doubt t h e r e a r e some
simple examples which i n v o l v e no more t h a n a p e r f e c t l y obvious s u b s t i t u t i o n i n some g e n e r a l metatheorem.
But i n most s u c c e s s f u l a p p l i c a t i o n s , g e n e r a l know-
ledge o f t h e a r e a , and s k i l l f u l d i s s e c t i o n o f informal p r o o f s were needed i n addition. Reminders.
( i ) Key p r o p e r t i e s o f a given informal proof a r e o f t e n formulated
i n higher o r d e r form, and r e c o n d i t e mathematical arguments =mentioned
in the
g i v e n proof a r e used t o f i n d an e q u i v a l e n t s e t of f i r s t o r d e r p r o p e r t i e s ; c f . group t h e o r e t i c a l arguments i n t h e a n a l y s i s o f Gromov's theorem by van den Dries and Wilkie ( A ) .
( i i ) Often it i s n e c e s s a r y t o modify a given proof ( i f model
t h e o r y i s a p p l i e d t o c r u c i a l lemmas) o r even t h e theorem i t s e l f i f p r o p e r t i e s which a r e demonstrably not of f i r s t o r d e r are involved.
An example occurs i n
t h e next s e c t i o n i n connection w i t h sums of s q u a r e s where it was necessary t o guess t h a t A r t i n ' s theorem on archimedean o r d e r i n g s , n o t a f i r s t o r d e r n o t i o n , could b e g e n e r a l i z e d (by modifying t h e old d e f i n i t i o n of: p o s i t i v e semi-definite). (iii) Depending on p e r s o n a l experience and i n t e r e s t r e a d e r s may wish t o r e c a l l now or l a t e r
-
analogues o u t s i d e mathematics, t h a t i s , t h e a d d i t i o n a l s k i l l s
needed f o r an e f f e c t i v e use o f t h e o r y beyond knowledge o f i t s formal p r o p e r t i e s .
-
234
G. KREISEL, A. MACINTYRE
Additional reassurances f o r l o g i c a l l y fastidious readers repelledby current proof theory because of i t s (continued, if t a c i t ) pretensions ; above a l l , the 'universal' scheme of calibrating formal theories by socalled canonical orderings, used originally by Gentzen i n t h e p a r t i c u l a r case of formal arithmetic. The whole subject seems suspect if it 'permits' t h i s s o r t of thing. F o r reassurance: there w a s a comparable episode i n t h e model theory of t h e f i f t i e s which, l i k e many f a i l u r e s of the past, i s (barely mentioned i n h i s t o r i e s , and) by now halfforgotten: T a r s k i ' s theory of theories, r e l a t i n g t h e syntactic form of axioms t o algebraic properties of t h e corresponding class of models. One o f us even toyed with the obvious analogue: relations between 'logical' r e f l e c t i o n principles and 'mathematical' t r a n s f i n i t e induction. - Ironically, there were equally pedantic discussions about the exact meaning of 'algebraic' and of 'canonical' (definitions Of Orderings Of the order type involved) ; i r o n i c since the r e s u l t s obtained were patently pointless i n most p a r t i c u l a r cases where there was no doubt about the meaning a t a l l . - The episode i s reassuring i n our v i e w . Quite soon sensible people dropped t h i s s o r t of caricature of a genuinely general theory, and retained a few special cases of special i n t e r e s t ; c f . t h e recent use i n van den Dries ( A ) of Lyndon's interpolation theorem, o r i g i n a l l y intended f o r Tarski's theory of theories. (Perhaps some o f t h o s e people got good practice with ultraproducts when using them t o establish algebraic equival e n t s t o t h e notion of f i r s t order formula.)
-
Broad conclusions on applying t h e n.c.i.
The principal additional s k i l l s needed
a r e , of course, t o spot informal proofs f o r which t h e n.c.i.
i s rewarding at
all, and, more s p e c i f i c a l l y , t o spot t h e , often small, parts of such proofs
which need attention.
Also one w i l l look f o r t h e kind o f trivial change i n t h e
proof, already mentioned ( f o r example, i n ( b ) i n t h e l a s t section) which can greatly simplify t h e use of t h e n.c.i. Another snag ( t o avoid): Though the n.c.i. i s not as 'universal' as t h e business of calibration above, i t i s not p a r t i c u l a r l y geared t o subject matter e i t h e r . Yet it aims t o extract bounds which a r e useful only i f they depend on approp r i a t e parameters. The proper choice o f parameters i s known t o be almost as delicate as t h a t of generalizations i n ( a ) above. Moreover, even f o r a given s u i t a b l e choice the r e l a t i v e weight of parameters i s usually of greater i n t e r e s t than t h e location o f t h e bounds i n some 'logical' hierarchy as a function of a l l t h e parameters i n sight; c f . the parameters c and k i n ( a ) of t h e l a s t section, or t h e number of variables and degree o f polynomials i n ( a ) of t h e next. Consequently, one cannot expect general metatheorems ( i n terms of l o g i c a l classific&ions) which a r e comparably useful t o t h e kind of mathematics i n t h e next section or t h e Appendix. However, once the unwinding by means of the n.c.i. has actually been carried out, t h e s i g n i f i c a n t parameters may s t a r e one i n t h e face; cf. footnote 2 on p. 139 of Suppes (1981) where lower bounds on L ( 1 , x ) are r e l a t e d t o t h e location of zeros o f t h e c - h c t i o n , though the l a t t e r a r e Reminder. Often t h e use of not mentioned i n t h e theorem s t a t e d origindlly. general theory i s even less d i r e c t , requiring a completely fresh start t o work out concretely a r e s u l t o f t h e form assured by t h e theory, f o r example, i n some cases of quantifier elimination.
-
D i a e s s i o n on deceptive terminology: proof theory and model theory. A s these words are used i n l o g i c , they do l i t t l e towards t h e aims ordinarily associated with them: finding proofs of given theorems, and models of some given object, say, t h e r e a l s . (NB. Ordinarily, one speaks of models of objects, retaining the e s s e n t i a l features of t h e l a t t e r , not: models of axioms expressing those features.) Logical proof theory t e l l s us what we gain i f some given proof happens t o have a r e s t r i c t e d syntactic form; f o r example, f o r unwinding i f a l l t h e heavy machinery i s used f o r l a m a s . Logical model theory s p e l l s out t h e gains, f o r example, f o r ultraproduct manipulations, i f t h e choice of modelling, t h e axioms, can be defined by f i r s t order formulas ( o r refinements such as
23 5
Constructive logic versus algebraization
p o s i t i v e o n e s ) . Without exaggeration: axiomatic a n a l y s i s p r a c t i s e d i n mathematics i s much c l o s e r t o t h e o r d i n a r y meanings o f 'proof t h e o r y ' and 'model t h e o r y ' as a l r e a d y explained above i n connection w i t h proof s t r a t e g i e s i m p l i c i t i n axiomatic p r e s e n t a t i o n s , f o r example, i n Cartan (1967). S i m i l a r l y , t h e l a t t e r would be s a i d t o propose t h e use o f v a r i o u s Banach spaces a s models o f t h e r e a l s f o r t h e purposes considered t h e r e . Other d e c e p t i v e terminology i n t h e l o g i c a l l i t e r a t u r e w i l l come up i n b ( a ) i n t h e next s e c t i o n on 'computation theory. ALGEBEUIZATION: REMINDERS AND SOME SURPRISES Algebraization
-
o f theorems, not n e c e s s a r i l y o f proofs!
ometry o r topology, logic
-
is
one o f
emphasized i n t h e l a s t s e c t i o n .
structive part
-
as i n a l g e b r a i c ge-
t h o s e g e n e r a l mathematical s t r a t e g i e s
o f mathematics.
-
outside
It i s p a r t i c u l a r l y u s e f u l i n t h e con-
Other s t r a t e g i e s which w i l l come up i n p a s s i n g
below a r e known from t h e ( d i s c r e e t ) mottoes: e n r i c h , r e s p . e n l a r g e your category. Reminders (from t h e i n t r o d u c t i o n ) . Once g e n e r a l mathematical s t r a t e g i e s a r e recognized a s b e i n g i n t h e running a t a l l , as comparable t o formal metatheorems, they w i l l e a s i l y come t o t h e r e a d e r ' s mind; n a t u r a l l y , s o m e background i n math(Otherwise one cannot hope - nor, probably, ematical reasoning i s assumed. even want - t o have a balanced view of mathematics, a philosophy, a s always, i n t h e sense o f Schopenhauer.) S i m i l a r l y , t h e s t y l e of e x p o s i t i o n below w i l l not be d i c t a t e d by any p a r t i c u l a r methodology, b u t simply by our purpose: t o convey, e f f i c i e n t l y and r e l i a b l y , where and how a l g e b r a i z a t i o n i s r e l e v a n t , f o r example, by memorable examples. This i s i n keeping w i t h t h e s t r e s s on ' a d d i t i o n a l s k i l l s ' ( a l s o i n t h e l a s t s e c t i o n ) : t h o s e needed f o r a p p l y i n g exact g e n e r a l p r i n c i p l e s s u c c e s s f u l l y seem q u i t e s i m i l a r t o t h o s e involved i n s e e i n g such p r i n c i p l e s i n a particular instance. Our two p r i n c i p a l examples a r e : ( a ) A r t i n ' s work on sums o f s q u a r e s , almost at t h e dawn o f modern a l g e b r a i z a t i o n , b u t s t i l l of i n t e r e s t , and ( b ) t h e e v o l u t i o n of t o o l s from group t h e o r y and a l g e b r a i c geometry o v e r t h e l a s t h a l f century t o give c o n s t r u c t i v e v e r s i o n s of v a r i o u s i m p l i c a t i o n s between f i n i t e n e s s theorems i n number t h e o r y needed f o r S i e g e l ' s theorem on d i o p h a n t i n e equations. amples i l l u s t r a t e a remarkable v a r i e t y o f g e n e r a l p o i n t s . Reminders.
Both ex-
( i ) Algebra provides computable s u b s t i t u t e s f o r b r u t a l completions
and c o m p a c t i f i c a t i o n s i n t r o d u c e d
-
by another g e n e r a l s t r a t e g y !
-
t o apply
t o p o l o g i c a l t o o l s ( l i m i t arguments, d u a l i t y theorems); u s u a l l y , by f i n d i n g minimal c l o s u r e c o n d i t i o n s , as i n t h e passage from Dedekind c u t s i n lR
t o real
c l o s u r e ( t h e a l g e b r a i c r e a l numbers, i n semi-algebraic topology) o r i n henseli z a t i o n o f complete n o e t h e r i a n r i n g s ; c f . a l s o b ( a ) below on t h e choice o f suitable presentations.
( i i ) More g e n e r a l l y , a s i m i l a r t r a n s f e r o f n o t i o n s t o
t h a t i n ( i ) p e r m i t s t h e a l g e b r a i c ( o r t o p o l o g i c a l ) i n t e r p r e t a t i o n o f computat i o n s ; f o r example, n o t i o n s from t h e t h e o r y o f ( f i n i t e ) f i e l d s i n t h e c a s e o f computations
mod p
c f . Chapter 2 o f
( f o r primes
[MI).
p
,a
stand-by i n t r a d i t i o n a l number t h e o r y ;
S t r i c t l y speaking, t h e a l g e b r a o f polynomials could b e
c i t e d h e r e , and i t s use f o r s t u d y i n g continuous and e s p e c i a l l y a n a l y t i c functions.
But a l l t h i s i s so p e r v a s i v e t h a t it goes a g a i n s t t h e g r a i n t o t h i n k of
it a s a p a r t i c u l a r s t r a t e g y .
(iii) A s f o r l i t e r a t u r e c o n t a i n i n g advice on t h e
G . KREISEL, A. MACINTYRE
236
good use o f ( i )and ( i i ) ,it i s b e s t t o look a t e s s a y reviews or l e c t u r e s t o
(1966), r a t h e r t h a n a t t e x t s ; c f . a l s o a ( i i i ) of
l e a r n e d s o c i e t i e s , l i k e Atiyah the last section.
(iv)
A s f o r s u r p r i s e s , probably t h e most famous r e c e n t
example i s t h e success o f a l g e b r a i c geometry f o r t r e a t i n g t h e e q u a t i o n s of Yang-
M i l l s though t h e p o s s i b i l i t y of something of t h i s s o r t i s q u i t e i n l i n e w i t h , say, pp. 66-68 of Atiyah (1966).
Again, l o g i c i a n s a r e sometimes s u r p r i s e d how
much high-brow a l g e b r a i s o c c a s i o n a l l y needed t o s o l v e an innocent looking dec i s i o n problem; c f . Grunewald and Segal (1979) who e x p l o i t a g e n e r a l s t r u c t u r e t h e o r y o f a r i t h m e t i c groups, presumably not developed p r i m a r i l y for a l g o r i t h m i c But t h e n , a f t e r a l l , knowing t h e a l g e b r a i c s t r u c t u r e of t h e ' s o l u t i o n
purposes.
-
Less t r i v i a l l y , for c o n s t r u c t i v e
refinements it pays t o e l i m i n a t e non-algebraic
c o n d i t i o n s l i k e well-foundedness
s e t ' should h e l p one decide i f it i s empty.
o r archimedean o r d e r i n g s from p r o o f s (about o b j e c t s which s a t i s f y t h e s e conFor t h e n one i s not even tempted t o d e f i n e s o l u t i o n s by use of t h o s e
ditions).
c o n d i t i o n s ; f o r example, d e f i n i t i o n s by r e c u r s i o n o r a r b i t r a r y f i n i t e decompos i t i o n s l e a d , almost i n e v i t a b l y , t o complicated s o l u t i o n s ; s p e c i f i c a l l y , funct i o n s d e f i n e d by r e c u r s i o n w i l l be h a r d t o compute a t arguments of h i g h rank.
-
F i n a l l y , f o r a s u r p r i s e on a q u i t e s u p e r f i c i a l l e v e l , r e c a l l t h e s u b t i t l e o f Cartan (1967), a l r e a d y d i s c u s s e d i n ( a ) of t h e l a s t s e c t i o n .
Incidentally,
even v i s u a l l y t h e t e x t has an a l g e b r a i c look s i n c e it c o n s i s t s o f e q u a t i o n s w i t h b u t few o p e r a t i o n s i n p l a c e of t h e usual i n e q u a l i t i e s and t h e l o g i c a l
€,6
Warning a g a i n s t r e g a r d i n g t h i s a s p e c t as a s p e c i a l c a s e of t h e t r i v -
symbolism.
i a l i t y t h a t t h e l o g i c a l symbolism can always be e l i m i n a t e d by i n t r o d u c i n g s u f f i c i e n t l y many Skolem o p e r a t i o n s .
This overlooks two genuine d i s c o v e r i e s .
Few
such o p e r a t i o n s t u r n e d o u t t o be enough f o r t h e whole c o u r s e , without any p a r t i c u l a r l y a r t i f i c i a l r e s t r i c t i o n on t h e m a t e r i a l , and t h e o p e r a t i o n s chosen have a d d i t i o n a l (mathematical, f o r example, c o n t i n u i t y ) p r o p e r t i e s r e l e v a n t t o t h e subject.
NB.
The e l i m i n a b i l i t y r e f e r r e d t o i s t r i v i a l not because it i s easy
t o establish but
-
t o r e p e a t a w e l l worn p h r a s e
away from t h o s e d i s c o v e r i e s .
-
because it draws a t t e n t i o n
A r e l a t e d m a t t e r comes up i n t h e next paragraph.
A l o E i c a l i s s u e concerning a l g e b r a i z a t i o n , when r e l a t i o n s
R
a r e defined on some
'complicated' o b j e c t , proved t o s a t i s f y ' s i m p l e ' a l g e b r a i c l a w s , and used t o answer q u e s t i o n s about t h a t o b j e c t from experience w i t h o t h e r s t r u c t u r e s obeying those l a w s .
Logic
could come
i n i f those proofs required
strong logical, i n particular, set-theoretical principles.
-
or simply used!
-
This i s not so i n
t h e examples ( a ) and ( b ) below. Reminders. ( i ) The most famous successes o f a l g e b r a i z a t i o n - i n v o l v i n g embeddings o f ZZ i n ordered, a l g e b r a i c a l l y c l o s e d o r p-adic f i e l d s , and t h e l i k e have nothing t o do w i t h t h e p o s s i b i l i t y a t i s s u e . The choice between t h o s e f i e l d s i s c r i t i c a l ; b u t t h e i r formal t h e o r i e s a r e s o elementary t h a t t h e y a r e a l l lumped t o g e t h e r a t t h e lowest l e v e l o f any p r o o f - t h e o r e t i c c l a s s i f i c a t i o n (remotely l i k e t h o s e considered i n t h e c u r r e n t l i t e r a t u r e ) . One reason for b r i n g i n g up t h e i s s u e a t a l l i s i t s obvious r e l a t i o n t o a c u r r e n t l y popular
-
231
Constructive logic versus algebraization
t o p i c : o f examining t h e formal need f o r s e t - t h e o r e t i c d i s t i n c t i o n s , between c o n s t r u c t i b l e and o t h e r s e t s , t h o s e o f low or high ( i n f i n i t e ) c a r d i n a l i t y , t o s e t t l e problems about groups o r Bore1 s e t s . ( i i ) Contrary t o an almost univers a l o v e r s i g h t , t h e need mentioned does not determine t h e p l a c e o f s e t - t h e o r e t i c d i s t i n c t i o n s . One has t o compare t h e i r r o l e w i t h t h e o t h e r i n g r e d i e n t s used i n t h e proofs involved, and, more d e l i c a t e l y , one has t o s e e what would b e l o s t ( f o r some given branches o r c o r n e r s o f mathematics) i f t h e problems mentioned were t o be ignored a l t o g e t h e r . The same a p p l i e s t o t h e l o g i c a l i s s u e above. I n s h o r t , t h e c a s e f o r a l o g i c a l a n a l y s i s of s u c c e s s f u l a l g e b r a i z a t i o n may be more convincingly r e f u t e d by l o o k i n g a t examples where s t r o n g l o g i c a l p r i n c i p l e s needed ( b u t seen t o b e , once a g a i n , t h e l e a s t i n t e r e s t i n g s i d e o f t h e m a t t e r ) .
are
(a)
Sums o f squares (SOS, f o r s h o r t ) ; f o r f u r t h e r background, b i b l i o g r a p h y and
o t h e r d e t a i l s , c f . t h e papers o f C. N. D e l z e l l i n t h i s volume and i n t h e f o r t h coming Herbrand volume.
The t o p i c i s f a m i l i a r from H i l b e r t ' s 1 7 t h problem con-
cerned w i t h a n a t u r a l normal form f o r 'showing' t h a t a polynomial semi-definite,
psd
is positive
p
f o r s h o r t ; c f . a l s o H i l b e r t ' s N u l l s t e l l e n s a t z which provides
a normal form f o r 'showing' t h a t a given polynomial vanishes a t a l l t h e common z e r o e s o f a g i v e n bunch o f polynomials.
More r e c e n t l y , D e l z e l l , van den D r i e s ( A )
and o t h e r s e s t a b l i s h e d a normal form proposed by Brumfiel f o r showing t h a t a semi-algebraic
s e t i s c l o s e d ( o r open).
Without having been o f much d i r e c t use,
work on some o f t h e s e p r e t t y normal forms i l l u s t r a t e s e x c e p t i o n a l l y w e l l u s e f u l general s t r a t e g i e s .
One o f them, i n t h e c a s e o f SOS, i s t h e s e l e c t i o n o f
i n a n t parameters among: t h e c h a r a c t e r o f t h e c o e f f i c i e n t f i e l d n
o f v a r i a b l e s and t h e degree o f
-choice
( p E K[xl,.
.., x n ] ) .
for
p c c.p.
,if
1 1
c. > 0 1 -
p
EK[xl
,...,x
1
or
K ( 5
,...,xn)
, and
I+
pi
if
similarly of:
i sums o f weighted s q u a r e s a r e considered, t h a t i s ,
.
e-
number
Another i s t h e proper
o f category f o r t h e s o l u t i o n , t h a t i s , o f t h e t y p e o f maps: p
p = cpi2
where
p
, the
K
p = Ccipi
2
A t h i r d s t r a t e g y concerns t h e p o s s i b l e need f o r e n r i c h i n g
d a t a , f o r example, by coding t h e f a c t t h a t
p
is
psd.
, the
For good measure, s i n c e
both model-theoretic and p r o o f - t h e o r e t i c metamathematical methods have been a p p l i e d t o t h e problem one a l s o g e t s an i d e a o f t h e i r c o n t r i b u t i o n s ; r e l a t i v e t o each o t h e r , and t o more a l g e b r a i c o r number-theoretic a n a l y s e s . ( i ) Back i n 1888 H i l b e r t Some d e t a i l s , documented i n f u l l i n D e l z e l l ' s papers. showed t h a t a some psd q u a r t i c ERCx, .x2.x31 w a s not a sum of s q u a r e s (SOS) of polynomials. R. M. Robinson w a s a b l e t o use t h e p u r e l y a l g e b r a i c c h a r a c t e r of ( a n a s i d e i n ) H i l b e r t ' s argument f o r a g e n e r a l method t o d e c i d e , f o r any x 1 , and an a r b i t r a r y r e a l c l o s e d f i e l d K , whether p i s (psd, p E K[xl, ( i i ) The a l g e b r a i c c h a r a c t e r o f A r t i n ' s and a l s o ) a S f ; S of polynomials. 1 f o r a r b i t r a r y ordered K (and r e s u l t , modified t o apply t o p E K[xl , . . . r ~ p b e i n g r e q u i r e d t o b e psd i n t h e real c l g s u r e o f K ) , ensures a r e p r e s e n t a t i o n as a SOS independent o f t h e c h a r a c t e r of K This i s a c o r o l l a r y o f (iii) More mathematical work o f Landau and model t h e o r y o r r e l a t e d 'nonsense.' and o f P f i s t e r f o r r e a l c l o s e d K , g i v e s q u a l i Pourchet on number f i e l d s K t a t i v e l y b e t t e r bounds f o r t h e number ( n o t t h e d e g r e e s ) o f t h e s q u a r e s used t h a n ( i v ) A proofanything known under t h e g e n e r a l c o n d i t i o n s i n ( i i )above. t h e o r e t i c a n a l y s i s o f A r t i n ' s argument by s t a n d a r d metamathematics o f c l a s s i c a l systems ( a c t u a l l y s i m p l i f i e s t h e l a t t e r , and) d e r i v e s q u a n t i t a t i v e l y b e t t e r bounds under c o n d i t i o n s ( i i )t h a n t h e g e n e r a l r e c u r s i v e ones ensured by model
...,
.
,
G. KREISEL, A. MACINTYRE
238
theory. It has a l s o suggested a d i f f e r e n t argument r e l y i n g on t h e g e n e r a l quanti f i e r e l i m i n a t i o n method f o r r e a l c l o s e d f i e l d s . It i s s t i l l open whether improvements i n t h e p r o o f - t h e o r e t i c a n a l y s i s could b e rewarding. They a r e not i f t h e (known) bounds a r e swamped by t h o s e f o r t h e a l g e b r a i c d e s c e n t . ( S p e c i f i c -
l,...,~
:
E K'(x g ) f o r & r o o t a" o f p = CG2 f o r s u i t a b l e n' some polynomial o f odd degree over K' Then p i s a l r e a d y a SOS i n ) , b u t g e n e r a l l y more complicated. The o t h e r c a s e , o f a d j u n c t i o n s K'(x1,..,,x
a l l y , suppose
.
& and f o r a E K' , i s not so complicated.) ( v ) For an o r d i n a r y cons t r u c t i v e s o l u t i o n o f H i l b e r t ' s 1 7 t h problem over such undecidable ground f i e l d s a s R , each summand must b e , roughly speaking, continuous b o t h i n t h e v a r i a b l e s (Here, ' o r d i n a r y ' means: without enrichment of and t h e c o e f f i c i e n t s o f p d a t a . ) More p r e c i s e l y , t h e r e i s a t o p o l o g i c a l v e r s i o n , i n v o l v i n g b o t h a choice o f topology and o f t h e c a t e g o r y of r e p r e s e n t a t i o n s , t h a t i s , maps: p c-+ pi
.
.
( v i ) Stengle's algebraic
p o s i t i v s t e l l e n s a t z i s i n f a c t a normal form 'showing' t h a t t h e summands can b e chosen so t h a t denominators vanish only a t t h e zeroes of p This t a k e s c a r e o f c o n t i n u i t y i n t h e v a r i a b l e s xl, x (vii)
..., .
.
D e l z e l l ' s papers give s o l u t i o n s (and counterexamples) i n a wide c l a s s o f c a s e s f o r t h e proper c a t e g o r i e s of s o l u t i o n s ; semi-algebraic or even r a t i o n a l i n t h e c a s e of q u a d r a t i c polynomials t r e a t e d i n t h i s volume. The methods and n o t i o n s come from mainstream mathematics, I n t e r e s t i n c o n s t r u c t i v e l o g i c h a s , perhaps, been u s e f u l i n drawing a t t e n t i o n t o t h e t o p o l o g i c a l v e r s i o n ; i n c o n t r a s t , i n ( i v ) above, metamathematics o f c l a s s i c a l systems a c t u a l l y provided t h e e a s i e s t constructive solutions. Enriching d a t a and Bishop ( 1 9 6 7 ) ; a t r i v i a l example. The high school r e p r e s e n t 2 a t i o n s o f a x + 2bxy + cy2 by 'completing t h e s q u a r e ' a r e not continuous i n t h e b a r e d a t a ( a . b , c ) ; c f . D e l z e l l ' s paper i n t h i s volume. To be p s d , a+c 2 0, 2 5 ac , and so e i t h e r b2 5 a* o r b 2 5 c 2 ( o r b o t h ) , indexed by 1 , r e s p .
b
2.
Require t h e d a t a t o be e n r i c h e d t o
language:
w i t h t h e d i s c r e t e topology on
(a,b,c,i) i
.
,i
= 1 or
Adding
i = 2 ; i n fancy
i s a genuine enrichment
i
s i n c e it i s not determined continuously nor uniquely by
(a,b,c)
.
For t h e new
d a t a t h e r e i s an obvious t o p o l o g i c a l s o l u t i o n : i f i = 1 : a ( x + y b / a ) 2 + 2 2 (c-b / a ) y 2 , and i f i = 2 : (a-b / c ) x 2 + c ( y + x b / c ) 2 - I n medieval language,
.
t h e s o l u t i o n i s ' i n t e n s i o n a l ' because it depends not o n l y on
on t h e p a r t i c u l a r
i
.
Seen i n t h i s way t h e a d d i t i o n of
(a,b,c)
, but
also
is parallel t o the
i
most s u c c e s s f u l p a r t s of Bishop (1967), a t l e a s t , a s formulated on p. 124 o f Browder ( 1 9 7 6 ) ; viz.:
by e n r i c h i n g t h e d a t a , f u n c t i o n a l equations can b e s o l v e d
by simpler o p e r a t i o n s .
, Bishop
for R
For example, i n t h e c a s e of o r d i n a r y continuous f u n c t i o n s
adds t o t h e graph ( a modulus of c o n t i n u i t y and) a d d i t i o n a l d a t a
which make l o c a l b i s e c t i o n arguments e f f e c t i v e : a map Ix'-xI
< n
-1
and
f(x') = 0
i s decidable.
(x,n)
+
x'
where
This enrichment i s b o t h necessary
f o r i t s purpose and o f t e n a v a i l a b l e i n p r a c t i c e , w h i l e
i
above i s not ' a v a i l -
a b l e , ' i n t h e sense o f not b e i n g r e c u r s i v e i n ( s a y , p r i m i t i v e r e c u r s i v e r e a l s ) a,b,c
.
Besides, by D e l z e l l ' s paper i n t h i s volume, no enrichment a t a l l i s
needed f o r more i n t e l l i g e n t r e p r e s e n t a t i o n s of convex combinations.
-
ax2 + 2bxy + cy
by s u i t a b l e
Other simple enrichments reduce t h e t o p o l o g i c a l v e r s i o n
239
Constructive logic versus algebraization
( v ) t r i v i a l l y t o t h e piece-wise r a t i o n a l s o l u t i o n o f H i l b e r t ' s 1 7 t h problem i n Theorem 2 . 1 o f D e l z e l l ( A ) . B i b l i o g r a p h i c a l remarks. By and l a r g e l o g i c i a n s a r e not aware j u s t how promi n e n t enrichments a r e i n mathematics (and emphasized by b e i n g given a name!). Viewed as an e x p o s i t i o n o f - t h e s t r a t e g y o f - enrichments Bishop (1967) could be most e f f e c t i v e f o r showing how g e n e r a l mathematical s t r a t e g i e s s e r v e trad i t i o n a l l o g i c a l ( h e r e : c o n s t r u c t i v e ) aims. C l e a r l y , t h i s was not t h e i n t e n t i o n , f o r example, o f t h e embarrassing i n t r o d u c t i o n , nor t h e e f f e c t on most l o g i c a l readers. I n s t e a d t h e y looked f o r a 'new' foundation, aping t h e d i s c r e d i t e d analyses o f axiomatic s e t theory (mentioned i n a ( i i ) o f t h e l a s t s e c t i o n ) , and worried, f o r example, whether Bishop (1967)used t h e p r i n c i p l e o f dependent choice! Another, even l e s s p e r c e p t i v e , r e a c t i o n was t o s e e enrichments a s mere padding o r b a l l a s t , not r e c o g n i z i n g t h e e s s e n t i a l knowledge contained i n ( a s k i l l f u l choice o f ) enrichments, even a f t e r t h e l a t t e r had p u t t h a t knowledge before our eyes. (b)
0
If;
Binary diophantine e q u a t i o n s ; c f . t h e s e c t i o n on
-+
113
f o r background,
and t h e Appendix f o r t h e p r i n c i p a l s t e p s i n t h e e v o l u t i o n o f S i e g e l ' s F i n i t e n e s s Theorem.
A t t e n t i o n focuses on methods o f d e r i v i n g
DA
-+
S
, where
S is
S i e g e l ' s c r i t e r i o n , i n terms o f t h e i r genus, f o r e q u a t i o n s which have only f i n i t e l y many i n t e g r a l s o l u t i o n s , and proximation theorem, b o t h
DA
DA
i s a ( s u i t a b l e ) diophantine ap-
S being
and
even from t h e s t r o n g form o f DA due t o Roth Mordell/Weil
If;
.
The c l a s s i c a l p r o o f s
-
used t h e ( s t r u c t u r e ) theorem of
on a f i n i t e b a s i s f o r t h e s e t o f a l l r a t i o n a l s o l u t i o n s o f t h e
equations considered, generators.
-
Now, no known proof o f t h i s theorem provides a l i s t of
But i f only a bound on t h e number o f g e n e r a t o r s i s a v a i l a b l e , t h e
s t a n d a r d proofs of DA
+
S
a r e simply not c o n s t r u c t i v e .
t h e a l g e b r a i c machinery which ( i )g e n e r a l i z e s b o t h number f i e l d s , b u t a l s o r e s t r i c t s
DA
DA
The Appendix e x p l a i n s
and S
t o arbitrary
t o a b e l i a n among a l l a l g e b r a i c v a r i e t i e s ,
t h u s ( i i )e x t r a c t i n g from t h e old p r o o f s c o n s t r u c t i v e i m p l i c a t i o n s : between d i f f e r e n t versions of
DA
o r of
DA
and S
.
(The most ambitious j o b o f t h i s
kind, sketched i n S e r r e ( 1 9 8 0 ) , i n v o l v e s s t i l l more d e l i c a t e a l g e b r a ; c f . A8.2.)
Apart from t h e s t r a t e R i e s i n ( a ) above, t h e work i l l u s t r a t e s a l s o t h e following g e n e r a l p o i n t s which w i l l be sharpened i n A 9 by r e f e r e n c e t o d e t a i l s i n t h e Appendix. One g e n e r a l p o i n t i s t h e l i m i t a t i o n o f f a m i l i a r c l a s s i f i c a t i o n s of problems, f o r example, by a formal q u a n t i f i e r count o r , i n t h e c a s e of ( b i n a r y ) polynomials, by t h e i r degree.
Another concerns t h e r o l e o f l o g i c a l s t r e n g t h f o r t h e success
of a l g e b r a i z a t i o n r a i s e d j u s t b e f o r e ( a ) , l e a d i n g t o a more convincing a n a l y s i s of t h i s success.
More t e c h n i c a l l y , a l g e b r a i c and geometric i n t e r p r e t a t i o n s a r e
used i n t h e Appendix t o choose a b s t r a c t s t r u c t u r e s s u i t e d f o r e f f i c i e n t comput a t i o n , roughly speaking, by p r o v i d i n g s u i t a b l e p r e s e n t a t i o n s o f t h e r e l e v a n t o b j e c t s ; i n c o n t r a s t t o s o c a l l e d t h e o r i e s o f computation i n r e c u r s i o n t h e o r y which assume t h e s t r u c t u r e s t o b e given; c f . t h e end of t h e l a s t s e c t i o n on deceptive terminology.
240
G. KREISEL, A. MACINTYRE
Documentation. ( i ) By t h e f a m i l i a r formal q u a n t i f i e r count, t h e solved by S i e g e l i s more complicated t h a n t h e
1;
$
problem
q u e s t i o n whether a b i n a r y
equation has any i n t e g r a l s o l u t i o n a t a l l ( which i s s t i l l open except f o r genus < 1); 'formal' because, modulo d e r i v a b i l i t y , S i e g e l ' s proof o f course r e d u c e s t h e q u a n t i f i e r complexity. - Reminder. I n c o n s t r u c t i v e l o g i c t h e two formulations o f f i n i t e n e s s , by bounds on number and s i z e , a r e not e q u i v a l e n t . S i e g e l ' s s o l u t i o n a p p l i e s t o t h e former; s i n c e bounds a r e a v a i l a b l e , t h e n a t u r a l formulation i s i n
0
II
form.
( i i ) For t h e problem s o l v e d by S i e g e l , t h e c l a s -
s i f i c a t i o n by degree i s not merely c o a r s e ( t h a t i s , worth r e f i n i n g ) , b u t i n t h e wrong d i r e c t i o n simply because a s u p e r i o r c l a s s i f i c a t i o n c u t s a c r o s s deKree; s p e c i f i c a l l y , by s u i t a b l e b i r a t i o n a l equivalence which p r e s e r v e s f i n i t e n e s s o f t h e s o l u t i o n s e t (and g e n u s ) , and i s incomparable w i t h degree; c f . Theorem 2 on p. 151 of [MI. It i s a s e p a r a t e m a t t e r whether genus i t s e l f i s a p r i n c i p a l s i g n i f i c a n t measure here. For t h e r e c o r d , we f i n d t h e r e s u l t s i n t h e Appendix r e l a t i n g genus and p r o p e r t i e s o f Jacobians p e r s u a s i v e , b u t do not c o n s i d e r ours e l v e s w e l l informed enough t o judge t h e i r s i g n i f i c a n c e ( f o r a choice o f measure). (iii) A i r y - f a i r y s p e c u l a t i o n s on t h e r o l e of l o g i c a l s t r e n g t h a r e o u t d a t e d because t h e r e a r e s t r i k i n g examples a v a i l a b l e f o r i n s p e c t i o n ; i n p a r t i c u l a r , t h o s e s p e c t a c u l a r a l g e b r a i c i n t e r p r e t a t i o n s o f phenomena which on t h e s u r f a c e seem mere c u r i o s i t i e s (as i n Ramanujan's c o n j e c t u r e ) ; b u t a l s o t h e modern a l g e b r a i c p r o o f , f o r example, i n Chapter 5 o f Lang ( 1 9 6 2 ) , o f t h e theorem of Mordell/Weil g i v e s an i d e a o f p o s s i b l e p r o g r e s s ; most d r a m a t i c a l l y , when compared w i t h t h e computational proof - i n c i d e n t a l l y , r e s t r i c t e d t o genus 1 i n Chapter 16 of [MI; f o r a more r e a l i s t i c comparison, c f . t h e proof on pp. 265-266 (and p. 258) o f C a s s e l s (1966), and t h e a n a l y s i s of corresponding 'computational' arguments on pp. 269-272. The choice o f a p p r o p r i a t e a l g e b r a i c s t r u c t u r e s , i n p a r t i c u l a r , a b e l i a n v a r i e t i e s , cohomology groups, i s c r i t i c a l ; not t h e means o f proof used t o e s t a b l i s h t h e i r r e l e v a n t p r o p e r t i e s . Exaggera t i n g very l i t t l e : t h e s t e p s of t h e computational proof ( o r some l i k e them) are used t o e s t a b l i s h and a t t h e same time t h e y a r e i n t e r p r e t e d by - t h o s e algeb r a i c p r o p e r t i e s . Digression on a n a l y t i c number t h e o r y (under t h e slogan: h i s t o r y r e p e a t s i t s e l f ) . I n t h e t w e n t i e s , people toyed w i t h t h e i d e a t h a t i t s s u c c e s s depended on t h e use o f - w h a t we s h o u l d now c a l l - s e t - t h e o r e t i c p r o p e r t i e s of E' A t t h a t time Gadel's incompleteness r e s u l t s could have given some supp o r t t o t h i s idea. For t h e y showed t h a t metamathematical c o n s i s t e n c y propert i e s , q u i t e e v i d e n t from c e r t a i n s e t - t h e o r e t i c a l p r i n c i p l e s , a c t u a l l y r e q u i r e d t h e l a t t e r f o r a formal proof. This w a s unexpected a t t h e time (though n o t 50 y e a r s e a r l i e r when Cantor compared h i g h e r set t h e o r y w i t h a r i t h m e t i c , t a k i n g it f o r g r a n t e d t h a t t h e r e w a s no rewarding r e d u c t i o n o f a r i t h m e t i c e i t h e r ) . I n t h e t h i r t i e s p e r c e p t i v e l o g i c i a n s l i k e Gentzen were s k e p t i c a l of t h e u s e o f s t r o n g p r i n c i p l e s i n f u n c t i o n t h e o r y , and by 1950 h i s impression had been v e r i f i e d beyond any shadow o f a doubt. During t h e l a s t decade l o g i c i a n s have d o t t e d t h e i ' s and c r o s s e d t h e t ' s , w h i t t l i n g down f u r t h e r t h e elementary p r i n c i p l e s which a r e obviously s u f f i c i e n t f o r ( t h e s t a n d a r d p a r t s o f ) f u n c t i o n t h e o r y . Ironi c a l l y , b u t by no means u n t y p i c a l l y , t h i s a c t i v i t y threw up a l o t o f d u s t as it were, obscuring t h e e s s e n t i a l f a c t s w i t h f i l i g r e e pedantry. Some o f t h e s e f a c t s w i l l b e s p e l t o u t i n ( i v ) below. This seems worth doing, e s p e c i a l l y s i n c e alg e b r a i z a t i o n i s t h e n seen t o b e a refinement o f t h e a n a l y t i c s t r a t e g i e s . ( i v ) The 'space' - or s p e c i e s i n i n t u i t i o n i s t i c j a r g o n o f f u n c t i o n s of a complex v a r i a b l e has t u r n e d o u t t o l e n d i t s e l f t o a remarkably manageable t h e o r y . Thus simple p r o p e r t i e s o f a f u n c t i o n i n one r e g i o n o f LC determine a l o t o f i t s behaviour elsewhere; f o r example, t h e l o c a t i o n of p o l e s and t h e maximum modulus o f f t h e r e a l axis determine t h e behaviour ( o f power s e r i e s expansions, z e r o e s , e t c . ) on it. There i s a whole a r s e n a l o f d i f f e r e n t d e s c r i p t i o n s o f t h e same function i n fancy language: r e s t r u c t u r i n g p a r t i c u l a r l y w e l l s u i t e d t o record ( a n d make e v i d e n t ) t h o s e simple p r o p e r t i e s . All t h i s knowledge can now b e brought t o b e a r on number-theoretic problems, e v e r s i n c e Euler s p o t t e d ( a n d o t h e r s e l a b o r a t e d ) how t o 'embed' t h e l a t t e r i n f u n c t i o n t h e o r y . Next, t h e k i n d
-
.
-
-
-
24 1
Constructive logic versus algebraization
of a l g e b r a i z a t i o n expounded i n t h e Appendix e x p l o i t s t h e p a r t i c u l a r l y simple c h a r a c t e r of diophantine e q u a t i o n s . Curves d e f i n e d by them ( t a c i t l y , i n a s u i t a b l e f i e l d ) a r e - t h i s time: l i t e r a l l y - e m b e d d e d i n s u i t a b l y chosen a l g e b r a i c v a r i e t i e s . I n g e n e r a l , t h e y a r e even s i m p l e r and b e t t e r understood o b j e c t s t h a n many o f t h e functions used i n a n a l y t i c number t h e o r y , b e s i d e s b e i n g something new t o t r y out. - Needless t o say, t h e g e n e r a l s t r a t e g i e s of u s i n g f u n c t i o n t h e o r y o r a l g e b r a i z a t i o n l e a v e p l e n t y o f room f o r t h e k i n d of a d d i t i o n a l s k i l l s so promi n e n t i n t h e l a s t s e c t i o n , f o r example, i n t h e choices o f s u i t a b l e embeddings and ' t i g h t ' r e s t r u c t u r i n g . ( a ) R e c a l l from t h e remark a t t h e end o f t h e l a s t s e c t i o n Technical p o i n t s . on deceptive terminology t h a t t h e g e n e r a l s t r a t e g i e s o f mathematics c o n t r i b u t e more t o a proof t h e o r y and a model t h e o r y i n t h e popular sense o f t h e s e words than t h e branches of l o g i c w i t h t h e s e names. Much t h e same a p p l i e s t o t h e p a r t of r e c u r s i o n t h e o r y c a l l e d ' t h e o r y o f computation on a b s t r a c t s t r u c t u r e s . ' The l a t t e r t e l l s us what we g a i n if t h e induced r e l a t i o n s a r e r e c u r s i v e , b u t not o f t e n which s t r u c t u r e s t o choose. The a l g e b r a i c l i t e r a t u r e does t h i s much b e t t e r provided, a s always, i t s r e l e v a n c e i s recognized a t a l l ; c f . 58.2 of t h e Appendix where i n t e r p r e t a t i o n s corning from a l g e b r a i c geometry a r e needed t o + I I; theorems. choose e f f i c i e n t p r e s e n t a t i o n s of Selmer's group. ( B )
$
The d i f f e r e n c e between p r a c t i c a l l y useful and i n t u i t i o n i s t i c meanings o f such i m p l i c a t i o n s i s w e l l i l l u s t r a t e d i n 18.1 o f t h e Appendix. There two p r o o f s a r e considered f o r d e r i v i n g S i e g e l ' s theorem f o r b i n a r y diophantine equations i n one number f i e l d K from Roth's theorem assumed f o r a r b i t r a r y K' ( 3 K) The s t a n d a r d proof shows e x p l i c i t l y how ( i )t h e r e l e v a n t e x t e n s i o n K' and t h e a l g e b r a i c numbers w i t h e x c e p t i o n a l l y c l o s e K ' - r a t i o n a l approximations ( o f l a r g e h e i g h t ) a r e got from ( i i ) K and t h e e q u a t i o n under c o n s i d e r a t i o n . The non-standard p r o o f , r e f e r r e d t o a t t h e end o f Robinson and Roquette (1975), does not. Recursion t h e o r i s t s w i l l recognize h e r e t h e familiar weakness, f o r 'posi t i v e ' r e s u l t s , o f - p r i m i t i v e o r general! - r e l a t i v e r e c u r s i v e n e s s compared t o many-one r e d u c i b i l i t y .
.
A p o s i t i v e c o r o l l a r y t o ( i i i ) above.
If a l g e b r a i c o r t o p o l o g i c a l i n t e r p r e -
t a t i o n s of numerical computations can do m i r a c l e s , why not t r y t h i s s t r a t e g y on formal computations w i t h Heyting's r u l e s ?
This might s e r v e as a crude s a l e s
p i t c h f o r t h e sheaf model i n d u s t r y r e p r e s e n t e d i n t h i s volume. refined, a t various l e v e l s of generality.
I t can even b e
Most t r i v i a l l y , we a l r e a d y have
p l e n t y o f f l a s h y metatheorems, r i p e f o r i n t e r p r e t a t i o n s , and s o t h e r e i s l i t t l e r i s k o f b e i n g l e f t t o t a l l y empty handed.
A s f o r a g e n e r a l a r e a of i n t e r p r e -
t a t i o n , t h e s i n g l e most dramatic use o f Heyting's l o g i c , i n Brouwer's b u s i n e s s of choice sequences, c e n t e r s around c o n t i n u i t y ( o f d i s j u n c t i o n s o r , more gene r a l l y , t h e q u a n t i f i e r combination VIX 3x ).
Bringing i n t h e technology of
sheaves i s doubly c o n s e r v a t i v e ; t e c h n i c a l l y , s i n c e i t s o r i g i n a l f u n c t i o n w a s some k i n d o f continuous p a s t i n g , and t h u s c l o s e t o Brouwer's venerable a i m ; more b r o a d l y , s i n c e sheaves a r e c e r t a i n l y among t h e b l u e chips of t h e mathem a t i c a l market. t o apply
-
True, t h e r e a r e more imaginative t h i n g s t o do w i t h them t h a n
t h e sheaf-theoretic i n t e r p r e t a t i o n s of
-
t h e l o g i c a l operations.
But t h e same could b e , and was, s a i d o f o r d i n a r y model t h e o r y , and t h e o r d i n a r y set-theoretic interpretations.
Yet even i t s e a r l i e s t c o n t r i b u t i o n s , by Malcev,
a r e something we s t i l l want t o know about.
A l l t h i s i s encouraging (though
t h e r e i s a n o t h e r s i d e t o which we r e t u r n i n a moment), and q u i t e enough t o
G. KREISEL, A. MACINTYRE guarantee a coherent theory.
The successes w e know a r e ( f o r us) more d i f f i c u l t
t o judge. Examples. ( i ) Sheaf models have 'brought a i d and comfort' - as t h e Royal Soct o some non-logicians, e s p e c i a l l y , t o p o l o g i s t s who a r e c u r i o u s t o i e t y p u t s it learn independence proofs i n s e t t h e o r y , b u t not t o u s e them. I f t h e y d i d t h e y might b e n e f i t e q u a l l y w e l l from boolean-valued models ( u s e d more widely i n t h e l i t e r a t u r e ) . - Unquestionably, i f ever t h e r e were t o b e a s i m i l a r p a s s i v e i n t e r e s t i n t h e metatheory o f c o n s t r u c t i v e l o g i c , sheaf models would s u r e l y provide n e a t e r e x p o s i t i o n s ( a n d e v e n t u a l l y some new r e s u l t s f o r s p e c i a l i s t s ) . ( i i ) It i s c e r t a i n l y easy t o imagine p l a u s i b l e u s e s , j u s t a s one d i d 1 5 y e a r s ago f o r c o n s t r u c t i v e l o g i c and formal c o n t i n u i t y axioms; c f . 1. 15-20 on p. 1024 of Statman (1979) f o r t h e ( b e g u i l i n g ) p o s s i b i l i t i e s envisaged, and t h e c u r r e n t l i m i t a t i o n s . - Reminder. Here a p p l i c a t i o n s o f sheaf models t o t h e broad cons t r u c t i v e t r a d i t i o n are considered.
-
Nevertheless t h e r e remain nagging doubts connected - perhaps p a r a d o x i c a l l y with t h e comparison above t o e a r l y model t h e o r y .
-
A f t e r having handled o r d i n a r y
models f o r 50 y e a r s , c o u l d n ' t we expect more r a p i d p r o g r e s s w i t h sheaf models? But then:
t h o s e e a r l y uses o f model t h e o r y were made at an e a r l y s t a g e o f
o r d i n a r y axiomatic mathematics which has developed i t s own devices i n t h e meantime, f o r example, b a s e change theorems i n p l a c e o f model-theoretic t r a n s f e r .
Has t h e growth o f o t h e r devices of t h i s s o r t simply 'preempted' t h e p o s s i b i l i t y of easy, s p e c t a c u l a r a p p l i c a t i o n s o f sheaf models?
L a s t b u t not l e a s t , t h e
number o f a r e a s where o r d i n a r y model t h e o r y has had s t r i k i n g u s e s i s q u i t e l i m i t e d , and t h e e x p e c t a t i o n s
-
on t h e o b j e c t i v e evidence a v a i l a b l e
-
i n , say,
1945, 1955, 1965, and 1975 f l u c t u a t e d t o o much f o r any s t a t i s t i c a l l y s i g n i f i c a n t assessment.
In such circumstances, i t seems premature, a s a l r e a d y mentioned i n
t h e I n t r o d u c t i o n , t o have any views on t h e broad p o t e n t i a l o f sheaf models o r o f o t h e r mathematical uses o f c o n s t r u c t i v e l o g i c .
-
For t h e r e c o r d , one o f us
hopes t h a t l o t s o f people w i l l work on sheaf models; j u s t a s it would have been n i c e f o r us, t h e consumers, i f more d i v e r s e v e n t u r e c a p i t a l had gone i n t o n u c l e a r e n e r a ( a t t h e c o s t o f b a n k r u p t c i e s o f some companies and losses t o many stockh o l d e r s ).
Grounds f o r optimism: p o s s i b l e s t r a t e g i c e r r o r s i n c u r r e n t work. Both ( a ) and ( 6 ) below a t t r i b u t e a simple-minded f o u n d a t i o n a l b i a s t o t h a t work. (a) Meticul o u s c a r e i s t a k e n i n choosing between c l a s s i c a l l y , b u t not i n t u i t i o n i s t i c a l l y e q u i v a l e n t d e f i n i t i o n s of t h e same ( b a s i c ) mathematical n o t i o n . But l e s s att e n t i o n seems t o b e given t o t h e q u e s t i o n whether every notion which i s b a s i c f o r ( o r d i n a r y ) mathematics, f o r example, o f r e a l c l o s e d f i e l d s , a l s o has a rewarding s h e a f - t h e o r e t i c a n a l y s i s . The answer would b e a u t o m a t i c a l l y p o s i t i v e i f one thought o f sheaf models as t h e ' t r u e foundation' o f ( w e l l - t e s t e d ) mathematical p r a c t i c e . ( 8 ) A q u i t e extreme form o f s t r a t e g i c e r r o r i s suggested by t h e l a s t paragraph on p. 1010 o f MacLane (1979) about t h e r e l a t e d t o p i c o f topos t h e o r y . A l i t t l e theorem i s p r e s e n t e d as i f it provided t h e f i r s t ' r i g orous' connection between c o n t i n u i t y and i n t u i t i o n i s t i c l o g i c ( a f t e r Brouwer's formal c o n t r a d i c t i o n s between c l a s s i c a l theorems and c o n t i n u i t y p r o p e r t i e s i n t h e i n t u i t i o n i s t i c t h e o r y o f choice sequences!). This s o r t o f r i t u a l o f u s i n g l i t t l e theorems t o ' e s t a b l i s h ' w e l l known p o i n t s i s not only p a i n f u l t o l o g i c a l s e n s i b i l i t i e s , b u t a l s o p r a c t i c a l l y d i s a s t r o u s : it i s bound t o s e t low standa r d s on a p p l i c a t i o n s f o r an obvious reason. No a p p l i c a t i o n can compete i n
Constructive logic versus algebraization
243
i n t e r e s t w i t h t h e s o c a l l e d conceptual p r o g r e s s o f having a t long l a s t given an i n t e l l i g i b l e meaning t o t h e i d e a a t i s s u e , h e r e : t o c o n s t r u c t i v e l o g i c ( i f t h a t i s what sheaf model semantics i s thought t o have done). A t t h e same time an i n t r i n s i c a l l y q u i t e poor a p p l i c a t i o n may b e more t h a n enough f o r t h e pedagogic purpose o f i l l u s t r a t i n g t h a t p r e c i o u s meaning; c f . a l s o a ( i ) o f t h e l a s t s e c t i o n concerning low s t a n d a r d s . - Reminder. S t r a t e g i c e r r o r s c o n s t i t u t e grounds f o r optimism because t h e y may have prevented f u l l e x p l o i t a t i o n o f t h e i n t r i n s i c p o t e n t i a l ( h e r e : of sheaf models). A s f a r as t h e c o n s t r u c t i v e t r a d i t i o n i n mathematics i s con-
Summing up P a r t I.
cerned, ( c o n s t r u c t i v e ) l o g i c has not been, and i s not l i k e l y t o b e , of s i g n i f icance comparable t o t h e g e n e r a l s t r a t e g i e s developed w i t h i n mathematics, d u r i n g t h e same p e r i o d .
More p r e c i s e l y , t h i s a p p l i e s t o t h e l o g i c a l e l a b o r a t i o n s s i n c e
some o f t h e broad i d e a s behind them, f o r example, t h o s e s t r e s s e d i n Brouwer's topology, have been absorbed i n t o t h e g e n e r a l mathematical s t r a t e g i e s t o o . Wherever p a r t s o f l o g i c , more o r l e s s r e l a t e d t o t h e c o n s t r u c t i v e v a r i e t y , were put t o e f f e c t i v e u s e , t h i s r e q u i r e d ' a d d i t i o n a l s k i l l s , ' f o r example, i n f e r r e t i n g out f r u i t f u l problems.
All t h i s i s i n s h a r p c o n f l i c t w i t h t h e e x p e c t a t i o n s cipal attraction foundations:
-
-
and c e r t a i n l y t h e p r i n -
o f t h e p a r t i c u l a r exact methodology a s s o c i a t e d w i t h l o g i c a l
o f s e e i n g i n l o g i c a powerful s y s t e m a t i c t o o l .
even more obvious c o n f l i c t s .
m e r e are other,
Three o f t h e p r i n c i p a l w o r r i e s about c o n s t r u c t i v e
l o g i c , s a y 50 y e a r s ago, concerned:
l a c k o f p r e c i s i o n o r even coherence, ex-
c e s s i v e r e s t r i c t i o n s , and t h e s p e c t r e o f an i n t o l e r a b l e reform of mathematical practice.
Whatever e l s e may b e i n doubt, p r e c i s i o n p r e s e n t e d l i t t l e d i f f i c u l t y ;
i f anything, r e s t r i c t i o n s were i n s u f f i c i e n t , and t h e a c t u a l reform, t h a t i s , change i n mathematical s t y l e , during t h e l a s t h a l f c e n t u r y exceeds anything t h a t was contemplated i n e a r l y debates about c o n s t r u c t i v e l o g i c . For t h e a c t i v i s t
-
concerned w i t h t o o l s , i n p a r t i c u l a r , norms ( t h e most ele-
mentary k i n d o f t o o l ) , f o r r e a s o n i n g
-
t h e s e c o n f l i c t s between e x p e c t a t i o n s and
experience a r e merely r e g r e t t a b l e o v e r s i g h t s .
But f o r t h o s e r e f l e c t i n g on math-
ematics t h e y are o f t h e essence, b e i n g genuine p h i l o s o p h i c a l d i s c o v e r i e s ; now i n t h e popular (no l o n g e r : assessing aims.
Schopenhauer's) s e n s e o f philosophy, concerned w i t h
And exact philosophy o f t h i s k i n d marshals t h e evidence pro-
vided by l a t e r , d e t a i l e d experience.
Work on c o n s t r u c t i v e l o g i c over t h e l a s t
h a l f c e n t u r y has provided remarkably d e c i s i v e o b j e c t l e s s o n s f o r t h i s k i n d o f philosophy.
They w i l l b e t a k e n up i n P a r t 11, t o g e t h e r w i t h aims i n t h e t r a -
d i t i o n o f l o g i c a l foundations f o r which c o n s t r u c t i v e l o g i c remains o f c e n t r a l i n t e r e s t , as a l r e a d y mentioned i n t h e I n t r o d u c t i o n .
244
G. KREISEL, A. MACINTYRE
APPENDIX S i e g e l ' s F i n i t e n e s s Theorem f o r Binary Diophantine Equations This Appendix i s intended f o r r e a d e r s who a r e - w i l l i n g f a m i l i a r with Lang (1962), [La] f o r s h o r t .
t o make themselves-
The r e s u l t of p r i n c i p a l i n t e r e s t i s
i n t h e l a s t chapter but one. It i s an i m p l i c a t i o n between two f i n i t e n e s s theorems, f o r diophantine approximations and diophantine equations (modern v e r s i o n s of Roth's and S i e g e l ' s theorems). more recent S e r r e quantifier-free,
Some s i g n i f i c a n t s i m p l i f i c a t i o n s contained i n t h e
(1980), [ S e ] f o r short, will be g e n e r a l l y reformulated i n so t o speak a l g e b r a i c i n p l a c e of S e r r e ' s i n t u i t i o n i s t i c language
( r e p l e t e with negations l i k e : il n ' e x i s t e p a s d e s u i t e 1.
Aims.
. . . ).
To p o i n t out and e x p l a i n d i s c r e p a n c i e s between ( i )t h e a c t u a l evolution
of- statements and proofs of- t h e theorems mentioned, and (ii)t h e p a r t i c u l a r i d e a l s of systematic a n a l y s i s found i n t h e l o g i c a l t r a d i t i o n .
The most s p e c i f i c
discrepancy concerns p r a c t i c a l l y u s e m i n t e r p r e t a t i o n s of ' c o n s t r u c t i v e ' implications.
This a f f e c t s not only c o n s t r u c t i v i s t s b u t a l s o t h o s e (model t h e o r i s t s
who a r e ) preoccupied with r e l a t i v e g e n e r a l o r , i n f a c t , even r e l a t i v e p r i m i t i v e recursiveness.
More general d i s c r e p a n c i e s concern t h e choice of terms i n which
t h e i d e a s of proofs, and eventually t h e theorems proved a r e formulated.
Thus
t h e r e a r e d e l i c a t e solved and unsolved problems - here: concerning e f f e c t i v i t y formulated i n terms p e r f e c t l y f a m i l i a r from l o g i c a l theory.
But t h e only known
After t h e significance o r 'rele-
general s o l u t i o n s involve a l g e b r a i c geometry.
vance' of t h e l a t t e r i s discovered i n t h i s way, t h e o r i g i n a l problems themselves a r e reformulated i n a l g e b r a i c / geometric terms.
Not only does t h i s a n a l y s i s con-
f l i c t with l o g i c a l i d e a l s , b u t t h e l a t t e r , i f taken l i t e r a l l y , would draw att e n t i o n away from i t s s i g n i f i c a n c e . Remark. Contrary t o a wide spread s u p e r s t i t i o n (among mathematicians) t h e success of t h e general mathematical s t r a t e g i e s used can be made p l a u s i b l e i n remarkably elementary - but of course, not t r a d i t i o n a l l o g i c a l - t e r m s . I n f a c t , many c a s u a l observations i n [ L a ] can b e used f o r t h a t purpose provided only they a r e r e membered where they a r e r e l e v a n t . Two examples of s p e c i a l importance below involve uniformity p r o p e r t i e s of h e i g h t s (even beyond t h o s e s t r e s s e d on t o p of p.50), and t h e e f f e c t of ' c o n d i t i o n s of a m u l t i p l i c a t i v e n a t u r e ' (bottom of p.94) on Roth's theorem; more p r e c i s e l y , i t s optimal form f o r abelian, as opposed t o a r b i t r a r y a l g e b r a i c v a r i e t i e s , though t h i s matter i s not-up i n V I $ 1 0 on pp.115-118 of [La] where, i n our view, it belongs. The m a t e r i a l below i s organized as follows.
52 s t r e s s e s geometric elements i n
t h e statement of S i e g e l ' s theorem ( S ) . $3 r e c a l l s some, s u p e r f i c i a l l y i n s i g n i f i cant a l g e b r a i c t w i s t s on diophantine approximation theorems (DA).
$ 4 f i r s t goes
i n t o ambiguities of ' c o n s t r u c t i v e ' meanings of implications, i n p a r t i c u l a r , (DA) + (S)
or, equivalently, of t h e phrase: from a counterexample t o ( S ) we g e t
Constructive logic versus algebraization
one f o r
8 5,
(DA),
245
and then makes a p r a c t i c a l l y u s e f u l choice between t h e s e meanings.
on p r o j e c t i v e embeddings and heights, s e t s out some of t h e notions needed t o
62,
develop t h e geometric i n s i g h t of t o exploit $ 3 .
and
96,
on a b e l i a n v a r i e t i e s , t h o s e needed
Both 8 6 . 2 and 87 i l l u s t r a t e how standard proofs of implications
between v a r i o u s modern v e r s i o n s of
(DA),
resp. of (DA)
f o r abelian varieties
and ( S ) can be reformulated t o s a t i s f y t h e c o n s t r u c t i v e meaning explained i n $4.4 (with a s t r o n g a d d i t i o n a l hypothesis i n §6.2, a mild one i n 87).
98 r e f e r s t o
more o r l e s s complete sketches i n t h e l i t e r a t u r e , e s p e c i a l l y [Se],
giving con-
s t r u c t i v e p r o o f s of (DA) + ( S )
f o r o t h e r v e r s i o n s of
(DA); s p e c i f i c a l l y , f o r
a l g e b r a i c v a r i e t i e s over a r b i t r a r y number f i e l d s , or t h e p a r t i c u l a r numberfield
99, on l o g i c a l and mathematical c l a s s i f i c a t i o n s , expands $1 and
involved i n ( S ) .
82 by r e f e r e n c e t o t h e preceding m a t e r i a l .
2.
Q u a n t i f i e r complexity, l o g i c a l and mathematical parameters ( c l a s s i f i c a t i o n s ) .
2.1. Logicians a r e most f a m i l i a r with diophantine equations from H i l b e r t ' s 10th Problem; c f . p p . 3 2 3 - 3 7 8 of Browder (1976). of t h e number of ( i n t e g r a l ) v a r i a b l e s .
There most r e s u l t s a r e s t a t e d i n terms
It i s observed t h a t t h e d e c i s i o n problem
f o r 1 v a r i a b l e i s solvable, b u t not f o r 9 v a r i a b l e s , and t h a t t h i s i s t h e l i m i t of c u r r e n t k n o w l e a e (with an a s i d e on t h e d e c i d a b i l i t y of quaclratic equations, Grunewald and Segal (1981) being an up-to-date r e f e r e n c e ) . 2.2. We g e t a d i f f e r e n t p e r s p e c t i v e if we l o o k a t e x i s t i n g knowleke i n t h e case of 2 v a r i a b l e s .
Consider:
(1)
When does
f(x,y) = 0
have a s o l u t i o n i n
(2)
When does
f(x,y) = 0
have i n f i n i t e l y many s o l u t i o n s i n
2 ? 2 ?
S i e g e l (1929) answered ( 2 ) completely, b u t one needs t h e rudiments of algebraic geometry t o understand h i s r e s u l t .
The s u c c i n c t answer t o ( 2 ) i s i n
terms of genus of curves, or, equivalently, t h e dimension of t h e i r Jacobians. c o n t r a s t , (1)i s s t i l l open, though widely conjectured t o be solvable.
In
Be t h a t
a s it may, as f a r as e x i s t i n g knowledge i s concerned, a formal q u a n t i f i e r
i s misleading
s i n c e it makes (1)simpler t h a n ( 2 ) .
2.3. S i e g e l ' s Theorem. If we assume f a b s o l u t e l y i r r e d u c i b l e over Q, f def i n e s a curve. The genus of ( t h e curve defined by) f i s a nonnegative i n t e g e r , which can .be p r i m i t i v e r e c u r s i v e l y computed from t h e c o e f f i c i e n t s o f If t h e genus ----
Siegel
of
f
i s greater than
0, f
has only f i n i t e l y many ----
f.
solutions
(199)a l s o provided d e f i n i t i v e information on t h e c a s e of genus
however does not concern us here.
Then
%
2.
0 , which
246
G. KREISEL, A. MACINTYRE
There i s no w s t e r y i n t h e appearance of geometrical i n v a r i a n t s i n a diophantine problem.
I n p a r t i c u l a r , genus i s a b i r a t i o n a l i n v a r i a n t , and b i r a t i o n a l t r a n s -
formations e s s e n t i a l l y r e s p e c t t h e p r o p e r t y of having i n f i n i t e l y many r a t i o n a l solutions.
It i s , perhaps, more remarkable t h a t genus i s such a useful parameter
f o r t h e problem of i n t e g r a l s o l u t i o n s .
-
One way i n which t h e
-
specific
notion
of genus i s u s e f u l i s t h a t it admits an e x t r a o r d i n a r y number of d e f i n i t i o n s i n
widely d i f f e r e n t contexts; i n p a r t i c u l a r , it connects with s e v e r a l e l a b o r a t e coho-
mology t h e o r i e s .
This kind of t h i n g i s t y p i c a l of mathematical g e n e r a l i t y i n con-
t r a s t t o t h e g e n e r a l i t y of a ' u n i v e r s a l ' l o g i c a l language, as i n model theory, which i s of l i t t l e help i n i d e n t i f y i n g p a r t i c u l a r l y s i g n i f i c a n t s p e c i f i c notions.
3 . Diophantine approximations t o a l g e b r a i c numbers.
Modern r e a d e r s w i l l be
f a m i l i a r with t h e relevance of diophantine approximations t o diophantine equations, f o r example, approximations t o 3 f i
2 - 22
and i n t e g r a l s o l u t i o n s o f
p.1.8 of [ S e ] f o r up-to-date q u a n t i t a t i v e information.
-
=
c ; cf.
Evidently, t h e l o g i c a l
p u r i s t a t t h e time of W h a g o r a s would have been ill at ease with t h i s connection. be r a t i o n a l numbers i n t h e i r lowest terms, and a
3.1. Let p/q
numbers of degree > 2 l i t e r a t u r e takes
DA
over
Q
.
algebraic
Then t h e c l a s s i c a l number-theoretic
i n t h e form:
For a l l such
t h e r e a r e only f i n i t e l y many where t h e best-known i n s t a n c e s of
and p o s i t i v e i n t e g e r s
n
< q -T(n),
q : Ia-p/ql 7:
a
are:
W + IR
( i ) n = degree of a ! , T(n) = n / 2 + 1 (Thue's theorem, a p r e c u r s o r S i e g e l ' s theorem, and adequate for = l),
Of
2 22
(ii) as above, but
T(n) = 2
fi , used
i n S i e g e 1 (1929), and f i n a l l y ,
(iii) Roth's theorem, which i s independent of t h e degree of
~ ( n =) 2 + l / n
.
The theorem would f a i l f o r
take arbitrary positive rationals Bounds on t h e number of exceptional Davenport and Roth (1955).
E
~ ( n =)2 .
i n p l a c e of
a,
not even f o r
q ( i n t h e sense o f (iii)above) a r e given i n
No e f f e c t i v e bounds on t h e s i z e
n=l.
Each of ( i ) -(iii) above i s a $i
with
l/n. )
l a t e r : height (bottom of p.95 of [ L a ] ) - o f t h e exceptional arbitrary
a,
(Equivalently, one can
statement.
q
o r , as we s h a l l say a r e known f o r
247
Constructive logic versus algebraization
3.2. Versions of (DA) incomparable with (iii)above. A t r i v i a l example: r e s t r i c t i n g a: t o be r a t i o n a l when 2 can b e replaced by 1; c f . ( v i ) on p.94 of [La].
On p.95, a m c h more i n t e r e s t i n g v e r s i o n i s s t a t e d as a COROLLARY, giving
s p e c i f i c conditions of a ' m u l t i p l i c a t i v e nature' mentioned e a r l i e r i n t h i s Appendix.
They a r e b e s t s t a t e d by f i r s t formulating Roth's theorem f o r a r b i t r a r y
number f i e l d s
K
i n p l a c e of
sidering approximations of
@,
as i n Theorem 1 on p.93 of [La], and t h e n con-
a: ( a l g e b r a i c over K ) by s p e c i a l elements of
satis-
K
Then 2 can be replaced by 0 .
fying those m u l t i p l i c a t i v e conditions.
3.3. Implications of t h e successive improvements i n 3.1 f o r f i n i t e n e s s theorems ' j a b o u t diophantine equations. p.186,
(ii)Theorem
4
Obvious examples are given i n
on p. 188, and
(iii)p.
( i )Theorem 1 on
189, 1. 5, of Mordell (1969)i n
terms of t h e s y n t a c t i c f o r m of t h e equations, f o r example, i n case (iii),f o r P = Q where
degree
<
zeros of
P i s homogeneous and i r r e d u c i b l e (over
n-2.
The relevant
~ ( 1a,)
= 0
CT
@) of degree
n
2 3,
a r e determined i n an obvious way by
P,
Q of as
or ~ ( a : 1) , = 0.
But f o r o t h e r equations, even those defining curves of genus 1 such as looking a t t h e s y n t a c t i c form j u s t won't help t o f i n d a relevant
y2=d+ k,
This i s
CT.
where t h e new icleas of Siege1 (1929), and eventually t h e formalism of a b e l i a n v a r i e t i e s come i n ( i f one wants t o d e r i v e ( S ) from some (DA) at a l l ;
Baker and
Coates (1970) have a d i f f e r e n t l i n e of a t t a c k ) .
4.
Constructive meanings of: (DA) + ( S ) .
Perhaps t h e f i r s t meaning t h a t comes
t o mind - and c e r t a i n l y t h e only one guaranteed by a proof i n c u r r e n t i n t u i t i o n i s t i c systems
-
i s this.
There i s a c o n s t r u c t i v e procedure ( f u n c t i o n a l ) of passing from a height bounding function(of CT and n) f o r (DA) t o one f o r t h e height of s o l u t i o n s of ( S ) , together with a proof t h a t t h e procedure works.
(Note t h a t t h i s formulation does
not r e s t r i c t i t s e l f t o hypothetical height bounding functions f o r a r e themselves constructive:
this would be weaker.)
meaning i s t h a t t h e r e i s no e f f e c t i v e height bounding function in
(DA)
(DA)
which
The f a t a l d e f e c t of t h i s f o r arbitrary
12
i n sight.
4.1. A much more u s e f u l meaning requires, f o r any given equation f ( x , y ) = 0 i n ( S ) , an e x p l i c i t l i s t of a: (and a number n ) which a r e relevant t o (S), with t h e hope t h a t t h e y f a l l i n t o subclasses may become a v a i l a b l e .
of
CT
f o r which height bounds a r e or
G . KREISEL, A. MACINTYRE
248
4.2. Better s t i l l , one would hope f o r an arsenal of methods ( d i f f e r e n t ) s e t s of
which provide
such t h a t height bounds f o r approximations t o these
01
01
some height bounds f o r solutions of t h e equation considered.
give
4.3. Best of a l l , t h e procedure should be e f f i c i e n t i n one o r both of t w o senses: ( i )the ( r e l a t i v e ) height bounds should not grow too fast,and ( i i ) t h e procedure
should work both ways: not only t o get bounds f o r ( S ) from (DA) applied t o specific
01,
volved i n q,
but t o pass
-
from
exceptionally large solutions
of -
( S ) t o exceptionally close r a t i o n a l approximations
'exceptional' i n t h e sense of
t h e equation in-
5
01
w i t h large
(DA). summarizing 4 . 1 - 4 . 3 above.
4.4. Formal constructive meaning of: (DA) + ( S ) , To give (an arsendl o f ) procedures which assign: (i)
To each binary equation (defining a curve)
ai ( 15 i
of algebraic numbers
C and integer
(ii) To each such
(iii)
To
C , Q, and
i(15 i
an
5 pC )
5 pc)
aw
and an integer
i n t e g r a l point
Q
and
of genus
Q : an integer
and a f r a c t i o n p/q
1 q1 2
c
(x,y)
X,
z
1: a f i n i t e s e t
n (more precisely,
)
n
.
and
C w i t h max(Ixl, l y l ) > X :
on
i n lowest terms such t h a t
lai -p/ql < q-T(n)
.
4.5. Remark on Baker and Coates (1970). Obviously, t h e absolute height 'bound given t h e r e f o r curves of genus 1, s a t i s f i e s 4.4 t r i v i a l l y ( f o r a r b i t r a r y
xc, 01)
since t h e r e simply a r e no i n t e g r a l
+
(x,y)
on
m u ( 1x1, IyI ) > . ( S ) , constructive o r otherwise, implies t h a t of very large, 4.4 may r e t a i n corresponding
X
C which s a t i s f y
This i s i n accordance with t h e f a c t t h a t t h e v a l i d i t y of (DA)
But since
(S).
an i n t e r e s t f o r a limited range of
i s much smaller then
various ' e f f e c t i v e ' height constants i n
XC.
Q
XC
is
provided t h e
(To check t h i s p o s s i b i l i t y t h e
5 5 6-7
below would have t o be computed
explicitly. ) Number t h e o r i s t s who are more competent t h a n we are, might be able t o i l l u s t r a t e t h a t i n t e r e s t by working out an example, perhaps, f o r t h e curves y2
= g+ k .
C defined by
Specifically, t o use t h e ideas of Siege1 (1%9), i n particular,
suitable nonconstant functions on
C and corresponding
01
(of degree
n), t o
exploit 'surprisingly' l a r g e i n t e g r a l points on C f o r t h e purpose s t a t e d i n
4.3 (ii). 4.6. Remark on extending 4.4 t o modern versions of (DA)
(S).
Here t h e r e i s
a p r i c e t o pay for t h e power of t h e modern mechinery which comes from 'looking
Constructive logic versus algebraization C
a t a curve
249
from d i f f e r e n t p o i n t s of view’ ( f o r example, by means of d i f f e r e n t
embeddings i n t h e same p r o j e c t i v e space, o r even i n spaces of d i f f e r e n t dimension). This i s alrea&y c l e a r from t h e r e f e r e n c e i n tacitly, different-heights.
61
t o uniformity p r o p e r t i e s of -
Thus, i n t h e extension of
4.4
b e chosen before we have f i x e d t h e p a r t i c u l a r embeddings of
may have t o
(ii), X
C, which determine
t h e h e i g h t s corresponding t o some of t h e a b s o l u t e v a l u e s occurring i n (iii)of
4.4; c f . t h e Remark i n 86.2 f o r another i l l u s t r a t i o n .
The next two s e c t i o n s
give an admittedly q u i t e s u p e r f i c i a l l i s t of d i v e r s e notions and p o i n t s t o which one must pay a t t e n t i o n .
5.
Geometry: P r o j e c t i v e Enibeddings and Heights.
5.1. By r o u t i n e e f f e c t i v e removal of s i n g u l a r i t i e s , S i e g e l ’ s problem (generalized K ) i s reduced t o t h e following geometric version:
t o a r b i t r a r y number f i e l d s Let C is
C be a p r o j e c t i v e nonsingular curve d e f i n e d over
2
1. Show t h a t
Reminders (i)
C
has only f i n i t e l y many
K.
Suppose t h e genus of
K - i n t e g r a l points.
of u s e f u l p r o p e r t i e s of p r o j e c t i v e spaces and non-singular curves:
p n ( ~ ) i s complete, and, f o r a= completions
a c t u a l l y compact, making l i m i t arguments p o s s i b l e .
of
K~
K,
IP”(K~)
is
.
I n aiming f o r e f f e c t i v i t y ,
we s h a l l have t o f i n i t i z e t h e l i m i t arguments, b u t we would b e l o s t without them. The completeness meant here i s a kind of formal compactness ( c f . Mumford
(1976)
82C, pp.33-36), r e l a t e d t o a s u b t l e r q u a n t i f i e r - e l i m i n a t i o n , i n c i d e n t a l l y somewhat neglected by l o g i c i a n s ; f o r an exception, c f . van den Dries ( A ) . bedding
( i i ) Em-
C i n i t s Jacobian v a r i e t y (about which more i n 66.1 below), r e q u i r e s
C t o be non-singular.
5.2. Height, H(P), t h e b a s i c measure, i s f i r s t defined f o r p o i n t s or
Pn(L)
for
L _3 K
P
i n #(K)
i n terms of c e r t a i n normalized absolute values on
The normalization makes t h e Product Formula hold, and t h i s i n t u r n makes defined;
H
K.
well-
p.44 of [ L a ] , on K-absolute heights, g i v e s a n axiomatic treatment.
The c e n t r a l r o l e of t h e product formula i s p l a u s i b l e enough since, by A r t i n and Whaples
(1945), it a x i o m t i z e s a l g e b r a i c number theory.
For an a r b i t r a r y v a r i e t y
V
,
each morphism V + IPn
defines (constructively) a
height on V.
The r e l e v a n t connections between a l l such h e i g h t s a r e s e t out i n
Chapters 3 and
4 of
[La].
F o r our p r i n c i p a l t o p i c , S i e g e l ’ s theorem and i t s r e l a t i o n t o diophantine
approximation, t h e most obviously u s e f u l p r o p e r t y of h e i g h t s i s t h i s : t h e s e t of p o i n t s i n p.
Pn(K)
49 of [ ~ a l .
of bounded height i s f i n i t e and e f f e c t i v e l y computable, by
G. KREISEL, A. MACINTYRE
250
6.
Algebra:
Abelian Varieties.
Abelian v a r i e t i e s enter i n t o our topic i n at
As mentioned already ( i n $ 5.1)
l e a s t two ways.
, non-singular
curves a r e embed-
ded i n t h e i r Jacobians which a r e abelian v a r i e t i e s , and then, a s i n $3.2, t h e natural version of
(DA)
lowers t h e exponent 2 i n Roth's theorem ( f o r general
-
algebraic v a r i e t i e s ) t o 0 .
C denotes non-singular projective curves over
K.
6.1. The constmction of Jacobians and t h e r a t i o n a l i t y properties which enrich t h e c l a s s i c a l theory of divisors, a r e t o be found i n I1 $2, pp.30-40, of Lang (1959). A s f o r effectiveness, t h e r e a r e primitive recursive procedures
C , n3 on C and any L-rational point
r a t i n g on
on
P
C
n,(C) = A , n2(C) and n3(C, P) a r e embed3ings: A + P n A i s t h e Jacobian of C , and IPn some projective space,
and
A
A + P n a r e defined over
i s equal t o t h e genus of
A
induced by t h e embedding (C, P)
-,Pn . -
L,
and
ope-
, resp. L
C +A,
where
i s an a r b i t r a r y
C.
-
A s i n $5, heights on
C are
A + IPn, or, more precisely, t h e embedding? :
Reminder: uniformity properties of ( r e l a t i o n s between) heights
f o r different choices of 6.2.
over
+A
n2
.
number f i e l d _3 K The fiimension of
c
K,
and
n1
such t h a t
P
w i l l be needed.
On p . l . 9 of [Se], (DA) i s s t a t e d f o r points B on algebraic and abelian
varieties
V
defined over a f i e l d
means of a completion Kv If t h e point
DA 6
. CT
i n V(K ) v
where H
5
H(B)-6
i s a property of K,v,V
DA6
For
K-varieties
For all abelian
V V
V
V.
i s algebraic there
B i n V(K) such t h a t
,
i s t h e height induced by a K-embedSing of
that
defined by
3.
i s the s e t of K-rational points o f
V(K)
a r e only f i n i t e l y many dv(a,B)
and a natural distance
K,
a. -
and of
and a l l algebraic points
i n some P n
Then, f o r a l l
. - Note
K and v,
CT'EV(K~):(V6 > 2 ) D A g ( a : ' ) .
a:
and a l l algebraic points
V
E V(Kv) : (Vp
>
O ) D A ~( a ) .
Formally speaking t h e two statements a r e incomparable because, i n t h e l a t t e r , t h e v a r i e t i e s considered a r e r e s t r i c t e d but t h e range of the quantifier (compared t o
6).
(Theorem 2 on p.
The corresponding socalled
116, resp. Theorem 1 on p.
p
extended
geometric formulations i n [La]
122 )
a r e more convoluted.
-
Though
we have not checked t h e exact r e l a t i o n s between Roth's theorem f o r number f i e l d s and points on algebraic v a r i e t i e s they should be close since t h e co-ordinates of trivially. If 6 5 p then DA6 + D A P
points a r e elements of a numbef f i e l a . NB.
-
Constructive logic versus algebraization
25 1
6.3. If AbDA means DA r e s t r i c t e d t o a b e l i a n V over K, and 6 > (*)
0
(a')+ ( V p > 0 ) Va AbDAp(0)
Va'A'bDA6
6=3
This i s e x p l i c i t on p.1.11 of [ S e ] (where
i s chosen), and i m p l i c i t i n t h e
'geometric' v e r s i o n i n Theorem 1 on pp.l22-l24 of [La].
- Weil
The proof a p p l i e s t h e
theorem f o r a b e l i a n v a r i e t i e s t o V ( K ) / m V ( K ) where, for some 6' > 6 , m must s a t i s f y (m2 - 1)p 2 6' Following pp.l.13-1.14 and 2 . 1 of
weak Mordell
.
[Se], t h e conclusion of (*) w i l l be applied i n 97 t o deduce constructively, i n t h e sense o f 4.4, S i e g e l ' s theorem (S) f o r curves now for V t h e Jacobian v a r i e t y C
those Remark.
C o f genus
2
1, by taking
C , A being a b e l i a n (constructively, f o r
of
A
t h a t a r e given t o g e t h e r with an embedding i n
A,
defined over
K.)
The p a r t i c u l a r proofs o f (*) i n [ S e ] o r [La] e s t a b l i s h (*) constructively-
as they stand, without introducing 'new i d e a s ' - f o r those v a r i e t i e s which some s e t
of r e p r e s e n t a t i v e s of
VK/m
a height bound
Bm
i s a v a i l a b l e (whence a height
V(K)/mV(K)
on t h e elements of bound
B
V over K f o r
with
VK/m
on a s e t of generators f o r V ( K )
can be
e f f e c t i v e l y determined; b u t t h i s i s not used h e r e ) ; i n t h e jargon of t h e track: by enriching t h e d a t a by
B
m
(from which a complete l i s t of a l l t h e elements i n VK/m
can be e f f e c t i v e l y computed).
a
E v ( q ) , we solve
for
a = W ! + x. 1
where
1
Now g i v e n - defining equations f o r
a! also i n 1' H(ni)
5 Bm
-
any point
V(Kv),
and
ni E V K / m .
Roughly speaking, t h e aim i s t o determine
f o r any i n t e g e r
h' : an i n t e g e r
from exceptionally c l o s e g e t an exceptionally c l o s e with
H(B')
To determine
ho
2
h'
p
ho
- approximations 6-approximation
such t h a t
B t o a: with H(B)_> ho we B' t o
one of
the
a;
.
independently of any ( h y p o t h e t i c a l ) p-approximations
B, one
uses t h e strong uniformity of t h e r e l e v a n t Property 4 of heights (on p.68 of [La]); since
p ' w i l l b e chosen t o s a t i s f y
B =a@' + a
f o r some x eA(K)/mA(K),
we know i n advance t h a t
Now, p.1.11 of [ S e ] needs : H(B')m2-1 only
c E (for all
E
>
0)
< H(B) while quasi-equivalence provides
such t h a t for all B '
and
r,
G. KREISEL, A. MACINTYRE
252 2
<
H(B')m Choose
c g H(B)'+',
so s m a l l t h a t
G
m2
2 2 m -1 < (m - l / 2 ) / ( l + y e )
H(B)
1h2 , one c
(h')
f3
C
P.
dv(a,B)
B
B'
and
.
B
p =mB'+ x i
E
V(K)
say.
5
H(B)-'
x.
f o r one o f t h e
a;.
h0
>
-
h2
V(K) h3
delarge
3
U.)
a r e determined by
Such a choice of
C
a,
is
are a l l &ale.
5
hi'
above t h e n
. B'
i s a c l o s e approximation t o
B
I n f a c t , by t h e r e l a t i o n between t h e h e i g h t s of
i s independent of
So, i f
if
and s a t i s f i e s :
dv(a;, B ' ) < C ' H ( B ' ) - 6 ' C'
h'
h-'
(Since t h e
may depend on
dv(a,B)
where
<
( p.1.11 of [ S e ] ) t h e morphisms : B ' , - t m B ' + x .
Now, suppose t h a t
one of t h e
2
, B ' ) < c dv (%B)
i s independent of
possible since
If
so l a r g e t h a t H(B')
To ensure t h a t
and
i
i s chosen a f t e r a, C
h3
ho
(It a l s o remains t o v e r i f y t h a t
=@' + n
a,(";
and
and t h e n
H(B).
The l a s t preliminary s t e p i s t o choose
effectively.)
enough t o e,"sure t h a t i f
where
.
c = h7 c € 1
Cg
u s e s t h e o t h e r d i r e c t i o n of quasiequivalence, making
sufficiently larger than termines
- l / 2 < m2(l+c),
if
<
H(B')m2/(1'E)
t h a t is,
max(h1,h2 dv(";,
B'
.
Since
6'
8' :
and
,
> 6,
C'
<
h6'-6
for all
h
2
h2 '
, h3) B ' ) < H(B')-6
.
6.4. For r e f e r e n c e below: t h e i m p l i c a t i o n (*) i n 6.2 i s uniform i n t h e 3 (suppressed) parameters the field
K, t h e v a l u a t i o n
V assumed t o be defined over K . assume t h e premise f o r tencling
v
and t h e a b e l i a n v a r i e t y
V,
A n a t u r a l formal weakening of (*) i s t o K' 2 K and v a l u a t i o n s v ' on K' ex-
extensions
v ( a n d now p o i n t s i n V(K') a r e considered ; i n 8.2 below we s h a l l have
t o vary a l s o f u l only i f
V).
Since
v
has s e v e r a l extensions
v'
,
t h e weakening i s use-
AbDAB i t s e l f i s r e s t a t e d f o r a r b i t r a r y f i n i t e s e t s
( c f . [Se] p . 2.09):
S
of v a l u a t i o n s
253
Constructive logic versus algebraization
7. Application t o S i e g e l ' s theorem ( S ) .
Recall t h a t
points on a p r o j e c t i v e , non-singular curve
9 6.
explained i n
concerns
(S)
1.
C of genus
[Se], pp. 1.13 - 1.14, and i m p l i c i t i n
The idea, e x p l i c i t i n
Theorem 2, on pp. 124-125, of [La] i s t o d e r i v e (S) from AbDA i s nowthe ( a b e l i a n ) Jacobian v a r i e t y
V
>
p(
C
of
A
,
0) and a l g e b r a i c p o i n t s O i on A a r e determined by (K and) C
A s s t r e s s e d i n 3.3, t h e choice of
(199). - Remark.
already i n S i e g e l
example, f o r
q*
p
and
f o r which t h e
, of
genus
g,
particular
standing
E A(K),
-
lP1 .)
For any points
H* c P
"1
for
where Bo(P)
>
order of
, introduced i n
+ lPl
denotes t h e height on
po,de-
P, on
C ,. for
B
= (xo,
xl,
s t e p s o n p.l.14 i n [Se].
S i e g e l (1929), i s given by
. . ., xg ) ,
(1
) above. (cp" maps Bo(C), C A , i n t o C or, equivalently, on Bo(C) induced by (p"
in
0, a n e f f e c t i v e bound i s obtained f o r t h e height of those i n t e g r a l
on
c
f o r which
IlogIq*(P)l,/log
H*(P)I e
So i n t e g r a l p o i n t s on
(9".
say
c o n s t r u c t i v e proofs of implications involve t h e contra-
(p" : C
q*(P) = xo/
B,
By 6.1, a
K-point,
f o r t h e r e s t of t h i s s e c t i o n .
p o s i t i v e , t h e exposition below r e v e r s e s t h e
7.1. The
may
C in A ;
i s e f f e c t i v e l y a v a i l a b l e from any
Since, by 4.4,
Reminder.
-
C by
will b e assumed below as p a r t of t h e d a t a .
C
and
K
, of
C is
the
K = I, from a r a t i o n a l , not n e c e s s a r i l y i n t e g r a l p o i n t .
example, f o r Fix
Bo
some embedding,
K,
ratio of
p/q i s (uniformly) bounded away from 1.
q
a l s o be thought of as defined on t h e image of
Po
makes t h e
Specifically, f o r
and v = v m , not o n l y t h e number of i n t e g r a l p o i n t s on
K=$
number of d i g i t s i n
f i n e d over
defined on
Nevertheless, [Se], p.1.14,
bounded, b u t a l s o of those r a t i o n a l p o i n t s
(t)
.
i s not a t a l l banal; they come from t h e
O.
apparently novel p o i n t t h a t t h e argument proves more t h a n ( S ) .
some such
where
P
poles and zeroes of a c e r t a i n (non-constant) r a t i o n a l f u n c t i o n
C,
integral
1, and t h e notions
-C
5
c,
C of l a r g e height
There a r e such s i n g u l a r i t i e s of
i s not constant.
t h a t is, f o r
< 1q*(p)lv < ec
H*(P)
2 3( >
e) :
.
can occur only near p o l e s o r zeros of
logIcq*I,
, at
least a t i n f i n i t y , i f
(The proviso i s checked by t h i n k i n g of
(p"
C as a curve i n a . )
G . KREISEL, A. MACINTYRE
254
(I),
CI by Po i n which a r e a l g e b r a i c p o i n t s over A , a r e t h e i' candidates f o r exceptionally c l o s e approximations by elements of A . This i s t h e
Their images,
f i r s t half required, i n 4 . 4 ( i ) , f o r a c o n s t r u c t i v e proof of ( S ) from AbDA ( o r , P -1 l o c . c i t . ) . The next s t e p s determine p equivalently, p = n i l s i n c e T(n) = n
.
from (K and) C
The f a c t s above a r e enough t o explain t h e choice of t h e socalled geometric formul a t i o n s on pp.115-118 of [ ~ a ] .
(p"
7.2. The e f f e c t i v e separation of poles and zeros of
C
i n t e r v a l s on
-
or, as always:
of an upper bound
c*
B (12)-
equivalently, on
)logIq*I
for
Iv
by a f i n i t e number of
, and
o u t s i d e those i n t e r v a l s
t h e computation Ii
around
Cx
i '
i s a r a t i o n a l function; i f one d i s l i k e s t h e empty
only uses t h e f a c t t h a t
q* s e t , one adds: which i s not constant.
Furthermore, t h e c.
, and
ai
at
order of
a l l t h e poles and zeros involved can be computed, say
ci
constants
such t h a t ,
with t h e convention t h a t poles have p o s i t i v e order.
7..3. Evidently, t o apply fl*
an3, t h e height, H
an embedding of
A
,
AbDA, it i s c r i t i c a l t o u s e t h e known r e l a t i o n between
i n some
volved i n t h e statement of
positive
ko
and
%
A (of
on t h e Jacobian
C) induced by (B
lPN (and t h u s a height on
C via
:C + A ,
and)
Bo : C + A )
in-
AbDA:
being obtained e f f e c t i v e l y , and uniformly i n
B.
7.4. To s a t i s f y t h e remaining conditions of 4.4 (without attempting Optimal bounds) t a k e c* from 7.2 f o r c i n 7.1. Then, i f H*(P), a f o r t i o r i , i f klH (B)ko > e , and
then
P
i s l o c a t e d i n j u s t one of t h e i n t e r v a l s
and so, i f
C
= maxlc.
-c*/,
ho
Then, for
l a r g e enough t o absorb i n
H(B)
>
ho
of 7.2.
Also by 7.2,
I ,
dv(ai,B) Choose
Ii
and
p = k0c*/2z
-k c*/E H(B) O k0c*/2 5 a l l the coefficients i n sight.
hO
Constructive logic versus algebraization
X=max(Q, h )
To s a t i s f y 4 . 3 ( i i ) , take
connection between heights i n
.
C and A
255
This i s simple because of the close (but no more so than f o r the c l a s s i c a l
analogues i n 3.3).
4 . 3 ( i i i ) i s s a t i s f i e d because any P t o be considered i s located i n a certain
,
Ii
and t h e ( r a t i o n a l ) approximating element on A
i s provided by Bo(P).
Remarks f o r comparison w i t h t h e corresponding r e s u l t s i n Theorem 2 on p.124 of F i r s t , we have considered only
[La] o r p.2.01 of [Se]. not a s e t
one valuation
v, and
involved i n t h e (usual) statement of ( S ) f o r S-integral points.
S ,
Secondly, we have not made e x p l i c i t t h e dependence of
p
on t h e degree of
K
(over t h e prime f i e l d ) which a r i s e s from t h e exponents i n t h e definition of heights needed t o make t h e product formula hold, but have hidden it i n
k -somewhat l i k e
p.1.14 of [Se] and unlike p.324 of [La]. Reminder. for
6
When knowledge of
> p to
pendent of
>
K
6/p
i s used, a s i n 6.3, the passage from AbDA
AK/m
i s uniform i n
P
K(v and A), and so t h e
Nevertheless, t h e relevant m
K.
affected by (m2 -1)
AbDA
since t h e l a t t e r a f f e c t s
p,
6
m needed i s inde-
f o r deriving ( S ) from AbDA6
is
i s required t o s a t i s f y :
and m
.
8. What can be done without knowing AK/m?
The l i t e r a t u r e , i n particular,
[Se],
contains sketches of two answers, s o t o speak, at opposite ends of t h e scale.
8.1. Siegel's Theorem ( S ) f o r curves V01
AbDA
above.
6
(01)
C over K i s derived, not from
f o r A ( K ) , but f o r a suitable extension K'
Specifically,
A(K')
of
as i n 6.4
K;
has an mth ' r o o t ' of each point on
A(K).
, copied
6.4 from p.2.09 of [Se]. i s determined (from C , K , v ) a s i n 7.4, modified f o r a s e t
valuations, say, place of one
AbDAi
in
> p),
of
S
I n particular S
p
of valuations i n
v.
Now t h e general idea of 6.3 can be applied ( f o r an 6
At
set
t h i s place one needs t h e formulation of Roth's theorem f o r a f i n i t e
AK/m.
but without recourse t o
m
derived from
p
and
Specifically, f i r s t , a s i n $ 7 , (S) i s
derived constructively from t h e conjunction of AbDAi(CXi),
applied t o t h e abelian v a r i e t y
f o r t h e s e t of valuations are obtained as follows. points
0li
on A(K);
algebraic over
v' As in
f o r each
.
extending t h e
07
v
involved i n (S), and the
t h e poles and zeros
ai, one takes
A(K), anct so over
A(K')
A(K').
(m
their
of
(p*
are algebraic
mth roots
i s determined from
0";
C
01;:01.
, K,
1
v
=MZ!
1
via
G. KREISEL, A. MACINTYRE
256
Now, since f o r any B i n A ( K ) , some B ' i n A(K'): B = I@' , B i s d i v i s i b l e by m without remainder, the - f i n i t e l y many - possible
p , as before.) that i s ,
AK/m, used i n 6.3, a r e no longer needed. Roughly speaking, i f p i s a p-close approximation t o Oi then p ' i s a 6-close approximation t o one o f t h e a ; . - Incidentally, t h e r e i s an obvious device f o r avoifling the 'enrichment of data' used i n $7, of presenting C together with an embedding remainders
Po : C +
xi,
ni
E
Since we introduce extensions of K
A.
and use
L'
i n place of
anyway, we might a s well s t a r t
L ( i n which a
C t o form a f i e l d
by adjoining a point on
Po
can be defined),
.
K'
We plan t o give d e t a i l s elsewhere, f i l l y enough t o compare t h e r e s u l t with a weak precursor, s t a t e d a t the end of Robinson and Roquette (1975).
It i s weak; not so
much f o r quantitative reasons ( s i n c e - a s i s usual i n model theory
-
only general
recursiveness i s established), but because of t h e f a t a l defect, explained at t h e beginning of
$4 of
r e l a t i v e recursiveness, primitive o r general; cf. t h e contrast
between Turing and many-one reducibility. - A more formal defect of Robinson and Roquette ( 1 9 5 ) i s t h a t it gives no warning of using the passage t o an extension a t a l l ! I n f a c t , Lemma 7.5 on p.170 loc. c i t . i s false, as confirmed by
K'
Roquette ( i n correspondence), precisely because such a passage i s involved i n t h e proof, but not s t a t e d i n t h e Lemma.
Incidentally, the proof, i n Roquette (1976),
i s purely algebraic, and at l e a s t as long as t h e non-standard argument of Robinson
and Roquette
(1975), not
counting the l e i s u r e l y general exposition of non-standard
arithmetic.
8.2.
The second sketch, on pp.1.12
-stays
in
K,
though
1.13 of [Se], i s much more ambitious: one V. Less knowledge of VK/m i s
-
on the given variety
used than i n 6.3, but an i n t r i c a t e 'cover' b u i l t on t h e f i n i t e l y presented Selmer group S ( m ) ; c f . Cassels (1$6), p.259 and especially p.265. (with each Va end Aa defined over K ) are: an embedding em:V(K)/mV(K) -,S(m) ; f o r each a
not
Au:
necessarily abelian variety
-, V
Vu
For each
V
where, f o r
and
d: (B; , P i )
B ' E Vu(K)
< Co
dv
e S(m) :
(homogeneous space), and a morphism
u = emn, Au(Vu(K)) i s t h e coset of VK/m containing
t h e r e i s a height
for all
V
u
Other a u x i l i a r i e s
H (and distance d:)
m2 -1 and p = A B ' : Hu(B )
(BlrB2)
for
B,B1,B2
Now, as i n t h e Remark of 6.3, f o r any
K,v,
such t h a t
<
H(B),
of large height, say, abelian
TI.
V
2
and a e V (Kv),
ho
.
AbDAp
i s derived constructively from t h e conjunction (valid by Roth's theorem) of
DAg applied t o :
all vu , u e s ( m ) ,
a
= A
This i s a l a r g e r s e t of equations than i n
u
6
(a'0 ). NB. 0
( 0,":
I Ie
VK/m)
. -For
each
p
and
E V(K)
e
with
vu ($)
H(B)
>_
satisfying: ho
6.3, corresponding t o
, look
for
u
E
S(m)
257
Constructive logic versus algebraization
and
B ' c Vo(K)
Such a
p'
s.t.
e x i s t s ; i n f a c t , f o r some u = n 9,
: x B VK/m (n
i s t h e remainder
B a f t e r 'division' by m ) . Because of t h e bound on H ( P I ) , by 5.2 a l l such B ' can be effectively determined. For each p a i r (0,P ' ) , and one of the a; : d: (a;,B ' ) < H(p')-6 , a s required; c f . also t h e FS. of
9.
Logical and mathematical parameters ( c l a s s i f i c a t i o n s ) .
tinues
This f i n a l section con-
$ $ 1-2 of t h i s Appen3ix i n t h e l i g h t of d e t a i l s i n $$3-8.
9.1. The difference between l o g i c a l and mathematical choices of parameters i s i l l u s t r a t e d well by 8.1, specifically, t h e kind of effectiveness of
K , relative t o DA,
number f i e l d
K' of
f o r extensions
K
for the
S ,
established logi-
cally a t t h e end of Robinson and Roquette (1975) and mathematically on pp.2.092.10 of Serre (1980).
The former i s so crude t h a t
some
of i t s weaknesses are
easily s t a t e d i n familiar l o g i c a l terms; f o r example, general versus primitive recursiveness, Turing versus many-one reducibility.
But t h i s gives no idea of t h e
dominant parameters involved, f o r example, t h e features of t h e curve which a r e enough t o determinethe degree of applied t o
a:
K'
obtained by
K' involved i n DA',
, (with similar questions about t h e degree of the - possibly choosing a variant of - (p* i n 5 7 ).
C in
S
short f o r : DA algebraic numbers
A s s o often with
c l a s s i f i c a t i o n s t h e inadequacies of t h e l o g i c a l variety mentioned a r e seen most clearly by looking a t cases which f a l l i n t o t h e 3 class, f o r example, the easy reduction of
S
to
DA'
, and
t h e delicate one of S
resp. pp.1.12 -1.13 of Serre (1980). as much as i n economics, only
after one
language : of the relevant parameters
to
DA
on pp.2.09-2.10,
Without exaggeration: i n mathematics almost
-
has a good idea what t o count
-
i n fancy
can a c l a s s i f i c a t i o n by some 'universal'
complexity measure, such a s r a t e of growth, be rewarding. 9.2. A s f o r axiomatizations, inspection shows t h a t t h e argoments involved i n t h e proof of Siegel's theorem can be formalized i n a r a t h e r weak subsystem of some of them a r e d e c i d e w d i f f i c q l t .
T h i s confirms (also
Ip ,though
i n t h i s instance) general
experience t h a t d i f f i c u l t y i s not correlated with socalled l o g i c a l strength, measured by t h e l o g i c a l complexity of t h e principles and t h e l i k e
-style
-
t h a t a r e used.
- of
induction, comprehension
More significantly, there i s another, mathematical
of axiomatization, which i s highly effective here; specifically, by using
t h e Product Formula t o axiomatize t h e subject of S i e g e l ' s theorem and, indeed, of algebraic number theory i n Lang (1962) pp. 122-U5, resp. Artin & Whaples (1$5), already mentioned i n 5.2.
I n contrast, t h e l i t e r a t u r e on ( f i l i g r e e ciistinctions
concerning) l o g i c a l strength has kept very close t o axiomatizations suggested by
258
G . KREISEL, A. MACINTYRE
Gentzen's o r d i n a l a n a l y s i s .
They always involve some p a r t i a l orderings, such as
f i n i t e l y and i n f i n i t e l y branching, wenfounded and o t h e r t r e e s .
That l i t e r a t u r e
has not even considered t h e imaginative mathematical axiomatizations above or, f o r t h a t matter, t h e most f a m i l i a r ones (of ordered, p-a3ic and o t h e r f i e l d s ) , l e t alone whether they f i t i n t o any of t h e c u r r q t l o g i c a l c l a s s i f i c a t i o n s ; more prec i s e l y , modulo some system regarded as ' b a s i c ' i n t h e t r a d e . Once t h i s formal matter i s decided ( p o s i t i v e l y ) , one could go on t o t h e more i n t e r e s t i n g question: Which s i d e g a i n s what from such equivalences?
Comparable equivalences were popu-
l a r at t h e t u r n of t h e century; f o r example, between Pappus theorem i n p r o j e c t i v e geometry and commutativity i n skew f i e l d s ( i n a l g e b r a ) , with a q u i t e d i s a s t r o u s balance of t r a d e f o r algebra: a s o r t of welfare p r o j e c t f o r t h e kind of f i l i g r e e This i s i n sharp c o n t r a s t t o
axiomatic geometry i n t h e p a r a l l e l considered here.
t h e many c o n t r i b u t i o n s of t h e more c e n t r a l p a r t s of geometry t o o t h e r branches of mathematics, l e t alone physics. PS. summarizing t h e broad conclusions of § § 7-8.
S i e g e l ' s theorem f o r K-integral
C i s d e r i v e d c o n s t r u c t i v e l y from Roth's theorem ( i )f o r
p o i n t s on a curve
p o i n t s on t h e Jacobian A
of
C i n t h e extension
Though t h e a l g e b r a i c numbers r e l e v a n t f o r any given
required by 4.4,
-
described i n 8.1, and
K'
(ii) for K-points on t h e not n e c e s s a r i l y a b e l i a n v a r i e t i e s
8.2.
K'
A (K)
described i n
C are s p e c i f i e d as
it remains t o be seen whether e i t h e r ( i )o r ( i i ) i s p r a c t i c a l l y
u s e f b l along t h e l i n e s of
4.1, t h a t i s , whether height bounds a r e a v a i l a b l e f o r
approximations t o a l g e b r a i c numbers r e l e v a n t t o some
C
of i n t e r e s t .
Concerning 8.2 it should b e noted t h a t , though t h e search procedure starts with E S(m) , and S(m) may contain ($x : x E VK/m) properly, it f i n i s h e s up u i n t h e smaller s e t , s i n c e by p.265 of Cassels (1966) for o t h e r : Vu(K) i s empty, and so could not c o n t a i n f3' . It i s e s s e n t i a l t h a t we need
all
u
with
only decide whether
Vo(K)
-
-
contains
K-rational p o i n t s of height
<
hy(m2-1)
' e s s e n t i a l ' i n t h e sense t h a t no e f f e c t i v e method i s known f o r deciding whether t h e corresponding diophantine equations have K-rational s o l u t i o n s t o u t c o u r t .
;
259:
Constructive logic versus algebraization REFERENCES
ARTIN, E. and WHAPLES, G. 1945, Axiomatic c h a r a c t e r i z a t i o n of f i e l d s by t h e product f o r m l a , B.A.M.S. 51, 469-492.
ATIYAH, M.F. 1966, The r o l e of a l g e b r a i c topology i n mathematics, J. London Math. SOC. 41, 63-69.
BAKER, A. 1964, On Mahler's c l a s s i f i c a t i o n o f t r a n s c e n d e n t a l numbers, Acta Math.111, 97-120. BAKER, A . and COATES, J . 1.970, I n t e g e r p o i n t s on curves o f genus 1, Proc. Cambridge P h i l o s . SOC. 67, 595-602. BISHOP, E.
1967, Foundations of c o n s t r u c t i v e a n a l y s i s , Mc G r a w H i l l .
BROWDER, F.E. (ed. )
1976, Proc. Symp. Pure Math. 28.
1967, C a l c u l d i f f g r e n t i e l , Hermann.
CAFiTAN, H.P.
1962, Arithmetic on curves of genus 1. I V . CASSELS, J.W.S. vermutung, J. r e i n e angew. Math. 211, 95-112.
Proof o f t h e Haupt-
CASSELS, J.W.S. 1966, Diophantine e q u a t i o n s w i t h s p e c i a l r e f e r e n c e t o e l l i p t i c curves, J. London Math. SOC. 41, 193-291.
DAVENPORT, H. and ROTH, K.F. Mathematika 2, 160-167.
1955, R a t i o n a l approximations t o a l g e b r a i c numbers,
DEL~ELL, C.N. 1982, Case d i s t i n c t i o n s a r e n e c e s s a r y f o r r e p r e s e n t i n g polynomials as sums of squares, 87-104 i n Proc. Herbrand Symposium ( e d . J. S t e r n ) . N o r t h Holland. DRIES L. van den, Some a p p l i c a t i o n s o f a m o d e l - t h e o r e t i c f a c t t o ( s e m i - a l g e b r a i c ) geometry, To appear i n 1ndag.Math. DRIES L. van den, and WILKIE, A . J . , Gromov's theorem concerning groups of polynomial growth and elementary logic, Jml. of Algebra. FRIEDBERG, R.M. 1957, Two r e c u r s i v e l y enumerable s e t s of incomparable degrees o f u n s o l v a b i l i t y . Proc. N a t . Ac. S c i e n c e s 43, 236-238. FRIEDMAN, H. (75 'I- E 45).
GOAD, C.A.
1975, Programs and r e s u l t s i n l o g i c I, Notices A.M.S. 22, 476
1980, Computational u s e s of t h e manipulation o f formal proofs, STAN-
cS-80-819,Stanford, C a l i f o r n i a . GEDEL, K. 1958, fiber e i n e b i s h e r noch n i c h t b e n k z t e Erweiterung des f i n i t e n Standpunktes, D i a l e c t i c a 12, 280-287. GRUNEWALD, F . J . and SEAL, D. 1979, The s o l v a b i l i t y of c e r t a i n d e c i s i o n problems i n a r i t h m e t i c and a l g e b r a , Bull. AMs 6, 915-918. GFXJNEWALD, F . J . and SEAL, D. 1981, How t o s o l v e a q u a d r a t i c e q u a t i o n i n i n t e g e r s , Math. Proc. Cambridge Phil. SOC. 89, 1-5. KREISEL, G. 1953, B r i t . J. P h i l . Sc.
A variant t o H i l b e r t ' s t h e o r y of t h e foundations of a r i t h m e t i c , 107-127.
4,
KREISEL, G. 1965, Mathematical l o g i c , T.L. matics, v o l . 3 , 95-195. Wiley, N.Y.
S a a t y (Ed.) L e c t u r e s on modern mathe-
260
LA%,
G. KREISEL, A. MACINTYRE S. 1959, Abelian Varieties, Interscience.
LA%, S. 1962, Diophantine Geometry, Interscience. MacLANE, S.
1979, Review, B u l l . A.M.S., 1, 1005-1014.
1979, Stability of E-theorems and program verification, 73-77 in Semiotika i informatika, 12, VINITI, Moscow.
MINTS, G.E.
MORDEU, L.J. 1.969, Diophantine Equations, Academic Press, London. MUMFORD, D.
1976, Algebraic Geometry I, Springer Verlag.
ROBINSON, A. and ROQUETTE, P. 1975, On the finiteness theorem of Siege1 and Mahler concerning diophantine equations, Number Theory 7, l21-176. ROQUETTE, P. 1976, On the division fields of an algebraic fbnction field of one variable. An estimate for their degree of irrationality, Houston J. of Math. 2, 251-287.
RGTH, K.F. 1955, Rational approximations to algebraic numbers, Mathematika 2, 1-20.
SCHWICHTENBERG, H. 1977, Proof theory: some applications of cut-elimination; pp. 897-895 in : J. Barwise (Ed.), Handbook of Mathematical Logic, North-Holland. SERRE, J.P. 1980, Autour du Thgorkme de Mordell-Weil, Lectures of 6th and 13th October, Collkge de France. Notes by M. Waldschmidt. SHOEWIELD, J.R. 1967, Mathematical Logic, Addison Wesley. ,I
SIEGFL, C.L. 1929, Uber einige Anwenciungen diophantischer Approximationen, Gesammelte Abhandlungen, 209-266.
STATMAN, R.
1979, Review. Bull. A.M.S., 1, 1022-1024.
SUPPES, P. (ed.) 1981, University-level computer-assisted instruction at Stanford, 1.968-1980. IMSSS Stanford.
THE LJJ. BROWER CENTENARY SYMFOSIUM A S . lheLrtm ond D. von Dolen (editors) 0 North-Hollond Publishing Compmy. 1982
26 1
SOME EXTENSIONS OF MARKOV'S CONSTRUCTIVE CONTINUUM AND THEIR
APPLICATIONS TO THE THEORY OF CONSTRUCTIVE FUNCTIONS B.A. Kuher Computing Center, Akademia Nauk ul. Babilova 40 117967 MOSKWA, USSR.
1. a,B
Constructive real numbers are rational numbers or pairs of algorithms
(coded in the proper way) such that a
B
and
determine, respectively, the
sequences of rational and natural numbers such that
Markov's continuum in the title of the paper is the totality of constructive real numbers with the arithmetical operations and equality and order relations between them. Modulo technical details it is precisely the model of the continuum proposed by A.A. Markov (cf. for example, C i - 3 J ) for developing mathematical analysis within the framework of the constructive approach to mathematics which he has founded.
This paper is carried out within this framework. Let us introduce some notations and definitions (unexplained concepts and
2.
definitions of constructive analysis can be found in C41). use N ,
R
and P
tive real numbers.
In the sequel we shall
for, respectively, the sets of natural, rational and construcThe letters i,j,k,L,m
(with or without indices) will range
over the natural numbers. Analogously, the letters r,s used,respectively, for the elements of
and
a,b,x,y
will be
R and D.
By "algorithm" we mean normal algorithm in some sufficiently large alphabet. The scheme of a normal algorithm can be coded as a word in a two-letter alphabet. We call this word the encoding for the given algorithm. We shall say that an algorithm a
is of type M ,
-;+
M2,
where M
M2
are two sets of words, if
262
B.A. Ia(P)
(Here
means that a
KUSNER If, in addition, a
P).
is applicable to the word
is applicable to any word in M I , then we shall say that a Let a be an algorithm, P
a word.
By
-ap
is of type M
1
+ M2.
we shall denote the algorithm con-
structed in some definite way such that, for every word
Q,
Following A . A . Markov 1 2 1 , we shall define a constructive function (c.f.) as an algorithm f of type P
+
0 such that if x = y then f(x)
=
f(y)
paper we shall deal only with everywhere defined functions).
By
denote the constructive segment (interval) with endpoints a
and b
(xEaAb
z
asxsb, x
A c.f.
E
(aVb) we
a A b 5 a < x < b).
f will be said to be uniformly continuous on the segment aAb
one can construct an algorithm 6
A c.f.
aAb
(in this
f
of type N
+
N
such that
is said to be pseudo-uniformly continuous on aAb
Let us call
f
if
to be effectively nonuniformly continuous on aAb
construct a rational number
if
r > 0 and algorithms 6 1 , 6 2
of type N
if one can +
P such
that Vn(61(n),62(n)'EaAb
3.
Besides
& 161(n)-62(n)1
< 2-"
&
lf(61(n))-f(62(n))l
2
r).
D, several larger constructive number systems have been consid-
ered in the literature; among these, we think the system of pseudonumbers to be especially interesting. Let us recall that by pseudonumbers we mean rational numbers or encodings of algorithms of type N
+
R
satisfying the "non-effective" Cauchy criterion
The system of pseudonumbers has been thoroughly studied in recent years.
In par-
Extensionsof the continuum
263
ticular, simple descriptive and computable characteristics of pseudonumbers have been found. Namely, pseudonumbers can be interpreted as
A -numbers in terms of 2
the arithmetical hierarchy or (what is constructively more convenient) as #'-computable real numbers (cf. C5-81). the set of pseudonumbers by denoted in that style by
uI
In view of this observation, we shall denote (the constructive continuum
Do).
We shall use the corresponding notation 4.
might have been
(pAq)l
where
p,q
A s is well-known, any c.f. is continuous at any point
Dl
E
x
E
u.
and
p 2 q.
But, in
spite of this, such a function can be unbounded on the unit segment, or bounded and effectively nonuniformly continuous on
(cf. c 4 ; 9-10]).
Oh1
In connection with this important result the question arises whether an effectively nonuniformly continuous c.f.
f has some special properties in connection
with some constructive continuum richer than by new points one may discover that those points.
f
U. Indeed, after an enrichment U
cannot be continuously extended at some of
If this would happen, we would get a new understanding of the char-
acter of the paradoxical properties of tioned system of pseudonumbers
u1
f.
It is natural to take the above men-
as the required extension of
u.
Let us note
that there is another aspect to the questions considered. A s is well-known, there exist two essentially different approaches to a definition of computable functions over the real numbers.
In the first case, an operator which calculates a function
finds approximations to a value of the function using approximations to an argument number.
In the second case, the operator uses a code of an argument number to get
a code of the resulting number.
In the first case we say that the function is
computed by a Kleene operator (The partial recursive operators of Kleene [ I l l are of this kind).
In the second case we speak of Markov operators (cf. definition of
constructive functions).
Kleene's computdbility is nearer to the intuitionistic
interpretation of real functions, while Markov's approach allows one to develop the theory of constructive functions much more closely to the intuition given by classical analysis since one regards functions just as point-to-point mappings. The constructive definition of functions over
u
computable by Kleene may be given
B.A. KUSNER
264
without any difficulties (cf. 16-71).
By a tree we shall mean a set of finite se-
quences of natural numbers which, together with each finite sequence, contains all of its initial segments.
if Vnll3mT(n,m)
and
... *i
*
numbers
i
we have
f(k,ik).
r
A binary predicate
Vnk&r(n,k)
r(n,e))
&
is said to be functional (over 3
k=L). Afinite sequenceof natural
r
is said to be a beginning of
0 < k 5 n,
if, for every
A functional predicate is said to be a path in a tree M
each of its beginnings belongs to M. is an algorithm
IY
N
of type
+
N
T
A path
Let
An algorithm
be the set
T ,
of type T , 7
w
said to be a (I,O)-functional if, for every two finite sequences s I , that
is an initial segment of
s1
We shall say that a (I,O)-functional
NXT,
of this path such that
s
N
-rt
ery k.
and
is defined Qn 5
r.
w(s)
m = Y
on
'Y
r
=
-
1
r
is
such
s2
we have w(s ) = in T ,
An algorithm
n.
W(S*).
and as-
Y
of type
is a (I,O)-functional for ev-
Yk
r
to be defined on
The value of
-
N
if one cannot fail to find a begin-
is said to be a (I,I)-functional if We shall consider Y
P
lw(s)
lw(s ) 2
is defined on a path
w
(written w < T > = n)
sumes on it the value n ning
lw(s,),
and
s2
if
is said to be computable if there
such that Vi(r(i,ct(i))).
of all finite sequences of natural numbers.
N)
if every (I,O)-functional
i s the predicate Y < D
-
k'
such that
The concepts just introduced are constructive versions of
partial recursive functionals and operators over everywhere defined functions. We have taken this approach from C121. Let T2 T -9
be the set of all finite sequences composed of
different from 0
or
Let us fix some single-valued effective enumeration of
1. 1
1
3
3
segments of the form -cA-c + n will be denoted by
T
.
3,
where
for a sequence n aAa + ;(b-a)
=
in T,,,2. ning in T -3
of length
2
I,
E
T -3
2
we set 0
=
I OS*] = a+g(b-a)Ab.
and
We shall say that of this path,
s
i s any integer.
c
We shall assume that
associate with every finite sequence s
s*o
and
be the set of all finite sequences in which only the first component can be
2
0
I's,
and
0's
x
E
0
is defining some x
T
0
2
OA-
=
3
The segment with index and
T~
=
a rational segment 0
$AI.
.
Let us
Namely,
T ~ ,and, if 0 = aAb, then Let x
D and let r be a path
E
r
defines x
.
It is not hard to prove that any computable path
E
(written
r
= x)
D and, conversely, for any
if, for every begin-
x
E
0,
one can effec-
Extensions of the continuum
tively find a computable path in Tm,2 al, f
a c.f.
computes
We shall say that Y
r
every computable path
in T
2
-3
defining x. f
r
such that
265
Let
be
Y
a (1,l)-function-
if, for every x
=
x
E
D and for
is a path in
Y
'm, 2
Y
and
Analogously, pseudonumbers can be defined by a limiting-computable or, in (cf. L61). It is also clear that, i n 2 representing numbers in the unit segment, one can limit oneself to paths in T2.
other words, @'-recursive path in T
-9
By virtue of the well-known theorem of G.S.
Ceitin (see, for example, L 4 1 ) , every
c.f. is computed by some (1,l)-functional.
It turns out that extendibility of that
functional to paths defining pseudonumbers guarantees the uniform continuity of the c.f. under consideration. In fact, let u s call a (1,l)-functional to be I-complete on
if it is defined on every @'-computable path in
T2
Theorem I.
A c.f.
is uniformly continuous on
f
T2
exists a (I,I)-functional which is I-complete on
The proof of this theorem can be found in C6l.
D
over
T2'
OAl
if and only if there
and computes f. So a Kleene operator computing
an effectively nonuniformly continuous c.f. always has a singularity in
the continuum P I .
The situation is quite different in the case of Markov's com-
putability. The construction of the corresponding counterexample (theorems 2-3 below) is the principal aim of this paper.
5. An algorithm p,q
P I , from p
E
of type D l
0
= q
+
it follows that
Dl
is said to be a I-c.f. if, for every
0(p)
= O(q)
(the equality relation over
pseudonumbers can be introduced in the obvious way, in fact, if and
algorithm a ,
- B(m)I
Vnll3m(Ia(m)
q
by <
B,
p
is given by an
then p = q means that
2-")).
Let u s note that I-c.f.'s, similarly to c.f.'s,
have properties of continuity (cf. C131). Let
x
D.
E
We shall denote by
of the algorithm of type N x
-
E
D\R. -
+
It is clear that
x1 = x2.
R E
the x
D,
for every
x
Thus we obtain a natural injection of O
extends a c.f.
f
itself if
from the description of
I
I-c.f.
-
x
if
E
D
D
x
x
E
R
and the encoding
(cf. section 1 ) if
and that x 1 = x2 into P I .
implies
We shall say that
266
B.A. K U ~ N E R Vx(xrP
A c.f.
f
3
f (x)=O(r;)).
is said to be I-complete if there exists a I-c.f. which extends f.
Theorem 2.
One can construct a I-complete c.f. which is unbounded on
Theorem 3 .
(cf. c 7 1 ) .
OAl.
One can construct a 1-complete c.f. which is effec-
tively nonuniformly continuous on
OAl.
Let us note that in all earlier examples of effectively nonuniformly continuo u s c.f.’s the property of I-completeness was not obtained.
To prove the theorems 2-3 we shall need the following lemma which is of independent interest. One can construct an algorithm y
Lemma 1.
N
of type
+
R
such that:
OVl;
a)
M(y(k)
b)
for every p
c)
One can construct algorithms 6 1 , 6 2
E
E
P I , one can find a natural number m
of type
P
-+
N
E
such that
N such that,
for every
B2(X)
x
E
D and k
Proof.
2
6,(x),
the condition
Let u s fix an algorithm U
algorithms of type any algorithm a
N
2 2-
of type Ed2
holds. -s+
R
which is universal for
R. More precisely, the following condition holds: for
of type
Let u s further denote by
ly(k)-xl
N
[Ul
R
one can find an
i
E
N
such that
an algorithm such that
Let us construct an algorithm a(’)
such that a(l)(i,O)
r
0 and
26 I
Extensions of the continuum
L,j),j+l) r O
i,j),j+l)
a(')
It i s not d i f f i c u l t t o see ( ( 1 ) - ( 3 ) ) t h a t
7
1.
possesses t h e following prop-
erties:
I)
a(')
2)
f o r every
N2
i s an a l g o r i t h m of type
+
N
and
k k ilj(a(')(i,j)
7
k+l
& lU(i,e).
t=0 Let f u r t h e r
v 1 , 'p2
Let t i o n of
'pl
a(2)
be an a l g o r i t h m such t h a t
b e algorithms of t y p e
i f t h e r e e x i s t s an algorithm
I)
0 5 B(n+l) - B ( n ) 5 1
2)
tflc3e(B(L) = k ) ;
3)
if
B(n) > 0
then
f o r every
@,(n)
By p r o p e r t i e s 1)-2) o f
N2
-+
R;
and, f o r
ti
2) i f
Let now
N
B
R.
We s h a l l say t h a t
of type
N
-+
N
Q2
i s a dilu-
such t h a t :
n;
'pl(B(n)).
a(')
w e have:
i s a n a l g o r i t h m o f type N
a ( 3 ) , a(4),
j 2 k
=
+
I) -+
R,
a(2)
i s an a l g o r i t h m of type
then
be algorithms such t h a t
Liz)
is adilutionof
-
Ui.
268
KUSNER
B.A.
It i s n o t h a r d t o check t h a t
N2
i s an algori thm of t ype
has the following properties:
R;
+
2) i f
ci
1)
N
i s a n a l g o r i t h m of t y p e
+
R
such
that
then
For any p
p
E
(Vn(p(n) = p)
DI
w e s h a l l d e n o t e by
if
p
E
R).
Let
bers
(5)
r
t h e a l g o r i t h m of type
From p r o p e r t i e s 11-2)
follows e a s i l y t h a t , f o r every number of
p
p
E
D,,
i n t h e n u m e r a t i o n g i v e n by
N
+
defining
of t h e a l g o r i t h m
it
one c a n f i n d a n a t u r a l number U)
R
i
(the
such t h a t
be an a l g o r i t h m t r a n s f o r m i n g any f i n i t e s e q u e n c e of r a t i o n a l num-
* ... *rk
i n t o a r a t i o n a l number from
Iri-a(')(r0*
The r e q u i r e d a l g o r i t h m
... *rk) I y
> 2- i - 3
OVI
.
i s now g i v e n by
such t h a t , f o r
0 5 i
5
k
269
Extensions of the continuum
It i s obvious t h a t
y(n)
E
OVI.
b
... * a ( 5 ) ( n , n ) ) .
i s a n a l g o r i t h m of t y p e
y
Let f u r t h e r
L e t u s suppose t h a t
(6)
*
= a(6)(a(5)(o,n) * a ( 5 ) ( l , n )
y(n)
p
0,.
E
We s h a l l f i n d
N i
+
R
and t h a t
such t h a t (4) holds.
i s such t h a t i t holds
Vk(a(5)(i,b)
~ x ( ~ ) ( i , b + k&) l p - a ( 5 ) ( i , l ) /
=
Then, by (5) and t h e d e f i n i t i o n o f
for
y,
n 2 max(i,b)
< 2-i-4 -
).
w e have
which w i t h ( 6 ) g i v e s u s
-
~p
y(n)l >
z-~-~,
and t h i s f i n i s h e s t h e p r o o f o f c l a u s e b ) o f t h e lemma. L e t now type
N
+
R
x
D.
E
a (') ,
Therefore, a(3),
such t h a t t h e algorithm
-U .
is a n a l g o r i t h m of
and it h o l d s t h a t
By p r o p e r t y ( 2 ) of ues.
i
We f i n d
a(')
the algorithm
l ~ ( ( ~ ) ( i ) L. e t
a(5)
and by (7),
a(5)(i,j)
=
Iv(n) -
u(i,i)I
l u ( i , i ) - xl
5
Then, by c o n s t r u c t i o n o f
w e have
lo
n 5 max(i,m),
g e t s a l l n a t u r a l numbers as i t s v a l -
a ( 4 ) ( i ) = m.
U(i,i)
Hence, f o r
a(') i
for
j
for
j 2 m
we have ( c f . > 2-i-3
z-~-~
<
m
(S), ( 8 ) )
a(1)
,
B.A. K U ~ N E R
270
from which we we obtain that that for n 2 max(i,m)
The construction of algorithm
from clause c) of the lemma is now obvious.
62
The lemma has been proved. Lemma 1 is of independent interest from the point of view of a classical theorem of Bolzano-Weierstrass. The algorithm y
provides an example of an effective
sequence of rational numbers from the unit segment which has no limiting points in This result turns out to be precise enough.
Dl.
continuum D2
If we took into consideration the
consisting of $"-computable real numbers (cf. Gal), it would be not
hard to see that every algorithmical, bounded sequence of rational numbers (and even numbers from 0) has a limiting point in 6.
y(i) i and
f
Proof of theorems 2-3. y(j).
It is not difficult to construct an algorithm 6
= $
for
i
f
6(n)
and right endpoints of
-Fn
It is clear that we can assume that, for
into a rational neighbourhood of 8(i)n6(j)
D2.
j.
y(i)
Let us denote by
transforming every
6(i) G O A I ,
such that
rn, sn
i z j,
I6(i)I
<
2-l
respectively the left
be an algorithm such that, for every n,
and let F
is a c.f. and
10
and, in addition,
Fn
for
(xsr
v x r s )
r is linear on
r +s
+s
r A
n
and
As
.
Let us consider the functional series m
In virtue of lemma 1 , this series constructively converges for every x one can construct a c.f. m
g
such that, for every
x
E
D
E
D.
Hence,
Extensions of the continuum r +s Clearly, g ( v )
=
n
and therefore g
27 1
is unbounded on
OAI.
I-completeness
follows without any difficulties from clause b) of lemma 1 which implies
of g
the local uniform continuity of
g.
Theorem 2 has been proved.
Let us remark that
theorem 3 follows from theorem 2 because it is not difficult to see that every c.f. unboundedon the unit segment is effectively nonuniformly continuous. But it is r +s easier to note that g(r ) = 0, g ( v ) = n and that lr - s 1 < 2-". n n
7.
Theorems 2,3establish an essential difference between Markov- and Kleene-
computability over 0 which reveals itself and can be formulated after we have taken into consideration the extension
D,
of
D.
enough to obtain that continuous extendibility of a c.f. antee any properties of uniform continuity of
f.
o2
then f
therefore, f
f onto 0 ,
f has a continuous extension
cannot be effectively nonuniformly continuous on
is a pseudo-uniformly continuous function on
Bibliography
would guar-
But at the same time, from a
remark after the proof of lemma 1 it follows that if onto
D, is not
On the other hand,
OAl.
OAl
and,
BA.K U ~ N E R
212
Editorial note.
Of the items in the bibliography, the nrs. 2, 7, 9, 10, 13 are
available in translation: 2.
A.A. Markov,
7.
B.A. Kugner,
On constructive functions. AMS Transl. 29(1963), 163-195.
On a type of computable real functions, Soviet Math.Dok1. 15(1974), 466-470.
Extensions of the continuum
9.
I.D.
Zaslavski?,
Some properties of contructive real numbers and constructive
functions. AMS Transl. 57(1966), 10. I . D .
273
Zaslavski;, G.S.
1-84.
Ceztin, O n singular coverings and properties of construc-
tive functions connected with them. AMS Transl. 98(1971),
41-89.
13. B . A . Kuxner, Continuity theorems for some types of computable operators. Soviet Math.Dok1. 14(1973),
Nathematical Reviews: ( 4 ) 52, p.7 (#53); (Uspenski;).
(I)
221-225.
16, p.436
(Markov);
(6) 53 p.1477 ( # 10652);
(3) 27, p.684 (#3528); ( 8 ) 80a #03071;
( 1 2 ) 19, p.2
THE L.EJ. B R O W E R CENTENARY SYMPOSIUM A S . lbektm and D.van Dalen (editors) 0North-Holhnd Fubshing Company,1982
215
TWO SHEAF REPRESENTATIONS OF ELEMENTARY TOPOSES.*)
J. Lambek and I. Moerdijk McGill University and University of Amsterdam
We study two sheaf representations of elementary toposes, by drawing two different analogies between topos theory and ring theory. When the Heyting algebra of subobjects of 1 is Boolean, the two representations coincide. In particular, when the topos satisfies the axiom of choice, this sheaf representation comprises Henkin's completeness theorem for type theory, the stalks of the sheaf being his general models.
1. INTRODUCTION A
theorem of fundamental importance in Algebraic Geometry asserts [GD]:
Every commutative ring is isomorphic to the ring of continuous global sections of a sheaf of local rings. While many generalizations of this result to other algebraic systems have been pursued (e.g. [Cl], [W]), there is no unanimity on how to extend it to noncommutative rings. It therefore came as a surprise to the authors when they realized that the result remains valid if "commutative ring" is replaced by "elementary topos". The closest approximation to this result in the literature is the result by Comer [CZ] for cylindrical algebras, an algebraization of first order logic, whereas toposes may be regarded as an algebraization of higher order logic. Let us recall the outlines of the proof for commutative rings. With any commutative ring R one associates a compact topological space Spec(R), whose points are the prime ideals P of R, and whose topology is the so-called StoneZariski or hull-kernel topology, with basic open sets of the form D(r) = IPESpec(R) IrtPI. On Spec(R) one defines a sheaf of rings whose sections over D(r) of the ring R[r-']
obtained from R by adjoining an inverse r-'
are the elements for the ele-
ment r. The stalks of the sheaf are the localizations Rp obtained by localizing R at the prime ideal P. For each element r of the ring R one has a continuous section of the sheaf space, where ;(P) = Lp(r), Lp being the canonical homomorphism R -+ Rp. The correspondence r I+ 1 between the elements o f R and the sections of the sheaf space is one-to-one and surjective.
J. LAMBEK, I. MOERDIJK
216
P
Figure 1 Let us t a k e a c l o s e r look a t t h e l o c a l i z a t i o n tained by i n v e r t i n g a l l elements of 1 Rp = R[X- 1, where X = {seRlsp!PI. and
s
The homomorphism
C.
E
i s c a l l e d t h e component of
0
R/Op
when
at -f
i s von Neumann r e g u l a r :
R
Rp
-f
Rp
at
R
I t i s ob-
P.
P, that is,
r onto r / l .
sends
r/s with
r
E
R
I t s kernel
P;
it plays an important r o l e i n Commutative
Rp
i s f r e q u e n t l y an isomorphism, f o r example,
r
f o r each
E
R
I n t h i s p a r t i c u l a r case one a c t u a l l y has
rsr = r.
of
which a r e not i n
I t s elements have t h e form
L : R P
Algebra.
The monomorphism
R
there exists Op = P
and
s
E
such t h a t
R
Rp = R/P,
and
t h e sheaf i n t h i s s i t u a t i o n has been s t u d i e d by P i e r c e [PI. SPECTRAL SPACES
2.
I n [Ho], Hochster d e f i n e s a category of topological spaces, t h e so-called
s p e c t r a l spaces, and shows t h a t t h e s e a r e p r e c i s e l y t h e spaces of t h e form Spec(R)
f o r some commutative r i n g
They a r e a l s o p r e c i s e l y t h e spaces which
R.
show up a s Stone spaces ( o r s p e c t r a ) o f d i s t r i b u t i v e l a t t i c e s .
In t h i s s e c t i o n
we c o l l e c t some f a c t s about s p e c t r a l spaces t h a t w i l l be needed below.
For more
d e t a i l s , the reader i s r e f e r r e d t o [Ho] and [BD] and t h e references c i t e d t h e r e . Recall t h a t a topological space s e t has a unique generic p o i n t . space i s
To,
but sober and
DEFINITION 2 . 1 (Hochster).
T1
sober i f
is
X
each i r r e d u c i b l e closed sub-
Every Hausdorff space i s sober and every sober a r e incomparable.
A t o p o l o g i c a l space i s s p e c t r a l i f i t
i s compact and
sober and has a b a s i s of compact open s e t s which i s closed under f i n i t e i n t e r sections.
(We use "compact" i n t h e sense t h a t it does n o t imply "Hausdorff".)
H
= (H,h,v,O,l)
A prime f i l t e r i n
x
A
y
E
P,
and
Let
be a d i s t r i b u t i v e l a t t i c e (with l a r g e s t and smallest elements).
H x 2 y
i s a proper f i l t e r E
P
implies
x
E
P 5 H (i.e. P)
0
k
P # !ii,x , y
E
P
with t h e a d d i t i o n a l p r o p e r t y :
implies
Two sheaf representations if Let
Spec(H)
x v y
E
P
then e i t h e r
x
E
277 or
P
H,
be t h e s e t o f prime f i l t e r s of
y
E P.
topologized by taking a s
basic open s e t s t h e s e t s
for
x
for
x,y
E
E
H,
(For t h e t h i r d statement:
if
x $ y,
choose a f i l t e r y 1 P;
i s maximal with r e s p e c t t o t h e property t h a t
second of t h e s e p r o p e r t i e s implies t h a t topology.
H i n BH(x).) Observe t h a t
(Usually, we w i l l omit t h e s u b s c r i p t
H.
The space
Spec(H)
{B(x)IxeH}
i s prime.)
P
H - P
The
i s indeed a b a s i s f o r a
Thus, a subset
i s a prime i d e a l .
P
of
of
H
H. is a
Therefore, t h e space
could a l s o be defined a s t h e s e t of prime i d e a l s of
Spec(H)
x which
containing
i s c a l l e d t h e spectrum (or Stone space)
The dual of a prime f i l t e r i s a prime i d e a l . prime f i l t e r i f and only i f
P
then
H , topologized by
taking a s b a s i c open s e t s t h e s e t s D(x) = {ICHII PROPOSITION 2 . 2
Let
i s a prime i d e a l and
H be a d i s t r i b u t i v e l a t t i c e . i s sober;
(1)
Spec(H)
t h e complete Heyting algebra subsets of
Spec(H)
Heyting algebra
In p a r t i c u l a r ,
Proof:
Spec(Cl)
the s e t s
B(x)
O(Spec(H))
o f open
i s isomprhic t o the complete
Idk(tl)
of i d e a l s o f
H;
a r e a l l compact.
i s a s p e c t r a l space.
The proofs a r e analogous t o t h e proofs of s i m i l a r statements about
i s a commutative r i n g .
Spec@),
where
ideal
t o t h e open subset
I
Then
(2)
(3)
~11).
(3) i s immediate.
R
The isomorphism of ( 2 ) sends an
U{B(X)IXEI} o f
Spec(H).
Using t h i s isomorphism,
J. LAMBEK. I. MOERDIJK
278
The easy proof of t h e following p r o p o s i t i o n i s l e f t t o t h e reader. PROPOSITION 2 . 3
Let
be any sober space and
X
compact open s u b s e t s of (2)
X
(3)
S(X)
Spec(H) X
1
Spec(B(X)).
i s a c o n t r a v a r i a n t functor: cp
H;
f o r some d i s t r i b u t i v e l a t t i c e
i s closed under f i n i t e i n t e r s e c t i o n s
( i . e . , i t i s a l a t t i c e ) and Spec
v - s e m i l a t t i c e of
Then t h e following a r e equivalent:
X.
X
Note t h a t
the
is spectral;
(1)
homomorphism, then
B(X)
if
induces a continuous mapping
cp:
ff
K
-+
is a l a t t i c e
Spec(cp): Spec(K)
+
Spec(t()
by
and Spec(cp)-l(Sff(x)) = BK(cp(x)). I n f a c t , it i s n o t d i f f i c u l t t o s e e t h a t t h e p a i r of f u n c t o r s (Spec,O) d e f i n e s a c o n t r a v a r i a n t adjunction between t h e category of d i s t r i b u t i v e l a t t i c e s and t h e category TopSp
of t o p o l o g i c a l spaces
and continuous mappings. The mappings
have t h e a d d i t i o n a l p r o p e r t y t h a t t h e i n v e r s e image of
Spec(cp)
a compact open subset i s again compact open. Let us w r i t e
mappings.
Then e s s e n t i a l l y t h e same adjunction may a l s o be regarded a s giving a
r e f l e c t i o n from
TopSp
SpecSp
Hochster c a l l s such mappings
spectral.
to
f o r t h e category of s p e c t r a l spaces and s p e c t r a l
SpecSp: t h e functor
SpecoO: TopSp
a d j o i n t t o t h e i n c l u s i o n f u n c t o r . (Of course, t h e category
+
SpecSp
SpecSp
is l e f t
i s dual t o t h e
category of d i s t r i b u t i v e l a t t i c e s . ) Finally, l e t one has a b a s i s
US
say a word about sheaves on s p e c t r a l spaces.
8
f o r a topologic space
s e c t i o n s , then a functor Sets,
8.
+
Sets
extends uniquely t o a sheaf
G : O(X)OP -+
where
i f and only i f of
F: Bop
In g e n e r a l , i f
which i s closed under f i n i t e i n t e r -
X
F
has t h e s h e a f p r o p e r t y with r e s p e c t t o coverings by elements
By t h i s we mean t h a t , given s e t s
B, Bi(ieI)
in
8 such t h a t
B =
U
i61
and a family of elements
x.
F(B~ n B for a l l
i,j
E
I,
E
j
F(B.)
+
which i s compatible i n t h e sense t h a t
Bi)(xi)
t h e r e e x i s t s a unique
=
F(Bi n B x
E
F(B)
j
+
B.)(x.) 1 1
such t h a t
F(Bi+B)(x) = xi
Bi
Two sheaf representations
for all i
E
219
I.
Thus, for spectral spaces X to define a functor
=
Spec(H),
to define a sheaf on X it suffices
having the sheaf property with respect to finite coverings. The same holds for sheaves with values in an arbitrary category (see [GI) having enough inverse limits to define G
from F.
QUOTIENT TOPOSES Before we can transport the above ideas out what corresponds to the construction of multiplicative subset C of R . If E is the set E(1,R) of all arrows 1 + R is a
3.
from rings to toposes, we must find the ring of fractions R[C-l] for a a topos with subobject classifier R, Heyting algebra (in particular, a
distributive lattice), and a multiplicative subset X of E(1,R) is just a filter base on E(1,R). Universally inverting the subobjects K(q) 1 classiwill be seen t o give rise to the construction of quotient toposes. fied by q E C Note that we may just as well assume that I: is a filter; for, if U V 5 1 and U is inverted, then V also becomes an isomorphism. For each filter F on E(1,Q) we shall define a topos E/F and a logical functor L(F): E + E/F. The objects of E/F are the same as the objects of E. The arrows f: A + B in E/F are arrows f: 1 + P(AxB) = nAXB in E such that E f i s an element of F. F o r arrows f,g: A + B the proposition t'xcA3!yEB<~,y> in E/F we write f*=-g to mean that f = g is an element of F. Moreover, we Put
Clearly, E/F is a category; it is not difficult to see that it is a topos and that L(F) is a logical functor. E/F will be called a quotient topes of E. (It is called "filter power" in [Jl].) While we prefer the construction of E/F given here, there are two other constructions that may have more appeal to the cognoscenti. First, one may regard E/F as the category of fractions obtained from E by inverting all those arrows 3!XCAfx = y belongs t o F. To f: A + B of E for which the proposition V YCB explain the second construction, let us first assume that F = (p) = {qlE k p * ql is the principal filter generated by p. Then E/F is equivalent (but not isomorphic) to the "slice" category E/K(p), where K(p) is the subobject of 1 classified by the proposition p: 1 + Q (see [LS3]). In general, E/F is equivalent to the direct limit of all E/K(p), where p ranges over all elements of F
J. LAMBEK, I. MOERDIJK
280
The quotient topos E/F is quite analogous to the notion of a quotient ring. In fact, we have the usual "homomorphism theorem" of algebra, which we state without proof. PROPOSITION 3.1 Every logical morphism L: E F between toposes factors uniquely into E L(F) E/F + F, where F is the filter of all propositions p in E for which L(p).=-T in F. -+
We claim that the arrow E/F
-+
F is uniquely determined, that is, L(F)
is
an epimorphism in the category of toposes and logical morphisms. This is proved like the uniqueness of
GI
in
[L2, Theorem 11.11.
COROLLARY 3.2 L(F): E + E/F is initial among all logical functors E which send all elements of F onto T.
+
F
We also state without proof the analogue of one of the usual "isomorphism theorems" of algebra. PROPOSITION 3.3 There is a one-to-one correspondence between the filters G E/F and the filters G of E containing F, and (E/F)/C 2 E/G.
of
THE FIRST SHEAF REPRESENTATION When R is a ring, one knows immediately what is meant by the underlying set IRI. In the case of a topos E, we shall define IEl as the union, automatically disjoint, of all sets E(l,A), where A ranges over objects of E. In passing from E to IE), we don't lose to much: an arrow f: A + B in E is still represented by the corresponding element of E(l,BA). o r even by the element {<x,y>cAxBlfx=y} of E(l,P(AxB)). What are we to make of the analogue of Figure 1 for toposes? Imitating the 4.
definition of the spectrum of a ring, we define the spectrum of a topos E to be the space whose points are the prime ideals Q of E(1,O) and whose basic open sets are the sets D(p) = IQlplQl. Thus, the spectrum of E is just the space Spec(E(1,n)) described in Section 2. From now on, we shall write Spec(E) f o r this space. Mostly, we shall think of the points of Spec(E) as prime filters P, so that basic open sets have the form B(p) = IPlprPl, for p E E(1,n) (see Sectioh 2). In the case of rings, we saw that the sections over D(r) correspond to the elements of the ring obtained from R by inverting r. It is clear from the description of quotient toposes given in Section 3 what the analogue for toposes is: the sections over B(p) correspond to the elements of the underlying set of the topos E/(p). More precisely, for each object A of E we have a functor A
281
Two sheaf representations defined on t h e b a s i c open s e t s of
Spec(€)
with t h e obvious r e s t r i c t i o n maps
A(B(p))
by
+
A(B(q))
for
B(p) 2 B(q),
that is,
E b q * p.
for
The important p r o p e r t y of t h i s functor i s t h a t it extends t o a sheaf on Spec(E).
In f a c t , i n view of what we s a i d a t t h e end of Section 2 , it s u f f i c e s t o
check t h e sheaf p r o p e r t y f o r f i n i t e covers by b a s i c open s u b s e t s . such t h a t , f o r a l l So suppose B(p) = B(qi) and ai E E/(qi)(l,A)
igl
j,
t h e r e s t r i c t i o n s of
t h e r e i s a unique to
€/(qi)
and
a.
a. t o
I
a E E/(p)(l,A)
According t o t h e c o n s t r u c t i o n of
qj)
agree.
Then we claim t h a t
t h e r e s t r i c t i o n of
i,
E/(qi),
i s an arrow
ai
1
3 ! x c A ~ ~ a i ,henceforth abbreviated a s
E C qi *
that is,
(qi),
A
a
ai.
is
such t h a t t h e p r o p o s i t i o n to
€/(qi
such t h a t , f o r a l l
and
i
(Actually,
3!a,.
ai
PA
-f
3!a..
i s an arrow
in
E
belongs
1 +'P(lxA).)
1
E
We a r e given t h a t
(qi
qj)
A
=+
ai = a j ,
for all
i
and
j.
Now r e c a l l a
theorem of i n t u i t i o n i s t i c type theory, which may be c a l l e d d e f i n i t i o n by c a s e s :
(This holds more g e n e r a l l y i f a r e terms of type
B.)
PA
E b p
=,
-
i s replaced by any type
Eb p
Using t h e f a c t t h a t
n 3!UEPAA (qi
*
i=l
B,
a s long a s t h e
(qlV"*Vqn),
= ail
o r , equivalently, t h a t
where
-
ai
Z
-a: 1
L((p))(ai).
unique arrow
-+
PA
Using d e s c r i p t i o n i n t h e topos in
E/(p)
we obtain a
such t h a t n
€/(PI b
E/(p),
A
(qi
*
- -
a = ail.
i=l
By showing t h a t E k 3!; (as i n t h e argument below), i t i s e a s i l y seen t h a t -a.=.L((p))(a) f o r some arrow a: 1 PA i n €. Hence E b qi * a a for +
each
i.
Since
E b qi
E b p * 3!a. Therefore,
3!ai, a
we have
i s an arrow
=
E C qi * 1
-c
A
in
3!a
f o r each
E/(p).
a.
we i n f e r t h a t
i,
i hence
J. LAMBEK, I. MOERDIJK
282
Obviously, t h e d e f i n i t i o n of
i s functorial in
(simply compose), s o we
A
we have a r r i v e d a t t h e following: PROPOSITION 4 . 1 defined by
For any topos
E,
qE: E
t h e r e i s a functor
8 , where 8(B(p))
nE(A) =
A s i n t h e case of r i n g s , t h e global s e c t i o n s of t h e sheaf
arrows when
in
1+ A
p*=*T, a
E.
E/{T)
* Sh(Spec(E))
= E/(p)(l,A).
1
are just the
This i s obvious from t h e d e f i n i t i o n of
corresponds t o an arrow
a: 1
-+
in
A
E.
A;
for,
A l t e r n a t i v e l y , i f we
p r e f e r t o p r e s e n t t h e sheaf by i t s espace BtalB, we a s s e r t t h a t t h e r e i s a b i j e c t i o n between mapping
a b
functor
E
-+
E(1,A)
a,
where
and t h e s e t of continuous s e c t i o n s of a(P) = L ( P ) ( a ) ,
L(P)
h
given by t h e
being t h e canonical l o g i c a l
E/P.
Spec E
P
Figure 2 Another way of expressing e s s e n t i a l l y t h e same observation a s above is t o say t h a t t h e functor on
Spec(E)
determined by
B(p)
C.E/(p)
gives a sheaf
-
with values i n t h e category of toposes and l o g i c a l morphisms.
on
Spec(E)
is
(see [GI), given arrows
p, q l , . . . q n : 1
+
such t h a t
R
Eb p
S(E) That
(qlv*-*vqn),
we have an e q u a l i z e r diagram of toposes and l o g i c a l f u n c t o r s
n
n
-
(The arrows i n t h i s diagram a r e t h e usual ones a r i s i n g from t h e canonical projections
E/(r)
+
E/(s)
for
E b s
r.)
The f a c t t h a t t h i s i s an e q u a l i z e r i s
again a s t r a i g h t f o r w a r d a p p l i c a t i o n of " d e f i n i t i o n by cases". between t h e sheaf
S(E)
and t h e set-valued sheaves
Observe t h e r e l a t i o n
h:
Having obtained a sheaf, one wants t o know what t h e s t a l k s look l i k e . u s u a l , t h e s t a l k a t a p o i n t (prime f i l t e r )
P
of
Spec(E)
As
i s defined t o be t h e
d i r e c t l i m i t of t h e toposes of s e c t i o n s of t h e sheaf on t h e (basic) neighbourhoods
of
P.
This i s t h e topos
283
Two sheafrepresentations
m-
( F o r the last equality, see Section 3 . ) We will call the topos E/P the ization of E at P. Observe that the global sections of an object A of E in the localization E/P are precisely the elements of the stalk at P of the sheaf A, since
Hence, the relation between the sheaf of toposes S(E) and the sheaves of sets pointed out above also holds at the stalks. Let us call the topos E if it has the disjunction property: for any p,q: 1
+
n,
EC p
v
q implies E b p
or E C q .
This terminology is analogous to that in ring theory: E is local if and only if clearly E/P E(1,Q) has exactly one maximal ideal. For a filter P on E(l,Q), is local if and only if P is prime. Not only is every stalk local, but every local topos arises as a stalk in a sheaf representation. For, if E is local, {TI is a prime filter in E(l,Q), hence E is isomorphic to the stalk of S(E) at {TI. Thus "local" is the characterizing property of stalks. We can now formulate the representation theorem as follows: Every topos is isomorphic to the topos of global sections of a
THEOREM 4 . 2
sheaf of local toposes. Let us briefly consider one particular case of the sheaf representation. We has exactly two elements, call a topos E cosimple if the Heyting algebra E(1,Q) cosemisimple if E(1,Q) is Boolean. The motivation for these terms comes from ring theory. Indeed, E is cosimple if and only if {TI is a maximal filter, and it is cosemisimple if and only if {TI is the intersection of all maximal filters. More generally, in any topos E the intersection of all maximal filters is the set of all propositions q such that E C l T q , which thus might be called the "coradical" of the topos. Still more generally, the intersection of all maximal filters containing a given filter F is the set of all propositions q such that
7.q
E
F.
PROPOSITION 4 . 3 The stalks of the sheaf S(E) the topos E is cosemisimple.
are all cosimple if and only if
J. LAMBEK, I. MOERDIJK
284
Proof: F o r a prime filter P of E(l,Q), P is maximal. But each prime filter of E(1,Q) I _
E(1,Q)
E/P is cosimple if and only if is maximal if and only if
is a Boolean algebra, by the remark preceding the proposition.
The reader will have noticed that there are two analogies with ring theory. According to the first, ideals in rings correspond to ideals in E(l,Q), while, according to the second, they correspond to fiIters in E ( 1 , Q ) . We have used the prefix "co" whenever a topos concept is named in accordance with the second analogy. Some topos theoretical concepts fall under both analogies and so acquire two distinct names. For example, cosimple = simple, coprime = local'. 5.
THE SECOND REPRESENTATION
For a topos E we also have a distributive lattice E(l,Q)OP, which may be considered (as in Section 2). Let us write
Cospec(E)
=
the spectrum of
Spec(E(l,Q)OP).
Using the correspondence between prime filters and prime ideals in any distributive lattice and the duality between E(1,Q) and €(l,Q)op, we may also describe Cospec(E) as the space whose points are the prime filters of E(1,Q) and whose basic open sets are the sets -
Note that
and that the complete Heyting algebra of open subsets of Cospec(E)
is isomorphic
to the complete Heyting algebra of filters of E(1,Q). For any arrow p: 1 .+ Q in E, we shall write
for the set of alternatives of p. Alt(p) is a filter, and if V(p) E: V(q) then so Alt (4) C Alt (p) Therefore, we have a presheaf T of toposes defined on basic open subsets of Cospec(E) by
E C q.* p and
.
the restriction maps being the canonical projections E/Alt(p)
-+
E/Alt(q)
for
Two sheafrepresentations
285
V(P) 5 V(q). In general, T is not a sheaf, as will become clear below. Therefore, we shall consider its associated sheaf T. The crucial point about T is that no new global sections are added.
-
LEMMA 5.1
-
The topos of global sections o f
-T
is the same as that of T, that
is, E. The proof of this lemma again uses a version of "definition by cases" f o r intuitionistic type theory, but this time of a rather unusual form and not as easy to prove as the version we used in the preceding section. (Of course, the two versions are equivalent classically.)
LEMMA 5.2 (New definition by cases). If pl,. . . ,pn are formulas and a are terms of type A, then from al,
...,
(i)
for each i and j ,
pivpjvai=a
j'
and
we may infer a!x,A((x=a
Vp )A-*-A(x=anvpn)). 1 1
Proof: Existence is proved from (i) by induction on n. Clearly, the result holds when n = 1. Assume the result for n-1. Now
hence v p i v /\ai i5n i#n Case 1. Case 2. x = 5,
= a
. .
A a . = an. Then the existence statement is witnessed by x = a ifn pi f o r some i 5 n. Then the existence statement is witnessed by where 5
is chosen, by inductional assumption,
so
that
J. LAMBEK, I. MOERDIJK
286
There i s a l s o a d i r e c t proof of e x i s t e n c e . Uniqueness i s proved from ( i i ) a s follows.
n
A
n (x = a 1. v p 1. )
A
and
a
B
A
(y = ai v p i ) .
i=l
i=l
Then t h e r e e x i s t subsets
Suppose
of
v = {l,
...,n l
such t h a t
~ pi. A x = a i ~A p i ~ , r \ y = a i A ica icv-a 1CB icv-8 If
B
and
a
a r e d i s j o i n t , then
( v - a ) u (v-%) = v ,
A pi,
hence
which
icv contradicts ( i i ) .
Therefore,
s o we have
A
x = a.
y = a,,
Proof of Lemma 5.1:
8
and
a
hence
have an element i n common, say
i,
and
x = y.
Given a f i n i t e covering
V(pl)u--*uV(p )
of
Cospec(E)
by b a s i c open s e t s , we have t o show t h a t any compatible family of s e c t i o n s over tlie
V(pi)
al,...,a
comes from a global s e c t i o n . o f type (1)
(recall that 3!ai (2)
that is, the
ai
PA,
A
To t h i s end, suppose we have terms
E,
being an o b j e c t of
f o r each
E/Alt(pi)
i,
such t h a t
I= 3!cri,
, a b b r e v i a t e s 3!x c A ~ ~ a i ) and for a l l
i
and
a r e compatible.
E/Alt(pivpj) b ai = a j ,
j,
Since t h e
V(pi)
cover
Cospec(E),
we have
Moreover, from (2) it follows t h a t
E C p.
V
p.
1
1
V
a. = a . . 1
Therefore, using Lemma 5.2 and d e s c r i p t i o n i n
and that
a
1
E,
we f i n d a term
a
such t h a t
i s unique up t o e q u a l i t y i n E . To complete t h e proof, we have t o show E b 3 ! a . But from (1) and (4) i t follows t h a t n
287
Two sheaf representations
hence that
Eb
Therefore, by ( 3 ) , REMARK 5.3
3!a.
Lemma 5.2 of course also has a relative version: Given any propo-
sition q. if q v l(p A..-AP,) 1 and, for all i and j, then q v 3!xeA((~
al
=
q V
V
p,)
pi
V
A"'A
p. 3
a.
V
(x
a.
=
I'
1
=
an
V
pn))
However, this does not suffice to prove a generalization of Lemma 5.1 for sections instead of global sections. For, if V(p,) U " - U V(pn) covers V(q), in other words, if E b (plh--.hpn)e=* q , we can in general derive that E k q v .(plh*--Ap ) o?ly if q is such that E b q V 19. Thus, T is a sheaf
over V(q)
only if E ( 1 , f i )
is a Boolean algebra. But this case is of no interest here,
because it is easy to see that the present sheaf representation is isomorphic to the one discussed in the previous section whenever E(1,fi) is Boolean. Let u s now turn to the stalks of the second sheaf representation. For a prime filter P, we write Tp s Ip
In o u r second analogy, Tp
E
E(1,fi)
1xqlpE C p v q}.
corresponds to the component of 0 at P in ring
theory defined by Op
The stalk of the sheaf
{r
E
R13slpr-s= 01.
at the point P may now be calculated as
since
To characterize the stalks of 7 we require an auxiliary concept corresponding to the notion of "regular" element of a commutative ring. Call the
J. LAMBEK, I. MOERDIJK
288
proposition p: 1 -+ s2 superfluous if, for all propositions q, whenever . E b p v q, then already E C q . It is not difficult to prove that p is superhence t o the fluous if and only if it belongs to every maximal ideal of E(l,n), "radical" of E, a fact which we mention only by the way. LEMMA 5 . 4 (1)
-
If F is any topos, the following statements are equivalent: F is isomorphic to a stalk of T(E) for some topos E.
There is a prime filter P in F(l,s2) such that Tp*='{T}. (3) For any n-tuple of propositions p i in F, if F b 7 ( p l ~ - - - )~ p then one of the pi is superfluous. (2)
-
(1) ( 2 ) . If F is a stalk of T(E) at the point P of Proof: Cospec(E), that is, F = E/Tp, then the prime filter P in F(1,Q) corresponding to the prime filter P in E(1,O) has the property that T--=*{T} in P F(l,s2). Conversely, if P is a prime filter in F(1,n) such that Tp-=-{TI, F
-
is clearly isomorphic to the stalk of ?(F) at P. (2) ( 3 ) . Tp-=* IT} if and only if P contains all superfluous propositions. But a prime filter with this property exists if and only if (3) holds. A topos having the equivalent properties of Lemma 5.4 will be called primeval. We may then summarize the above discussion in the following representation theorem. Every topos is isomorphic to the topos of global sections of a THEOREM 5 . 5 sheaf of primeval toposes. There is no need to consider the special case of cosemisimple toposes as in Section 4, as it was remarked above that the two representations coincide for cosemisimple toposes. In' analogy to local rings, we call a topos E colocal if E(1,n) has exactly one maximal filter. It is easily seen that E is colocal if but not both, the and only if, for every proposition p. E b lp or E b 3.p We shall call a topos E cosemilocal if, for maximal filter being IplE b .,PI. p v -,-,p. This is equivalent to saying that E(1,hl) every proposition p. E b . satisfies DeMorgan's Law (see [JZ]): l(p A q)-=-,p V .q. Now a topos E is cosemilocal if and only if all the stalks in its second sheaf representation are colocal. For E/Tp is colocal if and only if, f o r every proposition p, either . p o r -,.p belongs to Tp (but not both). This is the same as saying that there exists q k P such that either E b q v . p or E k q v . , p (but not both). Now this certainly holds if E is cosemilocal, for or q C ,p, as they cannot both belong to P. Conversethen we may take q :..p ly, if all the stalks E/Tp are colocal, then, for any prime filter P in E(l,s2),
Two sheafrepresentations either ,p o r filter, and so
-,,p
289
belongs to Tp C P, hence ,p v ,,p belongs to every prime In particular, we have the following: V , ,p.
E b ,p
Every cosemilocal topos is isomorphic to the topos of global PROPOSITION 5.6 sections of a sheaf of colocal toposes. We remark that unfortunately there is no reason why there should be a unique prime filter containing the non-superfluous propositions in an arbitrary stalk, although this is so when the stalk is colocal. (See [Ll] for a similar situation in ring theory.) It may be worth pointing out that, when E = Sh(X) REMARK 5.7 sheaves on a topological space X, then E is iff X has exactly one point, cosimp1e cosemisimple iff every open set is closed, colocal cosemilocal 6.
iff iff
is the topos of
every nonempty open set is dense, the closure of every open set is open.
HENKIN'S COMPLETENESS THEOREM FOR TYPE THEORY REVISITED
In as much as a higher order language may be regarded as a topos E, a standard model of E is a logical functor into Sets. Henkin [He] observed that, in general, there are not enough standard models, hence one requires other toposes in place of Sets to serve as (targets) of models. Let u s call S a model (topos) if it has the disjunction and existence properties, to wit, (1) if S b p v q then S b p o r S b q , (2) if S k Zx,,(p(x) then S k q(a) for some a: 1 + A.
--
Algebraically, (1) asserts that the terminal object 1 of S is indecomposable and (2) asserts that 1 is projective. If S is Boolean, (2) also implies if, for all a E S(l,A), S b cp(a), then S b Vx,,cp(x). This means that 1 is a generator, that is, that the functor r = S(1,-): S + Sets is faithful. This implies that (3)
and, in particular, that r(PA) Pr(A). So, essentially, S is like Sets, except that it has "smaller" power sets: S is equivalent to a general model in the sense of Henkin [He]. Henkin's completeness theorem asserts that a Boolean topos has enough (general) models, that is, when E is Boolean, E C p if and only if, for all logical functors L: E + S , S being a model, S b L(p). To simplify the argument, he assumes in [He] that E satisfies the axiom of choice. We shall make the same
J. LAMBEK, I. MOERDIJK
290 assumption h e r e .
According t o Lawvere, a topos s a t i s f i e s A . C . i f a l l e p i s s p l i t , o r equivalentl y , i f a l l objects are projective.
f o r some
f
E
E(A,B).
E
If
LEMMA 6.1
Proof:
This means:
s a t i s f i e s A.C.
E/F b p,
Suppose
and
F
where
p
i s a f i l t e r , then 5
VxEA3yEBq(~,y).then
A . C . , t h e r e i s an arrow f : A + E b VxEA(p=* cp(x,fx)), hence E k p VxEAq(x,fx). Since p
satisfies
+
is i n
F,
s a t i s f i e s A.C p
E b VxcA3yEB(p* q ( x , y ) ) . B i n E such t h a t
i s Boolean, by Diaconescu's r e s u l t , hence
VxcAq(x,fx)
E/F
E
F,
F.
E
Now
Since
E
E
it follows t h a t
E/F b VxEAq(x,fx).
that is,
Any topos with A . C . has enough models.
THEOREM 6.2
Proof:
If
L(P): E + E/P
P
i s any prime f i l t e r , t h e canonical l o g i c a l functor
i s a model, because
E/P
has choice, so t h a t
1 is projective in
There a r e enough models, because t h e i n t e r s e c t i o n of a l l prime f i l t e r s i s
E/P. {TI.
Actually, we know more: s e n t a t i o n of
t h e models of
E
a r e t h e s t a l k s of t h e sheaf r e p r e -
E.
In g e n e r a l , f o r an a r b i t r a r y topos, not n e c e s s a r i l y Boolean, one can prove a Henkin-Kripke s t y l e completeness theorem using "general" Kripke models.
The
argument f o r t h i s general case i s somewhat more complicated and w i l l be reserved f o r another paper [LM]. 7.
GEOMETRIC MORPHISMS AND ARBITRARY BASE TOPOSES I t i s p o s s i b l e t o c a r r y out t h e sheaf r e p r e s e n t a t i o n over an a r b i t r a r y base
topos;
but then one cannot d e f i n e t h e spectrum o f a topos a s before, because t h e r e Instead, we may look a t t h e l o c a l e (complete
may not be enough prime f i l t e r s .
Heyting algebra) of i d e a l s ( s e e Section 2 ) . looks l i k e . Let (in
E be any topos and
E ) , SpecE(F),
lattice
f,(OF)
sheaves on
F
f
E
We s h a l l b r i e f l y sketch what t h i s
any topos over
i s now defined t o be t h e l o c a l e
in
SpecE(F),
E.
In
E,
E.
The spectrum of
IdE(f,QF)
we can now form t h e topos
F
of i d e a l s on t h e
ShE(SpecE(F)) of
and we have a l o c a l i c geometric morphism
ShE(SpecE(F)) + E.
(The d i r e c t image i s defined by t a k i n g global s e c t i o n s , t h e i n v e r s e image i s t h e
Two sheafrepresentations
29 1
-
f E always factors The geometric morphism F + E. The easiest way to see this is to use the hyperthrough ShE(SpecE(F)) f connected-localic factorization of [J3] and to write F E as a composition "constant sheaf functor!')
F & ShE(f,nF) In E, we have a frame map V: IdL(f,QF) morphism
and the composite L = kog
+
h
f,QF,
E. which induces a geometric
is the required factorization
It is not difficult to show that L
is the unit of an adjunction SpecE -/
ShE
between toposes over E and the category of "spectral locales" (locales of ideals of distributive lattices) and spectral maps in E. In the case where E is Sets, every spectral locale is spatial (there are enough prime filters), and we have returned to the situation described in Section 4 : the functor . n F defined there is the direct image of the geometric morphism R . The crucial property of R is that its direct image L, preserves disjunction V. This property corresponds to the fact that the stalks of the sheaf representation of Section 4 were all local. Let us therefore call a geometric morphism local if its direct image preserves V. The diagram above says that every geometric morphism factors through a local one. The class of local morphisms is fairly well behaved: every hyperconnected geometric morphism is local, and a geometric morphism is local if and only ipthe localic part of its hyperconnected-localic factorization i s local. A localic geometric morphism ShE(A) + E is local if and only if lA is an indecomposable element of the locale A
in E, that is,
A l s o , the class of local geometric morphisms is closed under composition.
J. LAMBEK, I. MOERDIJK
292 :
APPENDIX
THE INTERNAL LANGUAGE OF A TOPOS
To make t h i s paper e s s e n t i a l l y s e l f - c o n t a i n e d , we remind t h e r e a d e r of some p e r t i n e n t f a c t s about toposes and t h e i r i n t e r n a l language, which happens t o be a
For o u r present purpose we r e q u i r e
version of applied i n t u i t i o n i s t i c type theory.
n e i t h e r a type of n a t u r a l numbers i n t h e language n o r an o b j e c t of n a t u r a l numbers i n t h e topos. A language c o n s i s t s of t h e following d a t a :
e: 1, R ,
(1)
PA
and
assuming
AxB,
B
and
A
t o be t y p e s , and
perhaps o t h e r s .
Terms:
(2) a = a'
{x
PA;
of type a
a
and
o f type
a
Alp(x)I
E
of type
A
and
and
a
PA,
assuming
p(x)
R
B;
x
and
of type
and
P
and
A
o f type
A);
E
of type
a'
a r e a l s o c a l l e d formulas.
AxB,
The symbols
assuming
T , I,
A,
v,
=-,
-,,
[LSZ].
of v a r i a b l e s a deduction r e l a t i o n
X
of type
a
a variable
x
and perhaps o t h e r s .
I I may be defined i n terms of t h e above
F o r each f i n i t e s e t
(3)
assuming
of type
b
Terms of type
Y, 3 , 3 !
P,
(as i s i n d i c a t e d by w r i t i n g
A
of type
* of type 1;
v a r i a b l e s of each type and a l s o t h e following: E
between
f i n i t e s e t s of formulas and s i n g l e formulas, a l l f r e e v a r i a b l e s of which a r e contained i n
X.
The r e l a t i o n s
s a t i s f y t h e "usual" axioms and r u l e s of i n -
ference of i n t u i t i o n i s t i c type theory, but may a l s o s a t i s f y o t h e r s . A topes E i s a Cartesian closed category i n which t h e subobject functor i s r e p r e s e n t a b l e by an o b j e c t a , t h a t i s , Sub E(-,R).
E
The i n t e r n a l language of
has t h e following t y p e s , terms and deduction
relation: (1)
Q and
The types a r e t h e o b j e c t s of t h e subobject c l a s s i f i e r ,
E;
PA = RA
1 i s t h e terminal o b j e c t ,
in particular, and
AxB
i s t h e Cartesian product o f
A
B.
Closed terms of type
(2)
A
i n t e r p r e t e d as indeterm'inates.
a r e arrows
category obtained from
E
where
x: 1
by a d j o i n i n g x,
+ A
in
but variables are x
E[x],
o f type
A
is
t h e Cartesian closed
much a s one a d j o i n s an indeterminate
Moreover:
* i s t h e unique arrow a = a'
E,
For example, t h e v a r i a b l e
i n t e r p r e t e d a s t h e indeterminate arrow t o a ring [L2, L3].
in
1+ A
1 -+ 1;
i s t h e arrow,
i s t h e " c h a r a c t e r i s t i c " morphism of t h e subobject
under t h e correspondence Sub(AxA)
E(AxA,Q) ;
A
-+
AxA
Two sheaf representations a
E c1
is the arrow
where
E~
corresponds to
IpA: PA
+
E(PA,P A) {x
E
293
Alp(x) 1
is the arrow 1
+
b
PAxA ---+EA
61,
PA under the correspondence
= E(PAxA,a)l
PA corresponding to the arrow f: A
+ 61
in
E under the correspondence E(A,Q) where
2
E(lxA,Q)
2
E(l,QA),
f is the unique arrow making the diagram
a
*
:f I I
A in E[x] commute; is the arrow 1 + AxB with the same name. (3) To explain p,(X) ,. ,pn(X) q(X), take for example X = {XI, then pi(x)*=*fix and q(x).=-gx in E[x]. We then interpret pl(x), ...,p n(x) I- q(x) to mean: for all objects B of E and for all arrows h: B + A, if T flh,..., f h are all equal to B + 1 0, then so is gh.
..
h
-
When X = {xl,..., x 1. take E[x] = E[xl] ...[xn], which is also isomorphic to E[x], x being a single indeterminate whose type is the product o f the types of the xi. Note, in particular, that p q means that p * q-=-T in E. We usualiy just write this as E b p * q. MLre generally, if p E E(l,R), we write E b p to mean that p*=-T in E. It is not difficult to verify that the "usual" axioms and rules of inference of intuitionistic logic do in fact hold in any topos. There are many ways in which the topos interacts with its internal language. We shall only mention two that play a r6le in this paper. The first is expressed by the slogan "internal equality implies external equality". It asserts that, if f and g are arrows A -P B such that
294
J. LAMBEK, I. MOERDIJK
E C VxcAfx = gx, then f.=-g. Note that we write
-=.
for equality in the matalanguage whenever
it is important to distinguish it from the equality =
in the internal language.
The second is expressed by the slogan "description holds in every topos". asserts that, if r is an arrow 1 + P(AxB) in E such that
It
E b VxEAg!yEB<~,~> 6 r, then there exists a unique arrow f: A
+
B
in E
E b VxEA<x,fxz E
such that
r.
REFERENCES R. Balbes and P. Dwinger, Distributive lattices (University of Michigan Press, 1974) . S.D. Comer, Representation by algebras of sections over Boolean spaces, Pacific J. Math. 38 (1971), 29-38. , A sheaf-theoretic duality theory for cylindrical algebras, Trans. Amer. Math. SOC. 169 (1972), 75-87. J.W. Gray, Sheaves with values in arbitrary categories, Topology 3 (1965), 1-18. A. Grothendieck and J. DieudonnB, El6ments de g6om6trie algarique I, I.H.E.S. Publ. Math. 4 , Paris 1960. L . Henkin, Completeness in the theory of types, J. Symbolic Logic 15
(1950), 81-91; reprinted in: 3 . Hintikka, The Philosophy of Mathematics, Oxford University Press 1969. M. Hochster, Prime ideal structure in commutative rings, Trans. Amer. Math. SOC. 142 (1969), 43-60. P.T. Johnstone, Topos theory (Academic Press, London 1977). , Conditions related to DeMorgan's law, in "Applications of sheaves", Proc. L.M.S. Durham Symposium 1977, Lecture Notes in Mathematics 753 (Springer Verlag, 1979), 479-491. , Factorization theorems for geometric morphisms I , Cahier top. et g8om. diff. 22 (1981), 3-17. J. Lambek, On the representation of modules by sheaves of factor modules, Can. Math. Bull. 14 (1971), 359-368. , From types to sets, Advances in Math. 36 (1980), 113-164. , From A-calculus to Cartesian closed categories in: J.P. Seldin and J.R. Hindley (editors), "To H.B. Curry, Essays in combinatory logic, lambda calculus and formalism" (Academic Press, 1980), 375-402.
Two sheafrepresentations
295
J. Lambek and I. Moerdijk, A Henkin-Kripke completeness theorem for intuitionistic type theory, in preparation. J. Lambek and P. Scott, Intuitionist type theory and the free topos, J. Pure and Appl. Algebra 19 (1980), 576-619.
, Intuitionist type theory and foundations, J. Phil. Logic 7 (1980), 1-14.
, Algebraic aspects of
topos theory in "31me colloque sur les
catEgories", Cahiers de Topologie et GGomGtrie DiffGrentielle 22 (1981) 129-140. R.S. Pierce, Modules over commutative regular rings, Memoirs Amer. Math. SOC. 70 (1967).
H. Rasiowa and R. Sikorski, The mathematics of metamathematics, (Warszawa, 1963). A. Wolf, Sheaf representation of arithmetical algebras, in "Recent
*
advances in the representation theory of rings and C -algebras by continuous sections", Memoirs Amer. Math. SOC. 148 (1974), 87-93. FOOTNOTE
"1
One of these sheaf representations was first presented at the Columbia Topos meeting in December 1980. Both authors had support from the National Science and Engineering Research Council of Canada, the senior author also from the Humanities and Social Science Research Council of Canada, moreover he shared a grant from the Quebec Department of Education.
THE L.E.J. B R O W E R CENTENARY SYhfPOSION A S . i?oe[stra and D. van Dalen (editors) 0 North-Holland Publishing Company, 1982
291
LAWLESSNESS ANU TNUEPENUENCE
U. van Paten, J.S. Loddeh
0. I NTRDDUCTI ON
The theory LS of lawless sequences contains an infinite list of continuity axioms, LS3(n) of the form CP(S~,S~ ,... ,s,,)
A
M C,3ci
iZ 1
+
gxvnET,x(
M nfSi
+
d n , S 2,... ,tn)).
i+l
In ID11 it was shown that LS3(1) PLS3(2), and it seemed plausible that in gene In the present paper we refine the forcing technique of
ral LS3(n) f+LSj(n+l).
I D 1 1 so that models can be constructed for LS3(2) in which LS3(3) fails.
We copy the modelconstruction from [Dll, which was based on the existence o suitable Cohen generic sequences that behave in the Beth model for analysis as lawless sequences. Our refinement consists of the incorporation of a certain dependence of the generic sequences that is reflected in a corresponding dependence of the lawless sequences. The simple minded approach however spoils the LS3(3) together with the LS3(2), so we have introduced infinite clauses in the forcing conditions to save the LS3(2). In the first section we give some results on dependence and independence for generic sets of natural numbers. In particular we look at closure of generic sets under complement, union, intersection and symmetric difference. The latter operation turns out to be useful for the application to lawless sequences, mainly because it has natural 'inverses'. Independence for generic sets is defined by the genericity of a suitable coding, presented by X + Y in definition 1.1. Our models are simplified versions of the models in [ D l ] , because we consider only 0-1-sequences, and also the binary tree a s underlying poset of the Beth model. As a consequence we can straightforwardly adapt Feferman's treatment, cf.1 F ] . We found it convenient to extend the language by quantifiers over generic sets, this could be avoided at the cost of extra details. The construction of the model
BR is by transfinite iteration o f the addition of definable sets, as in
[F].
J.S. LODDER. D. VAN DALEN
298
We c o n s i d e r a c o l l e c t i o n o f g e n e r i c s e t s t h a t i s c l o s e d u n d e r s y m m e t r i c d i f f e r ence, $, t h i s c l o s u r e i s embodied i n t h e f o r c i n g c o n d i t i o n s i n such a way t h a t t h e presence o f bound l a w l e s s v a r i a b l e s i n LS3(2) i s t a k e n c a r e o f , however, a t t h e p r i c e o f some t e c h n i c a l i t i e s .
1.
CLOSURE PROPERTIES OF GENERIC SETS
1.0 As i n [ F ] f o r c i n g c o n d i t i o n s p w i l l c o n s i s t o f f i n i t e c o n s i s t e n t sets o f sentences n E P , m B P .
F o r c i n g i s d e f i n e d i n d u c t i v e l y as i n [ F ] . A s e t G o f
f o r c i n g c o n d i t i o n s i s g e n e r i c i f f o r a l l sentences cp t h e r e i s a p E G such that p
It
cp o r P
Ik TCP.
A g e n e r i c s e t o f f o r c i n g c o n d i t i o n s d e t e r m i n e s a subset o f
subset X o f
IN. C o n v e r s e l y a
IN i s c a l l e d g e n e r i c i f i t i s d e t e r m i n e d by a g e n e r i c s e t o f f o r -
cing conditions.
GIN
1 . 1 D e f i n i t i o n . The g e n e r i c s e t s X,Y
a r e independent i f X + Y
i s g e n e r i c , wh
2n E X + Y - n E X ,
where
2n+l E X + Y -nEY For a c o n d i t i o n p we d e f i n e
p+ = { n
1 (nEP)Ep},
p- = I n
I (nBP)EpI.
The a p p l i c a t i o n s t h a t we have i n mind r e q u i r e c l o s u r e o f t h e c o l l e c t i o n o f gene r i c s e t s under some o p e r a t i o n s , and o f t h e p r e s e r v a t i o n o f indepence.
I n the
Dresent s e c t i o n we work o u t a few cases.
1.2 P r o p o s i t i o n .
PRoob. D e f i n e and
*
I f X i s g e n e r i c then Xc i s generic.
*
a translation
by ( n E P ) * := n B P , (p* := cp f o r a l l o t h e r a t a n s ,
i s a homomorphism f o r t h e c o n n e c t i v e s .
-
+
For c o n d i t i o n s p we p u t (p*)Claim: p
If cp
p
:= n E p .
1- nE P
and d e f i n e p* a c c o r d i n g l y .
p* lk (p*.
I n d u c t i o n on cp.
(i)cp
+
= p
Q
(n E p) E p
- n E p+
n E (p*)-
-
( n F P) E p*
For t h e r e m a i n i n g atoms t h e c l a i m i s t r i v i a l .
(GI
-
pII-cpv$-pItcp
P * I t cp*v+*
(.iiil
P Il-+P
Vq>p
or
pIt-$-p*tt(p*
-
or
vq*>p*
q*
IV (p*
p
*.
( n E P)
p*~k$*-
p * I t (cpv$)*. q IV cp
-
A
p*lt-lCP*
-
p*
It
(+PI*
299
Lawlessness and independence
For unranked sentences t h e c l a i m f o l l o w s i m m e d i a t e l y f r o m ( i ) Now l e t X be g e n e r i c , and g i v e n by c o n d i t i o n s p t h e n Xc
*
and
*
i s g i v e n by c o n d i t i o n s p*,
I f X and Y a r e independent g e n e r i c s e t s , then X U Y i s g e n e r i c .
Pm06. L e t 2 = X + Y
a translation
(v)
I7
and t h e c l a i m y i e l d s t h e g e n e r i c i t y o f X c .
1.3 Proposition.
-
be t h e generic s e t g i v e n by f o r c i n g c o n d i t i o n s i n P. We d e f i n e
by ( n € P ) * := 2 n E P v 2 n + l E P , cp*
:= cp f o r t h e r e m a i n i n g atoms,
i s a homomorphism f o r t h e c o n n e c t i v e s .
For t h e c o n d i t i o n s we p u t (p,)'
:= C m E 2 m
(p*)-
-
:= I m E 2 m
I p+ v 2 m + l E p + } , I p- A 2 m + l E p - ) .
T h i s d e f i n e s p*. Claim: p I k cp*
p * I t cp.
I n d u c t i o n on cp
(i)cp
:= n E p
pll-
-
(~EP)*+=*~II- 2 n E ~ v ( 2 n + l ) E ~ o 2 n E p + o r2 n + l E p + o
n E (p,)+
~kn
p*
e P.
For t h e r e m a i n i n g atoms t h e c l a i m i s t r i v i a l .
ILL1
plt- (cpv$)*-plt
P*Ik c p v i .
(-1
11( 7 cp)* p* Ik 1cp ; p
t tt
p
Vq>p
Observe t h a t q > p
If r>p*
(iv)3xcp(x) , (V)
-
cp*v$*-pll-
Ik
q
i* t* p*It- i
cp* o r p l t
IY (P*
LL vq,>p,
q*
IW cp
tt
o r p*
vr>p,
r
Q
IW cp
-
* q,>p,.
then there e x i s t s a q > p
s.t.
r=q*.
trivial.
3x'lcp(xa)
q$(P($)
A
Q
p*
g$(P($)
Ik
W({X
A
p
I $(X)}))
Ik
CP*({X
Q
P*
I $(X)))
It
Q
3xolQ(xa).
Now f o r each sentence cp t h e r e i s a f o r c i n g c o n d i t i o n p b e l o n g i n g t o 2, such t h a t
PIE v*
o r p I k ~ c p * . Then p* b e l o n g s t o t h e c o n d i t i o n s d e f i n i n g X
c l a i m , p * I k cp o r p,IE
u
Y and by t h e
~ q Hence . X U Y i s g e n e r i c , by v i r t u e o f t h e c o n d i t i o n s p*.
3 00
J.S. LODDER, D. VAN DALEN
1.4 Proposition. If X and Y are independent generic sets, then X n Y is generic. Ph~rooa. Similar to that of 1.3.
0
1.5 Proposition. If X and Y are independent generic sets, then X and $(X,Y).are independent generic sets.
Phood. Let Z = X + Y be the generic set given by forcing conditions in W = X+$(X,Y). We will show that W is generic. We define a translation * by: (nEP)* := 3x (n = 2x A n E p ) v (n = 2x+1 A ((2xEP A 2x+19P) v ((2x9P A 2x+1Ep))). cp* := cp for the remaining atoms, and
*
P,
let
is a homomorphism for the connectives.
Definition. A forcing condition p is symmetric if 2 n p+~ u p2n+1 E p+ u p-
For the remaining atoms the claim is immediate.
( G )cp v $, immediate.
( i i i l (a]Suppose p l t Let q>p*. Hence r IhL
lcp.
Take r>q
UP.
So q
Ilf
such that r is symmetric. Then r*>p, so
UP.
Hence p* II-
7
r*IW
cp.
cp*.
( b l Suppose p* ~k1 (P*. Let q>p. Take r > q such that r i s symmetric. Then r*>p*. Hence r Ilf cp. So q Ibc cp. Hence p* II- 7 w.
So
r*llf cp*.
301
Lawlessness and independence
(iwl j x c p ( x ) (WI
trivial.
~x"v(x')
trivial.
For each sentence cp t h e r e i s a symmetric p b e l o n g i n g t o t h e f o r c i n g c o n d i t i o n s which d e f i n e Z p * k cp or p*
such t h a t pII- cp* o r pII- 7 c p * .
11- 7 c p .
Since (p*)* = p the c l a i m y i e l d s
p* b e l o n g s t o t h e c o n d i t i o n s d e f i n i n g W,
so W i s g e n e r i c . 0
There a r e more p r o c e d u r e s t o o b t a i n new g e n e r i c s e t s f r o m o l d ones, e.g.
the
i n t e r s e c t i o n o f an i n f i n i t e a r i t h m e t i c s e t and a g e n e r i c s e t y i e l d s a g e n e r i c s e t a f t e r an a r i t h m e t i c " s t r e t c h i n g "
n
sider X {n
{Zn
I
o f the arithmetic onto
W . As an example, con-
n E I N } , then the s t r e t c h i n g y i e l d s the ' f i r s t p r o j e c t i o n '
I ZnEX}, which i s generic. We can c o n s i d e r g e n e r a l i s a t i o n s t o o p e r a t i o n s w i t h more arguments.
For o u r
purpose i t s u f f i c e s t o c o n s i d e r a r i t h m e t i c a l o p e r a t i o n s w i t h i n v e r s e s . Example: t h e t e r n a r y symmetric d i f f e r e n c e ,
g3(X,Y,Z)
and X =
= $(X,$(Y,Z))
$ ($ (X,Y,Z),Y,Z), 3 3
etc.
For convenience we w i l l use c h a r a c t e r i s t i c f u n c t i o n s i n s t e a d o f s e t s .
f : {0,lIk
+
{O,l} together w i t h inverses
fi : { 0 , l I k
+
{O,l}
We c o n s i d e r o p e r a t i o n s
( i = 0 ,...,k - 1 )
such t h a t (TI,
,..., f ,...,n k - l )
o
( n o ,..., f i
. . ,f , . . . , n k - l )
o
(
and ( n o , .
n o , .. . , f
,..., nk-l) ,. . . ,
= id,
T ~ - ~= )
id.
These o p e r a t i o n s may n o t be t h e most g e n e r a l ones, b u t t h e y s u f f i c e f o r t h e a p p l i cations
.
1.6 Proposition.
I f Xo,...,Xk-l
xo ,. . . ,f (x,,
. .. ,xk-l ) ,. .. ,xk-l.
-
i s an abuse of n o t a t i o n , we p u t
Here f(Xo,...,Xk-l)
,...,Xkml)
nEf(XO where Ki
a r e independent g e n e r i c s e t s , t h e n so a r e
f(Ko(n)
,...,K k - l ( n ) )
= 1
i s t h e c h a r a c t e r i s t i c f u n c t i o n o f X..
+...
L e t Z := X o + . . . + X k - l , W := X f ( X o ,..., Xk-l)...+Xk-l. 0 t h a t W i s g e n e r i c . We w i l l i n t r o d u c e a second abuse o f n o t a t i o n :
Pkoob.
nEf(Xo...Xk-l) 3y0.
. .yk-l
-
We w i l l show i n t h e language,
i s an a b b r e v i a t i o n f o r :
M I
((yi = 1
knwiEP)
A
(yi = 0
i.+ km+iFP)
A
f(yo...yk-l)
= 1).
3 02
J.S. LODDER, D. VAN DALEN
Define a t r a n s l a t i o n
*
by
( n E P ) * = 3x(n = kx+i
,..., Xk-,))
xEf(X,,
A
v Vx(n#kx+i
A
nEP).
A c o n d i t i o n p i s k-symmetric i f f o r a l l j < k
*
k n + j E p + U p-
@
kn+QEp+ U p-.
We p u t K (n) = 1
0 n E p + ; K (n) = 0 Q n E p - . P P k-symmetric c o n d i t i o n s a r e d e f i n e d by:
= {n I3m(n = km+i
(p,)'
vVm(n#km+i
A
A
( p * ) - = {n I3m(n = km+i vVm(n#km+i
A A
( p * ) + = {n I3m(n = km+i vVm(n#km+i
vVm(n#krn+i
A
= (p*),
Note t h a t (p,)* Let n E ((p*),)+,
(i]Vm
I-&] n
A A
...
f ( K (km) K (km+k-1)) P P K (n) = 1 ) ) .
*
and
*
= 1)
P f ( K (km) K (km+k-l)) = 0) P P K (n) = 0)).
...
P
A
( p * ) - = { n I3m(n = km+i
The t r a n s l a t i o n s
...K P (km+l-1))
= 1)
...KP (km+k-1))
= 0)
f i ( K (km) P K (n) = 1 ) ) . P fi(K
P
(km)
K (n) = 0 ) ) . P
= p.
then t h e r e a r e two cases.
n#km+i : Then n E ((p*),)+
0nE(p*)+
t=$
nEp+.
K *(km+k-l)) = 1 Then f ( K *(km)... P P (km+i) = f i ( K (km) K (km+k-1)) i t f o l l o w s t h a t P* P P (km+k-1)) = 1 , f (K ,(km). . f i (Kp(km). .K (km+k-1)) .K P P P* So K (km+i) = 1 ( s i n c e f i i s t h e i n v e r s e o f f ) . P The r e s t o f t h e p r o o f i s s i m i l a r . = km+i.
...
Since K
.
Claim. -
.
,. .
For k-symmetric c o n d i t i o n s p : p 11- IP
li] cp
-
p*
11- @.
:= n E P .
a) n = km+i. Then pII- n E P
*
f ( K (km)
P
t* t=)
b) Vm
* nEp+-
K (km+i) = 1 P
,... f i (Kp(km) ...KP (km+k-1)) ,...KP (km+k-l))
f ( K *(km)...K (km+i) P P* p*Ik (nEp)*.
,... K
P
,(km+k-l))
= 1
n#km+i.
Then p k n E P
Q
p*II-
(nEP)*.
For t h e remaining atoms t h e c l a i m i s t r i v i a l .
(2) cp v
$;immediate.
= 1
f o r the
3 03
Lawlessness and independence
1 x 1 (a)
Suppose p
11-
1 cp.
L e t q>p*.
Take r > q
So q
IV
v*..
Hence p*
IF
( b ) Suppose p* L e t q>p.
( i w ] gxcp(x)
7
I+
@.
i
cp*.
Take r > q
such t h a t r i s k-symmetric.
So r*Iv (p*.
Then r * > p * . Hence r
such t h a t r i s k-symmetric.
so r * Ilf cp. Hence r Ilf cp*.
Then r * > p ,
Ilf cp.
So q
IF cp.
Hence p*
11-
cp.
trivial.
I W I 3xacp(x")
trivial.
For each sentence cp t h e r e i s a k-symmetric p b e l o n g i n g t o t h e c o n d i t i o n s d e f i n i n g Z such t h a t p
If
(p* o r p
11-
2.
Ik cp
(p*. The c l a i m y i e l d s p*
belongs t o t h e c o n d i t i o n s d e f i n i n g W ,
o r p*
Ik
cp. S i n c e p*
0
t h i s implies t h a t W i s generic.
CONSTRUCTION OF A MODEL
We w i l l e x h i b i t a model of t h e t h e o r y of l a w l e s s sequences i n w h i c h LS3 i s v a l i d f o r 2 parameters. We u s e t h e symmetric d i f f e r e n c e o p e r a t o r on independent g e n e r i c s e t s i n o r d e r t o o b t a i n a model
i n w h i c h LS3(2) h o l d s b u t LS3(3) f a i l s . The t e c h n i q u e o f model-
c o n s t r u c t i o n i s adopted f r o m [ D l ] . approach,
For convenience we have chosen a s i m p l i f i e d
i n w h i c h we o n l y c o n s i d e r 0-1-sequences.
T h i s has t h e advantage t h a t we
can use f o r c i n g f o r a n a l y s i s w i t h s e t s , as i n Feferman's [ F ] . We w i l l use t h e framework o f [ 011, s e c t i o n
6,
m o d i f i e d i n accordance w i t h [ F ] .
2.1 We c a r r y o u t o u r f o r c i n g i n c l a s s i c a l second-order a r i t h m e t i c w i t h two s o r t s o f set variables. The g e n e r i c ones a r e i n d i c a t e d by s c r i p t c a p i t a l s X,Y,Z by X , Y , Z
...
...,
and s e t s i n g e n e r a l
The c o n d i t i o n s c o n t a i n more t h a n j u s t t h e t r a d i t i o n a l c l a u s e s ,
o r d e r t o h a n d l e t h e dependencies. The language c o n t a i n s a symbol m e t r i c d i f f e r e n c e s , and u n a r y p r e d i c a t e s P,,Pz, f i n i t e c o n s i s t e n t s e t o f t h e form p = { n E P where P,Q,R,
..., P ' , Q ' , R '
... . A
4
forcing condition i s a
,...,m e Q,...,P '
= q(Q',R')
,... 1,
are variables f o r the P.'s.
We p u t p+ = I n
i
I (ncPi)Ep v
...
in
f o r t h e sym-
v [ ( n ~ p . ) ~ Ap ( n e P k ) E p A $ ( p j , p k ) = P ~ E P I J v [ ( n E p . ) E p A ( n g P k ) E p A $(Pi,P.) = PkEpl} J J
J.S. LODDER, D. VAN DALEN
3 04
p f = I n I ( n B P i ) E p v [ ( n E p . ) E p A ( n E P k ) E p A $ ( P ~ , P ~= ) p i E p I J v v [ ( n g ~ . ) E pA ( n B P k ) E p A $(pj,Pk) = P i E p l } . J
...
F o r c i n g i s d e f i n e d as u s u a l : p t n E P i The c l a u s e s f o r v , - , 3 x , 3 X
PII- ~ X W ( X ) i f 3pi
nEpt.
if
a r e s t a n d a r d , f o r t h e g e n e r i c q u a n t i f i e r s we p u t
p k dpi).
A g e n e r i c sequence i s a sequence o f c o n d i t i o n s (P,)
(i]f o r
each sentence cp we have 3n
ILL) V i , j 3kn
($(Pi,Pj)
= P),
p
It
cp
or
such t h a t p It
1
cp.
E pn.
F o r c i n g has t h e f a m i l i a r p r o p e r t i e s , as one can e a s i l y check.
I n p a r t i c u l a r we
have t h e T r u t h Lemma. L e t (p ) be a g e n e r i c sequence and, ill2 the c o r r e s p o n d i n g model t h e n
D !
cp
e=*
p I t cp, f o r sentences cp.
3n
2.2 C o n s t r u c t i o n o f t h e g e n e r i c sequence. S i n c e we have r e s t r i c t e d o u r s e l v e s t o b i n a r y sequences, we can do w i t h o u t s p e c i a l measures t o g u a r a n t e e t h e i n i t i a l segment c o n d i t i o n s o f LS1. So a l l t h a t i s l e f t concerns t h e d e c i d i n g o f sentences and t h e " c l o s u r e under L e t cp1,cp2,cp3,...
$".
be an e n u m e r a t i o n o f t h e sentences o f second-order a r i t h m e t i c
w i t h symbols f o r t h e P i ' s . Step k . We have c o n s t r u c t e d c o n d i t i o n Pk-l. q 11- cpk o r q 11-
Claim:
(P,)
cpk.
As u s u a l t h e r e i s a q>pk-l
Choose any such q f o r p
such t h a t
k'
i s generic.
We o n l y have t o check c l o s u r e under $. Suppose t h a t no pn f o r c e s 3X $(P.,P.) = X t h e n f o r some I J Pmlk -3x $ ( P i ' P . ) = p, J so Vq>pm VPk q I v $ ( P i , P j ) = Pk, w h i c h i s f a l s e .
x,
A s i n 1011 we use a Beth-model on t h e b i n a r y t r e e t o i n t e r p r e t e sequences as
growing f a m i l i e s o f 0-1-functions namely t h e s t a n d a r d model.
(i.e.
s e t s ) . The f i r s t - o r d e r domain i s c o n s t a n t ,
L a w l i k e sequences a r e t o t a l i n t h e b o t t o m node. The
l a w l e s s sequences a r e d e f i n e d as f o 1 ow5
2.3 Definition. €Pi
Lawlessness and independence
:= 3p
Observe t h a t
2.4
11-
p I F VX(XEPi +=+xEP.) J
i s used f o r two d i s t i n c t purposes.
e. LS(1)
Pnood.
305
holds. i n t h e model.
L e t u be a f i n i t e 0 , l
For each c1 w i t h I t h
Then t h e r e i s a p
c1 =
sequence w i t h I t h u = n.
n we w i l l show nIk 35
S E u . Suppose f o r a l l p
such t h a t
which i s n o t t h e case. Hence t h e r e i s a p
such t h a t
M
P m k 3x
biEX
f-t
u . = 1).
OQ i
2.5 P e r m u t a t i o n s . Define
if
~ ! ( p = ~ p )i J
k = j
pj if k = i pk e l s e .
D e f i n e a s y n t a c t i c a l p e r m u t a t i o n by .rr!(nEPk) = ( ( n E P i J v (nEPk
A A
k = j) v ( n € P . A k = i ) J k # i A k f j)).
2.6 P e r m u t a t i o n lemma. p 11- cp
Pnood.
* n p 11-
mp.
I n d u c t i o n on cp.
(i)For
t h e a t o m i c case,
(close the
i t s u f f i c e s t o look a t t h e
$ - f r e e p a r t under
-
8-free part o f p
4).
(Lii)The s t a n d a r d c o n n e c t i v e s a r e r o u t i n e , we w i l l j u s t check 3XwX p
Il- 3 X w ( x )
-
( i n d . hyp.) TIP
II-
3Pi
p
3Pi
npll- vw(Pi)
3X?Icp(X).
0
dPi)
J.S. LODDER, D. VAN DALEN
306 Forcing i n t h e Beth-model
W
in
i s straight-forwardly translated i n t o satisfaction
i n e x a c t l y t h e same manner as [ D l ] ,
Result: f o r each cp t h e r e i s a cp*
6.5.
such t h a t
cxlt
cp
* !IT b
cp*(a).
Observe t h a t LS2 holds t r i v i a l l y i n t h e model.
Lemma.
2.7
L S 3 ( 2 ) holds i n t h e model.
Ptlood. We have t o show t h a t $ (6,,Ck)
h
v(cn.Ck)
*
3 x [ c n E x h v c E x ( f (595,)
-f
'P(E,ck)l
holds, where a l l lawless parameters a r e shown.
I t t u r n s o u t t o be t e c h n i c a l l y more convenient t o consider i n i t i a l segments o f lawless sequences f o r t h e purpose o f v a l i d a t i n g LS3(2). auxilliary fact: c1
IF t i f
sj
-
aI t
3x
Ti ( X I
#
We need t h e f o l l o w i n g
sj( x ) .
a I t ti f 5 and consider a 1- 3x Ti (x) f T . ( x ) . j J This reduces t o V f € a 3y T ( y ) 11- Ti (y) # (y) * 3y Vf E a i ( y ) 11- Ti ( y ) # rj ( y ) (by the f a n theorem) t=, 9JI I=3y V f E a Vi(i(Y)) fFj i ( y ) ) . Pa006 06 6act. L e t
rj
We use the Pi,P. as c h a r a c t e r i s t i c f u n c t i o n s . The above i n e q u a l i t y merely J s t a t e s t h a t t h e sets P. and P . d i f f e r i n one o f t h e (coded) i n i t i a l segments o f J f(Y). Suppose now t h a t p l k 1 3 y V f E a vq>p VY 3 r > q i .e.
V q Z p vy 3 r > q
3f
r
Fi(-f(y))#Fj(T(y)),
then
s IV P i ( f ( y ) ) + F j ( i ( y ) ) ,
3 f Vs>r
1-
Pi(i(y))
= Fj(f(y)).
Now look back a t t h e Beth model and determine t h e longest node t h a t occurs i n the c o n d i t i o n p, say w i t h l e n g t h y o . Extend p t o q such t h a t P i and P . d i f f e r i n J a l l nodes w i t h l e n g t h y o + l . Then f o r such a q
r 11- P i ( i ( y o + t ) )
i t i s impossible t o f i n d r > q
and an f such t h a t
= Fj(?(y0+1)).
C o n t r a d i c t i o n , hence t h e r e e x i s t s a p such t h a t
PIC 3y V f E a P i ( i ( Y ) ) f P j ( i ( Y ) ) a I- 3x Ti (x) # (x)
and t h e r e f o r e
sj .
The converse i s c l e a r . L e t all- cp(<
,c
) , then by t h e t r a n s l a t i o n lemna LQ +q*(a,Pn,Pk). So by t h e t r u t h n k lemma t h e r e i s a p such t h a t p k rp*(a,Pn,P,). L e t p contain, a p a r t from Pn,Pk a l s o
P
...P9 .
ml
307
Lawlessness and independence
We want a l l t h e P ' s t h a t o c c u r i n p t o be d i s t i n c t ,
b u t i n a s t r o n g form; we
extend each o f them such t h a t t h e y d i f f e r on a b a r i n t h e model,
B
There i s a b a r
for
Let B l t
k
,P
. .. P
ml
rn, (h)
3n 611- M T i ( n ) # r . ( n ) . L e t B E E , J p r e s c r i b e s a t B d i f f e r e n t i n i t i a l seg-
a such t h a t f o r a l l BEB
then we may e x t e n d p t o p B such t h a t p ments o f Pn,P
i.e.
B
o f t h e same l e n g t h h. Then p B IC v*(B,Pn,Pk). m!2
rn(h).
I n o r d e r t o d e f i n e t h e p e r m u t a t i o n we have t o c o n s i d e r t h e $ - p a r t s o f t h e c o n d i t i o n pB. For convenience we i n t r o d u c e t h e n o t a t i o n (n1,n2,n3) $(P, 1
. The
) = Pn
,Pn
for
$ - p a r t s o f pB can have t h e f o l l o w i n g form:
3
2
(1)
(n.k,mi 1
) ;
The p e r m u t a t i o n t a k e s n t o n ' and keeps k f i x e d . The m. i s d i s t i n c t from the '1 t o m.' , which i s $ ( n ' , k ) . I f mi m i s s i n case ( 2 ) , ( 3 ) . The p e r m u t a t i o n t a k e s m. '1 '1 = P ( n , k ) and s u b s t i t u t e : (mi,mj,9(n,k)), which o c c u r s i n case ( 4 ) , we w r i t e m i1 i s e q u i v a l e n t t o (n,$(k,m.) , m . ). We add t h e l a t t e r t o t h e 1 i s t (2). We proceed I J t o l i s t (2).
) t o (n',m ,mi' ) . '3 i2 3 We l o o k f o r o c c u r r e n c e s o f mi ( i n t h e l i s t s (3) and We permute (n,m.
,m.
'2
3 i n l i s t ( 2 ) o n l y once). We w r i t e m i r e p l a c e (mi,m.,m.
= $(n,mi
3
)I,
) by (mi,m.,&(n,mi
'3 J We add t h e l a t t e r t o t h e l i s t ( 2 ) .
(4)) n o t e t h a t m. can o c c u r '3
) and proceed t o e l i m i n a t e m
3
2 which i s e q u i v a l e n t t o (n,$(mi
2
.
i '
,mi),mj).
2
When we come t o t h e new a d d i t i o n s t o l i s t (2), we permute as p r e s c r i b e d by t h e preceding steps, e.g.
(n,$(k,mi),mj)
-t
(n',8(k,mj),mj'),
where m ' = $ ( n ' . $ ( k , m i ) ) .
A f t e r f i n i s h i n g l i s t (Z), we s t o p s i n c e t h e r e m a i n i n g $ - p a r t s
j
i n t h e l i s t s (3)
and ( 4 ) a r e n o t i n f l u e n c e d by t h e above s t e p s . We o b s e r v e t h e f o l l o w i n g f a c t : The t r i p l e s c o n t a i n i n g $ - s i g n s can be t r a n s f o r m e d i n t o $ - f r e e t r i p l e s .
-
Example: ( n ' , , % ( k , m i ) , m . ' ) c-t ($(n',k),mi,m.' ) (mi',mi,m,'). J J 1 J i s j u s t the permutation o f the Observe t h a t t h e r e s u l t i n g t r i p l e (mi',mi,m.') J i n case ( 3 ) o r ( 4 ) . o r i g i n a l t r i p l e (m ,mi,m.) i1 J
1
J.S. LODDER, D. VAN DALEN
308
So f a r we have permuted complete P i 1 s among themselves, but we have t o consider the $-f ree parts o f p
B' but f i x e s t h e i n i t i a l segment o f Pn t h a t
The permutation takes Pn t o Pn,,
occurs i n $ - f r e e c o n d i t i o n s i n pB. From t h e c o n s t r u c t i o n we see t h a t t h e perm u t a t i o n f i x e s a l l i n i t i a l segments o f t h e same a p p r o p r i a t e l e n g t h . The cond i t i o n s t h a t r e s u l t from the permutation belong t o t h e g e n e r i c sequence, s i n c e t h e c o n d i t i o n s i n v o l v i n g Pn a r e taken t o c o n d i t i o n s on Pnl by d e - f i n i t i o n . I n the stepwise d e f i n i t i o n o f IT on t h e remaining Pmls we have obeyed t h e $ - c o n d i t i o n s , and we permute t h e $ - f r e e c o n d i t i o n s a c c o r d i n g l y . F i n a l l y we observe t h a t t h e permuted c o n d i t i o n s Pml original P
do n o t occur i n t h e
B'
An a p p l i c a t i o n o f t h e permutation lemma y i e l d s ~ ( p , ) IC
cp*(B,Pn,P,)
so
nbB)
IF cp*(B,P,',
Pk)
Since ~ ( )p i s contained i n our g e n e r i c sequence we may apply t h e t r u t h
B
1 emma :
rn
II- (dC(B,Pn,Pk)
and hence
B (I- d E n , Lk). Now we can f i n d t h e r e q u i r e d i n i t i a l segment o f f o r a l l B E E , aIk 3x V E E x
Hence LS3(2) holds i n our model.
2.8
Lemma.
since
BI- VEErn(h)
d5,Sk)
0
LS3(3) f a i l s i n t h e model.
Ph006. There i s a
However ( )
5:,
cp(c,c,).
Y 3x
5,
such t h a t our model ( )
c i E x A VEEx
5 =
$(c,,c,).
IF Ei = $ ( 5 , , t 2 ) . 0
2.9 C o r o l l a r y . LS1, LS2, LS3(2) Y LS3(3) Contrary t o t h e i n i t i a l e x p e c t a t i o n o f t h e authors t h e above r e s u l t does n o t immediately c a r r y over t o t h e n-parameter case. We s t i l l c o n j e c t u r e t h a t LS3(n) lf
LS3(n+l),
g e n e r i c sets.
but presumably one needs more s o p h i s t i c a t e d o p e r a t i o n s on
Lawlessness and independence LITERATURE
[Dl]
D . van Dalen. An i n t e r p r e t a t i o n o f I n t u i t i o n i s t i c A n a l y s i s .
Ann. Math. L o g i c 1 3 ( 1 9 7 8 ) , pp. 1-43.
-
(D21
The c r e a t i v e s u b j e c t and H e y t i n g ' s A r i t h m e t i c ( t o appear i n ' A l g e b r a and i t s A p p l i c a t i o n s ' , Banach C e n t r e P u b l i c a t i o n s ) . T h i s paper c o n t a i n s c o r r e c t i o n s t o [ D l ] .
[F]
S.
Feferman. Some a p p l i c a t i o n s o f t h e n o t i o n o f f o r c i n g and g e n e r i c s e t s . Fund. Math. 56(1965),
pp. 325-345.
309
THE LXJ. BROUWER CENTENARY SYLWOSIUvl A S . Troelstra and D. van Dalen (editors) 0 North-HollandPublishing Company, 1982
311
CREATIVE SUBJECT AND BAR THEOREM Enrico Martino Seminario matematico Padova University V. Belzoni 35100 PADOVA (Italia) In the present article a reasonably precise description of Brouwer's notion of "creative subject" is proposed and an axiom is introduced which is conceptually equivalent to the Bar theorem.
1.
THE CREATIVE SUBJ€CT. The idea of the creative subject occurs in various writings of Brouwer in a
somewhat vague manner.
Several logicians, among them Kreisel, Troelstra and
Dummett, have recently tried to analyse this concept by proposing some axioms, which are however rather controversial, as Dumett's discussion shows. The creative subject, which we will call I, carries out its mathematical activity in time, which we assume divided in w
distinct states of knowledge.
The
main feature of the theory of the creative subject consists in using the fact that knowledge increases in time by explicitly referring to the stage in which E to know a certain proposition. operator
t.
If A
gets
Such a reference is expressed by the propositional
is a formula,
F A
stands for:"at stage n .I has evidence
for A". The kind of axioms for
we put forward essentially depends on our ideali-
zation of t. were pro?A the strict one, according to which I can at any stage know only a finite
In the literature two essentially different conceptions of posed:
number of propositions, and the wider one, according to which at any stage .I is allowed to know infinitely many propositions. The wider conception is proposed, among others things, by Troelstra [TI as a possible solution of a paradox of diagonalization in the strict theory (see § 3 ) , which he pointed out. We begin with some critical observations on the wider conception. The following axioms are usually assumed both in the strict theory and in the wider one:
E. MARTIN0
312
These axioms are not sufficient to yield a precise conception of the creative subject, but they seem to be minimal requirements:
they are implicitly used by
Brouwer himself in the well-known constructions of counterexamples for some classical theorems. 1.1
is usually justified in the following manner:
decidable since at the stage n X.
the predicate
%A
knows whether he has evidence for A
is or not.
We will shortly discuss such a justification. 1 . 2 says that the knowledge of
1
is cumulative:
at every stage he knows
again (or he maintains the knowledge of) what he knew at the preceding stages. 1.3,
from left to right, says that E
reasons in an intuitionistically cor-
rect manner, that is he knows only intuitionistically true propositions. From right t o left it seems to express the "solipsistic" conception of intuitionistic mathematics: subject.
the true propositions are only those which are known to the creative
If one does not want to commit oneself to this last statement, 1 . 3 can
be weakened by replacing it by 3nkA
1.3'
A
+
and 1 .3"
1.3"
A
-f
113nkA
(called by Kreisel the Principle of Christian Charity) says that if A
true, it cannot be excluded that, in some stage, X In the wider conception it is allowed that, if ate consequence" of A,
kB.
then
is
comes to know it. %A
and if
B
is a "immedi-
Apart from the difficulty of generally char-
acterising in a sufficiently precise manner the vague notion of immediate consequence, it seems that the following axioms for it are hardly objectionable (see [Dul). 1.4
t;;VXP(X)
1.5
% P(i5)
I .6
t;;(AvB)
-t
3xP(x)
+
-f
vxt;; P(x)
%A
v
%B
In 1.6 it is understood that A
and
B
do not contain choice parameters nor
any information which is not available at stage n .Now, we see at once that from 1.1-1.6
(see 1 2 ) .
we can deduce some intuitionistically
incorrect propositions. In fact, let P(x) such that Vx(P(x)
be a decidable predicate (without choice parameters),
V lP(x)).
From 1.3 it follows that, for some n,
3 13
Creative subject and bar theorem
whence, by 1 . 4 and 1.6, VX(kP(X) It follows that, if by 1 . 5 ,
k3xP(x)
Ik-lP(x)).
3xP(x),
.
then there exists a k
such that
kP(c)
and
so,
Therefore the following equivalence holds
3xP(x) Thus, since, by 1 . 1 ,
v
tf
k3xP(x).
k3xP(x) v lk3xP(x),
we have
3xP(x)
V
13xP(x).
But this
cannot be intuitionistically acceptable for an arbitrary P(x).
In my opinion this incoherence arises from the fact that 1 . 1 is acceptable only if, in order to have of A.
%A,
it is required that
Now, the evidence of VxP(x)
Z
is aware of having evidence
does not involve (unless we greatly stress
the idealisation of Z) the conscious evidence of all single instances P(k). Thus 1.4 holds only if evidence is meant as implicit, not necessarily conscious, evidence.
Hence the incompatibility of 1 . 1 and 1 . 4 results.
Since X so
is no real subject but an idealized subject, we could idealize him
that the evidence of VxP(x)
P(k).
involves the conscious evidence of each single
But such an idealization would attribute to
Z
superhuman powers which
would allow him to know some classically but not intuitionistically true propositions.
Since intuitionistic truths are to be humanly knowable, we must be very
cautious in idealizing Z. Therefore, since 1.4 seems t o be a minimal requirement of the wider conception, we hold that it forces the axiom 1 . 1 to be abandonned. Then, at the same stage, Z
can implicitly know infinitely many propositions.
he knows the soundness of the axioms and of the in-
If, fo'r instance, at stage n
ference rules of a certain system F, evidence of all theorems of
F
then at the same stage n
he has implicit
(but he i s not necessarily able to decide whether
a given formula is a theorem, as 1 . 1 requires).
Indeed one could even assume that
every stage is closed with respect to "analytic" deductions and that the passage from one stage to another is characterized by an increase of external information (see Posy (1977)). be read:
But we think that in that case
"At the stage n
$A
t can have evidence of A".
should be more properly The potential interpreta-
tion serves the purpose of avoiding that superhuman powers (as that one of deducing actually all what is deducible from the available information) are attributed to Z.
The closure with respect to the analytic deductions seems to be in agreement
with Grzegorczyk's semantics, (cf. [GI). Nevertheless it seems to me that such a conception has not the effect of taking the idea of the creative subject seriously, but rather of replacing it by other notions, such as "deducibility (in an intuitive sense) from certain given information", (cf. [Dal).
On the contrary we believe that the originality and the strength
314
E. MARTIN0
of the theory of the creative subject consists just in the possibility of exploiting the concept of conscious evidence, which Brouwer has already partially exploited by his implicit assumption of 1.1.
We hold that new interesting results are obtain-
able not just by suppressing 1 . 1 but rather by adding to it new axioms intended to exploit the concept more deeply. Therefore we will abandon the wider conception in favour of the strict one, according to which the request of the conscious evidence i s certainly plausible. This request can be made even more explicit by stating, for instance, that, in order to have
$A,
X
has to
write
a proof of
A
at the stage n.
We here obviously
pass over the inadequacy of natural language to express an intuitive proof; our statement serves only the purpose of clarifying metaphorically the meaning of the adjectif "conscious".
What is of importance is that, proving only finitely many
propositions at each stage, .I has the possibility of explicitly directing his attention at each one of them. .
The axiom 1 . 2 results to be obvious. Without committing ourselves to the so-
lipsistic conception, we will accept 1.3 with the following justification: since A
is intuitionistically true, if it has been proved by someone, we suppose that as
soon as a proof of
A
is found (by someone), it is communicated to .I who includes
it among the propositions of which he has evidence (at the stage he is in at the moment of communication). We now intend to propose a modification of the strict conception in order to obviate, at least in part, the drawback of the invalidity of 1.4 and of other axioms which seem to hold only in the large conception. We replace 1.4 with the scheme 1.4'
Vn(kVxP(x) If 1 . 4 '
+
k~(ii)).
is understood in the sense that all its instances should be simultane-
ously true, then it is certainly not acceptable in the strict conception, since it presents the same difficulties as 1 . 4 .
Therefore we propose to understand the val-
idity of an axiom scheme in the following sense:
for each instance, it is possible
"to programme" 1 at the stage 0 so that the instance in question is true. "to programme E
"
we mean "to instruct E
favourable conditions, he performs certain deductions which interest us". sense 1.4' is thoroughly acceptable: whenever we have fixed P and struct 1 so that, if he deduces VxP(x)
P(k)
By
so that if he happens to be in certain k,
In this we can in-
in some stage, he takes care of deducing
at the same stage. Similarly for 1 . 5 :
3xP(x)
whenever
as soon as he has deduced
P
is fixed, 1 can be instructed to deduce
P(m)
for some m.
necessary restrictions on the choice parameters).
In general we admit the following principle:
Likewise for 1.6 (with the
Creative subject and bar theorem 1 . 7 Whenever, for a fixed proposition
state of knowledge
s
A,
315
recognize that, if we were in a certain
we could prove A,
we can suppose that whenever 1
is in
the state s, he actually deduces A. Some other axioms which turn out to be sound are the following:
On the contrary we observe that 1.8'
(A-tB)
+
Vn ( k A
-f
I ; B )
does not hold, since until we know a proof of A instruct 1 to deduce B
-f
B
(or of l(A+B))
we cannot
from A.
But from 1.8 and 1 . 3 we get: 1.8''
(A-tB)
-t
3n( \;;A
+
kB).
We observe that a formula A(x)
with a free variable x must be considered
true if it is possible to programme t neously true. from it V x k x
=
x
t
that all instances A(k)
k x = x
is not true:
are simulta-
in fact we deduce
which would involve the evidence, at the stage n ,
finitely many propositions k = k. true:
so
For example, the formula
can be instructed
so
of the in-
On the other hand the formula V x t x = x
is
that, at every stage n, he knows n = n.
Finally we observe that, according to our concept of programming, t can be given only positive instructions, i.e. instructions for performing (under favourable conditions) certain deductions, and not negative instructions, i.e. instructions for not performing certain deductions. At every stage t must be free to perform at will some other deductions, in addition to the