1. A process, residing in the memory of a wireless mobile communication terminal, or a Smartphone, or a cellular telephone, that is used to invoke a compound wireless mobile communication service, or a Smartphone app, or an app, when a combination of events that either occur or events that do not occur result in a “True” evaluation of a Boolean expression causing the compound wireless mobile communication service to commence its execution, where the Boolean expression is associated with the compound wireless mobile communication service and is contained within an Invoke facility service; wherein the contained Boolean expression is built with events interconnected by the logical connectives of “And”, “Or”, “Not”, “If X, Then Y”, “And Then”; wherein the negation operation “Not” establishes a contradictory event, signifying that an event and its contradictory event are both considered to be events, where if the event did not occur or “False”, then its contradictory event did occur or “True” and conversely; with “And Then” logically equivalent to “And”; whereas, “And Then” includes a sequential implication for testing the occurrence of events; as in the Boolean expression “Preceding Expression And Then Following Expression”, for which “Preceding Expression” and “Following Expression” are both logic expressions each containing one or more events, wherein the events within “Preceding Expression” are tested for occurrences prior to testing occurrences of the events within “Following Expression”; where both logic expressions contain events or their contradictory events and these events are observed by or communicated to the wireless mobile communication terminal, or a Smartphone, or a cellular telephone, wherein a category of events or their contradictions result from the geographic spatial position of a wireless mobile terminal, or a Smartphone, or a cellular telephone, or the geographic spatial position of a communicating remote wireless mobile terminal, and with respect to whether the position is within one or more specified boundaries, or is outside one or more specified boundaries, or a combination of being within one or more specified boundaries and outside one or more specified boundaries; allowing for two dimensional boundaries, or three dimensional boundaries, or a combination of two dimensional boundaries and three dimensional boundaries, for which two dimensional boundaries are of a circular shape or in the shape of a polygonal, and three dimensional boundaries are of a spherical shape or in the shape of a polyhedron; wherein the boundary orientations overlap, have contiguous boundary edges, are contained within one another, are separated, or any combination of these orientations; where a polygon is a construction of straight lines on Cartesian coordinates, having the form Y=mX+b, whereby the equations define a closed figure in a plane, identified by set of geographic points in that plane; with each point being a pair (x, y) connected to exactly two edges, with as many edges as points, where no edges intersect at other than at the prescribed set of geographical points , and the edges enclose an area concluding at an edge subtended from the final point to the first point; with an event occurrence of either the wireless mobile terminal being moved outside the polygon's boundary or being moved inside the polygon's boundary; whereby an n-tuple of successive points, of the form ((x 1 , y 1 ), (x 2 , y 2 ), (x 3 , y 3 ),. .. , (x n , y n )), imply the boundary of the polygon; wherein the subscripts of the pairs are indicative of the sequence of the presented points to indicate the edges of the polygon between successive points, by means of performing the steps: a) for i=1,. . .,n−1, identify point (x i , y i ); b) for i=1,. .. ,n−1 compute and connect a straight line, of the form Y=mX+b, between the point (x i , y i ) and the point (x i+1 , y i+1 ); c) compute and connect a straight line, of the form Y=mX+b, between point (x n , y n ) and (x 1 , y 1 ); wherein the line intersections are only to take place at the specified boundary intersecting points and only for a consecutive pair of straight lines, according to the point subscripts, for a correctly prescribed polygon, whereby erroneous intersections of straight line segments are determined by incorporating an algorithm that ascertains if the equations of two straight lines, each between a pair of specified points in the same plane, erroneously intersect at other than their segment's specified end points by performance of the following steps: step 1—for i=1,. .. , n−1(iterating after step 3 or step 6), use the points (x i , y i ) and (x i+1 , y i+1 ) to select a straight line equation Y i =m i x+b i ,; where m k =(y k+l‘, y k ) / (x k+‘ 1 x i ) and b i =(x i+ , y i −x i y i+ 1)/(x i+ 1−x,); step 2—for k =i 1,. .. ,n (iterating after step 3—or step 6), use the points (x k , y k ) and (x k , y k ) to select a straight line equation Y k =m k x +b k ; where m k =(y k+1 y k ) / x k ) and b k =(x k+ 1 y k x k y k+1 −X k ); step 3 if m i =m k , increment “i” by one and return to step 1 (the lines are parallel and do not intersect); step 4—otherwise, compute the potential intersection point for the straight lines of Y i and Y k ; from x n , =(b k b i ) / (m i m k ) and y n , =(b k m i b i m k ) / (m i m k ); step 5—if the point (x m , y n ,) is simultaneously between the pair of points ((x i , y i ), (x 1+1 , Yi+1 )) and between the pair of points ((x k , y k ), (x k+1 , y k+1 )), then warn the Invoke facility service builder that the straight line segment data corresponding to y 1 and y k intersect at other than end points, then permit the Invoke facility service builder to revise entries and go to step 7; step 6—if the point y n ,) is not simultaneously between the pair of points ((x i , y i ), (x 1+1 , y i+1 )) and between the pair of points ((x k , y k ), (x k+1 , y k+1 )), then increment “i” by one and return to step 1 (the lines do not intersect); step 7—re-start the polygon construction algorithm, if the Invoke facility service builder elected to revise entries or otherwise stop the polygon generation; wherein a Boolean expression can also include the following events or their contradictions: A) visual events such as a) the retina of an eye, b) a door opening, c) a license plate number, d) a fire, e) an explosion, f) a bolt of lightning, g) a bar code, h) a person's face, i) an automobile, j) a gun, k) an animal; B) status events as a) heart pacer malfunction occurred, b) blood monitor sensed excessive glucose level, c) insulin pump level below threshold, d) epileptic seizure sensed, e) stroke precursor symptom(s) observed, f) heart rate is dangerous, g) temperature level above threshold, h) carbon monoxide level dangerous, i) smoke level suggests fire, j) vehicle engine is running, k) vehicle speed is above a set maximum, I) vehicle brake fluid low, m) vehicle engine malfunction warning, n) accelerometer sensed impact, o) heating system malfunctioned, p) home alarm system is triggered, q) breathing support system operating unsatisfactorily, r) password protection is violated, s) credit card charge beyond maximum, t) bank transfer beyond maximum, u) check cashed beyond maximum, v) sale made, w) purchase made; C) audio events such as a) a vehicle engine running, b) glass being broken, c) an automobile crash, d) a child crying, e) an explosion, f) the sound of thunder, g) the sound of gushing wind, h) the sound of falling rain, i) the sound of falling hail, j) a person's scream, k) a dog barking, l) screeching tires, m) an alarm siren, n) a gunshot, o) footsteps, p) a turning door knob, q) a door closing.