1
$\begingroup$

It is known that for symbols with finite many relations, the number of inequivalent class of first order sentence with quantifier rank $m$ is finite. But is it possible to list (classify) them? At least in special cases.

$\endgroup$
2
  • 1
    $\begingroup$ The number is roughly a tower of exponentials of height $m$, so there is not enough paper in the universe to list them for $m$ larger than a very, very small constant. $\endgroup$ May 14, 2014 at 8:59
  • $\begingroup$ See this question: math.stackexchange.com/questions/773942/… $\endgroup$
    – Denis
    May 14, 2014 at 11:54

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.