IST is more than an algorithm to prove ZFC theorems

Mathematics – Logic

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

There is a sentence in the language of IST, Nelson's internal set theory, which is not equivalent in IST to a sentence in the ZFC language. Thus the Reduction algorithm of Nelson, that converts bounded IST formulas with standard parameters to provably (in IST) equivalent formulas in the ZFC language, cannot be extended to all formulas of the IST language. Therefore, certain IST sentences are "meaningless" from the point of view of the standard universe.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

IST is more than an algorithm to prove ZFC theorems 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 IST is more than an algorithm to prove ZFC theorems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and IST is more than an algorithm to prove ZFC theorems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-609961

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.