Bar-Hillel, Yehoshua. 1953. “A Quasi-arithmetical Notation for Syntactic Description”. Language 29:1.47–58. Reprinted with revisions in Bar-Hillel (1964), 61–74.
Bar-Hillel, Yehoshua, Micha Perles & Eliyahu Shamir. 1961. “On Formal Properties of Simple Phrase Structure Grammars”. Zeitschrift für Phonetik, Sprachwissenschaft, und Kommunikationsforschung 141.143–172. Reprinted with revisions in Bar-Hillel (1964), 116–150.
Beth, Evert W. 1963. “Konstanten van het wiskundige denken [constants in mathematical thinking]”. Mededelingen der Koninklijke Nederlandse Akademie van Wetenschappen: Afdeling Letterkunde, Nieuwe Reeks 26:7.231–256.
Brodda, Benny. 1992. “Comments [on Geoffrey Sampson’s paper ‘Probabilistic parsing’]”. Directions in Corpus Linguistics: Proceedings of Nobel Symposium 82, Stockholm, 4–8 August 1991 ed. by Jan Svartvik, number 65 in Trends in Linguistics Studies and Monographs, 448–453. Berlin: Mouton de Gruyter.
Chomsky, Noam. 1951a. Morphophonemics of Modern Hebrew. Master’s thesis, University of Pennsylvania, Philadelphia, PA.
Chomsky, Noam. 1951b. Morphophonemics of Modern Hebrew. Typescript of a radical revision of Chomsky’s MA thesis, dated December 1951; retyped and published by Garland, New York, 1979.
Chomsky, Noam. 1955. Transformational Analysis. Ph.D. thesis, University of Pennsylvania, Philadelphia, PA. URL: [URL]
Chomsky, Noam. 1955–1956. Manuscript, mimeographed 1955; revised 1956 and distributed on microfilm by MIT Library, Cambridge, MA; ultimately published (with some omissions and a new introduction) as Chomsky 1975.
Chomsky, Noam. 1956. “Three Models for the Description of Language”. I.R.E. Transactions on Information Theory IT-21.113–123. Substantially revised version published in Readings in Mathematical Psychology, Volume II ed. by R. Duncan Luce, Robert R. Bush & Eugene Galanter, 105–124. New York: John Wiley & Sons, 1965.
Chomsky, Noam. 1959. “On Certain Formal Properties of Grammars”. Information and Control 2(2):137–167. Reprinted in Readings in Mathematical Psychology, Volume II1, ed. by R. Duncan Luce, Robert R. Bush & Eugene Galanter, 125–155. New York: John Wiley & Sons, 1965 (citation to the original on p. 125 of this reprinting is incorrect).
Chomsky, Noam. 1961. “On the notion ‘rule of grammar’.” Proceedings of the Twelfth Symposium in Applied Mathematics, 6–24. Providence, RI: American Mathematical Society. Reprinted in The Structure of Language: Readings in the philosophy of language ed. by Jerry A. Fodor & Jerrold J. Katz, 155–210. Englewood Cliffs, NJ: Prentice-Hall.
Chomsky, Noam. 1962. “Explanatory Models in Linguistics”. Logic, Methodology and Philosophy of Science: Proceedings of the 1960 International Congress ed. by Ernest Nagel, Patrick Suppes & Alfred Tarski, 528–550. Stanford, CA: Stanford University Press.
Chomsky, Noam. 1963. “Formal Properties of Grammars”. Handbook of Mathematical Psychology, Volume II1, ed. by R. Duncan Luce, Robert R. Bush & Eugene Galanter 323–418. New York: Wiley.
Chomsky, Noam & George A. Miller. 1963. “Introduction to the Formal Analysis of Natural Languages”. eds., Handbook of Mathematical Psychology, Volume II1, ed. by R. Duncan Luce, Robert R. Bush & Eugene Galanter, 269–322. New York: Wiley.
Cormen, Thomas H., Charles E. Leiserson & Ronald L. Rivest. 2000. Introduction to Algorithms. Cambridge MA / New York: MIT Press / McGraw Hill.
Davis, Martin, ed. 1965. The Undecidable: Basic papers on undecidable propositions, unsolvable problems and computable functions. New York: Raven Press. Reissued 2004 by Dover Publications with a different version of the final paper by Post.
Davis, Martin. 1982. “Why Gödel didn’t Have Church’s Thesis”. Information and Control 54:1.3–24.
De Mol, Liesbeth. 2009. “On the Boundaries of Solvability and Unsolvability in Tag Systems: Theoretical and experimental results. The Complexity of Simple Programs 2008, number 1 in Electronic Proceedings in Theoretical Computer Science, ed. by T. Neary, D. Woods, A. K. Seda & N. Murphy, 56–66. Waterloo, NSW, Australia: Open Publishing Association. [URL].
Epstein, Richard L. & Walter A. Carnielli. 2000. Computability: Computable functions, logic, and the foundations of mathematics. Belmont, CA: Wadsworth, 2nd ed.
George, Alexander. 1989. “How not to Become Confused about Linguistics”. Reflections on Chomsky ed. by Alexander George, 90–110. Oxford: Basil Blackwell.
Gödel, Kurt. 1931. “Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme, I”. Monatshefte für Mathematik und Physik 38:1.349–360. Translated as “On Formally Undecidable Propositions of Principia Mathematica and Related Systems, I”. In van Heijenoort 19671, 596–616.
Harris, Randy Allen. 2021. The Linguistics Wars: Chomsky, Lakoff, and the battle over deep structure. New York: Oxford University Press, second ed..
Harris, Zellig S. 1951. Methods in Structural Linguistics. Chicago, IL: University of Chicago Press. Republished as Structural Linguistics, 1960. Preface dated January 1947.
Hockett, Charles F. 1954. “Two Models of Grammatical Description”. Word 10:1.210–231. Page references are to the reprinting in Joos (ed.) 19661, 386–399.
Hockett, Charles F. 1966. “Language, Mathematics and Linguistics. Current Trends in Linguistics: Volume 3, theoretical foundations, 155–304. The Hague: Mouton. Republished as a monograph by Mouton, The Hague, 1967.
Jackson, Allyn. 2018. “Emil Post: Psychological fidelity”. Inference: International Review of Science 4:2. Online at [URL]
Jakobson, Roman. 1969. “Linguistics in its Relation to Other Sciences. Proceedings of the 10th International Congress of Linguists, 75–111. Bucharest: Éditions de l’Académie de la République Socialiste de Roumanie. Page reference is to the reprinting in Jakobson’s, Selected Writings, II: Word and Language (The Hague: Mouton, 1971), 655–708.
Joseph, John E. 1990. “Ideologizing Saussure: Bloomfield’s and Chomsky’s readings of the Cours de linquistique générale”. Ideologies of Language ed. by John E. Joseph & Talbot J. Taylor, 51–78. London: Routledge.
Joshi, Aravind K. 1985. “Tree Adjoining Grammars: How much context-sensitivity is required to provide reasonable structural descriptions?” Natural Language Parsing: Psychological, Computational and Theoretical Perspectives ed. by David Dowty, Lauri Karttunen & Arnold Zwicky, 206–250. Cambridge: Cambridge University Press.
Kimball, John. 1967. “Predicates Definable over Transformational Derivations by Intersection with Regular Languages”. Information and Control 11:1–2.177–195.
Levelt, W. J. M. 1974. Formal Grammars in Linguistics and Psycholinguistics. The Hague: Mouton. 41 volumes; republished in one volume as Levelt (2008).
Markov, Andrey A. 1947. “Névozmožnost’ nékotoryh algorifmov v téorii associativnyh sistém” (‘Impossibility of certain algorithms in the theory of associative systems’). Doklady Akadémii Nauk SSSR 55:587–590. Abstracted by Andrzej Mostowski in Journal of Symbolic Logic 13:1.52–53, 1948.
Peters, P. Stanley & Robert W. Ritchie. 1971. “On Restricting the Base Component of Transformational Grammars”. Information and Control 18:5.483–501. Republished in Mathematical Systems Theory 61, 324–333, 1973.
Piattelli-Palmarini, Massimo, Juan Uriagereka & Pello Salaburu, eds. 2009. Of Minds and Language: A dialogue with Noam Chomsky in the Basque country. Oxford: Oxford University Press.
Post, Emil L. 1921. “Introduction to a General Theory of Elementary Propositions”. American Journal of Mathematics 43:3.163–185. Reprinted in van Heijenoort (19671: 264–283) and reproduced in Davis (1994b: 21–43).
Post, Emil L. 1936. “Finite Combinatory Processes — Formulation 1”. Journal of Symbolic Logic 1:3.103–105. Reproduced in Davis (1965: 288–291) and in Davis (1994b: 103–105).
Post, Emil L. 1941[1965]. “Absolutely Undecidable Problems and Relatively Undecidable Propositions — Account of an Anticipation”. Rejected by American Journal of Mathematics in 1941; posthumously published in Davis (1965: 340–433); reprinted in Davis (1994: 375–441).
Post, Emil L. 1943. “Formal Reductions of the General Combinatory Decision Problem”. American Journal of Mathematics 65:2.197–215. Reproduced in Davis (1994b: 442–460).
Post, Emil L. 1944. “Recursively Enumerable Sets of Positive Integers and their Decision Problems”. Bulletin of the American Mathematical Society 50:5.284–316. Reproduced in Davis (1965: 305–337) and in Davis (1994b: 461–494).
Post, Emil L. 1946. “A Variant of a Recursively Unsolvable Problem”. Bulletin of the American Mathematical Society 5241.264–268. Reproduced in Davis (1994b: 495–500).
Post, Emil L. 1947. “Recursive Unsolvability of a Problem of Thue”. Journal of Symbolic Logic 12:1.1–11. Reproduced in Davis (1965: 293–303) and in Davis (1994b: 503–512).
Pullum, Geoffrey K. 1989. “Prospects for Generative Grammar in the 1990s”. Proceedings of the Western Conference on Linguistics [WECOL 89], Volume 2, ed.by Frederick H. Brengelman, Vida Samiian & Wendy Wilkins, 257–276. California State University, Fresno: Department of Linguistics.
Pullum, Geoffrey K. & Barbara C. Scholz. 2001. “On the Distinction between Model-Theoretic and Generative-Enumerative Syntactic Frameworks”. Logical Aspects of Computational Linguistics: 4th International Conference, number 2099 in Lecture Notes in Artificial Intelligence, ed. by Philippe de Groote, Glyn Morrill & Christian Retoré, 17–43. Berlin / New York: Springer.
Pullum, Geoffrey K. & Barbara C. Scholz. 2005. “Contrasting Applications of Logic in Natural Language Syntactic Description”. Proceedings of the 13th International Congress of Logic, Methodology and Philosophy of Science ed. by Petr Hájek, Luis Valdés-Villanueva & Dag Westerståhl, 481–503. London: KCL Publications.
Putnam, Hilary. 1961. “Some Issues in the Theory of Grammar”. Structure of Language and Its Mathematical Aspects, number XII in Proceedings of Symposia in Applied Mathematics ed. by Roman Jakobson, 25–42. Providence, RI: American Mathematical Society.
Thue, Axel. 1914. “Probleme über Veränderungen von Zeichenreihen nach gegebenen Regeln”. Skrifter utgit av Videnskapsselskapet i Kristiana, I, number 10 in Matematisk-naturvidenskabelig klasse 1914. Oslo: Norske Videnskaps-Akademi.
Turing, Alan M. 1936. “On Computable Numbers, with an Application to the Entscheidungsproblem”. Proceedings of the London Mathematical Society Series 2, 42:1.230–265. Received 28 May 1936; read 12 November 1936. Correction published in PAMS series 2, 431.544–546, 1937.
Urquhart, Alasdair. 2009. “Emil Post”. The Handbook of the History of Logic, Volume 5 ed. by Dov Gabbay & John Woods. 617–666. Amsterdam: Elsevier.
Zwicky, Arnold M. 1963. “Grammars of Number Theory: Some examples”. Working Paper W-6671, MITRE Corporation, Bedford, MA. Online at: [URL]