Book contents
- Frontmatter
- Contents
- Preface
- Continuous Functionals of Dependent and Transfinite Types
- Degree-Theoretic Aspects of Computably Enumerable Reals
- Simplicity and Independence for Pseudo-Algebraically Closed Fields
- Clockwork or Turing U/universe? - Remarks on Causal Determinism and Computability
- A Techniques Oriented Survey of Bounded Queries
- Relative Categoricity in Abelian Groups
- Computability and Complexity Revisited
- Effective Model Theory: The Number of Models and Their Complexity
- A Survey on Canonical Bases in Simple Theories
- True Approximations and Models of Arithmetic
- On the Topological Stability Conjecture
- A Mahlo-Universe of Effective Domains with Totality
- Logic and Decision Making
- The Sheaf of Locally Definable Scalars over a Ring
- Human Styles of Quantificational Reasoning
- Recursion Theoretic Memories 1954–1978
- Fields Definable in Simple Groups
- A Combinatory Algebra for Sequential Functionals of Finite Type
- Model Theory of Analytic and Smooth Functions
Human Styles of Quantificational Reasoning
Published online by Cambridge University Press: 17 May 2010
- Frontmatter
- Contents
- Preface
- Continuous Functionals of Dependent and Transfinite Types
- Degree-Theoretic Aspects of Computably Enumerable Reals
- Simplicity and Independence for Pseudo-Algebraically Closed Fields
- Clockwork or Turing U/universe? - Remarks on Causal Determinism and Computability
- A Techniques Oriented Survey of Bounded Queries
- Relative Categoricity in Abelian Groups
- Computability and Complexity Revisited
- Effective Model Theory: The Number of Models and Their Complexity
- A Survey on Canonical Bases in Simple Theories
- True Approximations and Models of Arithmetic
- On the Topological Stability Conjecture
- A Mahlo-Universe of Effective Domains with Totality
- Logic and Decision Making
- The Sheaf of Locally Definable Scalars over a Ring
- Human Styles of Quantificational Reasoning
- Recursion Theoretic Memories 1954–1978
- Fields Definable in Simple Groups
- A Combinatory Algebra for Sequential Functionals of Finite Type
- Model Theory of Analytic and Smooth Functions
Summary
Even middle-school mathematics relies on the use of variables to capture the generality of theorems and proofs. Ordinary nonmathematical language also relies on similar devices – determiners, pronouns, and sometimes other parts of speech – to specify information about entities without having to describe or to name them individually. In psychology, variables are a central means of representing, retrieving, and manipulating information in memory, according to many cognitive theories (e.g., Anderson, 1983; Newell, 1990). In these theories, for example, a simple procedure for recognizing a triangle might be spelled out in terms of mental rules such as IF Closed(x) & Three-sided(x) & Two-dimensional(x) THEN Triangle(x), much as in conventional computer-programming languages.
These psychological theories assume that all people – even those who have never had math or logic training – manipulate variables mentally, but until recently there have been no general proposals about reasoning with variables. If people do represent generality in this way, then it is useful to know something about the limits of their ability to deduce information from such representations. It is possible, of course, to capture generality by other means, for example, replacing variables with combinators (e.g., Hindley & Seldin, 1986; Schönfinkel, 1924/1967). The research that I describe here, however, follows the lead of theories such as Anderson's and Newell's in assuming variable-based representations, and it examines people's deductive skills within this framework.
- Type
- Chapter
- Information
- Models and Computability , pp. 353 - 366Publisher: Cambridge University PressPrint publication year: 1999
- 2
- Cited by