<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://www.conservapedia.com/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=StevenK</id>
	<title>Conservapedia - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://www.conservapedia.com/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=StevenK"/>
	<link rel="alternate" type="text/html" href="https://www.conservapedia.com/Special:Contributions/StevenK"/>
	<updated>2026-11-19T05:49:23Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.35.14</generator>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Talk:Formal_logic&amp;diff=588765</id>
		<title>Talk:Formal logic</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Talk:Formal_logic&amp;diff=588765"/>
		<updated>2008-12-17T04:06:03Z</updated>

		<summary type="html">&lt;p&gt;StevenK: /* Symbolic vs. Categorical Logic */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;==Symbolic vs. Categorical Logic==&lt;br /&gt;
&lt;br /&gt;
The first bit contains examples (ill-formed ones, at that!) of ''categorical'' logic, or the Aristotelian Syllogistic, not what these days is called ''symbolic'' logic, or the Propositional Calculus.  Do we want to split the article, or should I just replace the bad examples with relevant ones?&lt;br /&gt;
&lt;br /&gt;
:Split it, please! --[[User:Ed Poor|Ed Poor]] &amp;lt;sup&amp;gt;[[User talk:Ed Poor|Talk]]&amp;lt;/sup&amp;gt; 21:54, 15 December 2008 (EST)&lt;br /&gt;
&lt;br /&gt;
::Ed, I'm going to be out of town for a few days, but I'll work as I have time.  Obviously this project intersects with the [[Logic]] article, too, so I'll be making changes there as well. [[User:StevenK|StevenK]] 23:06, 16 December 2008 (EST)&lt;/div&gt;</summary>
		<author><name>StevenK</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Talk:Formal_logic&amp;diff=583390</id>
		<title>Talk:Formal logic</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Talk:Formal_logic&amp;diff=583390"/>
		<updated>2008-12-11T01:25:21Z</updated>

		<summary type="html">&lt;p&gt;StevenK: Question: how to proceed?&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;==Symbolic vs. Categorical Logic==&lt;br /&gt;
&lt;br /&gt;
The first bit contains examples (ill-formed ones, at that!) of ''categorical'' logic, or the Aristotelian Syllogistic, not what these days is called ''symbolic'' logic, or the Propositional Calculus.  Do we want to split the article, or should I just replace the bad examples with relevant ones?&lt;/div&gt;</summary>
		<author><name>StevenK</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Formal_logic&amp;diff=583388</id>
		<title>Formal logic</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Formal_logic&amp;diff=583388"/>
		<updated>2008-12-11T01:23:03Z</updated>

		<summary type="html">&lt;p&gt;StevenK: /* Rules of inference */ add a couple, label rules&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;'''Formal logic''' (or '''symbolic logic''') is the Western Civilization's system of reasoning. It is used in law, religion, science, and mathematics.&lt;br /&gt;
&lt;br /&gt;
Logic is used in proofs. For example, given that&lt;br /&gt;
&lt;br /&gt;
#All men are mortal; and,&lt;br /&gt;
#Socrates is a man;&lt;br /&gt;
&lt;br /&gt;
we can deduce (and ''prove'') that&lt;br /&gt;
#Socrates is mortal.&lt;br /&gt;
&lt;br /&gt;
Using one of the same premises, we can prove that [[Lucifer]] is not a man:&lt;br /&gt;
&lt;br /&gt;
#Lucifer is immortal (i.e., not mortal)&lt;br /&gt;
#Whoever is not mortal, is not a man.&lt;br /&gt;
#Hence, Lucifer is not a man.&lt;br /&gt;
&lt;br /&gt;
The key element here is the inference from ''All men are mortal'' to ''whoever is not mortal is not a man'' (see [[Syllogism]]s)&lt;br /&gt;
&lt;br /&gt;
==Rules of inference==&lt;br /&gt;
Modus Ponens:&lt;br /&gt;
#If A, then B.&lt;br /&gt;
#A&lt;br /&gt;
#Therefore, B.&lt;br /&gt;
&lt;br /&gt;
Modus Tollens:&lt;br /&gt;
#If A, then B.&lt;br /&gt;
#Not B&lt;br /&gt;
#Therefore, not A.&lt;br /&gt;
&lt;br /&gt;
Disjunctive Syllogism:&lt;br /&gt;
#A or B&lt;br /&gt;
#Not A&lt;br /&gt;
#Therefore, B&lt;br /&gt;
&lt;br /&gt;
Hypothetical Syllogism (or Chain Argument):&lt;br /&gt;
#If A, then B&lt;br /&gt;
#If B, then C&lt;br /&gt;
#Therefore, if A, then C&lt;br /&gt;
[[category:logic]]&lt;/div&gt;</summary>
		<author><name>StevenK</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Talk:Free_will&amp;diff=583168</id>
		<title>Talk:Free will</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Talk:Free_will&amp;diff=583168"/>
		<updated>2008-12-10T18:41:51Z</updated>

		<summary type="html">&lt;p&gt;StevenK: /* Section on morality */ reply to Ed&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;It is a logical inconsistancy to claim that foreknowledge of an individual's actions allows that individual to possess free will.  If the will is known, it is not free.  If the will is free, it cannot be known.&lt;br /&gt;
