We show that using a theory of
<term>
scope availability
</term>
based upon the
<term>
function-argument structure
</term>
of a
<term>
sentence
</term>
allows a
<term>
deterministic , polynomial time test
</term>
for the
<term>
availability of a reading
</term>
, while solving the same problem within theories based on the
<term>
well-formedness
</term>
of
<term>
sentences
</term>
in the
<term>
meaning language
</term>
has been shown to be NP-hard .
#30898We show that using a theory of scope availability based upon the function-argument structure of a sentence allows a deterministic, polynomial time test for the availability of a reading , while solving the same problem within theories based on the well-formedness of sentences in the meaning language has been shown to be NP-hard.