A definability theorem for first order logic

Details A definability theorem for first order logic A definability theorem for first order logic

1997-06-12

arxiv.org/abs/math/9706206v1

Mathematics

Logic

Scientific paper

For any first order theory T we construct a Boolean valued model M, in which precisely the T--provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order formula. Our presentation is entirely selfcontained, and only requires familiarity with the most elementary properties of model theory.

Affiliated with

Also associated with

No associations

Rating

A definability theorem for first order logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A definability theorem for first order logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A definability theorem for first order logic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-466731