Skip to main content

Models of First-Order Languages

  • Chapter
Mathematical Logic

Part of the book series: Progress in Computer Science and Applied Logic (PCS) ((PCS,volume 25))

  • 1259 Accesses

Abstract

As we mentioned in the previous chapter, terms and formulas are all symbol strings. To make use of a first-order language, the terms and formulas need to be interpreted as saying something meaningful about a domain. This semantic interpretation gives meaning to the symbol strings and is called a model of the language. In this chapter, we will build a general theory of semantics for first-order languages. The key ideas are as follows

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 69.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.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Birkhäuser Verlag AG

About this chapter

Cite this chapter

Li, W. (2010). Models of First-Order Languages. In: Mathematical Logic. Progress in Computer Science and Applied Logic (PCS), vol 25. Birkhäuser Basel. https://doi.org/10.1007/978-3-7643-9977-1_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-7643-9977-1_2

  • Publisher Name: Birkhäuser Basel

  • Print ISBN: 978-3-7643-9976-4

  • Online ISBN: 978-3-7643-9977-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics