7. A system for executing four-valued logic in a semantic network, the system comprising: a computing device comprising a central processing unit, a runtime stack and heap, a top down / bottom up parser, and a system clock; a logic system defined in memory of said computing device, said logic system having a NOT logical connective denoted as “ ” an AND logical connective denoted as “ ” and an OR logical connective denoted as “v,” wherein false values are represented with an “F” symbol, true values are represented by a “T” symbol, undefined values are represented by a “U” symbol, and defined values are represented by a “D” symbol, such that for a property P false values are in a set { P}, true values are in a set {P}, undefined values are in a set {}, and defined values are in a set {P, P}, wherein said logic system is proven complete and w-consistent by a set of statements comprising: F is T, T is F, U is D, D is U; F F is F, F T is F, F U is F, F D is F; T A F is F, T T is T, T A U is U, T D is D; U F is F, U T is U, U U is U, U D is F; D F is F, D T is D, D U is F, D D is D; F F is F, F T is T, F U is U, F D is D; T F is T, T T is T, T U is T, T D is T; U F is U, U T is T, U U is U, U D is T; and D F is D, D T is T, D U is T, D D is D; a non-transitory computer readable medium storing machine readable instructions for causing said computing device to perform the steps of generating a semantic network representing digitally stored information, said semantic network comprising a plurality of object nodes and a plurality of relationships between said plurality of object nodes, by: providing a first vector and a second vector in digital memory for each of said plurality of object nodes, each of said first vector and said second vector being a dynamically allocated array having a plurality of index positions each with a size of one bit; linearly encoding semantic information for an object node by storing two bits that together encode a false value, true value, undefined value, or defined value, a first bit of said two bits being stored at an index position within the first vector associated with the object node, and a second bit of said two bits being stored at the same index position within the second vector associated with the object node; linearly encoding syntactic information associated with said plurality of relationships in said digital memory; and testing of conditionals or quantifying variables in said semantic network during successive recursive steps in a predicate calculus using said logic system, the false values, true values, undefined values, and defined values in the semantic information associated with said plurality of object nodes, and the syntactic information associated with said plurality of relationships, wherein linear encoding of said semantic information and said syntactic information optimizes short term memory, maximizes long term storage, and optimizes communication and memory between different knowledge sources or processes.
7. A system for executing four-valued logic in a semantic network, the system comprising: a computing device comprising a central processing unit, a runtime stack and heap, a top down / bottom up parser, and a system clock; a logic system defined in memory of said computing device, said logic system having a NOT logical connective denoted as “ ” an AND logical connective denoted as “ ” and an OR logical connective denoted as “v,” wherein false values are represented with an “F” symbol, true values are represented by a “T” symbol, undefined values are represented by a “U” symbol, and defined values are represented by a “D” symbol, such that for a property P false values are in a set { P}, true values are in a set {P}, undefined values are in a set {}, and defined values are in a set {P, P}, wherein said logic system is proven complete and w-consistent by a set of statements comprising: F is T, T is F, U is D, D is U; F F is F, F T is F, F U is F, F D is F; T A F is F, T T is T, T A U is U, T D is D; U F is F, U T is U, U U is U, U D is F; D F is F, D T is D, D U is F, D D is D; F F is F, F T is T, F U is U, F D is D; T F is T, T T is T, T U is T, T D is T; U F is U, U T is T, U U is U, U D is T; and D F is D, D T is T, D U is T, D D is D; a non-transitory computer readable medium storing machine readable instructions for causing said computing device to perform the steps of generating a semantic network representing digitally stored information, said semantic network comprising a plurality of object nodes and a plurality of relationships between said plurality of object nodes, by: providing a first vector and a second vector in digital memory for each of said plurality of object nodes, each of said first vector and said second vector being a dynamically allocated array having a plurality of index positions each with a size of one bit; linearly encoding semantic information for an object node by storing two bits that together encode a false value, true value, undefined value, or defined value, a first bit of said two bits being stored at an index position within the first vector associated with the object node, and a second bit of said two bits being stored at the same index position within the second vector associated with the object node; linearly encoding syntactic information associated with said plurality of relationships in said digital memory; and testing of conditionals or quantifying variables in said semantic network during successive recursive steps in a predicate calculus using said logic system, the false values, true values, undefined values, and defined values in the semantic information associated with said plurality of object nodes, and the syntactic information associated with said plurality of relationships, wherein linear encoding of said semantic information and said syntactic information optimizes short term memory, maximizes long term storage, and optimizes communication and memory between different knowledge sources or processes. 10. The system of claim 7 , wherein said top down / bottom up parser is configured to mark subsets of said plurality of object nodes as {S} for start, {Np} for a noun phrase, {Vp} for a verb phrase, or {Pp} for a prepositional phrase during natural language processing.