6 found
Order:
  1.  28
    Comparing Inductive and Circular Definitions: Parameters, Complexity and Games.Kai-Uwe Küdhnberger, Benedikt Löwe, Michael Möllerfeld & Philip Welch - 2005 - Studia Logica 81 (1):79 - 98.
    Gupta-Belnap-style circular definitions use all real numbers as possible starting points of revision sequences. In that sense they are boldface definitions. We discuss lightface versions of circular definitions and boldface versions of inductive definitions.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  2.  27
    Michael Rathjen. The Superjump in Martin-Löf Type Theory. Logic Colloquium '98, Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, Held in Prague, Czech Republic, August 9–15, 1998, Edited by Samuel R. Buss, Petr Hájek, and Pavel Pudlák, Lecture Notes in Logic, No. 13, Association for Symbolic Logic, Urbana, and A K Peters, Natick, Mass., 2000, Pp. 363–386. [REVIEW]Michael Möllerfeld - 2002 - Bulletin of Symbolic Logic 8 (4):538.
  3.  5
    A Note on the Σ1 Spectrum of a Theory.Michael Möllerfeld & Michael Rathjen - 2002 - Archive for Mathematical Logic 41 (1):33-34.
  4.  5
    Comparing Inductive and Circular Definitions: Parameters, Complexity and Games.Philip Welch, Kai–Uwe Kühnberger, Benedikt Löwe & Michael Möllerfeld - 2005 - Studia Logica 81 (1):79-98.
    Gupta-Belnap-style circular definitions use all real numbers as possible starting points of revision sequences. In that sense they are boldface definitions. We discuss lightface versions of circular definitions and boldface versions of inductive definitions.
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  5.  13
    Review: Michael Rathjen, Samuel R. Buss, Petr Hájek, Pavel Pudlák, The Superjump in Martin-Löf Type Theory. [REVIEW]Michael Möllerfeld - 2002 - Bulletin of Symbolic Logic 8 (4):538-538.
  6.  1
    The Superjump in Martin-Löf Type Theory.Michael Möllerfeld - 2002 - Bulletin of Symbolic Logic 8 (4):538-538.