Cristopher John Ash 1945-1995

Christopher John Ash was born on 5 January 1945 at Gorleston, a seaside town adjoining Great Yarmouth, Norfolk, England. He was an only child. His father, Kenneth William Ash, was the middle of three brothers. The elder brother was a Wing Commander in the Royal Air Force who worked on rocket research and the younger was a Captain in the Merchant Navy. Chris’s father was Borough Engineer at Redcar on the North Yorkshire coast. His mother was Joan Evelyn Hadley, who worked at a Quaker school. Chris’s paternal grandfather was Headmaster of Middlesborough High School. After starting school at Wilton House School, Redditch, near Birmingham he continued at Newcomen Primary School, Redcar, in 1953. At Redcar he joined the St. Peter’s Church choir, whose choirmaster was his music master from school. He loved the dressing up and the ceremony of church services. He lamented that when his voice broke he ‘was left with a rather feeble and inadequate tenor voice’ – a dubious assertion at best. Continuing his musical interests, he learnt to play violin, piano and cello, to which he later added recorders, clarinet and bassoon. Later still viola and tenor horn joined that impressive list. His love of music continued throughout his life. From 1955 he attended Sir William Turner’s School at Coatham, North Yorkshire. He had taken the ‘eleven-plus’ examination a year early, as many bright children did, and he had the opportunity to become a boarder at York Minster Choir School. However, his parents decided, against Chris’s desires, to keep him at home. In his first form in high-school, he was in the top two or three of his class of thirty. His English master in April 1956, his first year of high-school, commented ‘he must be careful of the inexact use of words’ – a recommendation which seems to have had effect, for Chris loved the exact use of words – in English or other languages – and he used words well. When it came to entering the Sixth Form, he had to decide between Classics and Science. He certainly read and enjoyed classical literature, Greek and other, all his life, and enjoyed translating or debating Latin epithets. But he opted for Science as ‘more realistic’. He was surprised when his headmaster advised him to drop Chemistry and do Further Mathematics. However, Chris did hold his mathematics master, L. Page, in high regard and he followed the advice. For Pure Mathematics, in his penultimate year in high school, his other mathematics teacher wrote: ‘He has the ability and knowledge to be very successful, but he must guard against careless errors’. This comment apparently did not need repeating, as subsequently Chris was very careful. Encouraged by his school he got a place at St Edmund Hall, Oxford and a State Scholarship. His undergraduate career in mathematics was undistinguished. He got a Second¶ in Mathematics Finals, which was a disappointment to him, but it appears that he did not get much pleasure from the mathematics there. ‘The only lectures I enjoyed were those of Ken Gravett in Set Theory’, he has reported. Contemporaries in general would have regarded Gravett’s as the most entertaining and stimulating of all their lectures. Singing flourished and, having sung in various choirs, Chris became a member of Schola Cantorum Oxoniense. This small group went on overseas tours including one to Italy and made at least one commercial record with Chris singing. In 1966, he was awarded a (U.K.) Science Research Council award to do graduate study. By that time, Mathematical Logic was his preferred area of study. The subject had only recently been admitted into the

[1]  R. Shore The recursively enumerable α-degrees are dense , 1976 .

[2]  Rodney G. Downey,et al.  Decidable subspaces and recursively enumerable subspaces , 1984, Journal of Symbolic Logic.

[3]  John J. Thurber,et al.  Recursive and r.e. quotient Boolean algebras , 1994, Arch. Math. Log..

[4]  Jeffrey B. Remmel,et al.  Quasi-Simple Relations in Copies of a Given Recursive Structure , 1997, Ann. Pure Appl. Log..

[5]  C. Ash On countablen-valued post algebras , 1972 .

[6]  Valentina S. Harizanov Some Effects of Ash-Nerode and Other Decidability Conditions on Degree Spectra , 1991, Ann. Pure Appl. Log..

[7]  Christopher J. Ash A Construction for Recursive Linear Orderings , 1991, J. Symb. Log..

[8]  P. J. Cohen Set Theory and the Continuum Hypothesis , 1966 .

[9]  Saharon Shelah End Extensions and Numbers of Countable Models , 1978, J. Symb. Log..

[10]  A. Seidenberg A NEW DECISION METHOD FOR ELEMENTARY ALGEBRA , 1954 .

[11]  R. Friedberg,et al.  TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944). , 1957, Proceedings of the National Academy of Sciences of the United States of America.

[12]  T. E. Hall,et al.  Finite semigroups with commuting idempotents , 1987, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.

[13]  Bjarni Jónsson,et al.  Homogeneous Universal Relational Systems. , 1960 .

[14]  L. Duysens Preprints , 1966, Nature.

[15]  Model - Theoretic Forms of the Axiom of Choice , 1983 .

[16]  The partially ordered set of allJ-classes of a finite semigroup , 1973 .

[17]  Manuel Lerman,et al.  A General Framework for Priority Arguments , 1995, Bulletin of Symbolic Logic.

