MathOverflow is a question and answer site for professional mathematicians. 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

Is there a version of the Löwenheim-Skolem theorem in intuitionistic logic? I'm particularly interested in the "downward" form. The standard proof I know uses the Tarski-Vaught test for elementary substructures, which in turn relies on the fact that "forall" is equivalent to "not exists not", and that fails intuitionistically.

share|cite|improve this question
up vote 9 down vote accepted

I have a reference that says the downward Löwenheim-Skolem theorem does not occur in intuitionistic logic. In the words of the abstract "even a very powerful version of intuitionistic set theory does not yield any of the usual forms of a countable downward Löwenheim-Skolem theorem."

Skolem's paradox and constructivism Journal of Philosophical Logic Springer Netherlands Issue Volume 16, Number 2 / May, 1987

Also page 341 of A Companion to Metaphysics By Jaegwon Kim

"...there is no intuitionistically acceptable analogue of the classical downward Löwenheim-Skolem theorem"

share|cite|improve this answer
Thank you! That's very helpful, and lots of food for thought. – Mike Shulman Nov 2 '09 at 7:11

Is the question about the Löwenheim–Skolem theorem for classical models in intuitionistic metatheory, or about the Löwenheim–Skolem theorem for intuitionistic (Kripke) models in classical metatheory? The latter certainly holds. One can prove it easily by realizing that a Kripke model can be represented by a suitable two-sorted classical model in such a way that satisfaction of any intuitionistic formula in the original model is first-order definable in the representation, and then applying the classical Löwenheim–Skolem theorem.

share|cite|improve this answer
I intended to ask about intuitionistic models in intuitionistic metatheory. (-: But thanks anyway, the point you make is an interesting thing to note. – Mike Shulman Feb 5 '11 at 4:22

It's been a while, but I think Ebbinghaus, Flum & Thomas, in the book Mathematical Logic, get the Löwenheim-Skolem theorems as a byproduct of the completeness theorem, which they prove using the Henkin construction. And I think that is fully constructivist.

share|cite|improve this answer
As far as I can tell, the only logic used in that book is classical. On page 34 in my edition, they say explicitly that they will not use ∀ any more because it can be replaced by ¬∃¬, and similarly for ∧ and →; this is okay classically but not intuitionistically. Then the proof of Henkin's Theorem (p79-80 in my edition) proceeds by an induction on the construction of formulas, considering only the cases ¬, ∨, and ∃. Again, this is allowable classically, but not intuitionistically. – Mike Shulman Oct 30 '09 at 19:53
But I think they only do it to shorten the proofs. That is not to say that all the proofs in the book are secretly valid intuitionistic proofs. I suppose it would be a worthy exercise to try and prove the omitted cases of the Henkin proof intuitionistically. – Kirill Levin Oct 31 '09 at 5:22
I'll believe it when I see it. (-: – Mike Shulman Oct 31 '09 at 16:50
I wouldn't have thought that the Henkin construction is constructivist. Certainly, to even begin the Henkin construction you need a complete extension of the consistent theory you start with, and the standard Lindenbaum construction of this complete extension involves enumerating the sentences of the language, and then in turn adding each one if it is consistent and its negation if not. That disjunction assumes excluded middle. – Kenny Easwaran Nov 6 '09 at 6:28

Your Answer


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.