Abstract
Terms containing triple dots are defined in the framework of an ad hoc small formal language of mathematical logic. It contains some constructions that make this task possible. The constructions include variables whose subscripts are arbitrary terms of the language, quantifiers of an infinite number of variables, and shorter forms of triple-dot terms, called star terms. Introduction of the terms and constructions in a practice-oriented language may make it more convenient.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bencivenga, E.: Free logics, in D. Gabbay and F. Guenther (eds.), Handbook of Philosophical Logic, Vol. 3, Reidel, Dordrecht, 1986.
Bjørner, D. and Jones, C. B. (eds.): The Vienna Development Method, Lecture Notes in Computer Science 61, Springer-Verlag, 1978.
Farmer, W.M.: A partial function version of Church's simple theory of types, J. Symbolic Logic 55 (1990), 1269–1291.
Harrison, J.: A Mizar Mode for HOL, Lecture Notes in Computer Science 1125, Springer-Verlag, 1996.
Farmer, W.M., Guttman, J. D. and Thayer, J.: IMPS: An interactive mathematical proof system, J. Automated Reasoning 11 (1993), 213–248.
Łukaszewicz, L.: A formal language of computer related mathematics, ICS PAS Report, Warsaw, to appear.
Quine, W.: Mathematical Logic, Harvard Univ. Press, Cambridge, MA, 1955.
The RAISE Language Group: The RAISE Specification Language, Prentice-Hall, 1992.
Russell, B.: On denoting, Mind n.s. 14 (1905), 479–493.
Trybulec, A. and Blair, H. A.: Computer aided reasoning, Lecture Notes in Computer Science 193 (1985), 406–412.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
ŁUKASZEWICZ, L. Triple Dots in a Formal Language. Journal of Automated Reasoning 22, 223–239 (1999). https://doi.org/10.1023/A:1006086330571
Issue Date:
DOI: https://doi.org/10.1023/A:1006086330571