Switch to: References

Add citations

You must login to add citations.
  1. Intuitionistic analysis at the end of time.Joan Rand Moschovakis - 2017 - Bulletin of Symbolic Logic 23 (3):279-295.
    Kripke recently suggested viewing the intuitionistic continuum as an expansion in time of a definite classical continuum. We prove the classical consistency of a three-sorted intuitionistic formal system IC, simultaneously extending Kleene’s intuitionistic analysis I and a negative copy C° of the classically correct part of I, with an “end of time” axiom ET asserting that no choice sequence can be guaranteed not to be pointwise equal to a definite sequence. “Not every sequence is pointwise equal to a definite sequence” (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • On categorical structures arising from implicative algebras: From topology to assemblies.Samuele Maschio & Davide Trotta - 2024 - Annals of Pure and Applied Logic 175 (3):103390.
  • Models of intuitionistic set theory in subtoposes of nested realizability toposes.Samuele Maschio & Thomas Streicher - 2015 - Annals of Pure and Applied Logic 166 (6):729-739.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Introduction to Turing categories.J. Robin B. Cockett & Pieter Jw Hofstra - 2008 - Annals of Pure and Applied Logic 156 (2):183-209.
    We give an introduction to Turing categories, which are a convenient setting for the categorical study of abstract notions of computability. The concept of a Turing category first appeared in the work of Longo and Moggi; later, Di Paolo and Heller introduced the closely related recursion categories. One of the purposes of Turing categories is that they may be used to develop categorical formulations of recursion theory, but they also include other notions of computation, such as models of combinatory logic (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation