Clique-width of countable graphs: a compactness property

We define the clique-width of a countable graph. We prove that a countable graph has finite clique-width iff its finite induced subgraphs have clique-width at most k for some integer k.