Using ERP, we investigated the cause of the tie advantage according to which problems with repeated operands are solved faster and more accurately than non-tie problems. We found no differences in early or N400 ERP components between problems, suggesting that tie problems are not encoded faster or suffer from less interference than non-tie problems. However, a lesser negative amplitude of the N2 component was found for tie than non-tie problems. This suggests more working-memory and attentional resource requirements for non-tie problems and therefore more frequent use of retrieval for tie than non-tie problems. The possible peculiarity of problems involving a 1 was also investigated. We showed less negative N2 amplitudes for these problems than for other non-tie problems, suggesting less working-memory resources for 1-problems than other non-tie problems. This could be explained either by higher reliance on memory retrieval for 1-problems than non-1 problems or by the application of non-arithmetical rules for 1-problems.

使用ERP，我们调查了出现平局优势的原因，根据该原因，与非平局问题相比，解决重复操作数问题的速度更快，更准确。我们发现问题之间的早期或N400 ERP组件之间没有差异，这表明联系问题比非联系问题的编码速度更快或受到的干扰更少。但是，发现非粘结问题的N2分量负振幅较小。这表明非领带问题需要更多的工作记忆和注意力资源，因此比非领带问题更频繁地使用检索领带。还研究了涉及1的问题的可能特殊性。对于这些问题，我们显示出的负N2振幅要比其他非约束问题中的要小，与其他非约束问题相比，建议针对1问题的工作内存资源更少。这可以通过对1问题比对非1问题更依赖于内存检索来解释，或者通过对1问题采用非算术规则来解释。