First order logic

  • Thread starter kazuyak
  • Start date
  • #1
4
0
Let L = {f } be a first-order language containing a unary function
symbol f , and no other non-logical symbols.
1.Write down a sentence χ of L which is satisfiable in some structure
with an infinite domain but is false in every structure with a finite domain.
What can you say about the size of the domains of the models of the sentence
2.Write down a sentence ρ such that whenever A |= ρ and A is finite,
then A contains an even number of elements and, further, every finite set
with an even number of elements is the domain of some model of ρ. What
can you say about the size of the domains of the models of the sentence ¬ρ?

Could anyone please give me some hints how to deal with this problem? I'm not sure where to start. Any help is appreciated!
 

Answers and Replies

  • #2
Does your definition of a first order language include the symbol "=", and is this to be interpreted as the identity in the models (i.e. are they "normal" models)?
 

Related Threads on First order logic

  • Last Post
Replies
0
Views
155
  • Last Post
Replies
3
Views
2K
  • Last Post
Replies
15
Views
3K
  • Last Post
Replies
6
Views
2K
Replies
10
Views
2K
Replies
35
Views
2K
Replies
3
Views
1K
Replies
0
Views
994
Replies
16
Views
2K
Replies
3
Views
484
Top