user avatar
user avatar
user avatar
Bartosz Bednarczyk
  • Member for 7 years
  • Last seen this week
26 votes
Accepted

Is Descriptive Complexity dead?

11 votes
Accepted

Existing implementation of Scott's reduction?

9 votes

Decidability of diophantine equations over {=, +, gcd}

5 votes
Accepted

Is Scott's reduction sound for $\mathrm{FO}^2$ with equality?

5 votes
Accepted

Which are the best universities for a DPhil/PhD in proof theory and automated reasoning?

5 votes
Accepted

Generalizations of Dyck languages?

4 votes
Accepted

Normal forms for counting quantifiers?

3 votes
Accepted

Scott's normal form for $\exists y \forall x R(x,y) $

3 votes

Evaluating asymptotic probabilities of First Order Logic Formulas?

2 votes

Tableau method for two-variable first-order logic

2 votes
Accepted

Proving that a given formula in LTL is the smallest way to express it

2 votes
Accepted

Reference request: An algebraic characterisation of LTL[XF]-definable word languages

1 vote

Prove that L* is a regular language

1 vote
Accepted

Complexity of Model Enumeration in function free, equality free, First Order Logic with only Unary Predicates?