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.

I'm stuck with this problem:

$L$ is first-order language with identity and $L_q$ a language obtained by adding to $L$ the quantifier $Q$. If $P$ is a formula and $x$ a variable, $QxP$ is a formula of $L_q$. If $A$ is a $L_q$-structure, then $A\vDash QxP$ if and only if $\#\left(\{a \in |A| : A\vDash P[a]\}\right)>\aleph_0$.

I have to show that there exists $T\subset\operatorname{For}(L_q)$ of cardinal superior to $\aleph_0$ such that T does not have a model and every finite subset has a model

Any ideas??

thanks!

share|improve this question
2  
And the quantifier $Q$ is...? –  Asaf Karagila Jan 22 '13 at 19:22
5  
Use negation and Q to say the universe is countable. Then for uncountably many constant symbols, say they're all distinct. –  Andreas Blass Jan 22 '13 at 19:52
    
@AndreasBlass: you should post this as an answer... –  tomasz Jan 23 '13 at 15:45

1 Answer 1

To get this off the unanswered list:

Use negation and Q to say the universe is countable. Then for uncountably many constant symbols, say they're all distinct. – Andreas Blass Jan 22 at 19:52

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.