Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Suppose that a finiteness quantifier $\mathbf Fx$ is added to first order logic. Its semantics are: $\mathbf Fx\Phi(x)$ is true in a model just in case there a finitely many things in the domain of the model that satisfy $\Phi(x)$

So I have to prove an isomorphism with of $Th(\mathbb N)$ with the finiteness quantifier. But the kicker is that I cannot use any of the metatheory of regular FOL for this. No compactness etc. I really don't know how to proceed.

Does $Th(\mathbb N)$ even look that much different with a finiteness quantifier?

Any help is quite appreciated.

share|improve this question

1 Answer 1

Hint:

Show that $\forall x.\mathbf{F}y(y<x)$ is true in $\mathbb N$. Now suppose that $M$ is another model of $Th(\mathbb N)$, it has to be linearly ordered, and every initial segment has to be finite.

Now construct the isomorphism by induction (minimum to minimum, etc.)

share|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.