2.1k citations · 3.9k across the 42 of their papers we have counts for
4 papers · 1 filter
Towards Finding Longer Proofs
Zsolt Zombori, Adrián Csiszárik, Henryk Michalewski +2
We present a reinforcement learning (RL) based guidance system for automated theorem proving geared towards Finding Longer Proofs (FLoP). Unlike most learning based approaches, we…
Monadic Second Order Logic with Measure and Category Quantifiers
Matteo Mio, Michał Skrzypczak, Henryk Michalewski
We investigate the extension of Monadic Second Order logic, interpreted over infinite words and trees, with generalized "for almost all" quantifiers interpreted using the notions o…
The logical strength of Büchi's decidability theorem
Leszek Kołodziejczyk, Henryk Michalewski, Cécilia Pradic +1
We study the strength of axioms needed to prove various results related to automata on infinite words and Büchi's theorem on the decidability of the MSO theory of . We…
Deciding the Borel complexity of regular tree languages
Alessandro Facchini, Henryk Michalewski
We show that it is decidable whether a given a regular tree language belongs to the class of the Borel hierarchy, or equivalently whether the Wadge degree of a regula…