Switch to: Citations

Add references

You must login to add references.
  1. (2 other versions)Pseudo-exponentiation on algebraically closed fields of characteristic zero.Boris Zilber - 2005 - Annals of Pure and Applied Logic 132 (1):67-95.
    We construct and study structures imitating the field of complex numbers with exponentiation. We give a natural, albeit non first-order, axiomatisation for the corresponding class of structures and prove that the class has a unique model in every uncountable cardinality. This gives grounds to conjecture that the unique model of cardinality continuum is isomorphic to the field of complex numbers with exponentiation.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • (1 other version)On the elementary theory of restricted elementary functions.Lou van den Dries - 1988 - Journal of Symbolic Logic 53 (3):796-808.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • The classical and the ω-complete arithmetic.C. Ryll-Nardzewski, Andrzej Grzegorczyk & Andrzej Mostowski - 1958 - Journal of Symbolic Logic 23 (2):188-206.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • A Remark on Zilber's Pseudoexponentiation.David Marker - 2006 - Journal of Symbolic Logic 71 (3):791 - 798.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • (1 other version)Nondefinability results for expansions of the field of real numbers by the exponential function and by the restricted sine function.Ricardo Bianconi - 1997 - Journal of Symbolic Logic 62 (4):1173-1178.
    We prove that no restriction of the sine function to any (open and nonempty) interval is definable in $\langle\mathbf{R}, +, \cdot, , and that no restriction of the exponential function to an (open and nonempty) interval is definable in $\langle \mathbf{R}, +, \cdot, , where $\sin_0(x) = \sin(x)$ for x ∈ [ -π,π], and $\sin_0(x) = 0$ for all $x \not\in\lbrack -\pi,\pi\rbrack$.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • (1 other version)On the Elementary Theory of Restricted Elementary Functions.Lou van den Dries - 1988 - Journal of Symbolic Logic 53 (3):796 - 808.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Alan Turing and the foundations of computable analysis.Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (3):394-430.
    We investigate Turing's contributions to computability theory for real numbers and real functions presented in [22, 24, 26]. In particular, it is shown how two fundamental approaches to computable analysis, the so-called ‘Type-2 Theory of Effectivity' (TTE) and the ‘realRAM machine' model, have their foundations in Turing's work, in spite of the two incompatible notions of computability they involve. It is also shown, by contrast, how the modern conceptual tools provided by these two paradigms allow a systematic interpretation of Turing's (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • On the structure of semialgebraic sets over p-adic fields.Philip Scowcroft & Lou van den Dries - 1988 - Journal of Symbolic Logic 53 (4):1138-1164.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Schanuel's conjecture and free exponential rings.Angus Macintyre - 1991 - Annals of Pure and Applied Logic 51 (3):241-246.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Second order arithmetic and related topics.K. R. Apt & W. Marek - 1974 - Annals of Mathematical Logic 6 (3):177.
    Download  
     
    Export citation  
     
    Bookmark   13 citations