Switch to: References

Add citations

You must login to add citations.
  1. The strength of countable saturation.Benno van den Berg, Eyvind Briseid & Pavol Safarik - 2017 - Archive for Mathematical Logic 56 (5-6):699-711.
    In earlier work we introduced two systems for nonstandard analysis, one based on classical and one based on intuitionistic logic; these systems were conservative extensions of first-order Peano and Heyting arithmetic, respectively. In this paper we study how adding the principle of countable saturation to these systems affects their proof-theoretic strength. We will show that adding countable saturation to our intuitionistic system does not increase its proof-theoretic strength, while adding it to the classical system increases the strength from first- to (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  • 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  
  • Nonstandard arithmetic and reverse mathematics.H. Jerome Keisler - 2006 - Bulletin of Symbolic Logic 12 (1):100-125.
    We show that each of the five basic theories of second order arithmetic that play a central role in reverse mathematics has a natural counterpart in the language of nonstandard arithmetic. In the earlier paper [3] we introduced saturation principles in nonstandard arithmetic which are equivalent in strength to strong choice axioms in second order arithmetic. This paper studies principles which are equivalent in strength to weaker theories in second order arithmetic.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  • Hyperfinite models of adapted probability logic.H. Jerome Keisler - 1986 - Annals of Pure and Applied Logic 31:71-86.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • The Mathematical Intelligencer Flunks the Olympics.Alexander E. Gutman, Mikhail G. Katz, Taras S. Kudryk & Semen S. Kutateladze - 2017 - Foundations of Science 22 (3):539-555.
    The Mathematical Intelligencer recently published a note by Y. Sergeyev that challenges both mathematics and intelligence. We examine Sergeyev’s claims concerning his purported Infinity computer. We compare his grossone system with the classical Levi-Civita fields and with the hyperreal framework of A. Robinson, and analyze the related algorithmic issues inevitably arising in any genuine computer implementation. We show that Sergeyev’s grossone system is unnecessary and vague, and that whatever consistent subsystem could be salvaged is subsumed entirely within a stronger and (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • A theory of hyperfinite sets.P. V. Andreev & E. I. Gordon - 2006 - Annals of Pure and Applied Logic 143 (1-3):3-19.
    We develop an axiomatic set theory — the Theory of Hyperfinite Sets THS— which is based on the idea of the existence of proper subclasses of large finite sets. We demonstrate how theorems of classical continuous mathematics can be transfered to THS, prove consistency of THS, and present some applications.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations