Skip to main content

The Sentential Calculus

  • Chapter
Rough Sets

Part of the book series: Advances in Soft Computing ((AINSC,volume 15))

  • 353 Accesses

Abstract

We begin with a discussion of the basic tool of mathematical reasoning: the sentential calculus (or, calculus of propositions, propositional calculus, propositional logic). By a proposition, sentence we mean any statement about reality of interest to us whose truth value can be established with certainty. By a truth value of a proposition, we understand either of two possible values: truth (T or 1), falsity (F or 0). A proposition p may be therefore either true or false and only one of the two possibilities actually holds for p. For instance, the statement “if today is Monday then tomorrow is Tuesday” is according to our best knowledge true while the statement of ordinary arithmetic “ 2+2 = 3” is false. In the sequel, we denote truth values with the symbols 0, 1.

By the very act of arguing, you awake the patient’s reason; and once it is awake, who can foresee the result?

C.S. Lewis, The Screwtape Letters, I

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.

Works quoted

  1. P. Bernays, Axiomatische Untersuchung den Aussagenkalkiils der “Principia Mathematica”, Mathematische Zeitschrift, 25 (1926).

    Google Scholar 

  2. G. Frege, Begriffsschrift, eine der mathematischen nachgebildete Formelsprache des Reinen Denkens, Halle, 1874.

    Google Scholar 

  3. G. Gentzen, Untersuchungen über das logische Schliessen. I, II., Mathematische Zeitschrift 39 (1934–5), pp. 176–210, 405–431.

    Google Scholar 

  4. J. Herbrand, Recherches sur la theôrie de la démonstration, Travaux de la Soc.Sci. Lettr. de Varsovie, III, 33 (1930), pp. 33–160.

    Google Scholar 

  5. L. Kalmár, Über die Axiomatisierbarkeit des Aussagenkalküls,Acta Scientiarum Mathematicarum, 7 (1934–5), pp.222–243.

    Google Scholar 

  6. S. Kanger, Provability in Logic,Acta Universitatis Stockholmiensis, Stockholm Studies in Philosophy I, 1957. in: Jan Łukasiewicz. Selected Works, L. Borkowski (ed.), North Holland — Polish Scientific Publishers, Amsterdam — Warsaw, 1970, pp. 197–217].

    Google Scholar 

  7. J. Łukasiewicz, On the history of the logic of propositions, in: Jan Łukasiewicz. Selected Works, L. Borowski (ed.), North Holland — Polish Scientific Publishers, Amsterdam — Warsaw, 1970, pp. 197–217].

    Google Scholar 

  8. J. Łukasiewicz, Elements of Mathematical Logic, Pergamon Press — Polish Scientific Publishers, Oxford — Warsaw, 1963.

    Google Scholar 

  9. E. Post, Introduction to a general theory of elementary propositions, Amer. J. Math., 43 (1921), 163–185.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Polkowski, L. (2002). The Sentential Calculus. In: Rough Sets. Advances in Soft Computing, vol 15. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1776-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-7908-1776-8_2

  • Publisher Name: Physica, Heidelberg

  • Print ISBN: 978-3-7908-1510-8

  • Online ISBN: 978-3-7908-1776-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics