Graduate studies at Western
Journal of Logic, Language and Information 19 (3):283-314 (2010)
|Abstract||We conducted a computer-based psychological experiment in which a random mix of 40 tautologies and 40 non-tautologies were presented to the participants, who were asked to determine which ones of the formulas were tautologies. The participants were eight university students in computer science who had received tuition in propositional logic. The formulas appeared one by one, a time-limit of 45 s applied to each formula and no aids were allowed. For each formula we recorded the proportion of the participants who classified the formula correctly before timeout (accuracy) and the mean response time among those participants (latency). We propose a new proof formalism for modeling propositional reasoning with bounded cognitive resources. It models declarative memory, visual memory, working memory, and procedural memory according to the memory model of Atkinson and Shiffrin and reasoning processes according to the model of Newell and Simon. We also define two particular proof systems, T and NT , for showing propositional formulas to be tautologies and non-tautologies, respectively. The accuracy was found to be higher for non-tautologies than for tautologies ( p T was .89 and for non-tautologies the correlation between latency and minimum proof length in NT was .87.|
|Keywords||Bounded resources Proof system Propositional logic Psychological experiment Reasoning|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
M. G. Beavers (1994). Theorem Counting. Topoi 13 (1):61-65.
Nathan Segerlind (2007). The Complexity of Propositional Proofs. Bulletin of Symbolic Logic 13 (4):417-481.
Jan Krajíček (1995). Bounded Arithmetic, Propositional Logic, and Complexity Theory. Cambridge University Press.
Jan Krajíček (2004). Dual Weak Pigeonhole Principle, Pseudo-Surjective Functions, and Provability of Circuit Lower Bounds. Journal of Symbolic Logic 69 (1):265 - 286.
Juan A. Garc (2007). Mental Models in Propositional Reasoning and Working Memory's Central Executive. Thinking and Reasoning 13 (4):370 – 393.
Pavel Hrubeš (2007). Lower Bounds for Modal Logics. Journal of Symbolic Logic 72 (3):941 - 958.
Added to index2009-10-14
Total downloads23 ( #60,278 of 739,739 )
Recent downloads (6 months)1 ( #61,680 of 739,739 )
How can I increase my downloads?