D. R. Woodall has introduced closely-related notions of Menger and König duals which can be applied to a broad range of combinatorial contexts. The present paper considers these two notions for finite ground sets in terms of syntactic duality principles. Specific graph-theoretic interpretations are cited.