MHB How to Create Symbolic Versions of Statements in Formal Language

  • Thread starter Thread starter Valtham
  • Start date Start date
AI Thread Summary
To convert the statement "Each of our representatives has at least one customer that is located in Japan" into symbolic form, it is essential to define the appropriate signature. The suggested signature includes R(x) for representatives, C(x) for customers, W(x, y) for the representative-customer relationship, L(x, y) for location, and a constant j representing Japan. The confusion arises around how to represent Japan, with the consensus leaning towards treating it as a constant rather than a set or an if-and-only-if statement. The symbolic representation could be structured as "For all x (R(x) → ∃y (C(y) ∧ W(x, y) ∧ L(y, j)))". This approach emphasizes the need for a clear signature to accurately translate English statements into formal language.
Valtham
Messages
3
Reaction score
0
Currently I am trying to convert a statement into symbolic version. The following statement:

"Each of our representatives has at least one customer that is located in Japan."

I'm a little confused about this because I'm not sure how I would represent "Japan" in the symbolic version. At the moment I would say "For all y, there exists x in Japan." Should I treat Japan as a set, or would I treat it like an iff statement? I can't find the tool to write equations or I would write in symbolic form.
 
Physics news on Phys.org
The result of turning an English statement into symbolic form depends on the formal language, also called the signature, that you have. I would prefer the problem statement provided a signature because otherwise there are too many possible answers.

I think the following signature is appropriate here.

R(x): x is a representative

C(x): x is a customer

W(x, y): x works with y, i.e., x and y have a representative-customer relation

L(x, y): x is located in y

j: Japan (j is a constant).
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top