Proposition Theorems

Propositions can be simplified to make them simpler to understand. Idempotence: and . Excluded middle: and Identity: and . Strictness: and . Double negation This is easily provable: construct truth tables with rows for and . Associativity Communtativity Distributivity de Morgan There is a convention of priority among connectives, together with the associativity of and...

Truth Values & Logical Propositions

Statements Logic is one of the most fundamental aspects of computer science - reasoning. Reasoning allows us to determine whether a particular statement is true or false. A statement is a collection of symbols that has a truth value - either false (F) or true (T). Let us consider two statements: Paris is in France...