This paper will be at LICS.

Remembering the day that Michael Rabin received an honorary doctorate from the University of Wroclaw.
share.google/SziclflYDdKw...

Sad to hear. RIP.

Happy Baisakhi!

Happy Easter 🐣

And will there also be Have I Got More News For You?

There is a post-doctoral position available in my group. Funding is for two years in the first instance (with a possibility of an extension). Details on how to apply are at the link below. Please feel free to contact me with any enquiries.

www.cam.ac.uk/jobs/researc...

Half a million strong. Together.

The biggest march against the far-right in British history.

Today! @togetheralliance.bsky.social

Happy birthday!

28 March — Together Alliance Together is an alliance of hundreds of civil society organisations united against the far right.

In London on Saturday:
www.togetheralliance.org.uk/march

Eid Mubarak to all!

Nowruz mubarak نوروذ مبارک

Isn't Pyaasa SD Burman?

Mughal-e-azam. Aawara. Pyaasa.

For outstanding papers in Logic and Computation in the last twenty five years.

Post-it notes, cryptic clues, a key - and someone trying to piece them all together to solve a riddle. Just like the 'Help Us Find Our Missing Computer Science Professor' escape room we're running during our Family Open Day on Sat 21 March 2026.

We're running a new 'escape room' at our @cambridgefestival.bsky.social Family Open Day on Sat 21 March - 'Help Us Find our Missing Computer Science Professor'. Find clues, make connections & see if you can solve the riddle! More details on this & other activities on the day at: shorturl.at/Jeu63

And like all macho men, they will soon grow bored of beating each other up. So, both sides can declare victory and go back home to beating up their women as usual.

RIP, Tony.

I highly recommend this column by Hongseok Yang and two of his students giving a formal logic take on a powerful method from extremal combinatorics.

The Spring issue of the EATCS Bulletin is now available!

Yes, foxes are getting quite common. See them in the daytime often. You should check out David Attenborough'documentary on wild London.

The last time a wolf was seen anywhere in Britain was about 1680.

Happy Holi

We also consider satisfiability in general partial Boolean algebras, which subsume both the classic Boolean algebra and the projector algebras of Hilbert spaces.

If the values of the propositions can be arbitrary measurement outcomes in a quantum system (i.e. arbitrary projectors in a Hilbert space) the problem is undecidable. If we limit the dimension of the Hilbert space, it is complete for the existential theory of the reals.

The Kochen-Specker theorem tells us that then not every classical tautology is always true. So, what is then the complexity of deciding which formulas are satisfiable?
We answer this question under various assumptions about the system.

Testing whether a propositional formula is satisfiable is the classic NP-complete problem. But, what if the propositions that the formula is formed from are not understood as statements that can be true or false but as the outcomes of measurements in a quantum system?

Complexity of Satisfiability in Kochen-Specker Partial Boolean Algebras The Kochen-Specker no-go theorem established that hidden-variable theories in quantum mechanics necessarily admit contextuality. This theorem is formally stated in terms of the partial Boolean algebra...

Our new paper (by my postdoc Nihil Shah and myself) just landed on arXiv. About propositional satisfiability in a quantum world. A short thread explaining what this is about.

arxiv.org/abs/2602.24164

Ah. Piskunov!