Skip to main content

Satisfiability

  • Chapter
Combinatorial Functors

Part of the book series: Ergebnisse der Mathematik und ihrer Grenzgebiete ((MATHE2,volume 81))

  • 229 Accesses

Abstract

In this last part our aim is a strong simultaneous satisfiability criterion for relations on chain types. We make no special assumption on the categories involved other than the basic one that they arise from fully effective ℵ0-categorical models as suitable categories.

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

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Crossley, J.N., Nerode, A. (1974). Satisfiability. In: Combinatorial Functors. Ergebnisse der Mathematik und ihrer Grenzgebiete, vol 81. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85933-5_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-85933-5_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-85935-9

  • Online ISBN: 978-3-642-85933-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics