Andreas Blass

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

Andreas R. Blass
Prof. Andreas Blass giving a talk during the conference "Boise Extravaganza in Set Theory BEST 17", Boise, Idaho, March 2008
BornOctober 27, 1947
Nationality United States
Known forset theory, mathematical logic, theoretical computer science.
Scientific career
FieldsMathematician
InstitutionsUniversity of Michigan
Doctoral advisorFrank Wattenberg

Blass graduated from the University of Detroit, where he was a Putnam Fellow, in 1966 with a B.S. in physics. He received his Ph.D. in 1970 from Harvard University, with a thesis on Orderings of Ultrafilters written under the supervision of Frank Wattenberg.[1] Since 1970 he has been employed by the University of Michigan, first as a T.H. Hildebrandt Research Instructor (197072), then assistant professor (197276), associate professor (197684) and since 1984 he has been a full professor there.

In 2014, he became a Fellow of the American Mathematical Society.[2]

Selected publications and results

In 1984 Blass proved that the existence of a basis for every vector space is equivalent to the axiom of choice. He made important contributions in the development of the set theory of the reals and forcing.

Blass was the first to point out connections between game semantics and linear logic.

He has authored more than 200 research articles in mathematical logic and theoretical computer science, including:

  • Blass, Andreas (1984). "Existence of bases implies the axiom of choice". Axiomatic set theory, Proc. AMS-IMS-SIAM Jt. Summer Res. Conf., Boulder/Colo. 1983, Contemp. Math. 31. pp. 31–34.
  • Blass, Andreas; Shelah, Saharon (1987). "There may be simple - and -points and the Rudin–Keisler ordering may be downward directed". Annals of Pure and Applied Logic. 33: 213–243. doi:10.1016/0168-0072(87)90082-0. hdl:2027.42/26916.
  • Blass, Andreas (1992). "A game semantics for linear logic". Annals of Pure and Applied Logic. 56 (1–3): 183–220. doi:10.1016/0168-0072(92)90073-9. hdl:2027.42/30097.
  • Blass, Andreas; Gurevich, Yuri (2003). "Algorithms: a quest for absolute definitions" (PDF). Bull. Eur. Assoc. Theor. Comput. Sci. EATCS. 81: 195–225. Retrieved 2008-04-28.
gollark: https://media.discordapp.net/attachments/549759333014044673/789952376986927166/image0.jpg?width=576&height=422
gollark: It is apparently *horribly* buggy.
gollark: I didn't know you *could* use luck units for that, actually.
gollark: I see.
gollark: Yes, please have 192.0004 luck units dunnousername.

References


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.