The Computer Science Colloquium
Thursday, December 3, 4:15pm, room 9204/9205
Rohit Parikh
Brooklyn College of CUNY and CUNY Graduate Center)
"Beth Definability, Interpolation and Language Splitting"
Both the Beth definability theorem and Craig's lemma
(interpolation theorem from now on) deal with the issue of the entanglement,
of one language L1 with another language L2, that is to say,
information transfer - or the lack of such transfer - between the two languages.
The notion of splitting we study looks into this issue.
We briefly relate our own results in this area as well as the results
of other researchers like Kourousias and Makinson, and Peppas, Chopra and Foo.
We do have one new (easy, but possibly important) theorem.
The Colloquium is supported by generous contributions from
the Bloomberg, Information Builders, Inc., and Netlogic,
Inc.
365 Fifth Ave, New York City 10016 | Room 4319 | Phone: 212.817.8190 | Fax: 212.817.1510 | compsci@gc.cuny.edu


