John Truss

Last updated

John Truss
BornApril 1947 (age 77)
Education King's College, Cambridge (BA)
University of Leeds (PhD)
Children4; including Liz
Scientific career
Fields Pure mathematics
Institutions Paisley College of Technology
University of Leeds

John Kenneth Truss (born April 1947) is a mathematician and emeritus professor of pure mathematics at the University of Leeds where he specialises in mathematical logic, infinite permutation groups, homogeneous structures and model theory. [1] Truss began his career as a junior research fellow at the University of Oxford before holding a series of academic positions and lastly joining the University of Leeds. He has written books on discrete mathematics (1991) and mathematical analysis (1997) and was co-editor in chief of the Journal of the London Mathematical Society until June 2003. He is the father of the former Prime Minister of the United Kingdom, Liz Truss.

Contents

Early life and family

John Truss was born in April 1947. [2] [3] He graduated from King's College, Cambridge, in 1968 and earned his PhD at the University of Leeds in 1973 for a dissertation titled "Some Results about Cardinal Numbers without the Axiom of Choice" which was supervised by Frank Drake. [4] In 1969, he married Priscilla Mary Grasby, a nurse, [5] who he had met while they were students at Cambridge. [5] Together, they have a daughter, Liz Truss, and three sons. [6] Liz Truss has described her parents' politics as "to the left of Labour". [7] Truss and his wife were both supporters of the Campaign for Nuclear Disarmament. [8] They divorced in 2003. [5]

Truss refused to campaign with his daughter on her selection for Conservative candidate for South West Norfolk in the 2010 UK general election. [9]

Career

Truss's first academic position was as a junior research fellow at the Mathematical Institute of the University of Oxford. [10] He then taught at a school in Kidderminster, [11] Worcestershire, before lecturing at Paisley College of Technology from 1979 to 1985. [5] In 1987, he worked at Simon Fraser University [12] in British Columbia, Canada, and later at the University of Leeds where in 1988 with Frank Drake he edited the collected papers of Logic Colloquium '86, held at the University of Hull in 1986. [13]

In 1990, Peter Cameron paid tribute to Truss in his notes on Oligomorphic Permutation Groups in the London Mathematical Society Lecture Notes Series No. 152, for saving him from "making some rash conjectures (by disproving them)", and "notably" for his contribution to the question of what are the possible cycle structures of automorphisms of M? [14] In 1991, Truss published Discrete Mathematics for Computer Scientists which John Bayliss described in The Mathematical Gazette as "masterful and thorough" and getting "rapidly to the heart of some very exciting topics" but felt that it was more of a mathematician's book than a book for computer scientists as claimed by the author. Nonethless, Bayliss felt that the approach taken by Truss in organising and presenting his material was highly successful in condensing different strands of mathematics so that the author had shown that "discrete mathematics has come of age and is no longer a collection of disparate topics." [15]

In 1999, Truss and S. Barry Cooper, also of the University of Leeds, jointly edited two volumes of papers in the London Mathematical Society Lecture Notes Series arising from the European meeting of the Association for Symbolic Logic in Leeds in July 1997 on sets and proofs [16] [17] and models and computability. [16] The volumes were welcomed by philosopher Graham Priest of the University of Queensland who noted that they concentrated on logic as practiced in mathematics departments with little content of a philosophical or computer science nature, but, possibly as a result, were more coherent than usual for collections of conference papers. [16] By then, Truss and Jonathan Partington were co-editors of the Journal of the London Mathematical Society . [18] They were succeeded on 6 June 2003 by Francis Burstall and John Toland. [19]

Selected publications

Books

Edited volumes

Journal articles

Related Research Articles

<span class="mw-page-title-main">Discrete mathematics</span> Study of discrete mathematical structures

Discrete mathematics is the study of mathematical structures that can be considered "discrete" rather than "continuous". Objects studied in discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete mathematics excludes topics in "continuous mathematics" such as real numbers, calculus or Euclidean geometry. Discrete objects can often be enumerated by integers; more formally, discrete mathematics has been characterized as the branch of mathematics dealing with countable sets. However, there is no exact definition of the term "discrete mathematics".

Mathematics is a field of study that discovers and organizes methods, theories and theorems that are developed and proved for the needs of empirical sciences and mathematics itself. There are many areas of mathematics, which include number theory, algebra, geometry, analysis, and set theory.

<span class="mw-page-title-main">Saharon Shelah</span> Israeli mathematician

Saharon Shelah is an Israeli mathematician. He is a professor of mathematics at the Hebrew University of Jerusalem and Rutgers University in New Jersey.

