Symposium on logic and computability "Logic and Computation Day"

Conferences

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

Symposium on logic and computability "Logic and Computation Day"
(June 7, 2013, Steklov Mathematical Institute of RAS, Moscow)

The symposium features six invited lectures covering topics in theoretical and applied logic centered around the notions of proof and computation. The keynote speaker is Prof. Andre Scedrov, University of Pennsylvania.

E-mail:
Website:	https://lcd13.mi.ras.ru

Organizers
Beklemishev Lev Dmitrievich

Institutions
Steklov Mathematical Institute of Russian Academy of Sciences, Moscow


*Symposium on logic and computability "Logic and Computation Day", Moscow, June 7, 2013*

	*June 7, 2013 (Fri)*

1.	Bounded Memory Protocols and the Unbounded Adversary A. Scedrov June 7, 2013 10:00–11:00, Moscow, Steklov Mathematical Institute of RAS


2.	High Entropy Random Selection Protocols N. K. Vereshchagin June 7, 2013 11:00–11:45, Moscow, Steklov Mathematical Institute of RAS


3.	Circular proofs for provability logic D. S. Shamkanov June 7, 2013 12:15–13:00, Moscow, Steklov Mathematical Institute of RAS


4.	Primal implication as encryption V. N. Krupski June 7, 2013 14:30–13:15, Moscow, Steklov Mathematical Institute of RAS


5.	Fixed-point tile sets and their applications A. Romashchenko June 7, 2013 15:30–16:15, Moscow, Steklov Mathematical Institute of RAS


6.	Hamming metric and products of modal logics I. B. Shapirovskii June 7, 2013 16:15–17:00, Moscow, Steklov Mathematical Institute of RAS

Registration to the website

Logotypes