Abstract
Peirce grammar is a context-free grammar with a Peirce algebra as its semantics. A Peirce algebra is a two-sorted algebra that presupposes a Boolean algebra and a relation algebra. Since Peirce algebra has an equational theory many natural language inferences can be captured in terms of equational computation. The notions of a Peirce algebra and a Peirce grammar are applied to natural language. It is shown that the meaning of anaphoric pronouns, in particular possessive, relative, reciprocal, identity, and diversity pronouns can be constructed without use of variables or generalized quantifiers.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Bloomfield, L. Language, Allen & Unwin, London, 1933.
Böttner, M. State transition semantics, Theoretical Linguistics, 18: 239–286, 1992.
Böttner, M. A collective extension of relational grammar, Logic Journal of the Interest Group in Pure and Applied Logics, 6: 175–193, 1998.
Böttner, M. Relationale Grammatik. Niemeyer, Tübingen, 1999.
Böttner, M. and W. Thümmel, editors. Variable-Free Semantics, Secolo, Osnabrück, (2000).
Brink, C. Boolean modules, Journal of Algebra, 71: 291–313, 1981.
Brink, C.,K. Britzand R. Schmidt.Peircealgebras, Formal Aspects of Computing, 6: 339–358, 1994.
Brink, C., G. Kahl and G. Schmidt, editors. Relational Methods in Computer Science, Springer, Wien, 1997.
Brink, C. and R. Schmidt. Subsumption computed algebraically, Computers and Mathematics with Applications, 23: 329–342, 1992.
Clark, H. Using Language, Cambridge University Press, Cambridge, 1996.
Dalrymple, M., M. Kanazawa, Y. Kim, S. Mchombo and S. Peters. Reciprocal expressions and the concept of reciprocity, Linguistics and Philosophy, 21: 159–210, 1998.
Jacobson, P. Bach-Peters sentences in a variable-free semantics. In P. Dekker and M. Stokhof, editors, Proceedings of the Eigth Amsterdam Colloquium. December 17-20, 1991. 283–302, ILLC, University of Amsterdam, 1992.
Jakobson, R. A few remarks on Peirce, pathfinder in the science of language. In R. Jakobson, editor, The Framework of Language, 31–38, Michigan Studies in the Humanities, 1980.
Keenan, E.L. Unreducible n-ary quantifiers in natural language. In P. Gärdenfors, editor, Generalized Quantifiers, 109–150, Reidel, Dordrecht, 1987.
Keenan, E.L. and L.M. Faltz. Boolean Semantics for Natural Language, Reidel, Dordrecht, 1985.
Link, G. Algebraic Semantics in Language and Philosophy, CSLI Press, Stanford, 1998.
Lyons, J. Natural Language and Universal Grammar, vol. I, Cambridge University Press, Cambridge, 1991.
Rich, E. Artificial Intelligence, McGraw Hill, New York, 1983.
de Rijke, M. The logic of Peirce algebras, Journal of Logic, Language and Information, 4: 227–250, 1995.
Steedman, M. Surface Structure and Interpretation, MIT Press, Cambridge, 1997.
Suppes, P. Semantics of context-free fragments of natural languages. In K.J.J. Hintikka et al., editors, Approaches to Natural Language, 370–394, Reidel, Dordrecht, 1973.
Suppes, P. Elimination of quantifiers in the semantics of natural language by use of extended relation algebras, Revue Internationale de Philosophie, 117/118: 243–259, 1976.
Suppes, P. Language for Humans and Robots. Blackwell, Oxford, 1991.
Suppes, P. and E. Macken. Steps toward a variable-free semantics of attributive adjectives, possessives, and intensifying adverbs. In K.E. Nelson, editor, Children's language, vol. 1, 81–115, Gardner Press, New York, 1978.
Suppes, P. and M. Zanotti. On using random relations to generate upper and lower probabilities, Synthese, 36: 427–440, 1977.
Tarski, A. and S. Givant. A Formalization of Set Theory without Variables. AMS Colloquium Publications 41, Providence RI, 1987.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Böttner, M. Peirce Grammar. Grammars 4, 1–19 (2001). https://doi.org/10.1023/A:1011403527615
Issue Date:
DOI: https://doi.org/10.1023/A:1011403527615