# 6.5 First-order axioms for waterworld

 Page 1 / 1
The domain axioms of WaterWorld in first-order logic.

We summarize the details of how we choose to model WaterWorld boards in first-order logic: exactly what relations we make up, and the formaldomain axioms which capture the game's rules.

This will follow almost exactly the same pattern as our WaterWorld model in propositional logic . However, we will take advantage of the additional flexibility providedby first-order logic.

Rather than modeling only the default 64 WaterWorld board;, we will be able to model any board representable by our relations.This will allow boards of any size and configuration, with one major constrainteach location can have at most three neighboring pirates.

## Domain and relations

Our domain is simply the set of all board locations. This set can be arbitrarily largeeven infinite!

The board configuration is given by the binaryneighborrelation $\mathrm{nhbr}$ .

The next relations correspond directly to the propositions in the propositional logic model.

• Whether or not a location contains a pirate: $\mathrm{safe}$ . This is a unary relation.
We choose not to include a redundant relation $\mathrm{unsafe}$ .
• Unary relations indicating the number of neighboring pirates: $\mathrm{has0}$ , $\mathrm{has1}$ , $\mathrm{has2}$ , and $\mathrm{has3}$ .
Thus, we have our restriction to three unsafe neighbors. This will also be reflected in our domain axioms below. See also this problem for a discussion of how to avoid this restriction.

In addition, to have encode the domain axioms for an arbitrary domain, we also need an equality relation over our domain of locations.As is traditional, we will use infix notation for this relation, for example, $x=y$ . Furthermore, we will allow ourselves to write $x\neq y$ as shorthand for $\neg (x=y)$ . Thus, we do not need a distinct inequality relation.

Note that these relations describe the state of the underlying boardthe modeland not our particular view of it. Our particular view will be reflected in which formulaswe'll accept as premises. So we'll accept $\mathrm{has2}(A)$ as a premise only when $A$ has been exposed and shows a 2.

## The domain axioms

Many of our axioms correspond directly, albeit much more succinctly, with those of the propositional model. In addition, we have axioms that specify that our neighbor and equalityrelations are self-consistent.

Axioms asserting that the neighbor relation is anti-reflexive and symmetric:

• $\forall x\colon \neg \mathrm{nhbr}(x, x)$
• $\forall x\colon \forall y\colon \mathrm{nhbr}(x, y)\implies \mathrm{nhbr}(y, x)$

Axioms asserting that=truly is an equality relation, i.e. , it is reflexive, symmetric, and transitive.

• $\forall x\colon x=x$
• $\forall x\colon \forall y\colon (x=y)\implies (y=x)$
• $\forall x\colon \forall y\colon \forall z\colon ((x=y)\land (y=z))\implies (x=z)$

Axioms asserting that the neighbor counts are correct. Each of these is of the formif location $x$ has $n$ neighboring pirates, then there are $n$ distinct unsafe neighbors of $x$ , and any other distinct neighbor $x$ is safe.We use the equality relation to specify the distinctness of each neighbor.

• $\forall x\colon \mathrm{has0}(x)\implies \forall y\colon \mathrm{nhbr}(x, y)\implies \mathrm{safe}(y)$
• $\forall x\colon \mathrm{has1}(x)\implies \exists a\colon \mathrm{nhbr}(x, a)\land \neg \mathrm{safe}(a)\land \forall y\colon (\mathrm{nhbr}(x, y)\land (a\neq y))\implies \mathrm{safe}(y)$
• $\forall x\colon \mathrm{has2}(x)\implies \exists a\colon \exists b\colon \mathrm{nhbr}(x, a)\land \mathrm{nhbr}(x, b)\land (a\neq b)\land \neg \mathrm{safe}(a)\land \neg \mathrm{safe}(b)\land \forall y\colon (\mathrm{nhbr}(x, y)\land (a\neq y)\land (b\neq y))\implies \mathrm{safe}(y)$
• $\forall x\colon \mathrm{has3}(x)\implies \exists a\colon \exists b\colon \exists c\colon \mathrm{nhbr}(x, a)\land \mathrm{nhbr}(x, b)\land \mathrm{nhbr}(x, c)\land (a\neq b)\land (a\neq c)\land (b\neq c)\land \neg \mathrm{safe}(a)\land \neg \mathrm{safe}(b)\land \neg \mathrm{safe}(c)\land \forall y\colon (\mathrm{nhbr}(x, y)\land (a\neq y)\land (b\neq y)\land (c\neq y))\implies \mathrm{safe}(y)$

In addition, we want the implications to go the opposite way. Otherwise, each of $\mathrm{has0}$ , $\mathrm{has1}$ , $\mathrm{has2}$ , and $\mathrm{has3}$ could always be false, while still satisfying the above!For brevity, we elide the details in the following list:

• $\forall x\colon \forall y\colon \mathrm{nhbr}(x, y)\implies \mathrm{safe}(y)\implies \mathrm{has0}(x)$
• $\forall x\colon \text{}\implies \mathrm{has1}(x)$
• $\forall x\colon \text{}\implies \mathrm{has2}(x)$
• $\forall x\colon \text{}\implies \mathrm{has3}(x)$

