How It is Done

My published scientific papers: 
Paper on theory of cognition and its software application (Readware):
https://www.dropbox.com/s/659cn2x42ytmsiw/cognition.pdf

Paper on theory of semantics:
https://www.dropbox.com/s/r65bx37xjsmxwhm/semantics.pdf

Paper on theory of emotions:
https://www.dropbox.com/s/s8cgfeupzmsx1dn/emotions.pdf

 Here is an example of how it is done:
“ra waw hha” (soul, spirit)

ra () & hha (). A closed-self assignment of manifestation (ra) juxtaposed with a closed-self assignment and manifestation of containment (hha)

An independent spiritual decision maker (ra) connected with an independent living thing (hha) .

The example above (analysis of Arabic word stem "ra waw hha") was constructed using Algorithm C (see below) .

Our Theory of Semantics states that each of the 28 Arabic consonants is a sign that refers to one of seven abstract processes—assignment, manifestation, containment, assignment of manifestation, assignment of containment, manifestation of containment, and assignment and manifestation of containment—and one of four abstract polarities—closed-self, open-self, closed-others, and open-others. This is visualized in Table 1.

Assignment, manifestation, and containment are called elementary abstract processes. The remaining four combinations thereof are called compound abstract processes.

Closed-self and open-self polarities are opposites. They are called boundary polarities. Closed-others and open-others polarities also are opposites. They are called engagement polarities.

Most Arabic word roots are strings of three consonants each. There are rules to convert any word root into an abstract mathematical mapping such as f: X ==> Y or f(x). The seven abstract processes (Table 1) have a precedence order that is shown in Table 2. Consonants that refer to processes with higher precedence play the role of function such as f of the mapping while the remaining consonants play the role of domain X or range Y of the mapping.

Table 1. Abstract objects of Arabic consonants

	P O L A R I T Y
P R O C E S S	closed-self	open-self	closed-others	open-others
assignment	ya	hamza	waw	ha
manifestation	meem	fa	dal	thal
containment	‘ain	noon	qaf	ghain
assignment of manifestation	ra	lam	ba	ta
assignment of containment	seen	zay	ssad	tha
manifestation of containment	kaf	ddad	tta	kha
assignment & manifestation of containment	hha	sheen	geem	zza

Table 2. Descending order of process precedence

assignment

assignment of manifestation

assignment of containment

assignment & manifestation of containment

manifestation

manifestation of containment

containment

For example, the root “kaf lam meem” (speech) has a mapping of the form f: X ==> Y, i.e.,

“kaf lam meem” has the mapping lam: kaf ==> meem

because lam has open-self polarity and higher precedence than kaf or meem. Table 3 lists 12 possible types of word root mappings and explains the rules for generating mappings out of roots.

Table 3. Types of word root mappings

1. Forward mapping Function consonant f has open-self polarity and higher precedence than domain consonant X and range consonant Y.	f : X ==> Y
2. Backward mapping Consonant f has closed-self polarity and higher precedence than consonants X and Y.	f : X <== Y
3. Engagement mapping Consonant f has closed-others polarity and higher precedence than consonants X and Y.	f : X <==> Y
4. Disengagement mapping Consonant f has open-others polarity and higher precedence than consonants X and Y.	f : X >==<>
5. Mapping with square domain and unspecified range Consonant f has higher precedence than duplicate consonant x.	f( x2 )
6. Mapping with unspecified range First or third consonant is ya, hamza or waw that is dropped in some word forms (it appears as ya, hamza or waw in root), and consonant f has higher precedence than consonant x.	f( x )
7. Composition with unspecified range Consonants f and g are not first and third in root, are from the same row of Table 1, and have higher precedence than consonant x.	f( g( x ) )
8. Parallel functions, unspecified range Consonants f and g are first and third in the root, are from same row of Table 1, and have higher precedence than consonant x.	f( x ) & g( x )
9. Parallel functions with unspecified domain & range Second consonant is ya, hamza or waw that is dropped in some word forms (it appears as ya, hamza or waw in root).	f( ) & g( )
10. Composition with unspecified domain & range First or third consonant is ya, hamza or waw that is dropped in some word forms (it appears as ya, hamza or waw in root) and consonants f and g are from the same row of Table 1.	f( g( ) )
11. Double composition with unspecified domain & range All three consonants are from same row of Table 1.	f( g( h( ) ) )
12. Mapping with unspecified domain and range Root contains two occurrences of ya, hamza or waw that are dropped in some word forms (they appear as ya, hamza or waw in root).	f( )

