A.A. Ivanov, H.D. Macpherson, Strongly determined types, Ann. Pure Appl. Logic 99 (1999), 197--230. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Definable Sets in Algebraically Closed Valued - Fields Part Elimination Self-citation (Macpherson) (Correct)
....in Section 2.5, we will show that any unary type has a canonical invariant extension (given by the generic type over any parameter set) hence we can just write pjC for p , the generic extension of p over C . In the subsequent paper we will extend this to n types. In Remark 2. 11 of [5] it is claimed that invariant extensions of types exist for arbitrary C minimal structures. However the Remark rests on Lemma 2.2 of that paper, and the proof of Lemma 2.2 is incomplete and the result may well be incorrect (other applications of 2.2 in [5] seem to be unaffected, as problems only ....
....extend this to n types. In Remark 2.11 of [5] it is claimed that invariant extensions of types exist for arbitrary C minimal structures. However the Remark rests on Lemma 2.2 of that paper, and the proof of Lemma 2.2 is incomplete and the result may well be incorrect (other applications of 2. 2 in [5] seem to be unaffected, as problems only arise when acl 6= dcl) 18 In this section we study definable functions from the value group into G, and show that they are fairly simple. In order to obtain Corollary 2.4.12, we actually work in the more general setting of a function from a finite cover ....
A.A. Ivanov, H.D. Macpherson, Strongly determined types, Ann. Pure Appl. Logic 99 (1999), 197--230.
Definable sets in algebraically closed valued fields. .. - Haskell, Hrushovski, .. (2002) Self-citation (Macpherson) (Correct)
....in Section 2.5, we will show that any unary type has a canonical invariant extension (given by the generic type over any parameter set) hence we can just write pjC for p , the generic extension of p over C . In the subsequent paper we will extend this to n types. In Remark 2. 11 of [5] it is claimed that invariant extensions of types exist for arbitrary C minimal structures. However the Remark rests on Lemma 2.2 of that paper, and the proof of Lemma 2.2 is incomplete and the result may well be incorrect (other applications of 2.2 in [5] seem to be una ected, as problems only ....
....extend this to n types. In Remark 2.11 of [5] it is claimed that invariant extensions of types exist for arbitrary C minimal structures. However the Remark rests on Lemma 2.2 of that paper, and the proof of Lemma 2.2 is incomplete and the result may well be incorrect (other applications of 2. 2 in [5] seem to be una ected, as problems only arise when acl 6= dcl) 18 In this section we study de nable functions from the value group into G, and show that they are fairly simple. In order to obtain Corollary 2.4.12, we actually work in the more general setting of a function from a nite cover of ....
A.A. Ivanov, H.D. Macpherson, Strongly determined types, Ann. Pure Appl. Logic 99 (1999), 197-230.
Finite Covers - Evans, Macpherson, Ivanov (1995) Self-citation (Ivanov Macpherson) (Correct)
.... 0 categorical structures (although we often present results in more generality) The material is, for the most part, taken from the papers of Ahlbrandt and Ziegler ( 3, 4] Evans ( 23, 24, 25] Evans and Hrushovski ( 27] Hodges and Pillay ( 34] Ivanov ( 38, 39] and Ivanov and Macpherson ([40]) Some of the material does not appear elsewhere. The material on free covers (Section 2.1) and the presentation of Pontriagin duality (Section 6.3) is due to Evans, but is undoubtedly well known to others. Recall that the main problem is: The Cover Problem: For a given 0 categorical ....
.... case, this is precisely the group of automorphisms preserving all 0definable finite equivalence relations (on W n , for all n) From now on we assume that W is countable and 0 categorical (but we should mention here that the material of this section largely extends to the general case [40]) The following is a generalisation of the notion of strong type introduced earlier (4.3.1) Definition 5.1.2 Suppose that W is a permutation structure. A strongly determined n type over W is a function ae which assigns to each finite A W a complete n type over A (whose set of realisations is ....
[Article contains additional citation context not shown here]
A. A.Ivanov, D.Macpherson, `Strongly determined types', Preprint, Wroc/law, 1996.
Notes On Finite Covers - Evans (1996) (Correct)
No context found.
A.A.Ivanov, H.D.Macpherson, 'Strongly determined types', Preprint, Wroc/law, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC