Abstract
We construct equivalent “localized” versions of a formula, adding assumptions simultaneously to various locations, where the particular location determines what is added. Inference rules that take advantage of localized formulas are presented for sequent calculi in which the left hand side of sequents can be used to accumulate the background assumptions (or “contexts”) of assertions. The intended application is to the automatic generation of tractable justifying lemmas for substitution operations for interactive proof development systems, especially those concerned with mathematical topics where manipulation of deeply embedded terms is desirable.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bell, J. and Machover, M., A Course in Mathematical Logic, North-Holland, New York, N.Y. (1977).
deBruijn, N. J., ‘The mathematical language AUTOMATH, its usage, and some of its extensions’, in Symposium on Automatic Demonstration, Lecture Notes in Mathematics, vol. 125, Springer-Verlag, Berlin (1970).
Robinson, J. A., Logic: Form and Function, Artificial Intelligence Series, North-Holland, New York, N.Y. (1979).
Schoenfield, J., Mathematical Logic, Addison-Wesley, Reading, Mass. (1967).
Schutte, K., Proof Theory, trans. J. N. Crossley, Springer-Verlag, Berlin (1977).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Monk, L.G. Inference rules using local contexts. J Autom Reasoning 4, 445–462 (1988). https://doi.org/10.1007/BF00297249
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00297249