Switch to: References

Add citations

You must login to add citations.
  1. Constructing the constructible universe constructively.Michael Rathjen - 2024 - Annals of Pure and Applied Logic 175 (3):103392.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Infinite Computations with Random Oracles.Merlin Carl & Philipp Schlicht - 2017 - Notre Dame Journal of Formal Logic 58 (2):249-270.
    We consider the following problem for various infinite-time machines. If a real is computable relative to a large set of oracles such as a set of full measure or just of positive measure, a comeager set, or a nonmeager Borel set, is it already computable? We show that the answer is independent of ZFC for ordinal Turing machines with and without ordinal parameters and give a positive answer for most other machines. For instance, we consider infinite-time Turing machines, unresetting and (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The formal verification of the ctm approach to forcing.Emmanuel Gunther, Miguel Pagano, Pedro Sánchez Terraf & Matías Steinberg - 2024 - Annals of Pure and Applied Logic 175 (5):103413.
    Download  
     
    Export citation  
     
    Bookmark