Skip to main content
Log in

Induction in linear logic

  • Published:
International Journal of Theoretical Physics Aims and scope Submit manuscript

Abstract

Linear logic, introduced by Girardet al., has a great power of expression, but no method for induction. This paper proposes a method of induction using knowledge represented by linear logical formulas. In linear logic, the number of propositions is controlled by logical operators. When a background theory and a hypothesis prove an example, the number of propositions on each side must be equivalent.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Deville, Y., and Lau, K.-K. (1994). Logic program synthesis,Journal of Logic Programming,19–20, 321–350.

    Article  MathSciNet  Google Scholar 

  • Filinski, A. (1992). Linear continuations, inConference Record of the Nineteenth Annual Symposium on Principles of Programming Languages, ACM Press, pp. 27–38.

  • Genesereth, M. R., and Nilsson, N. J. (1987).Logical Foundations of Artificial Intelligence, Morgan Kaufmann Publishers.

  • Girard, J.-Y., Lafont, Y., and Regnier, L. (1995).Advances in Linear Logic, Cambridge University Press, Cambridge.

    Google Scholar 

  • Muggleton, S., and De Raedt, L. (1994). Inductive logic programming: Theory and methods,Journal of Logic Programming,19–20, 629–679.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yamaguchi, F., Nakanishi, M. Induction in linear logic. Int J Theor Phys 35, 2107–2116 (1996). https://doi.org/10.1007/BF02302230

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02302230

Keywords

Navigation