On further delimiting the space of bias profiles for polar interrogatives

In Gärtner & Gyuris (2017) we defined the “bias profileˮ of an individual polar interrogative clause type as a non-empty choice from the power sets of evidential bias options and epistemic bias options for each of its expressive instantiations as positive polar question (PPQ), and negative polar questions with inside (IN-NPQ) and outside negation (ON-NPQ) in the sense of Ladd (1981). By simple arithmetic we predicted the existence of (7x7)^3 = 117649 such bias profiles. We then explored the “spaceˮ of bias profiles and demonstrated a numerical reduction to just (4x2)^3 = 512 permissible types. This was based on differential choices from the sets of evidential and epistemic biases, formulated in terms of the principle of Static Complementarity (together with the principle of Convexity). In the current brief note, we will show how to considerably cut down options further by in addition imposing a bi-uniqueness constraint on the evidential bias of IN-NPQs.