Search results for 'Number theory' (try it on Scholar)

1000+ found
Sort by:
See also:
  1. Renling Jin (2000). Applications of Nonstandard Analysis in Additive Number Theory. Bulletin of Symbolic Logic 6 (3):331-341.score: 240.0
    This paper reports recent progress in applying nonstandard analysis to additive number theory, especially to problems involving upper Banach density.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  2. Sue Ann Toledo (1975). Tableau Systems for First Order Number Theory and Certain Higher Order Theories. Springer-Verlag.score: 210.0
     
    My bibliography  
     
    Export citation  
  3. Erasmo Recami (1983). A Modified Large Number Theory Withconstant G. Foundations of Physics 13 (3):341-346.score: 180.0
    The inspiring “numerology” uncovered by Dirac, Eddington, Weyl,et al. can be explained and derived when it is slightly modified so to connect the “gravitational world” (cosmos) with the “strong world” (hadron), rather than with the electromagnetic one.The aim of this note is to show the following. In the present approach to the “Large Number Theory,” cosmos and hadrons are considered to be (finite)similar systems, so that the ratio ${{\bar R} \mathord{\left/ {\vphantom {{\bar R} {\bar r}}} \right. \kern-0em} {\bar (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  4. Jeremy Avigad (2003). Number Theory and Elementary Arithmetic. Philosophia Mathematica 11 (3):257-284.score: 180.0
    is a fragment of first-order aritlimetic so weak that it cannot prove the totality of an iterated exponential fimction. Surprisingly, however, the theory is remarkably robust. I will discuss formal results that show that many theorems of number theory and combinatorics are derivable in elementary arithmetic, and try to place these results in a broader philosophical context.
    Direct download (13 more)  
     
    My bibliography  
     
    Export citation  
  5. J. Ellenberg & E. Sober (2011). Objective Probabilities in Number Theory. Philosophia Mathematica 19 (3):308-322.score: 180.0
    Philosophers have explored objective interpretations of probability mainly by considering empirical probability statements. Because of this focus, it is widely believed that the logical interpretation and the actual-frequency interpretation are unsatisfactory and the hypothetical-frequency interpretation is not much better. Probabilistic assertions in pure mathematics present a new challenge. Mathematicians prove theorems in number theory that assign probabilities. The most natural interpretation of these probabilities is that they describe actual frequencies in finite sets and limits of actual frequencies in (...)
    Direct download (12 more)  
     
    My bibliography  
     
    Export citation  
  6. J. Michael Dunn (1979). A Theorem in 3-Valued Model Theory with Connections to Number Theory, Type Theory, and Relevant Logic. Studia Logica 38 (2):149 - 169.score: 180.0
    Given classical (2 valued) structures and and a homomorphism h of onto , it is shown how to construct a (non-degenerate) 3-valued counterpart of . Classical sentences that are true in are non-false in . Applications to number theory and type theory (with axiom of infinity) produce finite 3-valued models in which all classically true sentences of these theories are non-false. Connections to relevant logic give absolute consistency proofs for versions of these theories formulated in relevant logic (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  7. Alessandro Berarducci & Benedetto Intrigila (1991). Combinatorial Principles in Elementary Number Theory. Annals of Pure and Applied Logic 55 (1):35-50.score: 174.0
    We prove that the theory IΔ0, extended by a weak version of the Δ0-Pigeonhole Principle, proves that every integer is the sum of four squares (Lagrange's theorem). Since the required weak version is derivable from the theory IΔ0 + ∀x (xlog(x) exists), our results give a positive answer to a question of Macintyre (1986). In the rest of the paper we consider the number-theoretical consequences of a new combinatorial principle, the ‘Δ0-Equipartition Principle’ (Δ0EQ). In particular we give (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  8. Marcus Alfred, Petero Kwizera, James V. Lindesay & H. Pierre Noyes (2004). A Nonperturbative, Finite Particle Number Approach to Relativistic Scattering Theory. Foundations of Physics 34 (4):581-616.score: 156.0
    We present integral equations for the scattering amplitudes of three scalar particles, using the Faddeev channel decomposition, which can be readily extended to any finite number of particles of any helicity. The solution of these equations, which have been demonstrated to be calculable, provide a nonperturbative way of obtaining relativistic scattering amplitudes for any finite number of particles that are Lorentz invariant, unitary, cluster decomposable and reduce unambiguously in the nonrelativistic limit to the nonrelativistic Faddeev equations. The aim (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  9. Christopher Norris (2002). Putnam, Peano, and the Malin Génie: Could We Possibly Bewrong About Elementary Number-Theory? [REVIEW] Journal for General Philosophy of Science 33 (2):289-321.score: 156.0
    This article examines Hilary Putnam's work in the philosophy of mathematics and - more specifically - his arguments against mathematical realism or objectivism. These include a wide range of considerations, from Gödel's incompleteness-theorem and the limits of axiomatic set-theory as formalised in the Löwenheim-Skolem proof to Wittgenstein's sceptical thoughts about rule-following (along with Saul Kripke's ‘scepticalsolution’), Michael Dummett's anti-realist philosophy of mathematics, and certain problems – as Putnam sees them – with the conceptual foundations of Peano arithmetic. He also (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  10. Toby Ord, Representations of Ω in Number Theory: Finitude Versus Parity.score: 156.0
    We present a new method for expressing Chaitin’s random real, Ω, through Diophantine equations. Where Chaitin’s method causes a particular quantity to express the bits of Ω by fluctuating between finite and infinite values, in our method this quantity is always finite and the bits of Ω are expressed in its fluctuations between odd and even values, allowing for some interesting developments. We then use exponential Diophantine equations to simplify this result and finally show how both methods can also be (...)
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  11. Wolfram Pohlers (1998). Subsystems of Set Theory and Second Order Number Theory. In Samuel R. Buss (ed.), Handbook of Proof Theory. Elsevier. 137--209.score: 156.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  12. Manfred Szabo (1970). On the Original Gentzen Consistency Proof for Number Theory. In A. Kino, John Myhill & Richard Eugene Vesley (eds.), Intuitionism and Proof Theory. Amsterdam,North-Holland Pub. Co.. 409.score: 156.0
    No categories
     
    My bibliography  
     
    Export citation  
  13. Steven C. Leth (1988). Some Nonstandard Methods in Combinatorial Number Theory. Studia Logica 47 (3):265 - 278.score: 152.0
    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 (5 more)  
     
    My bibliography  
     
    Export citation  
  14. Colin Mclarty (2010). What Does It Take to Prove Fermat's Last Theorem? Grothendieck and the Logic of Number Theory. Bulletin of Symbolic Logic 16 (3):359-377.score: 150.0
    This paper explores the set theoretic assumptions used in the current published proof of Fermat's Last Theorem, how these assumptions figure in the methods Wiles uses, and the currently known prospects for a proof using weaker assumptions.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  15. T. M. Scanlon (1973). The Consistency of Number Theory Via Herbrand's Theorem. Journal of Symbolic Logic 38 (1):29-58.score: 150.0
  16. S. C. Kleene (1945). On the Interpretation of Intuitionistic Number Theory. Journal of Symbolic Logic 10 (4):109-124.score: 150.0
  17. Hilary Putnam (1960). An Unsolvable Problem in Number Theory. Journal of Symbolic Logic 25 (3):220-232.score: 150.0
  18. R. L. Goodstein (1947). Transfinite Ordinals in Recursive Number Theory. Journal of Symbolic Logic 12 (4):123-129.score: 150.0
  19. Yvon Gauthier (1978). Foundational Problems of Number Theory. Notre Dame Journal of Formal Logic 19 (1):92-100.score: 150.0
  20. Yvon Gauthier (2008). From Fermat to Gauss: Indefinite Descent and Methods of Reduction in Number Theory Paolo Bussotti Augsburg, Erwin Rauner Verlag, 2006, 574 p. [REVIEW] Dialogue 47 (02):411-.score: 150.0
    Translate to English
    | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  21. G. Kreisel (1952). On the Interpretation of Non-Finitist Proofs: Part II. Interpretation of Number Theory. Applications. Journal of Symbolic Logic 17 (1):43-58.score: 150.0
  22. B. Mazur (1994). Questions of Decidability and Undecidability in Number Theory. Journal of Symbolic Logic 59 (2):353-371.score: 150.0
  23. W. D. Goldfarb & T. M. Scanlon (1974). The Ω-Consistency of Number Theory Via Herbrand's Theorem. Journal of Symbolic Logic 39 (4):678-692.score: 150.0
  24. W. Knorr (1976). Problems in the Interpretation of Greek Number Theory: Euclid and the 'Fundamental Theorem of Arithmetic'. Studies in History and Philosophy of Science Part A 7 (4):353-368.score: 150.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  25. Alan C. Bowen (1989). Boethian Number Theory: A Translation of the de Institutione Arithmetica with Introduction and Notes. Ancient Philosophy 9 (1):137-143.score: 150.0
  26. F. G. Asenjo (1965). The Arithmetic of the Term-Relation Number Theory. Notre Dame Journal of Formal Logic 6 (3):223-228.score: 150.0
  27. Robert R. Tompkins (1968). On Kleene's Recursive Realizability as an Interpretation for Intuitionistic Elementary Number Theory. Notre Dame Journal of Formal Logic 9 (4):289-293.score: 150.0
  28. Jeremy Avigad, Kevin Donnelly, David Gray & Adam Kramer, Number Theory.score: 150.0
    1.1 Some examples of rule induction on permutations . . . . . . . 6 1.2 Ways of making new permutations . . . . . . . . . . . . . . . 7 1.3 Further results . . . . . . . . . . . . . . . . . . . . . . . . . . 8 1.4 Removing elements . . . . . . . . . . (...)
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  29. Dorothy Bollman (1967). Formal Nonassociative Number Theory. Notre Dame Journal of Formal Logic 8 (1-2):9-16.score: 150.0
  30. Albert A. Mullin (1961). Correlative Remarks Concerning Elementary Number Theory, Groups and Mutant Sets. Notre Dame Journal of Formal Logic 2 (4):253-254.score: 150.0
  31. Harry Gonshor (1980). Number Theory for the Ordinals with a New Definition for Multiplication. Notre Dame Journal of Formal Logic 21 (4):708-710.score: 150.0
  32. Steven Orey (1955). Formal Development of Ordinal Number Theory. Journal of Symbolic Logic 20 (1):95-104.score: 150.0
  33. Albert A. Mullin (1967). On New Theorems for Elementary Number Theory. Notre Dame Journal of Formal Logic 8 (4):353-356.score: 150.0
  34. Nino Cocchiarella (1984). Formal Number Theory and Compatibility. [REVIEW] Teaching Philosophy 7 (4):361-362.score: 150.0
  35. John Myhill (1952). A Derivation of Number Theory From Ancestral Theory. Journal of Symbolic Logic 17 (3):192-197.score: 150.0
  36. Ivor Bulmer-Thomas (1985). Boethian Number Theory Michael Masi: Boethian Number Theory: A Translation of the De Institutione Arithmetica (with Introduction and Notes). (Studies in Classical Antiquity, 6.) Pp. 198; 8 Figures with Mathematical Diagrams and Musical Notation in Text. Amsterdam: Editions Rodopi, 1983. Paper, Fl. 60. [REVIEW] The Classical Review 35 (01):86-87.score: 150.0
  37. D. Bollman & M. Laplaza (1973). A Set-Theoretic Model for Nonassociative Number Theory. Notre Dame Journal of Formal Logic 14 (1):107-110.score: 150.0
  38. Th Skolem (1958). Review: R. L. Goodstein, Recursive Number Theory. A Development of Recursive Arithmetic in a Logic-Free Equation Calculus. [REVIEW] Journal of Symbolic Logic 23 (2):227-228.score: 150.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  39. Mariko Yasugi (1967). Interpretations of Set Theory and Ordinal Number Theory. Journal of Symbolic Logic 32 (2):145-161.score: 150.0
  40. S. C. Kleene (1940). Review: Rozsa Peter, Contribution to Recursive Number Theory. [REVIEW] Journal of Symbolic Logic 5 (2):70-71.score: 150.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  41. Wilbur Knorr (1985). Boethius, Boethian Number Theory: A Translation of the “De Institutione Arithmetica,” Trans. Michael Masi. (Studies in Classical Antiquity, 6.) Amsterdam: Rodopi, 1983. Paper. Pp. 197; 6 Illustrations. $27.75. Distributed in the U.S.A. By Humanities Press, Atlantic Highlands, N.J. [REVIEW] Speculum 60 (4):946-948.score: 150.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  42. Richard Montague (1957). Review: Hao Wang, Between Number Theory and Set Theory. [REVIEW] Journal of Symbolic Logic 22 (1):82-83.score: 150.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  43. Steven Orey (1967). Review: Elliott Mendelson, Y. Bar-Hillel, E. I. J. Poznanski, M. O. Rabin, A. Robinson, On Non-Standard Models for Number Theory. [REVIEW] Journal of Symbolic Logic 32 (1):128-128.score: 150.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  44. Andrew Adler (1969). Extensions of Non‐Standard Models of Number Theory. Mathematical Logic Quarterly 15 (19):289-290.score: 150.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  45. Rosina Albano- Zinco (1975). On Gurwitsch's Number Theory. Graduate Faculty Philosophy Journal 5 (1):109-112.score: 150.0
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  46. Martin Davis (1990). Gödel Kurt. Zur Intuitionistischen Arithmetik Und Zahlentheorie (1933e). A Reprint of 41811. Collected Works, Volume I, Publications 1929–1936, by Kurt Gödel, Edited by Feferman Solomon, Dawson John W. Jr., Kleene Stephen C., Moore Gregory H., Solovay Robert M., and van Heijenoort Jean, Clarendon Press, Oxford University Press, New York and Oxford 1986, Even Pp. 286–294. Gödel Kurt. On Intuitionistic Arithmetic and Number Theory (1933e). English Translation by Stefan Bauer-Mengelberg and Jean van ... [REVIEW] Journal of Symbolic Logic 55 (1):346-346.score: 150.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  47. Gert H. Muller (1966). Review: Georg Kreisel, Some Concepts Concerning Formal Systems of Number Theory. [REVIEW] Journal of Symbolic Logic 31 (1):128-128.score: 150.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  48. David Nelson (1948). Review: R. L. Goodstein, Transfinite Ordinals in Recursive Number Theory. [REVIEW] Journal of Symbolic Logic 13 (3):171-171.score: 150.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  49. Abraham Robinson (1971). Review: James Ax, Simon Kochen, Diophantine Problems Over Local Fields I; James Ax, Simon Kochen, Diophantine Problems Over Local Fields II. A Complete Set of Axioms for $P$-Adic Number Theory; James Ax, Simon Kochen, Diophantine Problems Over Local Field III. Decidable Fields. [REVIEW] Journal of Symbolic Logic 36 (4):683-684.score: 150.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  50. Julia Robinson (1972). Review: Martin Davis, Application of Recursive Function Theory to Number Theory. [REVIEW] Journal of Symbolic Logic 37 (3):602-602.score: 150.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
1 — 50 / 1000