The application of a(n) makes it easier to solve the drinking beer version of the Wason problem.
a. conjunction rule
b. permission schema
c. atmosphere effect
d. availability heuristic
Question 2
Which of the following statements would most likely invoke the operation of a permission schema?
a. No artists can be beekeepers, but some of the beekeepers must be chemists.
b. All A are B. All B are C. Therefore, all A are C.
c. I forgot to charge my cell phone last night, therefore I missed an important call today.
d. If I get an A on my cognitive psychology exam, I can go out with my friends Saturday night.