Andreas Blass

Andreas Blass

Infobox_Scientist
name = Andreas R. Blass



image_width = 200px
caption = Prof. Andreas Blass giving a talk during the conference "Boise Extravaganza in Set Theory BEST 17", Boise, Idaho, March 2008
birth_date = October 27, 1947
birth_place =Nuremberg
residence = Ann Arbor, Michigan
nationality = USA
ethnicity =
field = Mathematician
work_institution = University of Michigan
alma_mater =
doctoral_advisor = Frank Wattenberg
doctoral_students =
known_for = set theory, mathematical logic, theoretical computer science.
prizes =
footnotes =

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

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. [MathGenealogy|id=7579] Since 1970 he has been employed by the University of Michigan, first as a "T.H. Hildebrandt Research Instructor" (1970–72), then assistant professor (1972–76), associate professor (1976–84) and since 1984 he has been a full professor there.

elected 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 about 175 research articles in mathematical logic and theoretical computer science, including:

*citation| last = Blass | first = Andreas| contribution = Existence of bases implies the axiom of choice | title = Axiomatic set theory, Proc. AMS-IMS-SIAM Jt. Summer Res. Conf., Boulder/Colo. 1983, Contemp. Math. 31. | pages = 31–34| year = 1984
*cite journal|author=Blass, Andreas|coauthors=Shelah, Saharon|title=There may be simple P_{aleph_1}- and P_{aleph_2}-points and the Rudin-Keisler ordering may be downward directed| journal= Annals of Pure and Applied Logic|volume=33|year=1987|pages=213–243
*cite journal|author = Blass, Andreas| title= A game semantics for linear logic|journal= Annals of Pure and Applied Logic|volume= 56|year=1992|pages=183–220
*cite journal|author = Blass, Andreas |coauthors= Gurevich, Yuri|title= Algorithms: a quest for absolute definitions|journal= Bull. Eur. Assoc. Theor. Comput. Sci. EATCS|volume=81|year=2003|pages=195–225|url=http://research.microsoft.com/~gurevich/Opera/164.pdf| format=PDF|accessdate=2008-04-28

References

External links

* [http://www.math.lsa.umich.edu/~ablass/ Blass's page at UM]

Persondata
NAME = Blass, Andreas Raphael
ALTERNATIVE NAMES =
SHORT DESCRIPTION = Mathematician
DATE OF BIRTH = October 27 1947
PLACE OF BIRTH = Nuremberg
DATE OF DEATH =
PLACE OF DEATH =


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Blass — can refer to several people *Andreas Blass, an American mathematician. *Bill Blass (1922–2002), US fashion designer *Friedrich Blass (1843–1907), German classical scholar *Steve Blass, baseball player and announcer *Wolf Blass, East German born… …   Wikipedia

  • Ernst Blass — (* 17. Oktober 1890 in Berlin; † 23. Januar 1939 in Berlin; Pseudonyme: Daniel Stabler und Erich Sternow) war ein bedeutender frühexpressionistischer Dichter, Kritiker und Schriftsteller. Inhaltsverzeichnis 1 Leben 2 Werke …   Deutsch Wikipedia

  • Game semantics — (German: dialogische Logik) is an approach to formal semantics that grounds the concepts of truth or validity on game theoretic concepts, such as the existence of a winning strategy for a player, somewhat resembling Socratic dialogues or medieval …   Wikipedia

  • Algorithm characterizations — The word algorithm does not have a generally accepted definition. Researchers are actively working in formalizing this term. This article will present some of the characterizations of the notion of algorithm in more detail. This article is a… …   Wikipedia

  • Liste de personnes par nombre d'Erdős — Voici une liste non exhaustive de personnes ayant un nombre d Erdős de 0, 1 ou 2. Sommaire 1 #0 2 #1 3 #2 4 Référence …   Wikipédia en Français

  • List of mathematicians (B) — NOTOC Bab * Babai, László (Hungary, 1950 ) * Babbage, Charles (England, 1791 1871) * Babuška, Ivo (Czech Republic, ? ) * Bacaloglu, Emanoil (Romania, 1830 1891) * Bach, Eric (?, ? ) * Bachelier, Louis Jean Baptiste Alphonse (France, 1870 1946) *… …   Wikipedia

  • University of Detroit Mercy — Motto Ad maiorem Dei gloriam and Maria, Sedes Sapientiae ( Mary, Seat of Wisdom ) Established 1877 Type Private, Coeducational …   Wikipedia

  • Newton da Costa — at Berkeley in 1973 Photo courtesy George M. Bergman Full name Newton da Costa Born 16 September 1929 (1929 09 16) (age 82) Curitiba, B …   Wikipedia

  • Algorithm examples — This article Algorithm examples supplements Algorithm and Algorithm characterizations. = An example: Algorithm specification of addition m+n =Choice of machine model:This problem has not been resolved by the mathematics community. There is no… …   Wikipedia

  • List of people by Erdős number — Paul Erdős was one of the most prolific writers of mathematical papers. He collaborated a great deal, having 511 joint authors, a number of whom also have many collaborators. The Erdős number measures the collaborative distance between an author… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”