Skip to Main Content
Computational Thinking for the Modern Problem Solver
book

Computational Thinking for the Modern Problem Solver

by David Riley, Kenny A. Hunt
March 2014
Beginner to intermediate content levelBeginner to intermediate
405 pages
12h 16m
English
Chapman and Hall/CRC
Content preview from Computational Thinking for the Modern Problem Solver
Logic   ◾     77  
to be a contradiction. Since a tautology is always True, a tautology can be
understood as simply a long-winded way of expressing something that is
self-evident. Of course, a contradiction can be understood as a statement
that is always logically invalid no matter how you look at it. Tautologies
and contradictions should be avoided when writing propositions and they
should also be avoided in the normal course of human conversations since
such statements do not express any sort of productive line of reasoning. e
following propositions give examples of a tautology and a contradiction.
Tautology: P or not P
Contradiction: P a
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

From Computing to Computational Thinking

From Computing to Computational Thinking

Paul S. Wang

Publisher Resources

ISBN: 9781466587793