Abstract polarities and processes have many concrete realizations. Tables 4 and 5 list common realizations of polarities and processes, respectively.

Table 4. Common realizations of abstract polarities

closed-self	open-self	closed-others	open-others
a certain . . . backward complementary complete defined familiar independent inward old one’s own oneself the past perfect personal positive preservation private react receive repeat restrain self self-contained valid well-defined	another (not self) arbitrary deficient directed at others discretionary empty forward the future incomplete invalid lacking loose negative new offer open to others open-ended others (not self) one to turn to outward public release send toward others uncertain undefined unfamiliar unleash unspecified violation vulnerable	balance combine common compare connect constructive continue dual engaged equal general include integrate internal isolate join meet moderate multiple mutual pending the present reciprocal shared together within environment	beyond environment choose contrast cut destructive disconnect disengage distinguish exchange excessive exclude exclusive external imbalance separate special specific specify stop target third-party unengaged unequal

Table 5. Common realizations of abstract processes

assignment	attach, connect, designate, determine, to direct, an element, identify, identity, link, point, to project, signal, a unit
manifestation	action, active, activity, agency, agent, appearance, apply, attitude, display, entity, essence, event, execute, to experience, express, feel, form, fulfill, instrument, interpret, manner, mass, matter, method, number, person, phenomenon, place, realization, shape, space, status, substance, time, translate
containment	command, container, content, data, energy, force, information, an instruction, law, number, order, power, quantity, rule, volume, weight, word
assignment of manifestation (combine first & second rows)	belong (assign place), decision (assign action), directed action, implement (determine realization), interpretative link, placement (assign place), project manifestation/form, relationship (connect by activity), set (elements in a place)
assignment of containment (combine first & third rows)	assessment (assign quantity), attack (directed force), fill (assign content), lodge (assign container), measure (assess), posture (assign order), sequence (assign order), statement (assign words), stream (sequence), structure (assign order)
manifestation of containment (combine second & third rows)	algorithm (execute laws), apply law, apply force, consequence, control (manifestation of order), controller, effort (apply energy), display of force, field (force in space), form of energy, mapping (execute, realize law), powerful agent, sovereign area (space of power), theory (interpretation of law)
assignment & manifestation of containment (combine first three rows)	behavior (process), experience, living being (system), mechanism (process), motion, object (static view of process), organism, process (assignment and manifestation of control), system (process), systemic, thing (object)

Table 1 was created for the sounds of English and other languages. However, not all the cells of the table could be filled for any language other than Arabic. Table 6 is the equivalent of Table 1 for English.

Table 6. Abstract objects of English sounds

	P O L A R I T Y
P R O C E S S	closed-self	open-self	closed-others	open-others
assignment	i-, y-, j	a-	o-, u-, v, w	e-, h
manifestation	m	f, p, ph	d	th
containment		n, gn, kn	q, cq	ng, nk, nc
assignment of manifestation	r	l	b	t
assignment of containment	s	z	c, ck
manifestation of containment	k			x, gh, ch
assignment & manifestation of containment		sh	g

ALGORITHM C

AN ALGORITHM TO DEVELOP A SCIENTIFIC THEORY FROM WORD ROOT SEMANTICS

The following procedure is an implementation of the Scientific Method using our Theory of Semantics.