<span class="mw-page-title-main">Cyclic order</span> Alternative mathematical ordering

In mathematics, a cyclic order is a way to arrange a set of objects in a circle.[nb] Unlike most structures in order theory, a cyclic order is not modeled as a binary relation, such as "a < b". One does not say that east is "more clockwise" than west. Instead, a cyclic order is defined as a ternary relation [a, b, c], meaning "after a, one reaches b before c". For example, [June, October, February], but not [June, February, October], cf. picture. A ternary relation is called a cyclic order if it is cyclic, asymmetric, transitive, and connected. Dropping the "connected" requirement results in a partial cyclic order.

<span class="mw-page-title-main">Wilfrid Hodges</span> British mathematician

Wilfrid Augustine Hodges, FBA is a British mathematician and logician known for his work in model theory.

<span class="mw-page-title-main">Thomas Callister Hales</span> American mathematician

Thomas Callister Hales is an American mathematician working in the areas of representation theory, discrete geometry, and formal verification. In representation theory he is known for his work on the Langlands program and the proof of the fundamental lemma over the group Sp(4). In discrete geometry, he settled the Kepler conjecture on the density of sphere packings, the honeycomb conjecture, and the dodecahedral conjecture. In 2014, he announced the completion of the Flyspeck Project, which formally verified the correctness of his proof of the Kepler conjecture.

In mathematics, Kruskal's tree theorem states that the set of finite trees over a well-quasi-ordered set of labels is itself well-quasi-ordered under homeomorphic embedding.

<span class="mw-page-title-main">S. Barry Cooper</span> English mathematician and computability theorist

S. Barry Cooper was an English mathematician and computability theorist. He was a professor of pure mathematics at the University of Leeds.

<span class="mw-page-title-main">Discrete tomography</span> Reconstruction of binary images from a small number of their projections

Discrete tomography focuses on the problem of reconstruction of binary images from a small number of their projections.

John Vivian Tucker is a British computer scientist and expert on computability theory, also known as recursion theory. Computability theory is about what can and cannot be computed by people and machines. His work has focused on generalising the classical theory to deal with all forms of discrete/digital and continuous/analogue data; and on using the generalisations as formal methods for system design; based on abstract data types and on the interface between algorithms and physical equipment.

<span class="mw-page-title-main">Steve Vickers (computer scientist)</span>

Steve Vickers is a British mathematician and computer scientist. In the early 1980s, he wrote ROM firmware and manuals for three home computers, the ZX81, ZX Spectrum, and Jupiter Ace. The latter was produced by Jupiter Cantab, a short-lived company Vickers formed together with Richard Altwasser, after the two had left Sinclair Research. Since the late 1980s, Vickers has been an academic in the field of geometric logic, writing over 30 papers in scholarly journals on mathematical aspects of computer science. His book Topology via Logic has been influential over a range of fields. In October 2018, he retired as senior lecturer at the University of Birmingham. As announced on his university homepage, he continues to supervise PhD students at the university and focus on his research.

<span class="mw-page-title-main">Andreas Blass</span> German-American mathematician

Andreas Raphael Blass is a mathematician, currently a professor at the University of Michigan. He works in mathematical logic, particularly set theory, and theoretical computer science.

Michael J. T. Guy is a British computer scientist and mathematician. He is known for early work on computer systems, such as the Phoenix system at the University of Cambridge, and for contributions to number theory, computer algebra, and the theory of polyhedra in higher dimensions. He worked closely with John Horton Conway, and is the son of Conway's collaborator Richard K. Guy.

In combinatorial mathematics and theoretical computer science, a (classical) permutation pattern is a sub-permutation of a longer permutation. Any permutation may be written in one-line notation as a sequence of entries representing the result of applying the permutation to the sequence 123...; for instance the sequence 213 represents the permutation on three elements that swaps elements 1 and 2. If π and σ are two permutations represented in this way, then π is said to contain σ as a pattern if some subsequence of the entries of π has the same relative order as all of the entries of σ.

In mathematics, ψ0(Ωω), widely known as Buchholz's ordinal, is a large countable ordinal that is used to measure the proof-theoretic strength of some mathematical systems. In particular, it is the proof theoretic ordinal of the subsystem -CA0 of second-order arithmetic; this is one of the "big five" subsystems studied in reverse mathematics (Simpson 1999). It is also the proof-theoretic ordinal of , the theory of finitely iterated inductive definitions, and of , a fragment of Kripke-Platek set theory extended by an axiom stating every set is contained in an admissible set. Buchholz's ordinal is also the order type of the segment bounded by in Buchholz's ordinal notation . Lastly, it can be expressed as the limit of the sequence: , , , ...

