Skip to main content
SpringerLink
Log in

Introduction: Prerequisites

  • Chapter
  • First Online:
Logic: Reference Book for Computer Scientists

Part of the book series: Intelligent Systems Reference Library ((ISRL,volume 245))

  • 105 Accesses

Abstract

In this chapter, we collect basic information on set theory, rewriting systems, computability, complexity, algebraic structures, topological structures, which will serve us in what follows as references.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Knaster, B., Tarski, A.: Un théorème sur fonctions d’ensembles. Ann. Soc. Polon. Math. 6, 133–4 (1928)

    MATH  Google Scholar 

  2. Zermelo, E.: Beweis dass jede Menge wohlgeordnet werden kann. Math. Ann. 59, 514–516 (1904)

    Article  MathSciNet  MATH  Google Scholar 

  3. Zorn, M.: A remark on method in transfinite algebra. Bull. Am. Math. Soc. 41, 667–670 (1915)

    Article  MathSciNet  MATH  Google Scholar 

  4. Kuratowski, C.: Une méthode d’ élimination des nombres transfinis des raisonnement mathématiques. Fund. Math. 3, 89 (1922)

    Article  Google Scholar 

  5. Hausdorff, F.: Grundz\(\ddot{u}\)ge der Mengenlehre, Leipzig (1914)

    Google Scholar 

  6. Tukey, J.: Convergence and uniformity in topology. Ann. Math. Stud. 2 (1940)

    Google Scholar 

  7. Kelley, J.L.: General Topology. Springer, New York (1991). (reprint of Van Nostrand (1955))

    Google Scholar 

  8. König, D.: Über eine Schlussweise aus dem Endlichen ins Unendliche. Acta Litt. ac.sci.Hung. Fran. Josephinae, Sect. Sci. Math. 3, 121–130 (2927)

    Google Scholar 

  9. Ramsey, F.P.: On a problem of formal logic. Proc. Lond. Math. Soc. 30, 264–286 (1930). (2nd. ser.)

    Google Scholar 

  10. Salomaa, A.: Formal Languages. Academic Press, New York (1973)

    MATH  Google Scholar 

  11. Büchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik und Grundl. Math. 6, 66–92 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  12. Landweber, C.H.: Decision problems for \(\omega \)-automata. Math. Syst. Theory 3, 376–385 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  13. Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc. 2(42), 230–265 (1937)

    Article  MathSciNet  MATH  Google Scholar 

  14. Davis, M.: Computability and Unsolvability. McGraw-Hill Book Co., New York (1958)

    MATH  Google Scholar 

  15. Radó, T.: On non-computable function. Bell Syst. Tech. J. 41(3), 877–884 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  16. Aaronson, S.: The BB frontier. www.scottaaronson.com//papers//bb.pdf

  17. Kropitz, P.: Busy Beaver problem. B.Sc Thesis. University Karlova, Prague (2011). https://is.cuni.cz//webappa//zzp//detail//49210

    Google Scholar 

  18. Yedidia, A., Aaronson, S.: A relatively small Turing machine whose behavior is independent of set theory. Complex Syst. 25(4) (2016)

    Google Scholar 

  19. Kleene, S.C.: Recursive predicates and quantifiers. Trans. Am. Math. Soc. 53, 41–73 (1943)

    Article  MathSciNet  MATH  Google Scholar 

  20. Kleene, S.C.: Introduction to Metamathematics. Van Nostrand, Princeton NJ (1952)

    MATH  Google Scholar 

  21. Rozenberg, G., Salomaa,A.: Cornerstones of Undecidability. Prentice Hall (1994)

    Google Scholar 

  22. Gödel, K.: Über formal unentscheidbare Sätze der Principia Mathematica und Verwandter Systeme 1. Monatshefte für Mathematik und Physics 38, 173–188 (1931)

    Article  MATH  Google Scholar 

  23. Tarski, A.: Der Wahrheitsbegriff in den formalisierten Sprachen, Studia Philos. 1, 261–405 (1936). (also in Eng. transl.: Logic, Semantics, Metamathematics. Oxford University Press, New York (1956))

    Google Scholar 

  24. Smullyan, R.M.: Gödel’s Incompleteness Theorems. Oxford Logic Guides. Oxford University Press, New York-Oxford (1992)

    Book  MATH  Google Scholar 

  25. Bachmann, P.: Zahlentheorie. Zweiter Teil: Die Analytische Zahlentheorie. Teubner, Leipzig (1894)

    Google Scholar 

  26. Cook, S.A.: The complexity of theorem proving procedures. In: Proceedings of 3rd Annual ACM Symposium on Theory of Computing, pp. 151–158. ACM (1971)

    Google Scholar 

  27. Levin, A.: Universal sequential search problems. Problems Inf. Transm. 9 (1973)

    Google Scholar 

  28. Stockmeyer, L., Meyer, A.R.: Word problems requiring exponential time. In: STOC, pp. 1–9. ACM (1973)

    Google Scholar 

  29. Arora, S., Barak, B.: Computational Complexity. Cambridge University Press, Cambridge UK (2009)

    Book  MATH  Google Scholar 

  30. Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4, 177–19 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  31. Papadimitriou, C.: Computational Complexity, 2nd edn. Longman, Reading MA (1995)

    MATH  Google Scholar 

  32. Meyer, A.R., Stockmeyer, L.: The equivalence problem for regular expressions with squaring requires exponential time. In: FOCS, pp. 125–129. IEEE (1972)

    Google Scholar 

  33. Rasiowa, H., Sikorski, R.: The Mathematics of Metamathematics. PWN-Polish Scientific Publishers, Warszawa (1963)

    MATH  Google Scholar 

  34. Stone, M.H.: The theory of representations for Boolean algebras. Trans. Am. Math. Soc. 40, 37–111 (1936)

    MathSciNet  MATH  Google Scholar 

  35. Tychonoff, A.: Über die topologische Erweiterung von Räumen. Math. Ann. 102, 544–561 (1929)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Informatics, University of Warmia and Mazury, Olsztyn, Poland

    Lech T. Polkowski

Authors
  1. Lech T. Polkowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lech T. Polkowski .

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Polkowski, L.T. (2023). Introduction: Prerequisites. In: Logic: Reference Book for Computer Scientists. Intelligent Systems Reference Library, vol 245. Springer, Cham. https://doi.org/10.1007/978-3-031-42034-4_1

Download citation

Publish with us

Policies and ethics

Search

Navigation