Algorithm C. Procedure to develop a theory to explain a certain phenomenon to which a certain word root refers

Step 1. Generate abstract theory from chosen word root. Use Tables 1-3 to convert the chosen word root into a mapping. Use Table 1 to verbally express the mapping in abstract processes and abstract polarities. This expression is an abstract theory about some aspects of the nature of the phenomenon to which the word root refers. The abstract processes that correspond to the domain and range of the mapping are abstract hypotheses about the nature of some elements of the phenomenon. The abstract polarities are abstract hypotheses about the attributes of these elements. The abstract processes that correspond to the functions of the mapping are abstract hypotheses about the nature of the relationships between these elements of the phenomenon.

Step 2. Make predictions. Make predictions—that are not likely to be observed (try to disprove the theory)—based on the abstract theory from Step 1, or—more likely—based on a concrete theory (obtained by substituting abstract elements with their realizations) that was created in Step 3.

Step 3. Test proposed theory and generate alternative concrete theories using Tables 4 and 5. Compare predictions with collected observations about the phenomenon and try to find a mismatch. If one prediction is not confirmed by observation, replace one or more polarities or processes from the theory with realizations from Tables 4 and 5, or with new realizations that are based on these tables or on the original abstract concepts, and then return to Step 2 to test this alternative concrete theory. If all predictions are confirmed by observations, then also return to Step 2 and make new predictions. If, for a fixed version of the theory, many predictions are made and all of them are confirmed by observation, then consider the proposed theory as corroborated theory. If later observations or corroborated theories about related phenomena clash with this theory, then revise the theory using alternative realizations and return to Step 2.

THEORY OF COGNITION

Our Theory of Cognition is an implementation of the Theory of Semantics and Algorithm C.

1. Verbalization of a word root mapping is an abstract theory. The names of the abstract processes and polarities to which a word root refers are abstract hypotheses about some aspects of the nature of the phenomenon to which the word root refers. If a word root mapping is expressed using the names of its abstract components, then an abstract theory about some aspects of the nature of that phenomenon is obtained.

2. Concrete theories. If some of the abstract processes or polarities in an abstract theory that expresses a word root are substituted with realizations from Tables 4 and 5 or with similar realizations, the result is a concrete theory about some aspects of the nature of the phenomenon to which the word root refers.

3. Applicability of Algorithm C. Algorithm C can be used to attempt to corroborate abstract theories and concrete theories.

4. Every concrete theory is promising. Every concrete theory is promising, i.e., likely to be corroborated by Algorithm C. In other words, Algorithm C is efficient.

5. Single abstract theory may spawn multiple corroborated theories (ambiguity and polysemy). Multiple concrete theories that are derived from a single word root can be corroborated. This implies that every word root is polysemous (ambiguous). Polysemy means that a word root refers to different objects in different contexts.

6. Incompleteness of theories (synonymy and homonymy). Every abstract theory is incomplete in that it and all concrete theories derived from it put together do not explain everything about the phenomenon to which the corresponding word root refers. Different word roots may refer to the same phenomenon (synonyms, homonyms and equivalent word roots in other languages) in such a way that the resulting abstract theories may complement each other in explaining the phenomenon. Consequently, the sum of all abstract and concrete theories about any phenomenon also is incomplete. But some word roots, particularly three-consonant Arabic word roots, may indicate stronger theories than others, i.e., theories that explain more aspects of a phenomenon.

7. Convergence to field ontology. If Algorithm C is applied to many word roots that refer to the phenomena in a specific field of study, then the resulting corroborated theories will share realizations of abstract components in such a manner that the whole field of study will have an integrated and consistent theory—a field ontology.

8. Field ontology supports preservation of phenomena in field according to precedence rules. The order of precedence of Table 2 is propagated into every field ontology involving natural phenomena in such a manner that the preservation of the natural phenomena is supported by the ontology according to rules of precedence.