Axioms asserting that the neighbor counts are consistent. While redundant, including axioms like the following can be convenient.

• $\forall x\colon \mathrm{has0}(x)\implies \neg (\mathrm{has1}(x)\lor \mathrm{has2}(x)\lor \mathrm{has3}(x))$
• $\forall x\colon \mathrm{has1}(x)\implies \neg (\mathrm{has0}(x)\lor \mathrm{has2}(x)\lor \mathrm{has3}(x))$
• $\forall x\colon \mathrm{has2}(x)\implies \neg (\mathrm{has0}(x)\lor \mathrm{has1}(x)\lor \mathrm{has3}(x))$
• $\forall x\colon \mathrm{has3}(x)\implies \neg (\mathrm{has0}(x)\lor \mathrm{has1}(x)\lor \mathrm{has2}(x))$

Note that this set of axioms is not quite complete, as explored in an exercise .

find the 15th term of the geometric sequince whose first is 18 and last term of 387
I know this work
salma
The given of f(x=x-2. then what is the value of this f(3) 5f(x+1)
hmm well what is the answer
Abhi
how do they get the third part x = (32)5/4
can someone help me with some logarithmic and exponential equations.
20/(×-6^2)
Salomon
okay, so you have 6 raised to the power of 2. what is that part of your answer
I don't understand what the A with approx sign and the boxed x mean
it think it's written 20/(X-6)^2 so it's 20 divided by X-6 squared
Salomon
I'm not sure why it wrote it the other way
Salomon
I got X =-6
Salomon
ok. so take the square root of both sides, now you have plus or minus the square root of 20= x-6
oops. ignore that.
so you not have an equal sign anywhere in the original equation?
hmm
Abhi
is it a question of log
Abhi
🤔.
Abhi
I rally confuse this number And equations too I need exactly help
salma
But this is not salma it's Faiza live in lousvile Ky I garbage this so I am going collage with JCTC that the of the collage thank you my friends
salma
Commplementary angles
hello
Sherica
im all ears I need to learn
Sherica
right! what he said ⤴⤴⤴
Tamia
hii
Uday
hi
salma
what is a good calculator for all algebra; would a Casio fx 260 work with all algebra equations? please name the cheapest, thanks.
a perfect square v²+2v+_
kkk nice
algebra 2 Inequalities:If equation 2 = 0 it is an open set?
or infinite solutions?
Kim
The answer is neither. The function, 2 = 0 cannot exist. Hence, the function is undefined.
Al
y=10×
if |A| not equal to 0 and order of A is n prove that adj (adj A = |A|
rolling four fair dice and getting an even number an all four dice
Kristine 2*2*2=8
Differences Between Laspeyres and Paasche Indices
No. 7x -4y is simplified from 4x + (3y + 3x) -7y
how do you translate this in Algebraic Expressions
Need to simplify the expresin. 3/7 (x+y)-1/7 (x-1)=
. After 3 months on a diet, Lisa had lost 12% of her original weight. She lost 21 pounds. What was Lisa's original weight?
what's the easiest and fastest way to the synthesize AgNP?
China
Cied
types of nano material
I start with an easy one. carbon nanotubes woven into a long filament like a string
Porter
many many of nanotubes
Porter
what is the k.e before it land
Yasmin
what is the function of carbon nanotubes?
Cesar
I'm interested in nanotube
Uday
what is nanomaterials​ and their applications of sensors.
what is nano technology
what is system testing?
preparation of nanomaterial
Yes, Nanotechnology has a very fast field of applications and their is always something new to do with it...
what is system testing
what is the application of nanotechnology?
Stotaw
In this morden time nanotechnology used in many field . 1-Electronics-manufacturad IC ,RAM,MRAM,solar panel etc 2-Helth and Medical-Nanomedicine,Drug Dilivery for cancer treatment etc 3- Atomobile -MEMS, Coating on car etc. and may other field for details you can check at Google
Azam
anybody can imagine what will be happen after 100 years from now in nano tech world
Prasenjit
after 100 year this will be not nanotechnology maybe this technology name will be change . maybe aftet 100 year . we work on electron lable practically about its properties and behaviour by the different instruments
Azam
name doesn't matter , whatever it will be change... I'm taking about effect on circumstances of the microscopic world
Prasenjit
how hard could it be to apply nanotechnology against viral infections such HIV or Ebola?
Damian
silver nanoparticles could handle the job?
Damian
not now but maybe in future only AgNP maybe any other nanomaterials
Azam
Hello
Uday
I'm interested in Nanotube
Uday
this technology will not going on for the long time , so I'm thinking about femtotechnology 10^-15
Prasenjit
can nanotechnology change the direction of the face of the world
At high concentrations (>0.01 M), the relation between absorptivity coefficient and absorbance is no longer linear. This is due to the electrostatic interactions between the quantum dots in close proximity. If the concentration of the solution is high, another effect that is seen is the scattering of light from the large number of quantum dots. This assumption only works at low concentrations of the analyte. Presence of stray light.
the Beer law works very well for dilute solutions but fails for very high concentrations. why?
how did you get the value of 2000N.What calculations are needed to arrive at it
Privacy Information Security Software Version 1.1a
Good
Got questions? Join the online conversation and get instant answers!