Skip to main content

Logic-Based Models of Computation

  • Chapter
Models of Computation

Part of the book series: Undergraduate Topics in Computer Science ((UTICS))

  • 2500 Accesses

During the late 1920s, Jacques Herbrand, a young mathematician, developed a method to check the validity of a class of first-order logic formulas. In his thesis, published in 1931, Herbrand discussed what can be considered the first unification procedure. Unification is at the heart of modern implementations of logic programming languages

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.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.

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Maribel Fernández or Maribel Fernández .

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag London Limited

About this chapter

Cite this chapter

Fernández, M. (2009). Logic-Based Models of Computation. In: Models of Computation. Undergraduate Topics in Computer Science. Springer, London. https://doi.org/10.1007/978-1-84882-434-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-84882-434-8_5

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84882-433-1

  • Online ISBN: 978-1-84882-434-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics