Affirmation/Validity/Tautology

Everything is always evaluated as true

• Tautology wikipedia page

For any two propositions P and Q, if Q implies P, then P is the converse implication of Q.

It may take the following forms:

1. p⊂q
2. Bpq
3. p←q

 P  |  Q  | XNq  
 _  _  _  _  _  
 0  |  0  |  0 
 0  |  1  |  0 
 1  |  0  |  1 
 1  |  1  |  0

List any sites, books, or sources utilized when researching information on this topic. (Remove any filler text).

• http://en.wikipedia.org/wiki/Converse_implication
• Reference 2
• Reference 3

Demonstration of the indicated keyword.

If you wish to aid your definition with a code sample, you can do so by using a wiki code block, an example follows:

/*
 * Sample code block
 */
#include <stdio.h>
 
int main()
{
    return(0);
}

Alternatively (or additionally), if you want to demonstrate something on the command-line, you can do so as follows:

lab46:~$ cd src
lab46:~/src$ gcc -o hello hello.c
lab46:~/src$ ./hello
Hello, World!
lab46:~/src$