Skip to main content
SpringerLink
Log in

Reasoning in Trees

  • Chapter
Mathematical Logic and Its Applications

Abstract

Most theories of computation start with the following:

  • a set of states S;

  • the initial states I — a subset of S;

  • the terminal states τ — a subset of S;

  • a set of moves M — mapping S in S.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Archimedes. “The Sandreckoner”.

    Google Scholar 

  2. W. F. Clocksin and C. S. Mellish, “Programming in Prolog”, Springer Verlag (1981).

    Google Scholar 

  3. H. Friedmann, S. Simpson and S. Smith, Countable algebras and set existence axioms, Annals of Pure & App. Logic (1983).

    Google Scholar 

  4. G. Gentzen, Untersuchungen über das logische Schliessen, Mathematische Zeitschrift. 39:176–210, 405–431 (1935).

    Article  MathSciNet  Google Scholar 

  5. J-Y. Girard, II<Stack><Subscript>2</Subscript><Superscript>1</Superscript></Stack>-logic, Part I: Dilators, Annals of Math. Logic, vol. 21:75–219 (1981).

    Google Scholar 

  6. J-Y. Girard, The Ω-Rule. Proceedings International Congress of Mathematicians, Warszawa (1983).

    Google Scholar 

  7. J-Y. Girard and J. P. Ressayre, Elements de logique Π<Stack><Subscript>n</Subscript><Superscript>1</Superscript></Stack> Proceedings of the AMS Symposium on Recursion Theory, Cornell (1982).

    Google Scholar 

  8. K. Gödel, Ueber eine bisher noch nicht benützte Erweiterung des finiten Standpunktes, Dialectica, 12:280–287 (1958).

    Article  MathSciNet  MATH  Google Scholar 

  9. H. R. Jervell, Introducing Π<Stack><Subscript>2</Subscript><Superscript>1</Superscript></Stack>-logic. Proceedings from a Symposium in Oslo. To appear in Springer Lecture Notes.

    Google Scholar 

  10. H. R. Jervell, Π<Stack><Subscript>n</Subscript><Superscript>1</Superscript></Stack>-completeness. Proceedings from a Symposium in Oslo. To appear in Springer Lecture Notes.

    Google Scholar 

  11. A. Mostowski, Formal systems of analysis based on an infinistic rule, in: “Infinitistic Methods”, Warszawa (1960).

    Google Scholar 

  12. D. Prawitz, Mekanisk bevisföring i predikatkalkylen, Uppsats för seminariet i teoretisk filosofi (mimeographed), Stockholm (1957).

    Google Scholar 

  13. J. A. Robinson, Theorem-Proving on the Computer, J. Assoc. for Computing Machinery, Vol. 10, No. 2, April (1963).

    Google Scholar 

  14. A. M. Turing, On Computable Numbers, with an Application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, Ser. 2, Vol. 42:230–265 (1936–1937);

    Article  Google Scholar 

  15. A. M. Turing, On Computable Numbers, with an Application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, Ser. 2, Vol. 43:544–546 (1937).

    Article  Google Scholar 

  16. H. Wang, Proving theorems by pattern recognition: I, Communications of the Assoc. Computing Machinery, Vol. 3, No. 4, April (1960). (“H. Wang” should be “W. Hao”.)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Inst. of Informatics, University of Oslo, Box 1080, Blindern, 0316, Oslo 3, Norway

    Herman Ruge Jervell

Authors
  1. Herman Ruge Jervell
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Sofia University, Sofia, Bulgaria

    Dimiter G. Skordev

  2. Sector of Mathematical Logic, Faculty of Math. & Mech., boul. Anton Ivanov 5, Sofia, 1126, Bulgaria

    Dimiter G. Skordev

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Plenum Press, New York

About this chapter

Cite this chapter

Jervell, H.R. (1987). Reasoning in Trees. In: Skordev, D.G. (eds) Mathematical Logic and Its Applications. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0897-3_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-0897-3_8

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4612-8234-1

  • Online ISBN: 978-1-4613-0897-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation