mpla.math.uoa.gr

Font size: Αα Αα Αα

hide gadgets

autohide:

You are here: Seminars » 1999-2000 » P. Kolaitis, 2000-07-06

{ prev, contents, next }

Navigator

Fortune cookie

“Every mathematician agrees that every mathematician must know some set theory; the disagreement begins in trying to decide how much is some. This book contains my answer to that question.”

Paul Halmos,
the beginning of his book, "Naive Set Theory"..

download seminar details: { pdf }

Seminar

Speaker:	Ph. Kolaitis (University of California, Santa Cruz)
Title:	On the Complexity of Counting Problems in Equational Matching and Unification
Date:	Thursday, 06 Jul 2000
Time:	18:00-19:00

Comments

You must be logged in to comment.

Reporter

Posts

Web standards: XHTML1.0, CSS3.

Powered by: OpenBSD, vim, nginx, Haskell, Ruby, Python, PostgreSQL, SQLite, django, schole.

© 1996 – 2018 MPLA: Graduate program in Logic, Algorithms and Computation.
Contact the webmaster.