Representations without Rules, Connectionism and the Syntactic Argument

Synthese 101 (3) (1994)
  Copy   BIBTEX


This paper has a two-fold aim. First, it reinforces a version of the "syntactic argument" given in Aizawa (1994). This argument shows that connectionist networks do not provide a means of implementing representations without rules. Horgan and Tlenson have responded to the syntactic argument in their book and in another paper (Horgan & Tlenson, 1993), but their responses do not meet the challenge posed by my formulation of the syntactic argument. My second aim is to describe a kind of cognitive architecture. This architecture might be called a computational architecture, but it is not a rules and representations architecture nor the representations without rules architecture that Horgan and Tlenson wish to endorse.



External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library


Added to PP

187 (#66,335)

6 months
107 (#6,012)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Ken Aizawa
Rutgers University - Newark

References found in this work

No references found.

Add more references