This is a static snapshot of the website of MPLA, taken on 2025-02-27.

You are here: Seminars » 2009-2010 » A. Sirokofskich, 2010-06-11

Navigator

Fortune cookie

“Your discovery of the contradiction caused me the greatest surprise and, I would almost say, consternation, since it has shaken the basis on which I intended to build my arithmetic.... It is all the more serious since, with the loss of my rule V, not only the foundations of my arithmetic, but also the sole possible foundations of arithmetic seem to vanish.”

Gottlob Frege.

Seminar

Speaker:	Alla Sirokofskich (MPLA)
Title:	Decidability of sub-theories of polynomials over a finite field
Date:	Friday, 11 Jun 2010
Time:	18:00-19:00

Comments

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.