## Abstract

First, we describe a psychological experiment in which the participants were asked to determine whether sentences of first-order logic were true or false in finite graphs. Second, we define two proof systems for reasoning about truth and falsity in first-order logic. These proof systems feature explicit models of cognitive resources such as declarative memory, procedural memory, working memory, and sensory memory. Third, we describe a computer program that is used to find the smallest proofs in the aforementioned proof systems when capacity limits are put on the cognitive resources. Finally, we investigate the correlation between a number of mathematical complexity measures defined on graphs and sentences and some psychological complexity measures that were recorded in the experiment.

Original language | English (US) |
---|---|

Pages (from-to) | 115-137 |

Number of pages | 23 |

Journal | Journal of Logic, Language and Information |

Volume | 22 |

Issue number | 1 |

DOIs | |

State | Published - Jan 2013 |

## Keywords

- Bounded cognitive resources
- First-order logic
- Proof system
- Truth

## ASJC Scopus subject areas

- Computer Science (miscellaneous)
- Philosophy
- Linguistics and Language