Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

PH is the complexity class that is the set of languages expressible by second-order logic. If so, is there any complexity class that is the set of languages expressible by first-order logic?

It seems likely that R is the complexity class that is the set of languages expressible by first-order logic, but I am not really sure.

share|cite|improve this question
    
Did you check the Wikipedia page on Descriptive complexity theory? – Yuval Filmus May 9 '12 at 1:25
    
@YuvalFilmus no.. and I got an answer! Thanks for help. – user2346 May 9 '12 at 1:29
up vote 2 down vote accepted

I'm just putting this here to remove it from the unanswered queue. From the wikipedia article on Descriptive Complexity Theory:

First-order logic defines the class FO, corresponding to $\mathsf{AC}^0$, the languages recognized by polynomial-size circuits of bounded depth, which equals the languages recognized by a concurrent random access machine in constant time.

share|cite|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.