[18]  Alan D. Vlach Hyperarithmetical Relations in Expansions of Recursive Structures , 1994, Ann. Pure Appl. Log..

[19]  Julia F. Knight,et al.  Generic Copies of Countable Structures , 1989, Ann. Pure Appl. Log..

[20]  Karsten Henckell,et al.  Ash's Type II Theorem, Profinite Topology and Malcev Products: Part I , 1991, Int. J. Algebra Comput..

[21]  J. R. Shoenfield Undecidable and creative theories , 1961 .

[22]  Christopher J. Ash On Countable Fractions from an Elementary Class , 1994, J. Symb. Log..

[23]  Julia Robinson,et al.  Definability and decision problems in arithmetic , 1949, Journal of Symbolic Logic.

[24]  M. Rabin Decidability of second-order theories and automata on infinite trees , 1968 .

[25]  Christopher J. Ash,et al.  Recursive Structures and Ershov's Hierarchy , 1996, Math. Log. Q..

[26]  Christopher J. Ash,et al.  Labelling Systems and r.e. Structures , 1990, Ann. Pure Appl. Log..

[27]  Christopher J. Ash,et al.  A Conjecture Concerning the Spectrum of a Sentence , 1994, Math. Log. Q..

[28]  Julia F. Knight,et al.  A Completeness Theorem for Certain Classes of Recursive Infinitary Formulas , 1994, Math. Log. Q..

[29]  John W. Rosenthal,et al.  Some Theories Associated with Algebraically Closed Fields , 1980, J. Symb. Log..

[30]  C. J. Ash,et al.  Persistently finite, persistently arithmetic theories , 1983 .

[31]  Functorial properties of algebraic closure and Skolemization , 1981 .

[32]  C. J Ash Pseudovarieties, generalized varieties and similarly described classes , 1985 .

[33]  The lattice of ideals of a semigroup , 1980 .

[34]  David Marker Degrees of Models of True Arithmetic , 1982 .

[35]  Manuel Lerman,et al.  Priority arguments using iterated trees of strategies , 1990 .

[36]  Geoffrey R. Hird Recursive Properties of Relations on Models , 1993, Ann. Pure Appl. Log..

[37]  Julia F. Knight,et al.  Possible Degrees in Recursive Copies II , 1997, Ann. Pure Appl. Log..

[38]  G. Higman,et al.  Embedding Theorems for Groups , 1949 .

[39]  N. R. REILLYf CONGRUENCE-FREE INVERSE SEMIGROUPS , 1974 .

[40]  John Love Stability among r.e. Quotient Algebras , 1993, Ann. Pure Appl. Log..

[41]  S. S. Goncharov,et al.  Autostability and computable families of constructivizations , 1975 .

[42]  M. Morley Categoricity in power , 1965 .

[43]  Theodore A. Slaman,et al.  Relatively recursive expansions II , 1992 .

[44]  G. Birkhoff,et al.  On the Structure of Abstract Algebras , 1935 .

[45]  Richard Watnick Constructive and recursive scattered order types , 1981 .

[46]  S. Kleene On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper) , 1955 .

[47]  Kevin J. Davey Inseparability in Recursive Copies , 1994, Ann. Pure Appl. Log..

[48]  W. Markwald Zur Theorie der konstruktiven Wohlordnungen , 1954 .

[49]  Julia A. Knight Effective Construction of Models , 1986 .

[50]  Christopher J. Ash Generalizations of Enumeration Reducibility Using Recursive Infinitary Propositional Sentences , 1992, Ann. Pure Appl. Log..

[51]  John L. Bell,et al.  Models and Ultraproducts: An Introduction. , 1969 .

[52]  Erwin Engeler,et al.  Languages with expressions of infinite length , 1966 .

[53]  Christopher J. Ash Stability of recursive structures in arithmetical degrees , 1986, Ann. Pure Appl. Log..

[54]  John Chisholm,et al.  Effective model theory vs. recursive model theory , 1990, Journal of Symbolic Logic.

[55]  A. Tarski A Decision Method for Elementary Algebra and Geometry , 2023 .

[56]  R. Vaught,et al.  Homogeneous Universal Models , 1962 .

[57]  Christopher J. Ash,et al.  Inevitable Graphs: a Proof of the Type II Conjecture and some Related Decision Procedures , 1991, Int. J. Algebra Comput..

[58]  Kelleen R. Hurlburt Sufficiency Conditions for Theories with Recursive Models , 1992, Ann. Pure Appl. Log..

[59]  Uniform labelled semilattices , 1979 .

[60]  Jean-Éric Pin,et al.  On the Varieties of Languages Associated with Some Varieties of Finite Monoids with Commuting Idempotents , 1990, Inf. Comput..

[61]  John W. Rosenthal,et al.  Intersections of algebraically closed fields , 1986, Ann. Pure Appl. Log..

[62]  Lawrence Feiner,et al.  Hierarchies of Boolean algebras , 1970, Journal of Symbolic Logic.

[63]  阿部 浩一,et al.  Fundamenta Mathematicae私抄 : 退任の辞に代えて , 1987 .