Complexity of countable categoricity in finite languages

Details Complexity of countable categoricity in finite languages Complexity of countable categoricity in finite languages

2011-01-19

arxiv.org/abs/1101.3792v1

Mathematics

Logic

16 pages

Scientific paper

We study complexity of the index set of countably categorical theories and
Ehrenfeucht theories in finite languages.

Affiliated with

Also associated with

No associations

Rating

Complexity of countable categoricity in finite languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Complexity of countable categoricity in finite languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity of countable categoricity in finite languages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-332815