In computability theory, computational complexity theory and proof theory, the slow-growing hierarchy is an ordinal-indexed family of slowly increasing functions gα: N → N. It contrasts with the fast-growing hierarchy.

<span class="mw-page-title-main">Ieke Moerdijk</span> Dutch mathematician

Izak "Ieke" Moerdijk is a Dutch mathematician, currently working at Utrecht University, who in 2012 won the Spinoza prize.

In set theory, an amorphous set is an infinite set which is not the disjoint union of two infinite subsets.

<span class="mw-page-title-main">Rod Downey</span> Australian mathematician

Rodney Graham Downey is a New Zealand and Australian mathematician and computer scientist, an emeritus professor in the School of Mathematics and Statistics at Victoria University of Wellington in New Zealand. He is known for his work in mathematical logic and computational complexity theory, and in particular for founding the field of parameterised complexity together with Michael Fellows.

In mathematical logic, a Gödel logic, sometimes referred to as Dummett logic or Gödel–Dummett logic, is a member of a family of finite- or infinite-valued logics in which the sets of truth values V are closed subsets of the unit interval [0,1] containing both 0 and 1. Different such sets V in general determine different Gödel logics. The concept is named after Kurt Gödel.

References

  1. ↑ "Professor J K Truss | School of Mathematics | University of Leeds". eps.leeds.ac.uk. Archived from the original on 23 February 2022. Retrieved 7 September 2022.
  2. ↑ Truss, J. K., Library of Congress. Retrieved 15 September 2022.
  3. ↑ Virtual International Authority File. Retrieved 15 September 2022.
  4. ↑ John Kenneth Truss. Mathematics Genealogy Project. Retrieved 12 September 2022.
  5. 1 2 3 4 Norfolk, Andrew; Wace, Charlotte; Grylls, George. "Liz Truss: from teenage Lib Dem to darling of the Tory right" . The Times . ISSN   0140-0460 . Retrieved 7 September 2022.
  6. ↑ Josh Glancy; Hugo Daniel (3 September 2022). "Just where is Liz Truss from? Her incredible journey spans three countries and two continents". The Times . Archived from the original on 4 September 2022. Retrieved 6 September 2022.
  7. ↑ Quinn, Ben (5 September 2022). "How Liz Truss became leader of the Conservative party – a timeline". The Guardian .
  8. ↑ Hawke, Jack (5 September 2022). "How Liz Truss, Britain's next prime minister, went from anti-monarchist rebel to the next Margaret Thatcher". ABC News . Retrieved 14 March 2023.
  9. ↑ Cole, Harry; Heale, James (2022). Out of the Blue: The Inside Story of the Unexpected Rise and Rapid Fall of Liz Truss . HarperCollins. ISBN   978-0-00-860578-0.
  10. ↑ "Models of set theory containing many perfect sets", Ann. Math. Logic 7, 197–219 (1974).
  11. ↑ Where in Oxford is Liz Truss from? Miranda Norris, Oxford Mail, 6 September 2022. Retrieved 12 September 2022.
  12. ↑ Chan, Cheryl (6 September 2022). "New U.K. prime minister Liz Truss attended school in Burnaby". Vancouver Sun . Retrieved 6 September 2022.
  13. ↑ Skowron, Andrzej (1989). "Review of Logic Colloquium '86". Studia Logica. 48 (3): 396–400. ISSN   0039-3215. JSTOR   20015451.
  14. ↑ Cameron, Peter J. (1990). Oligomorphic Permutation Groups . London Mathematical Society Lecture Notes Series No. 152. Cambridge: Cambridge University Press. pp. v, 3, 86, 104. ISBN 0-521-38836-8
  15. 1 2 Baylis, John (1992). "Review of Discrete Mathematics for Computer Scientists". The Mathematical Gazette . 76 (476): 303–305. doi:10.2307/3619163. ISSN   0025-5572. JSTOR   3619163.
  16. 1 2 3 Priest, Graham (2001). "Review of Sets and Proofs; Models and Computability, S. Barry Cooper, John K. Truss". Studia Logica . 69 (3): 446–448. ISSN   0039-3215. JSTOR   20016368.
  17. ↑ Cantini, Andrea (2002). "Review of First Steps into Metapredicativity in Explicit Mathematics". The Bulletin of Symbolic Logic . 8 (4): 535–536. doi:10.2307/797965. ISSN   1079-8986. JSTOR   797965.
  18. ↑ "Journal of the London Mathematical Society". Archived from the original on 13 September 1999.
  19. ↑ "Journal of the London Mathematical Society". www1.maths.leeds.ac.uk. Retrieved 6 September 2022.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.