University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Indistinguishability in Counting Logics and the Complexity of Semi-Algebraic Proofs

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Indistinguishability in Counting Logics and the Complexity of Semi-Algebraic Proofs

Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani .

Semantics and Syntax: A Legacy of Alan Turing

The recent connection between the concept of indistinguishability by the properties expressible in a certain formal language and a relaxation of structural isomorphism through linear programming brings the areas of descriptive complexity and propositional proof complexity a little bit closer together. In this talk I will overview this connection making emphasis on the questions it has answered, but also on the many new exciting questions that it raises.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cambridge-Fudan Cognitive Neuroscience seminar London's West End Type the title of a new list here

Other talks

Together Now: Cooperation and Collaboration in Social Art Practice Diasporic Divas: Performing Race, Gender, and Sexuality from the 18th Century to Today Shape modes of CP^1 vortices Title to be confirmed Content, Caching and Kubernetes: Performance and User Experience in the Browser Semiconductor-based neutron detector development at QMUL
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity