David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Journal of Logic, Language and Information 20 (3):277-296 (2011)
Chomsky’s highly influential Syntactic Structures ( SS ) has been much praised its originality, explicitness, and relevance for subsequent cognitive science. Such claims are greatly overstated. SS contains no proof that English is beyond the power of finite state description (it is not clear that Chomsky ever gave a sound mathematical argument for that claim). The approach advocated by SS springs directly out of the work of the mathematical logician Emil Post on formalizing proof, but few linguists are aware of this, because Post’s papers are not cited. Chomsky’s extensions to Post’s systems are not clearly defined, and the arguments for their necessity are weak. Linguists have also overlooked Post’s proofs of the first two theorems about effects of rule format restrictions on generative capacity, published more than ten years before SS was published
|Keywords||Generative grammar Transformations Emil Post Formalization Proof theory Mathematical logic|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
Noam Chomsky (1965). Aspects of the Theory of Syntax. The Mit Press.
Emil Post (1921). Introduction to a General Theory of Elementary Propositions. American Journal of Mathematics 43 (1):163--185.
Emil L. Post (1947). Recursive Unsolvability of a Problem of Thue. Journal of Symbolic Logic 12 (1):1-11.
Geoffrey K. Pullum & Barbara C. Scholz (2009). For Universals (but Not Finite-State Learning) Visit the Zoo. Behavioral and Brain Sciences 32 (5):466-467.
Citations of this work BETA
No citations found.
Similar books and articles
David S. Henley (1995). Syntax-Directed Discovery in Mathematics. Erkenntnis 43 (2):241 - 259.
Liesbeth De Mol (2006). Closing the Circle: An Analysis of Emil Post's Early Work. Bulletin of Symbolic Logic 12 (2):267 - 289.
Giuseppe Longo & Arnaud Viarouge (2010). Mathematical Intuition and the Cognitive Roots of Mathematical Concepts. Topoi 29 (1):15-27.
Halina Święczkowska (ed.) (1998). Emil L. Post and the Problem of Mechanical Provability: A Survey of Post's Contributions in the Centenary of His Birth. Chair of Logic, Informatics and Philisiophy of Science University of Białystok.
Emil Leon Post (1941). The Two-Valued Iterative Systems of Mathematical Logic. London, H. Milford, Oxford University Press.
Edwin Coleman (2009). The Surveyability of Long Proofs. Foundations of Science 14 (1-2):27-43.
Marcus Tomalin (2011). Syntactic Structures and Recursive Devices: A Legacy of Imprecision. [REVIEW] Journal of Logic, Language and Information 20 (3):297-315.
Andrew Aberdein (2006). Proofs and Rebuttals: Applying Stephen Toulmin's Layout of Arguments to Mathematical Proof. In Marta Bílková & Ondřej Tomala (eds.), The Logica Yearbook 2005. Filosofia. 11-23.
Ian J. Dove (2009). Towards a Theory of Mathematical Argument. Foundations of Science 14 (1-2):136-152.
Wolfram Hinzen & Juan Uriagereka (2006). On the Metaphysics of Linguistics. Erkenntnis 65 (1):71-96.
Added to index2011-07-16
Total downloads12 ( #128,186 of 1,101,088 )
Recent downloads (6 months)3 ( #116,335 of 1,101,088 )
How can I increase my downloads?