Skip to main content

Semantics of First-Order Languages

  • Chapter
Mathematical Logic

Part of the book series: Undergraduate Texts in Mathematics ((UTM))

  • 2915 Accesses

Abstract

Let R be a binary relation symbol. The {R}-formula

(1) ∀v 0 R v 0 v 0

is, at present, merely a string of symbols to which no meaning is attached. The situation changes if we specify a domain for the variable v 0 and if we interpret the binary relation symbol R as a binary relation over this domain. There are, of course, many possible choices for such a domain and relation.

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
Hardcover Book
USD 79.95
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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer Science+Business Media New York

About this chapter

Cite this chapter

Ebbinghaus, HD., Flum, J., Thomas, W. (1994). Semantics of First-Order Languages. In: Mathematical Logic. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-2355-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-2355-7_3

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4757-2357-1

  • Online ISBN: 978-1-4757-2355-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics