Switch to: References

Add citations

You must login to add citations.
  1. Nonstandard methods in combinatorics and theoretical computer science.M. M. Richter & M. E. Szabo - 1988 - Studia Logica 47 (3):181 - 191.
  • Some nonstandard methods in combinatorial number theory.Steven C. Leth - 1988 - Studia Logica 47 (3):265 - 278.
    A combinatorial result about internal subsets of *N is proved using the Lebesgue Density Theorem. This result is then used to prove a standard theorem about difference sets of natural numbers which provides a partial answer to a question posed by Erdös and Graham.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Sequences in countable nonstandard models of the natural numbers.Steven C. Leth - 1988 - Studia Logica 47 (3):243 - 263.
    Two different equivalence relations on countable nonstandard models of the natural numbers are considered. Properties of a standard sequence A are correlated with topological properties of the equivalence classes of the transfer of A. This provides a method for translating results from analysis into theorems about sequences of natural numbers.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations