7 found
Order:
Disambiguations
Edward R. Griffor [5]Edward Griffor [4]
  1.  40
    The Strength of Some Martin-Löf Type Theories.Edward Griffor & Michael Rathjen - 1994 - Archive for Mathematical Logic 33 (5):347-385.
    One objective of this paper is the determination of the proof-theoretic strength of Martin-Löf's type theory with a universe and the type of well-founded trees. It is shown that this type system comprehends the consistency of a rather strong classical subsystem of second order arithmetic, namely the one with Δ 2 1 comprehension and bar induction. As Martin-Löf intended to formulate a system of constructive (intuitionistic) mathematics that has a sound philosophical basis, this yields a constructive consistency proof of a (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   38 citations  
  2.  15
    Inaccessibility in Constructive Set Theory and Type Theory.Michael Rathjen, Edward R. Griffor & Erik Palmgren - 1998 - Annals of Pure and Applied Logic 94 (1-3):181-200.
    This paper is the first in a series whose objective is to study notions of large sets in the context of formal theories of constructivity. The two theories considered are Aczel's constructive set theory and Martin-Löf's intuitionistic theory of types. This paper treats Mahlo's π-numbers which give rise classically to the enumerations of inaccessibles of all transfinite orders. We extend the axioms of CZF and show that the resulting theory, when augmented by the tertium non-datur, is equivalent to ZF plus (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  3.  5
    Tomoyuki Yamakami. Polynomial Games and Determinacy, Annals of Pure and Applied Logic, Vol. 80 , Pp. 1–16.Edward Griffor - 1999 - Journal of Symbolic Logic 64 (2):913.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  4.  10
    Participants and Titles of Lectures.Klaus Ambos-Spies, Marat Arslanov, Douglas Cenzer, Peter Cholak, Chi Tat Chong, Decheng Ding, Rod Downey, Peter A. Fejer, Sergei S. Goncharov & Edward R. Griffor - 1998 - Annals of Pure and Applied Logic 94 (1):3-6.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5.  4
    Some Consequences of Ad for Kleene Recursion in 3e.Edward R. Griffor - 1983 - Mathematical Logic Quarterly 29 (10):485-492.
  6.  4
    Review: Tomoyuki Yamakami, Polynomial Games and Determinacy. [REVIEW]Edward Griffor - 1999 - Journal of Symbolic Logic 64 (2):913-913.
  7.  34
    Handbook of Computability Theory.Edward R. Griffor (ed.) - 1999 - Elsevier.
    The chapters of this volume all have their own level of presentation. The topics have been chosen based on the active research interest associated with them. Since the interest in some topics is older than that in others, some presentations contain fundamental definitions and basic results while others relate very little of the elementary theory behind them and aim directly toward an exposition of advanced results. Presentations of the latter sort are in some cases restricted to a short survey of (...)
    Direct download  
     
    Export citation  
     
    Bookmark