Hostname: page-component-669899f699-rg895 Total loading time: 0 Render date: 2025-04-27T08:10:21.105Z Has data issue: false hasContentIssue false
  • English
  • Français

Circumscription within monotonic inferences

Published online by Cambridge University Press:  12 March 2014

E. G. K. López-Escobar
E. G. K. López-Escobar*
Affiliation:
Mathematics Department/Institute for Advanced Computer Studies, University of Maryland, College Park, Maryland 20742
Get access Rights & Permissions [Opens in a new window]

Abstract

A conservative extension of first order logic, suitable for circumscriptive inference, is introduced.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 53 , Issue 3 , September 1988 , pp. 888 - 904
Copyright
Copyright © Association for Symbolic Logic 1988

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

REFERENCES

[MC]McCarthy, John, Circumscription—a form of nonmonotonic reasoning, Artificial Intelligence, vol. 13(1980), pp. 27–39.CrossRefGoogle Scholar
[MD]Davis, Martin, The mathematics of non-monotonic reasoning, Artificial Intelligence, vol. 13 (1980), pp. 73–80.CrossRefGoogle Scholar
[M-P]Minker, Jack and Perlis, Don, Completeness results for circumscription, Artificial Intelligence, vol. 28 (1986), pp. 29–42.Google Scholar
[P 1]Prawitz, Dag, Natural deduction. A proof theoretical study, Almqvist & Wiksell, Stockholm, 1965.Google Scholar
[P 2]Prawitz, Dag, Ideas and results in proof theory, Proceedings of the second Scandinavian logic symposium (Oslo, 1970), North-Holland, Amsterdam, 1971, pp. 235–307.CrossRefGoogle Scholar
[Ta]Tait, W. W., Applications of the cut elimination theorem to some subsystems of classical analysis, Intuitionism and proof theory (proceedings, Buffalo, New York, 1968), North-Holland, Amsterdam, 1970, pp. 475–488.CrossRefGoogle Scholar
[T]Troelstra, A. S., Normalization theorems for systems of natural deduction, Metamathematical investigation of intuitionistic arithmetic and analysis, Lecture Notes in Mathematics, vol. 344, Springer-Verlag, Berlin, 1973, pp. 275–323.CrossRefGoogle Scholar