&lt;br /&gt;
Thus, if a deity has foreknowledge of an individual's actions, then that deity has denied the individual's free will.&lt;br /&gt;
&lt;br /&gt;
If an individual's will is genuinely free, then any claim that a deity can have prior knowledge of an individual's actions is false.&lt;br /&gt;
&lt;br /&gt;
''Free will'' and ''an omniscient deity'' are mutually exclusive.  If either is encompassed by a theologically honest position, the other must be denied.  --[[User:OmnusErudito|OmnusErudito]] 14:24, 14 March 2007 (EDT)&lt;br /&gt;
&lt;br /&gt;
:This argument assumes that the future is capable of being the subject of knowledge (a fairly widely held assumption, but one I, and many other philosophers, reject).  That is, it assumes that a statement about the future is true or false, rather than indeterminate.  If the future is indeterminate then an omniscient deity would be able to know all that is knowable and still not know what I am going to do in the future.  Of course, this position raises problems with respect to prophesy and that may be a problem for some theists (but not necessarily for all theists if they reject prophesy or if they view prophesy as a promise of what God intends to do in the future).  So, while you are right, free will and the common understanding of an omniscient deity are at odds, free will and an omniscient deity are not necessarily at odds.--[[User:Reginod|Reginod]] 15:34, 14 March 2007 (EDT)&lt;br /&gt;
&lt;br /&gt;
::Knowing all possible outcomes does not make a being omniscient - I know all possible outcomes of a dice-roll, but I am not omniscient.  Given time and inclination, I could work out all possible results to a general election, but I will still not be omniscient.  No matter how complex a system, no matter how many possible outcomes exist in potentia, knowing all the possibilities does not make a being omniscient, merely clever.  Omniscience would require that the being know ''which'' of the possible outcomes will occur, bringing us right back to my original point. (I like your rewrite of the article, by the way)--[[User:OmnusErudito|OmnusErudito]] 14:28, 15 March 2007 (EDT)&lt;br /&gt;
&lt;br /&gt;
:::I'm sorry if I wasn't clear.  My point was simply that it could be the case that the future is not something that is knowable--at all--so even an all knowing entity (one that knows everything that is knowable) would not know the future.  Such an entity would know all the posable outcomes (just as we know what results a dice-roll may have), but it would not know the future.  this assumes a non-static future (which is an understanding of the nature of the future that is more compatible with free will than a static, even if unknown, future).  This would mean an all knowing God would still not know the future--so God's foreknowledge would not be in conflict with free will.    I'm not saying it is the right answer, I'm not sure what the right answer is, but it is one way to make free will and the existence of an all knowing being compatible.&lt;br /&gt;
:::Thank you for the compliment on the edit, I'm of the opinion that it is better to note where the debate is than pretend knowledge of the truth.--[[User:Reginod|Reginod]] 14:50, 15 March 2007 (EDT)--[[User:Reginod|Reginod]] 14:50, 15 March 2007 (EDT)&lt;br /&gt;
::::That is much clearer, and a response needs much more thought on my part, not something I will have time to do for at least a week or two.--[[User:OmnusErudito|OmnusErudito]] 14:56, 15 March 2007 (EDT)&lt;br /&gt;
:::::No hurry, I have this page on my watchlist so when you get a chance to respond I will see it.--[[User:Reginod|Reginod]] 14:59, 15 March 2007 (EDT)&lt;br /&gt;
&lt;br /&gt;
==Angels and animals==&lt;br /&gt;
&lt;br /&gt;
Removed:&lt;br /&gt;
*&amp;lt;s&amp;gt;Within a totally naturalistic system, freewill does not exist.&amp;lt;/s&amp;gt;&lt;br /&gt;
*In the Christian faith it is believed that humans were created with freewill so that they would chose to worship God, &amp;lt;s&amp;gt;unlike angels who were created without the choice to worship God&amp;lt;/s&amp;gt;. &lt;br /&gt;
&lt;br /&gt;
#I don't understand the reference to [[naturalism]]. Are you saying that '''your''' actions are all determined by physical law, L.T.?&lt;br /&gt;
#Which denomination says that angels are incapable of making choices? Haven't you read Jude 1:6-7? (It mentions angels who sinned, and sin is a [[choice]].) --[[User:Ed Poor|Ed Poor]] &amp;lt;sup&amp;gt;[[User talk:Ed Poor|Talk]]&amp;lt;/sup&amp;gt; 14:33, 27 July 2007 (EDT)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Section on morality==&lt;br /&gt;
This article on free will seems quite brief so I've added a section here. It's not fantastically well written and it's a bit waffly but hopefully it'll do until it can be expanded, either by my or another person.[[User:Sam99foster|Sam99foster]] 10:51, 14 September 2008 (EDT)&lt;br /&gt;
: I like the first sentence, bu I find the rest confusing.  It seems to be starting with the assumption that determinism is the opposite of free will, then redefines free will to be determinism!  This means that it's not actually the opposite after all, but simply another name for the same thing.  [[User:Philip J. Rayment|Philip J. Rayment]] 11:03, 14 September 2008 (EDT)&lt;br /&gt;
:: Yeah sorry, I should've made that clearer but I hoped I could leave it a little implicit. Essentially Hume draws a distinction between two kinds of freedom - freedom of action and freedom of will. The former is the freedom to do as you choose (i.e. it would be compromised if you were in jail or tied up or something), and the latter is the freedom to determine your own will. Hume says that confusion between these two terms is at the root of many discussions of free will, since often people use free will to mean the latter thing when in reality it doesn't make much sense - either things are determined or they are random (because of cause and effect). Is that at all clear? --[[User:Sam99foster|Sam99foster]] 11:58, 14 September 2008 (EDT)&lt;br /&gt;
::Re-reading myself I really don't think it is. When people talk about lack of free will negating morality, they mean lack of freedom of will (as opposed to of action). Hume says that lack of freedom of will results in randomness, because thought processes are subject to the same laws of cause and effect as any other event. So an apple falling is caused by gravity or something else, and if its caused by nothing then the occurrence must be random; and the same with decisions, which are caused by a variety of external stimuli.--[[User:Sam99foster|Sam99foster]] 12:03, 14 September 2008 (EDT)&lt;br /&gt;
&lt;br /&gt;
:::Your addition and your writing here are not necessarily clear.  If you wish to break up the article into two sections, then do so showing clearly that Hume is using his own definition of free will to make his point.  In the absense of free will it is obvious that there is no blame for actions as free will would be a necessary precursor for free action.  You also seem to be confused that lack of free will does not equal random.  Indeed much of what occurs is structured and orderly; there is just no will involved.  In nature an apple falling from a tree does so due to gravity - and will do so each and every time unless some other outside stimulus intervenes.  The apple has no free action to suddenly fall up, nor does it have a free will to consider that.  It reacts based upon the bio-chemical nature of its makeup.  Humans are no different when considered from this same naturalistic setting. [[User:Learn together|Learn together]] 15:35, 15 September 2008 (EDT)&lt;br /&gt;
&lt;br /&gt;
::::I agree that my writing is not clear. I'm afraid you misunderstand me entirely. What I mean by 'freedom of will' above is the idea that people can engage in thought which is essentially ''uncaused'', since if thought has a cause (like the apple falling from the tree) it's not 'free', in the same way the apple is not 'free' to fall upwards. Hume points out that logically if thoughts are uncaused then they must be random, which is obviously a problem for libertarians. This is sometimes referred to as the 'randomness problem'.&lt;br /&gt;
&lt;br /&gt;
::::Anyway I agree that my contribution is lacking as it is, and when I have a bit of free time on my hands I'll re-write it substantially. Thanks for the feedback.--[[User:Sam99foster|Sam99foster]] 16:31, 17 September 2008 (EDT)&lt;br /&gt;
&lt;br /&gt;
::::: I'm questioning (your explanation of) Hume's view, rather than the content of the article, but without understanding the view better, I'm limited in how much I can do to fix the wording.&lt;br /&gt;
::::: By way of analogy, diseases can be (a) genetic/hereditary, (b) non-genetic/non-hereditary, or (c) genetically-''influenced'', but not genetically-''determined''.  Hume's argument seems to be that if it's not &amp;quot;caused&amp;quot; (determined), it is ''uncaused'' (random).  But what about the will being ''influenced'' by causes, but not ''determined'' by them?  This would make it non-random.&lt;br /&gt;
::::: Further, Hume's argument appears to be materialistic, i.e. not allowing for a non-materialistic, or perhaps ''spiritual'' component.&lt;br /&gt;
::::: Comments?&lt;br /&gt;
::::: [[User:Philip J. Rayment|Philip J. Rayment]] 22:49, 17 September 2008 (EDT)&lt;br /&gt;
&lt;br /&gt;
::::::With regard to causation - there's no logical reason that things could not be only ''influenced'' by causes rather than entirely determined by them. However, you are left having to explain what it is providing the rest of the event (the part of the disease which is not genetically influenced). If it's randomness, then you are still left with the determined/random problem. If it is some third possibility, you would have to explain what this could be and how it would work.&lt;br /&gt;
::::::I think it's correct to say that Hume's approach is materialistic, although on a logical rather than ideological basis. What form would a 'spiritual component' take?&lt;br /&gt;
::::::Thanks by the way for the reply and for the continued discussion - it helps to sort out exactly what my arguments are to have them questioned coherently like that.--[[User:Sam99foster|Sam99foster]] 08:38, 19 September 2008 (EDT)&lt;br /&gt;
::::::P.S. I am not completely positive what Hume's precise rebuttal would be to your arguments, I'm just putting forward my view since I agree with Hume. I am however reasonably confident that I've expressed his view accurately.&lt;br /&gt;
&lt;br /&gt;
:::::::I think you need to rewrite your section soon.  I'm uncomfortable with having an article that currently reads in a form that is misleading and/or confusing.&lt;br /&gt;
&lt;br /&gt;
:::::::The difficulty that Hume faced, and those since his time, is how to allow for free will in a totally naturalistic system.  I find they often take the conclusion (we have free will) and try to force it backwards to fit in a way that presumes it must fit when it doesn't.  It is also common today for naturalists to simply state that we have no free will, a positition that is certainly more sound based on the naturalistic evidence, but doesn't appear to match what we see in reality.  Hume also had the advantage of ignorance, having only the barest knowledge of the naturalistic system that has been fleshed out in much greater detail today.  One can speculate a role for 'randomness' back then that just isn't seen in our knowledge of naturalistic functions today. [[User:Learn together|Learn together]] 12:54, 19 September 2008 (EDT)&lt;br /&gt;
&lt;br /&gt;
(unindent) I'm jumping in here, because Hume seems to have said that either our decisions - such as mine just now to take issue with the way the article is going - are either (1) caused by external stimuli or (2) completely random. But this is the fallacy of the [[excluded middle]]. No one '''causes''' me to decide a certain way. Between stimulus and response there is plenty of time for me to exercise [[agency (philosophy)]], i.e., to &amp;quot;[[Be proactive]]&amp;quot; as Stephen Covey would say. &lt;br /&gt;
&lt;br /&gt;
The error stems from the materialistic assumption that only physical forces or physical phenomena can be causes. But an angel just appeared beside me and said, &amp;quot;That is balderdash, my good man!&amp;quot; --[[User:Ed Poor|Ed Poor]] &amp;lt;sup&amp;gt;[[User talk:Ed Poor|Talk]]&amp;lt;/sup&amp;gt; 13:15, 8 December 2008 (EST)&lt;br /&gt;
&lt;br /&gt;
:Even if non-materialist forces can be causes (which I agree with), they are still important causes. For example, if I decided to have a hamburger for lunch, I may be influenced by the smell (external) and a series of previous events (including my past experiences) from the start of creation. Some of that would be my reflection on what I like, and would be non-physical, but it is still a causal line from the moment of creation. To me, that would argue for a deterministic outlook, because the non-physical causes would still be considered causally related. Personally, I have no problem with that as a compatiblist, but I really don't understand any real way for us to have thoughts that aren't &amp;quot;caused&amp;quot; one way or another. I don't think that Hume was, in terms of philosophy of mind, a materialist, so I think this could also fit in with his arguments. [[User:Sulli|Sulli]] 13:26, 8 December 2008 (EST)&lt;br /&gt;
&lt;br /&gt;
:Ed, you misunderstand Hume's argument.  This particular error is quite common, as elsewhere Hume argues against, e.g., the possibility of miraculous events.  That said: Hume is not a physicalist in the modern sense used by philosophers of mind.  The dichotomy is this:  Either some event is caused or it is not.  This isn't a false dilemma (what I think you mean by &amp;quot;fallacy of the excluded middle&amp;quot;; the excluded middle is just the Aristotelian term for the claim &amp;quot;either P is true or it is false&amp;quot;) -- it is, as far as I at least can tell, a tautology.   This event is what we'll call a &amp;quot;choice&amp;quot;.  Now, if the choice is caused, it is determined, because for P to cause Q, if P were to happen, Q must follow (this is basic Lewisian counterfactual causation).  That's what &amp;quot;caused&amp;quot; means.  The other option is, of course, that the event is uncaused.  But for something to be uncaused is for it to be random.&lt;br /&gt;
&lt;br /&gt;
:The only way to attack Hume here is on the nature of causation.  You claim, without support, that Hume's problem is a materialist one, but this is just not the case.  Even if what &amp;quot;causes&amp;quot; our choices is our willing, if there's a genuine causal relationship, there's no freedom in our willing.  It's a nasty little problem indeed.  The best way out is probably a quasi-Aristotelian move to posit that each free individual is an uncaused causer, but there are some severe problems there that I'm sure you can see.  [[User:StevenK|StevenK]] 18:47, 8 December 2008 (EST)&lt;br /&gt;
&lt;br /&gt;
::I don't think I misunderstood. I simply disagree with the idea that '''your choices are caused'''. Nothing &amp;quot;causes&amp;quot; you to choose to come to CP and start an argument about philosophy. Rather, you '''decide''' to do it. The essence of free will (and what links it to aspects of ethics such as responsibility) is your ability to make a choice. If you can't choose - if you are nothing more than an automaton, then you are not a moral agent at all. Robots aren't convicted of crimes, or given prizes. No one praises a computer that wins a chess tournament; the computer programmer gets the prize. A dog, trained to attack, would not be convicted of assault: rather, the person who made the dog attack is charged. &lt;br /&gt;
&lt;br /&gt;
::The error lies in the false dichotomy between &amp;quot;caused choices&amp;quot; and &amp;quot;random choices&amp;quot;. It is only robots and dogs who make caused choices. I hold you morally and ethically responsible for every edit you make on this website. --[[User:Ed Poor|Ed Poor]] &amp;lt;sup&amp;gt;[[User talk:Ed Poor|Talk]]&amp;lt;/sup&amp;gt; 10:39, 10 December 2008 (EST)&lt;br /&gt;
&lt;br /&gt;
::: Right.  But now you're confusing &amp;quot;choice&amp;quot; with &amp;quot;event&amp;quot;.  Remember that every '''decision''' is an event, and, as such, is either caused or uncaused.  You're claiming that decisions are uncaused.  OK.  But if decisions are uncaused, how are they anything other than random?  If they're truly uncaused, that is, our '''reasons''' have nothing to do with how they're made, because then reasons would have something to do with the production of decisions, which are uncaused events; and this is clearly an absurdity.  Morality demands more than just doing the right thing!  It demands that we do the right thing ''for the right reasons''.  This is why Hume says that determinism is necessary for moral action.  If there is no causal relationship between reasons and actions, then no moral action is possible, since morality depends on reason.  [[User:StevenK|StevenK]] 13:41, 10 December 2008 (EST)&lt;br /&gt;
&lt;br /&gt;
::*I have spent the bulk of my waking life (at least when I'm not sleeping on the job! ;-) creating rules for computers to follow. I '''cause''' computers to make decisions based on [[if then else]] logic. All their choices are caused, and none are random. But God is not a computer programmer, and I am not some science fiction experiment or fantasy (see [[TRON]]). And neither are you. --[[User:Ed Poor|Ed Poor]] &amp;lt;sup&amp;gt;[[User talk:Ed Poor|Talk]]&amp;lt;/sup&amp;gt; 10:52, 10 December 2008 (EST)&lt;br /&gt;
&lt;br /&gt;
::: I fail to see the relevance of this comment.  Of course we're not computer programs.  But that doesn't mean that there's no problem of freedom... ? [[User:StevenK|StevenK]] 13:41, 10 December 2008 (EST)&lt;/div&gt;</summary>
		<author><name>StevenK</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Talk:Free_will&amp;diff=581640</id>
		<title>Talk:Free will</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Talk:Free_will&amp;diff=581640"/>
		<updated>2008-12-08T23:47:37Z</updated>

		<summary type="html">&lt;p&gt;StevenK: Ed: you're missing Hume's point a bit -&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;It is a logical inconsistancy to claim that foreknowledge of an individual's actions allows that individual to possess free will.  If the will is known, it is not free.  If the will is free, it cannot be known.&lt;br /&gt;
&lt;br /&gt;
Thus, if a deity has foreknowledge of an individual's actions, then that deity has denied the individual's free will.&lt;br /&gt;
&lt;br /&gt;
If an individual's will is genuinely free, then any claim that a deity can have prior knowledge of an individual's actions is false.&lt;br /&gt;
&lt;br /&gt;
''Free will'' and ''an omniscient deity'' are mutually exclusive.  If either is encompassed by a theologically honest position, the other must be denied.  --[[User:OmnusErudito|OmnusErudito]] 14:24, 14 March 2007 (EDT)&lt;br /&gt;
&lt;br /&gt;
:This argument assumes that the future is capable of being the subject of knowledge (a fairly widely held assumption, but one I, and many other philosophers, reject).  That is, it assumes that a statement about the future is true or false, rather than indeterminate.  If the future is indeterminate then an omniscient deity would be able to know all that is knowable and still not know what I am going to do in the future.  Of course, this position raises problems with respect to prophesy and that may be a problem for some theists (but not necessarily for all theists if they reject prophesy or if they view prophesy as a promise of what God intends to do in the future).  So, while you are right, free will and the common understanding of an omniscient deity are at odds, free will and an omniscient deity are not necessarily at odds.--[[User:Reginod|Reginod]] 15:34, 14 March 2007 (EDT)&lt;br /&gt;
&lt;br /&gt;
::Knowing all possible outcomes does not make a being omniscient - I know all possible outcomes of a dice-roll, but I am not omniscient.  Given time and inclination, I could work out all possible results to a general election, but I will still not be omniscient.  No matter how complex a system, no matter how many possible outcomes exist in potentia, knowing all the possibilities does not make a being omniscient, merely clever.  Omniscience would require that the being know ''which'' of the possible outcomes will occur, bringing us right back to my original point. (I like your rewrite of the article, by the way)--[[User:OmnusErudito|OmnusErudito]] 14:28, 15 March 2007 (EDT)&lt;br /&gt;
&lt;br /&gt;
:::I'm sorry if I wasn't clear.  My point was simply that it could be the case that the future is not something that is knowable--at all--so even an all knowing entity (one that knows everything that is knowable) would not know the future.  Such an entity would know all the posable outcomes (just as we know what results a dice-roll may have), but it would not know the future.  this assumes a non-static future (which is an understanding of the nature of the future that is more compatible with free will than a static, even if unknown, future).  This would mean an all knowing God would still not know the future--so God's foreknowledge would not be in conflict with free will.    I'm not saying it is the right answer, I'm not sure what the right answer is, but it is one way to make free will and the existence of an all knowing being compatible.&lt;br /&gt;
:::Thank you for the compliment on the edit, I'm of the opinion that it is better to note where the debate is than pretend knowledge of the truth.--[[User:Reginod|Reginod]] 14:50, 15 March 2007 (EDT)--[[User:Reginod|Reginod]] 14:50, 15 March 2007 (EDT)&lt;br /&gt;
::::That is much clearer, and a response needs much more thought on my part, not something I will have time to do for at least a week or two.--[[User:OmnusErudito|OmnusErudito]] 14:56, 15 March 2007 (EDT)&lt;br /&gt;
:::::No hurry, I have this page on my watchlist so when you get a chance to respond I will see it.--[[User:Reginod|Reginod]] 14:59, 15 March 2007 (EDT)&lt;br /&gt;
&lt;br /&gt;
==Angels and animals==&lt;br /&gt;
&lt;br /&gt;
Removed:&lt;br /&gt;
*&amp;lt;s&amp;gt;Within a totally naturalistic system, freewill does not exist.&amp;lt;/s&amp;gt;&lt;br /&gt;
*In the Christian faith it is believed that humans were created with freewill so that they would chose to worship God, &amp;lt;s&amp;gt;unlike angels who were created without the choice to worship God&amp;lt;/s&amp;gt;. &lt;br /&gt;
&lt;br /&gt;
#I don't understand the reference to [[naturalism]]. Are you saying that '''your''' actions are all determined by physical law, L.T.?&lt;br /&gt;
#Which denomination says that angels are incapable of making choices? Haven't you read Jude 1:6-7? (It mentions angels who sinned, and sin is a [[choice]].) --[[User:Ed Poor|Ed Poor]] &amp;lt;sup&amp;gt;[[User talk:Ed Poor|Talk]]&amp;lt;/sup&amp;gt; 14:33, 27 July 2007 (EDT)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Section on morality==&lt;br /&gt;
This article on free will seems quite brief so I've added a section here. It's not fantastically well written and it's a bit waffly but hopefully it'll do until it can be expanded, either by my or another person.[[User:Sam99foster|Sam99foster]] 10:51, 14 September 2008 (EDT)&lt;br /&gt;
: I like the first sentence, bu I find the rest confusing.  It seems to be starting with the assumption that determinism is the opposite of free will, then redefines free will to be determinism!  This means that it's not actually the opposite after all, but simply another name for the same thing.  [[User:Philip J. Rayment|Philip J. Rayment]] 11:03, 14 September 2008 (EDT)&lt;br /&gt;
:: Yeah sorry, I should've made that clearer but I hoped I could leave it a little implicit. Essentially Hume draws a distinction between two kinds of freedom - freedom of action and freedom of will. The former is the freedom to do as you choose (i.e. it would be compromised if you were in jail or tied up or something), and the latter is the freedom to determine your own will. Hume says that confusion between these two terms is at the root of many discussions of free will, since often people use free will to mean the latter thing when in reality it doesn't make much sense - either things are determined or they are random (because of cause and effect). Is that at all clear? --[[User:Sam99foster|Sam99foster]] 11:58, 14 September 2008 (EDT)&lt;br /&gt;
::Re-reading myself I really don't think it is. When people talk about lack of free will negating morality, they mean lack of freedom of will (as opposed to of action). Hume says that lack of freedom of will results in randomness, because thought processes are subject to the same laws of cause and effect as any other event. So an apple falling is caused by gravity or something else, and if its caused by nothing then the occurrence must be random; and the same with decisions, which are caused by a variety of external stimuli.--[[User:Sam99foster|Sam99foster]] 12:03, 14 September 2008 (EDT)&lt;br /&gt;
&lt;br /&gt;
:::Your addition and your writing here are not necessarily clear.  If you wish to break up the article into two sections, then do so showing clearly that Hume is using his own definition of free will to make his point.  In the absense of free will it is obvious that there is no blame for actions as free will would be a necessary precursor for free action.  You also seem to be confused that lack of free will does not equal random.  Indeed much of what occurs is structured and orderly; there is just no will involved.  In nature an apple falling from a tree does so due to gravity - and will do so each and every time unless some other outside stimulus intervenes.  The apple has no free action to suddenly fall up, nor does it have a free will to consider that.  It reacts based upon the bio-chemical nature of its makeup.  Humans are no different when considered from this same naturalistic setting. [[User:Learn together|Learn together]] 15:35, 15 September 2008 (EDT)&lt;br /&gt;
&lt;br /&gt;
::::I agree that my writing is not clear. I'm afraid you misunderstand me entirely. What I mean by 'freedom of will' above is the idea that people can engage in thought which is essentially ''uncaused'', since if thought has a cause (like the apple falling from the tree) it's not 'free', in the same way the apple is not 'free' to fall upwards. Hume points out that logically if thoughts are uncaused then they must be random, which is obviously a problem for libertarians. This is sometimes referred to as the 'randomness problem'.&lt;br /&gt;
&lt;br /&gt;
::::Anyway I agree that my contribution is lacking as it is, and when I have a bit of free time on my hands I'll re-write it substantially. Thanks for the feedback.--[[User:Sam99foster|Sam99foster]] 16:31, 17 September 2008 (EDT)&lt;br /&gt;
&lt;br /&gt;
::::: I'm questioning (your explanation of) Hume's view, rather than the content of the article, but without understanding the view better, I'm limited in how much I can do to fix the wording.&lt;br /&gt;
::::: By way of analogy, diseases can be (a) genetic/hereditary, (b) non-genetic/non-hereditary, or (c) genetically-''influenced'', but not genetically-''determined''.  Hume's argument seems to be that if it's not &amp;quot;caused&amp;quot; (determined), it is ''uncaused'' (random).  But what about the will being ''influenced'' by causes, but not ''determined'' by them?  This would make it non-random.&lt;br /&gt;
::::: Further, Hume's argument appears to be materialistic, i.e. not allowing for a non-materialistic, or perhaps ''spiritual'' component.&lt;br /&gt;
::::: Comments?&lt;br /&gt;
::::: [[User:Philip J. Rayment|Philip J. Rayment]] 22:49, 17 September 2008 (EDT)&lt;br /&gt;
&lt;br /&gt;
::::::With regard to causation - there's no logical reason that things could not be only ''influenced'' by causes rather than entirely determined by them. However, you are left having to explain what it is providing the rest of the event (the part of the disease which is not genetically influenced). If it's randomness, then you are still left with the determined/random problem. If it is some third possibility, you would have to explain what this could be and how it would work.&lt;br /&gt;
::::::I think it's correct to say that Hume's approach is materialistic, although on a logical rather than ideological basis. What form would a 'spiritual component' take?&lt;br /&gt;
::::::Thanks by the way for the reply and for the continued discussion - it helps to sort out exactly what my arguments are to have them questioned coherently like that.--[[User:Sam99foster|Sam99foster]] 08:38, 19 September 2008 (EDT)&lt;br /&gt;
::::::P.S. I am not completely positive what Hume's precise rebuttal would be to your arguments, I'm just putting forward my view since I agree with Hume. I am however reasonably confident that I've expressed his view accurately.&lt;br /&gt;
&lt;br /&gt;
:::::::I think you need to rewrite your section soon.  I'm uncomfortable with having an article that currently reads in a form that is misleading and/or confusing.&lt;br /&gt;
&lt;br /&gt;
:::::::The difficulty that Hume faced, and those since his time, is how to allow for free will in a totally naturalistic system.  I find they often take the conclusion (we have free will) and try to force it backwards to fit in a way that presumes it must fit when it doesn't.  It is also common today for naturalists to simply state that we have no free will, a positition that is certainly more sound based on the naturalistic evidence, but doesn't appear to match what we see in reality.  Hume also had the advantage of ignorance, having only the barest knowledge of the naturalistic system that has been fleshed out in much greater detail today.  One can speculate a role for 'randomness' back then that just isn't seen in our knowledge of naturalistic functions today. [[User:Learn together|Learn together]] 12:54, 19 September 2008 (EDT)&lt;br /&gt;
&lt;br /&gt;
(unindent) I'm jumping in here, because Hume seems to have said that either our decisions - such as mine just now to take issue with the way the article is going - are either (1) caused by external stimuli or (2) completely random. But this is the fallacy of the [[excluded middle]]. No one '''causes''' me to decide a certain way. Between stimulus and response there is plenty of time for me to exercise [[agency (philosophy)]], i.e., to &amp;quot;[[Be proactive]]&amp;quot; as Stephen Covey would say. &lt;br /&gt;
&lt;br /&gt;
The error stems from the materialistic assumption that only physical forces or physical phenomena can be causes. But an angel just appeared beside me and said, &amp;quot;That is balderdash, my good man!&amp;quot; --[[User:Ed Poor|Ed Poor]] &amp;lt;sup&amp;gt;[[User talk:Ed Poor|Talk]]&amp;lt;/sup&amp;gt; 13:15, 8 December 2008 (EST)&lt;br /&gt;
&lt;br /&gt;
:Even if non-materialist forces can be causes (which I agree with), they are still important causes. For example, if I decided to have a hamburger for lunch, I may be influenced by the smell (external) and a series of previous events (including my past experiences) from the start of creation. Some of that would be my reflection on what I like, and would be non-physical, but it is still a causal line from the moment of creation. To me, that would argue for a deterministic outlook, because the non-physical causes would still be considered causally related. Personally, I have no problem with that as a compatiblist, but I really don't understand any real way for us to have thoughts that aren't &amp;quot;caused&amp;quot; one way or another. I don't think that Hume was, in terms of philosophy of mind, a materialist, so I think this could also fit in with his arguments. [[User:Sulli|Sulli]] 13:26, 8 December 2008 (EST)&lt;br /&gt;
&lt;br /&gt;
:Ed, you misunderstand Hume's argument.  This particular error is quite common, as elsewhere Hume argues against, e.g., the possibility of miraculous events.  That said: Hume is not a physicalist in the modern sense used by philosophers of mind.  The dichotomy is this:  Either some event is caused or it is not.  This isn't a false dilemma (what I think you mean by &amp;quot;fallacy of the excluded middle&amp;quot;; the excluded middle is just the Aristotelian term for the claim &amp;quot;either P is true or it is false&amp;quot;) -- it is, as far as I at least can tell, a tautology.   This event is what we'll call a &amp;quot;choice&amp;quot;.  Now, if the choice is caused, it is determined, because for P to cause Q, if P were to happen, Q must follow (this is basic Lewisian counterfactual causation).  That's what &amp;quot;caused&amp;quot; means.  The other option is, of course, that the event is uncaused.  But for something to be uncaused is for it to be random.&lt;br /&gt;
&lt;br /&gt;
:The only way to attack Hume here is on the nature of causation.  You claim, without support, that Hume's problem is a materialist one, but this is just not the case.  Even if what &amp;quot;causes&amp;quot; our choices is our willing, if there's a genuine causal relationship, there's no freedom in our willing.  It's a nasty little problem indeed.  The best way out is probably a quasi-Aristotelian move to posit that each free individual is an uncaused causer, but there are some severe problems there that I'm sure you can see.  [[User:StevenK|StevenK]] 18:47, 8 December 2008 (EST)&lt;/div&gt;</summary>
		<author><name>StevenK</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Boolean_algebra&amp;diff=510319</id>
		<title>Boolean algebra</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Boolean_algebra&amp;diff=510319"/>
		<updated>2008-09-03T23:08:18Z</updated>

		<summary type="html">&lt;p&gt;StevenK: /* Derived Functions */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;'''Boolean algebra''' or '''boolean logic''' is the formal mathematical discipline that deals with &amp;quot;truth values&amp;quot;&amp;amp;mdash;&amp;quot;true&amp;quot; or &amp;quot;false&amp;quot;.  Its fundamental operations are &amp;quot;and&amp;quot;, &amp;quot;or&amp;quot; and &amp;quot;not&amp;quot;.  One can write &amp;quot;propositions&amp;quot; (equations) of boolean algebra, such as&lt;br /&gt;
 P = (Q+R)•(T')&lt;br /&gt;
and manipulate them the way one would manipulate ordinary algebraic equations.&lt;br /&gt;
&lt;br /&gt;
Boolean algebra as a formal mathematical study was pioneered by (and is named after) [[English]] mathematician [[George Boole]] in the 1830's.&lt;br /&gt;
&lt;br /&gt;
The terms &amp;quot;boolean algebra&amp;quot; and &amp;quot;boolean logic&amp;quot; are used interchangeably.  The words are not capitalized (except at the beginning of a sentence, of course) even though they are named after a person.&lt;br /&gt;
&lt;br /&gt;
==Boolean Algebra and Computer Hardware==&lt;br /&gt;
The thing that elevates boolean algebra from a somewhat obscure branch of mathematics to one of the driving forces of modern society is that it is the basis for computers.  Computers do everything in boolean logic.  All numbers are represented internally in [[binary]] (base 2) notation, with digits (&amp;quot;bits&amp;quot;) 1 and 0, corresponding to &amp;quot;true&amp;quot; and &amp;quot;false&amp;quot;, respectively.  Computers are then designed in terms of boolean algebra equations.  For example, addition is performed by 32 copies of these equations:&lt;br /&gt;
 S = (A•B•C) + (A•B'•C') + (A'•B•C') + (A'•B'•C)&lt;br /&gt;
 D = (A•B) + (A•C) + (B•C)&lt;br /&gt;
A modern computer processing chip has tens of millions of transistors, all calculating boolean operations.&lt;br /&gt;
&lt;br /&gt;
==Three Basic Operations==&lt;br /&gt;
The three basic operations of boolean algebra are AND (analogous to [[multiplication]]), OR (analogous to [[addition]]), and NOT (analogous to [[inversion]]). See the tables below for a numerical and pictorial descriptions. From these functions, the other functions of boolean algebra can be derived.  In the following descriptions, we will use the 1-and-0 notation rather than the true-and-false notation.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; align=&amp;quot;center&amp;quot;&lt;br /&gt;
! colspan=10 | Truth Table for the Operators &lt;br /&gt;
|- alight=&amp;quot;left&amp;quot;&lt;br /&gt;
! colspan=3 | AND: A•B=C ||  || colspan=3 | OR: A+B=C || || colspan=2 | NOT A'=B&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| '''A''' || '''B''' || '''C''' || rowspan=5 | || '''A''' || '''B''' || '''C''' || rowspan=5 | || '''A''' || '''B'''&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| 0 || 0 || 0 || 0 || 0 || 0 || 0 || 1&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| 0 || 1 || 0 || 0 || 1 || 1 || 1 || 0&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| 1 || 0 || 0 || 1 || 0 || 1&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| 1 || 1 || 1 || 1 || 1 || 1&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
===AND===&lt;br /&gt;
[[Image:VennAnd1.gif|right|250px|thumb|Pictorial despcription of AND]]&lt;br /&gt;
AND is the boolean equivalent of multiplication. The product of two numbers are non-zero if both numbers are non-zero. In words, the AND function states: &amp;quot;If A AND B are true then C is true&amp;quot;.  The AND function is commutative, so it results in the same answer no matter what order the values are in. For example, A • B = B • A, and A • (B • C) = (A • B) • C.&lt;br /&gt;
&lt;br /&gt;
{{clear}}&lt;br /&gt;
&lt;br /&gt;
===OR===&lt;br /&gt;
[[Image:VennOr1.gif|right|250px|thumb|Pictorial description of OR]]&lt;br /&gt;
OR is the boolean equivalent of addition. The sum of two positive numbers is non-zero if either number is non-zero. In words, the OR function states: &amp;quot;If A OR B is true then C is true&amp;quot;. Like AND, the OR function is commutative.&lt;br /&gt;
&lt;br /&gt;
===NOT===&lt;br /&gt;
NOT is the Boolean equivalent of inversion. It is represented by an apostrophe (A') or an overbar (&amp;lt;math&amp;gt;\bar A&amp;lt;/math&amp;gt;). NOT reverses the value of any variable: if A = 0, A' = 1, and if A = 1, A' = 0.&lt;br /&gt;
&lt;br /&gt;
NOT can be combined with AND and NOT for interesting results. A•A' (A AND NOT A) always equals 0 (false), since no matter the value of A, one of the two values is always 0. Similarly, A+A' (A OR NOT A) always equals 1 (true), since no matter the value of A, one of the two values is always 1.&lt;br /&gt;
&lt;br /&gt;
===Order of Operations===&lt;br /&gt;
By convention, the [[order of operations]] (sometimes called &amp;quot;operator precedence&amp;quot;) for boolean algebra is the same as that for traditional algebra, except that there are fewer functions for boolean algebra: parenthesis are evaluated first, followed by multiplication then addition. Bars over multiple variables are treated at the same level as parenthesis.  In practice, considerations of operation order are never a problem.&lt;br /&gt;
&lt;br /&gt;
==Derived Functions==&lt;br /&gt;
From the three functions mentioned above, other functions can be derived. Some common ones are NAND, NOR and XOR. See the table below for a numerical description.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; align=&amp;quot;left&amp;quot;&lt;br /&gt;
! colspan=3 | NAND: (A•B)'!!  !! colspan=3 | NOR: (A+B) !! !! colspan=3 | XOR (A'B + AB')&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| '''A''' || '''B''' || '''C''' || rowspan=5 | || '''A''' || '''B''' || '''C''' || rowspan=5 | || '''A''' || '''B''' || '''C'''&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| 0 || 0 || 1 || 0 || 0 || 1 || 0 || 0 || 0&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| 0 || 1 || 1 || 0 || 1 || 0 || 0 || 1 || 1&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| 1 || 0 || 1 || 1 || 0 || 0 || 1 || 0 || 1&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| 1 || 1 || 0 || 1 || 1 || 0 || 1 || 1 || 0&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
===NAND and NOR===&lt;br /&gt;
NAND and NOR are formed by simply performing a NOT on the output of an AND or OR operation, respectively. NAND can be expressed symbolically as A NAND B = (AB)' and NOR can be expressed symbolically as A NOR B = (A+B)'.&lt;br /&gt;
&lt;br /&gt;
===XOR===&lt;br /&gt;
XOR (or &amp;quot;exclusive OR&amp;quot;) gives a 1 (&amp;quot;true&amp;quot;) if either of its inputs are 1, but not both. Symbolically this can be broken down into its basic operations by the expression: A XOR B = A'B + B'A.&lt;br /&gt;
&lt;br /&gt;
==Boolean Algebra and Computer Programming==&lt;br /&gt;
The operations of boolean logic are extremely important in computer software.  Modern computer languages usually have some kind of &amp;quot;boolean&amp;quot; data type.  For example, in the C++ language, it is called &amp;quot;bool&amp;quot;.&lt;br /&gt;
{{clear}}&lt;br /&gt;
&lt;br /&gt;
== See Also ==&lt;br /&gt;
*[http://www.learn-c.com/boolean.htm Boolean logic tutorial]&lt;br /&gt;
&lt;br /&gt;
[[Category:Logic]]&lt;br /&gt;
[[Category:Computer Science]]&lt;br /&gt;
[[Category:Electronics]]&lt;/div&gt;</summary>
		<author><name>StevenK</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Boolean_algebra&amp;diff=510318</id>
		<title>Boolean algebra</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Boolean_algebra&amp;diff=510318"/>
		<updated>2008-09-03T23:07:34Z</updated>

		<summary type="html">&lt;p&gt;StevenK: /* Derived Functions */ another typo in bottom row of table&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;'''Boolean algebra''' or '''boolean logic''' is the formal mathematical discipline that deals with &amp;quot;truth values&amp;quot;&amp;amp;mdash;&amp;quot;true&amp;quot; or &amp;quot;false&amp;quot;.  Its fundamental operations are &amp;quot;and&amp;quot;, &amp;quot;or&amp;quot; and &amp;quot;not&amp;quot;.  One can write &amp;quot;propositions&amp;quot; (equations) of boolean algebra, such as&lt;br /&gt;
 P = (Q+R)•(T')&lt;br /&gt;
and manipulate them the way one would manipulate ordinary algebraic equations.&lt;br /&gt;
&lt;br /&gt;
Boolean algebra as a formal mathematical study was pioneered by (and is named after) [[English]] mathematician [[George Boole]] in the 1830's.&lt;br /&gt;
&lt;br /&gt;
The terms &amp;quot;boolean algebra&amp;quot; and &amp;quot;boolean logic&amp;quot; are used interchangeably.  The words are not capitalized (except at the beginning of a sentence, of course) even though they are named after a person.&lt;br /&gt;
&lt;br /&gt;
==Boolean Algebra and Computer Hardware==&lt;br /&gt;
The thing that elevates boolean algebra from a somewhat obscure branch of mathematics to one of the driving forces of modern society is that it is the basis for computers.  Computers do everything in boolean logic.  All numbers are represented internally in [[binary]] (base 2) notation, with digits (&amp;quot;bits&amp;quot;) 1 and 0, corresponding to &amp;quot;true&amp;quot; and &amp;quot;false&amp;quot;, respectively.  Computers are then designed in terms of boolean algebra equations.  For example, addition is performed by 32 copies of these equations:&lt;br /&gt;
 S = (A•B•C) + (A•B'•C') + (A'•B•C') + (A'•B'•C)&lt;br /&gt;
 D = (A•B) + (A•C) + (B•C)&lt;br /&gt;
A modern computer processing chip has tens of millions of transistors, all calculating boolean operations.&lt;br /&gt;
&lt;br /&gt;
==Three Basic Operations==&lt;br /&gt;
The three basic operations of boolean algebra are AND (analogous to [[multiplication]]), OR (analogous to [[addition]]), and NOT (analogous to [[inversion]]). See the tables below for a numerical and pictorial descriptions. From these functions, the other functions of boolean algebra can be derived.  In the following descriptions, we will use the 1-and-0 notation rather than the true-and-false notation.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; align=&amp;quot;center&amp;quot;&lt;br /&gt;
! colspan=10 | Truth Table for the Operators &lt;br /&gt;
|- alight=&amp;quot;left&amp;quot;&lt;br /&gt;
! colspan=3 | AND: A•B=C ||  || colspan=3 | OR: A+B=C || || colspan=2 | NOT A'=B&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| '''A''' || '''B''' || '''C''' || rowspan=5 | || '''A''' || '''B''' || '''C''' || rowspan=5 | || '''A''' || '''B'''&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| 0 || 0 || 0 || 0 || 0 || 0 || 0 || 1&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| 0 || 1 || 0 || 0 || 1 || 1 || 1 || 0&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| 1 || 0 || 0 || 1 || 0 || 1&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| 1 || 1 || 1 || 1 || 1 || 1&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
===AND===&lt;br /&gt;
[[Image:VennAnd1.gif|right|250px|thumb|Pictorial despcription of AND]]&lt;br /&gt;
AND is the boolean equivalent of multiplication. The product of two numbers are non-zero if both numbers are non-zero. In words, the AND function states: &amp;quot;If A AND B are true then C is true&amp;quot;.  The AND function is commutative, so it results in the same answer no matter what order the values are in. For example, A • B = B • A, and A • (B • C) = (A • B) • C.&lt;br /&gt;
&lt;br /&gt;
{{clear}}&lt;br /&gt;
&lt;br /&gt;
===OR===&lt;br /&gt;
[[Image:VennOr1.gif|right|250px|thumb|Pictorial description of OR]]&lt;br /&gt;
OR is the boolean equivalent of addition. The sum of two positive numbers is non-zero if either number is non-zero. In words, the OR function states: &amp;quot;If A OR B is true then C is true&amp;quot;. Like AND, the OR function is commutative.&lt;br /&gt;
&lt;br /&gt;
===NOT===&lt;br /&gt;
NOT is the Boolean equivalent of inversion. It is represented by an apostrophe (A') or an overbar (&amp;lt;math&amp;gt;\bar A&amp;lt;/math&amp;gt;). NOT reverses the value of any variable: if A = 0, A' = 1, and if A = 1, A' = 0.&lt;br /&gt;
&lt;br /&gt;
NOT can be combined with AND and NOT for interesting results. A•A' (A AND NOT A) always equals 0 (false), since no matter the value of A, one of the two values is always 0. Similarly, A+A' (A OR NOT A) always equals 1 (true), since no matter the value of A, one of the two values is always 1.&lt;br /&gt;
&lt;br /&gt;
===Order of Operations===&lt;br /&gt;
By convention, the [[order of operations]] (sometimes called &amp;quot;operator precedence&amp;quot;) for boolean algebra is the same as that for traditional algebra, except that there are fewer functions for boolean algebra: parenthesis are evaluated first, followed by multiplication then addition. Bars over multiple variables are treated at the same level as parenthesis.  In practice, considerations of operation order are never a problem.&lt;br /&gt;
&lt;br /&gt;
==Derived Functions==&lt;br /&gt;
From the three functions mentioned above, other functions can be derived. Some common ones are NAND, NOR and XOR. See the table below for a numerical description.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; align=&amp;quot;left&amp;quot;&lt;br /&gt;
! colspan=3 | NAND: (A•B)'!!  !! colspan=3 | NOR: (A+B) !! !! colspan=3 | XOR (A'B + AB')&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| '''A''' || '''B''' || '''C''' || rowspan=5 | || '''A''' || '''B''' || '''C''' || rowspan=5 | || '''A''' || '''B''' || '''C'''&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| 0 || 0 || 1 || 0 || 0 || 1 || 0 || 0 || 0&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| 0 || 1 || 1 || 0 || 1 || 0 || 0 || 1 || 1&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| 1 || 0 || 1 || 1 || 0 || 0 || 1 || 0 || 1&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| 1 || 1 || 0 || 1 || 0 || 0 || 1 || 1 || 0&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
===NAND and NOR===&lt;br /&gt;
NAND and NOR are formed by simply performing a NOT on the output of an AND or OR operation, respectively. NAND can be expressed symbolically as A NAND B = (AB)' and NOR can be expressed symbolically as A NOR B = (A+B)'.&lt;br /&gt;
&lt;br /&gt;
===XOR===&lt;br /&gt;
XOR (or &amp;quot;exclusive OR&amp;quot;) gives a 1 (&amp;quot;true&amp;quot;) if either of its inputs are 1, but not both. Symbolically this can be broken down into its basic operations by the expression: A XOR B = A'B + B'A.&lt;br /&gt;
&lt;br /&gt;
==Boolean Algebra and Computer Programming==&lt;br /&gt;
The operations of boolean logic are extremely important in computer software.  Modern computer languages usually have some kind of &amp;quot;boolean&amp;quot; data type.  For example, in the C++ language, it is called &amp;quot;bool&amp;quot;.&lt;br /&gt;
{{clear}}&lt;br /&gt;
&lt;br /&gt;
== See Also ==&lt;br /&gt;
*[http://www.learn-c.com/boolean.htm Boolean logic tutorial]&lt;br /&gt;
&lt;br /&gt;
[[Category:Logic]]&lt;br /&gt;
[[Category:Computer Science]]&lt;br /&gt;
[[Category:Electronics]]&lt;/div&gt;</summary>
		<author><name>StevenK</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Boolean_algebra&amp;diff=510316</id>
		<title>Boolean algebra</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Boolean_algebra&amp;diff=510316"/>
		<updated>2008-09-03T23:06:46Z</updated>

		<summary type="html">&lt;p&gt;StevenK: /* Three Basic Operations */ fix typo in last line of table&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;'''Boolean algebra''' or '''boolean logic''' is the formal mathematical discipline that deals with &amp;quot;truth values&amp;quot;&amp;amp;mdash;&amp;quot;true&amp;quot; or &amp;quot;false&amp;quot;.  Its fundamental operations are &amp;quot;and&amp;quot;, &amp;quot;or&amp;quot; and &amp;quot;not&amp;quot;.  One can write &amp;quot;propositions&amp;quot; (equations) of boolean algebra, such as&lt;br /&gt;
 P = (Q+R)•(T')&lt;br /&gt;
and manipulate them the way one would manipulate ordinary algebraic equations.&lt;br /&gt;
&lt;br /&gt;
Boolean algebra as a formal mathematical study was pioneered by (and is named after) [[English]] mathematician [[George Boole]] in the 1830's.&lt;br /&gt;
&lt;br /&gt;
The terms &amp;quot;boolean algebra&amp;quot; and &amp;quot;boolean logic&amp;quot; are used interchangeably.  The words are not capitalized (except at the beginning of a sentence, of course) even though they are named after a person.&lt;br /&gt;
&lt;br /&gt;
==Boolean Algebra and Computer Hardware==&lt;br /&gt;
The thing that elevates boolean algebra from a somewhat obscure branch of mathematics to one of the driving forces of modern society is that it is the basis for computers.  Computers do everything in boolean logic.  All numbers are represented internally in [[binary]] (base 2) notation, with digits (&amp;quot;bits&amp;quot;) 1 and 0, corresponding to &amp;quot;true&amp;quot; and &amp;quot;false&amp;quot;, respectively.  Computers are then designed in terms of boolean algebra equations.  For example, addition is performed by 32 copies of these equations:&lt;br /&gt;
 S = (A•B•C) + (A•B'•C') + (A'•B•C') + (A'•B'•C)&lt;br /&gt;
 D = (A•B) + (A•C) + (B•C)&lt;br /&gt;
A modern computer processing chip has tens of millions of transistors, all calculating boolean operations.&lt;br /&gt;
&lt;br /&gt;
==Three Basic Operations==&lt;br /&gt;
The three basic operations of boolean algebra are AND (analogous to [[multiplication]]), OR (analogous to [[addition]]), and NOT (analogous to [[inversion]]). See the tables below for a numerical and pictorial descriptions. From these functions, the other functions of boolean algebra can be derived.  In the following descriptions, we will use the 1-and-0 notation rather than the true-and-false notation.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; align=&amp;quot;center&amp;quot;&lt;br /&gt;
! colspan=10 | Truth Table for the Operators &lt;br /&gt;
|- alight=&amp;quot;left&amp;quot;&lt;br /&gt;
! colspan=3 | AND: A•B=C ||  || colspan=3 | OR: A+B=C || || colspan=2 | NOT A'=B&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| '''A''' || '''B''' || '''C''' || rowspan=5 | || '''A''' || '''B''' || '''C''' || rowspan=5 | || '''A''' || '''B'''&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| 0 || 0 || 0 || 0 || 0 || 0 || 0 || 1&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| 0 || 1 || 0 || 0 || 1 || 1 || 1 || 0&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| 1 || 0 || 0 || 1 || 0 || 1&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| 1 || 1 || 1 || 1 || 1 || 1&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
===AND===&lt;br /&gt;
[[Image:VennAnd1.gif|right|250px|thumb|Pictorial despcription of AND]]&lt;br /&gt;
AND is the boolean equivalent of multiplication. The product of two numbers are non-zero if both numbers are non-zero. In words, the AND function states: &amp;quot;If A AND B are true then C is true&amp;quot;.  The AND function is commutative, so it results in the same answer no matter what order the values are in. For example, A • B = B • A, and A • (B • C) = (A • B) • C.&lt;br /&gt;
&lt;br /&gt;
{{clear}}&lt;br /&gt;
&lt;br /&gt;
===OR===&lt;br /&gt;
[[Image:VennOr1.gif|right|250px|thumb|Pictorial description of OR]]&lt;br /&gt;
OR is the boolean equivalent of addition. The sum of two positive numbers is non-zero if either number is non-zero. In words, the OR function states: &amp;quot;If A OR B is true then C is true&amp;quot;. Like AND, the OR function is commutative.&lt;br /&gt;
&lt;br /&gt;
===NOT===&lt;br /&gt;
NOT is the Boolean equivalent of inversion. It is represented by an apostrophe (A') or an overbar (&amp;lt;math&amp;gt;\bar A&amp;lt;/math&amp;gt;). NOT reverses the value of any variable: if A = 0, A' = 1, and if A = 1, A' = 0.&lt;br /&gt;
&lt;br /&gt;
NOT can be combined with AND and NOT for interesting results. A•A' (A AND NOT A) always equals 0 (false), since no matter the value of A, one of the two values is always 0. Similarly, A+A' (A OR NOT A) always equals 1 (true), since no matter the value of A, one of the two values is always 1.&lt;br /&gt;
&lt;br /&gt;
===Order of Operations===&lt;br /&gt;
By convention, the [[order of operations]] (sometimes called &amp;quot;operator precedence&amp;quot;) for boolean algebra is the same as that for traditional algebra, except that there are fewer functions for boolean algebra: parenthesis are evaluated first, followed by multiplication then addition. Bars over multiple variables are treated at the same level as parenthesis.  In practice, considerations of operation order are never a problem.&lt;br /&gt;
&lt;br /&gt;
==Derived Functions==&lt;br /&gt;
From the three functions mentioned above, other functions can be derived. Some common ones are NAND, NOR and XOR. See the table below for a numerical description.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot; align=&amp;quot;left&amp;quot;&lt;br /&gt;
! colspan=3 | NAND: (A•B)'!!  !! colspan=3 | NOR: (A+B) !! !! colspan=3 | XOR (A'B + AB')&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| '''A''' || '''B''' || '''C''' || rowspan=5 | || '''A''' || '''B''' || '''C''' || rowspan=5 | || '''A''' || '''B''' || '''C'''&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| 0 || 0 || 1 || 0 || 0 || 1 || 0 || 0 || 0&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| 0 || 1 || 1 || 0 || 1 || 0 || 0 || 1 || 1&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| 1 || 0 || 1 || 1 || 0 || 0 || 1 || 0 || 1&lt;br /&gt;
|- align=&amp;quot;center&amp;quot;&lt;br /&gt;
| 1 || 1 || 0 || 1 || 0 || 0 || 1 || 1 || 1&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
===NAND and NOR===&lt;br /&gt;
NAND and NOR are formed by simply performing a NOT on the output of an AND or OR operation, respectively. NAND can be expressed symbolically as A NAND B = (AB)' and NOR can be expressed symbolically as A NOR B = (A+B)'.&lt;br /&gt;
&lt;br /&gt;
===XOR===&lt;br /&gt;
XOR (or &amp;quot;exclusive OR&amp;quot;) gives a 1 (&amp;quot;true&amp;quot;) if either of its inputs are 1, but not both. Symbolically this can be broken down into its basic operations by the expression: A XOR B = A'B + B'A.&lt;br /&gt;
&lt;br /&gt;
==Boolean Algebra and Computer Programming==&lt;br /&gt;
The operations of boolean logic are extremely important in computer software.  Modern computer languages usually have some kind of &amp;quot;boolean&amp;quot; data type.  For example, in the C++ language, it is called &amp;quot;bool&amp;quot;.&lt;br /&gt;
{{clear}}&lt;br /&gt;
&lt;br /&gt;
== See Also ==&lt;br /&gt;
*[http://www.learn-c.com/boolean.htm Boolean logic tutorial]&lt;br /&gt;
&lt;br /&gt;
[[Category:Logic]]&lt;br /&gt;
[[Category:Computer Science]]&lt;br /&gt;
[[Category:Electronics]]&lt;/div&gt;</summary>
		<author><name>StevenK</name></author>
	</entry>
</feed>