Skip to main content

Logical Seeing

  • Chapter
  • First Online:
Mathematical Logic

Part of the book series: Springer Graduate Texts in Philosophy ((SGTP,volume 4))

  • 71 Accesses

Abstract

This chapter serves as an interlude. Our goal in the following chapters is to show how tools of logic can used to uncover essential features of familiar number structures. We will be inspecting number structures with our logic glasses on, but we need to get used to wearing those glasses. In this chapter we will take a look at some easy to visualize structures—finite graphs—and we will examine them from the logical perspective. In other words, later, logic will help us to see structures; now, simple structures will help us to see logic. A concept of symmetry of a graph is introduced in Definition 2.1 followed by Theorem 2.1, which is crucial for many further developments. Both, the definition and the theorem, will be generalized later to arbitrary mathematical structures.

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

Notes

  1. 1.

    Notice the change of font. Throughout the book we will discuss various mathematical objects and for brevity we give them names, which are typically just single letters, sometimes using different fonts. There is nothing formal about those names, and choices of names are arbitrary.

  2. 2.

    The Ehrenfeucht-Fraïssé theorem gives a criterion for determining the least quantifier complexity of first-order sentences that express differences between structures. See [47, Lemma 2.4.9].

  3. 3.

    In each case, one of those symmetries is the identity transformation—nothing gets moved.

  4. 4.

    It is now necessary to include \(\lnot (x_1=x_2)\) because we do not allow loops, so this is implied by \(E(x_1,x_2)\).

  5. 5.

    Every graph has the trivial symmetry, i.e., the symmetry f such that \(f(v)=v\) for each vertex v.

References

  1. Marker, D. (2002). Model theory: An introduction.Graduate Texts in Mathematics (Vol. 217). Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2024 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

Kossak, R. (2024). Logical Seeing. In: Mathematical Logic. Springer Graduate Texts in Philosophy, vol 4. Springer, Cham. https://doi.org/10.1007/978-3-031-56215-0_2

Download citation

Publish with us

Policies and ethics