First Order Logic

  • #1
ver_mathstats
253
21
Homework Statement:
Let sigma = {a,b,c} be a finite alphabet. Construct formulas that specify the following languages over sigma.
Relevant Equations:
sigma = {a,b,c}
An example we were given is as follows: {ua|u∈∑*} (where ∑* is set of all words over ∑) so we have ∀x. last(x) → a(x).

I am given {awa|w∈∑*} to do, and I know that I have to express that a is the first letter and last letter in a word. Could I write it as:
∀x,y ( a(x) ∧ a(y) ∧ x<y → ∃z(x<z<y)), am I on the right track with this, any help would be appreciated, thank you.
 

Answers and Replies

Suggested for: First Order Logic

Replies
8
Views
158
Replies
5
Views
298
Replies
4
Views
586
Replies
12
Views
685
Replies
2
Views
587
Replies
15
Views
869
Replies
4
Views
514
Replies
3
Views
635
Replies
6
Views
1K
  • Last Post
Replies
4
Views
204
Top