Switch to: Citations

Add references

You must login to add references.
  1. On the structure of paradoxes.Du?ko Pavlovi? - 1992 - Archive for Mathematical Logic 31 (6):397-406.
    Paradox is a logical phenomenon. Usually, it is produced in type theory, on a type Ω of “truth values”. A formula Ψ (i.e., a term of type Ω) is presented, such that Ψ↔¬Ψ (with negation as a term¬∶Ω→Ω)-whereupon everything can be proved: In Sect. 1 we describe a general pattern which many constructions of the formula Ψ follow: for example, the well known arguments of Cantor, Russell, and Gödel. The structure uncovered behind these paradoxes is generalized in Sect. 2. This (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (2 other versions)Handbook of Mathematical Logic.Akihiro Kanamori - 1984 - Journal of Symbolic Logic 49 (3):971-975.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Introduction to Mathematical Logic.D. van Dalen - 1964 - Journal of Symbolic Logic 45 (3):631-631.
    Download  
     
    Export citation  
     
    Bookmark   44 citations  
  • (2 other versions)Infinity and the Mind. The Science and Philosophy of the Infinite.Joseph Shipman - 1985 - Journal of Symbolic Logic 50 (1):246-247.
    Download  
     
    Export citation  
     
    Bookmark   60 citations  
  • A note on Russell's paradox in locally cartesian closed categories.Andrew M. Pitts & Paul Taylor - 1989 - Studia Logica 48 (3):377 - 387.
    Working in the fragment of Martin-Löfs extensional type theory [12] which has products (but not sums) of dependent types, we consider two additional assumptions: firstly, that there are (strong) equality types; and secondly, that there is a type which is universal in the sense that terms of that type name all types, up to isomorphism. For such a type theory, we give a version of Russell's paradox showing that each type possesses a closed term and (hence) that all terms of (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On Gödel incompleteness and finite combinatorics.Akihiro Kanamori & Kenneth McAloon - 1987 - Annals of Pure and Applied Logic 33 (C):23-41.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • (1 other version)Understanding the Infinite.Stewart Shapiro - 1996 - Philosophical Review 105 (2):256.
    Understanding the Infinite is a loosely connected series of essays on the nature of the infinite in mathematics. The chapters contain much detail, most of which is interesting, but the reader is not given many clues concerning what concepts and ideas are relevant for later developments in the book. There are, however, many technical cross-references, so the reader can expect to spend much time flipping backward and forward.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Notes on the mathematical aspects of Kripke’s theory of truth.Melvin Fitting - 1986 - Notre Dame Journal of Formal Logic 27 (1):75-88.
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • Existence and feasibility in arithmetic.Rohit Parikh - 1971 - Journal of Symbolic Logic 36 (3):494-508.
    Download  
     
    Export citation  
     
    Bookmark   90 citations  
  • An existence theorem for recursion categories.Alex Heller - 1990 - Journal of Symbolic Logic 55 (3):1252-1268.
    Download  
     
    Export citation  
     
    Bookmark   3 citations