Skip to main content

Variation in the Deduction Search Tactics in Sequential Calculi

  • Chapter
Studies in Constructive Mathematics and Mathematical Logic

Part of the book series: Seminars in Mathematics ((SM,volume 4))

Abstract

Formulas from the considered calculi are constructed by the customary method from free and bound subject variables, functional and predicate symbols by using the logical connectives &, V, ˥,⊃,∀,Ǝ. Expressions of the form Γ→∆, where Γ and ∆ are arbitrary lists of symbols, are called sequents. Terms are constructed by the usual method from free variables by utilizing functional symbols. Expressions which may be obtained from terms (formulas) by replacing some number (possibly zero) of entries of free variables by entries of bound variables, will be called quasi-terms (or quasi- formulas).

The main results of the present note were presented to the Leningrad Seminar on Mathematical Logic on December 29, 1966

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature Cited

  1. Kanger, S., “A simplified proof method for elementary logic,” in: Computer Programming and Formal Systems, Amsterdam, 1963, pp. 87–94.

    Chapter  Google Scholar 

  2. Godel, K., “Uber eine bisher noch nicht benützte Erweiterung des finiten Standpunktes,” Dialectica, 12(3–4):280–287 (1958).

    Article  Google Scholar 

  3. Hilbert, D. and Bernays, P., Grundlagen der Mathematik, Vol. 2, Berlin, 1939.

    Google Scholar 

  4. Beth, E. W., The Foundations of Mathematics, Amsterdam, 1959.

    Google Scholar 

  5. Lifshits, V. A., “Normal form for deductions in predicate calculus with equality and fimctional symbols,” this volume, p. 21.

    Google Scholar 

  6. Kleene, S. C., “Permutability of inferences in Gentzen’s calculi LK and LJ,” Mem. Am. Math. Soc., No. 10, pp. 1–26 (1952).

    Google Scholar 

  7. Kripke, S. A., “Semantical analysis of intuitionistic logic. I,” in: Formal Systems and Recursive Functions, Amsterdam, 1965, pp. 92–130.

    Chapter  Google Scholar 

  8. Maslov, S. Yu., “Invertible sequential variant of constructive predicate calculus,” this volume, p. 36.

    Google Scholar 

Download references

Authors

Editor information

A. O. Slisenko

Rights and permissions

Reprints and permissions

Copyright information

© 1969 Consultants Bureau

About this chapter

Cite this chapter

Mints, G.E. (1969). Variation in the Deduction Search Tactics in Sequential Calculi. In: Slisenko, A.O. (eds) Studies in Constructive Mathematics and Mathematical Logic. Seminars in Mathematics, vol 4. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-8968-2_13

Download citation

  • DOI: https://doi.org/10.1007/978-1-4684-8968-2_13

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4684-8970-5

  • Online ISBN: 978-1-4684-8968-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics