I need help with explaining this task:
We have a set of first order sentences not involving =. Show that if
this set is satisfiable in a finite universe, then it is satisfiable in
an infinite universe.
How can I make universe wider?


I need help with explaining this task:
We have a set of first order sentences not involving =. Show that if
this set is satisfiable in a finite universe, then it is satisfiable in
an infinite universe.
How can I make universe wider?







Atreides wrote:
> I need help with explaining this task:
> We have a set of first order sentences not involving =. Show that if
> this set is satisfiable in a finite universe, then it is satisfiable in
> an infinite universe.
> How can I make universe wider?
Try adding in an infinite number of "copies" of one of the objects
already in the domain ….
Peter_Smith wrote:
> Atreides wrote:
> > I need help with explaining this task:
> > We have a set of first order sentences not involving =. Show that if
> > this set is satisfiable in a finite universe, then it is satisfiable in
> > an infinite universe.
> > How can I make universe wider?
> Try adding in an infinite number of "copies" of one of the objects
> already in the domain ….
Is it possible? I mean, is it OK to add the same objects to the domain?
Or we can just add them and rename?
- Hide quoted text — Show quoted text -
Atreides wrote:
> Peter_Smith wrote:
> > Atreides wrote:
> > > I need help with explaining this task:
> > > We have a set of first order sentences not involving =. Show that if
> > > this set is satisfiable in a finite universe, then it is satisfiable in
> > > an infinite universe.
> > > How can I make universe wider?
> > Try adding in an infinite number of "copies" of one of the objects
> > already in the domain ….
> Is it possible? I mean, is it OK to add the same objects to the domain?
> Or we can just add them and rename?
Hint2: Think about adding new objects, but which ones which are copies
in the sense of indiscriminable by predicates which occur in the given
set of sentences …