Skip to main content

Theorems for Negation, Conjunction and Disjunction

  • Chapter
Book cover Axiomatic Formal Ontology

Part of the book series: Synthese Library ((SYLI,volume 264))

  • 210 Accesses

Abstract

Negation, conjunction and disjunction (as the defined expressions “neg”, “conj” and “disj” are to be read, given that the universe of discourse consists precisely of all states of affairs) are Boolean functional terms; for we can prove:

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.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

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Meixner, U. (1997). Theorems for Negation, Conjunction and Disjunction. In: Axiomatic Formal Ontology. Synthese Library, vol 264. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-8867-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-94-015-8867-6_9

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-4898-1

  • Online ISBN: 978-94-015-8867-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics