4 found
Order:
Disambiguations
Stephan Wehner [4]Stephanie Wehner [1]
  1.  15
    The Index Set of Injectively Enumerable Classes of Recursively Enumerable Sets in ∑5‐Complete.Stephan Wehner - 1994 - Mathematical Logic Quarterly 40 (1):87-94.
    I introduce an effective enumeration of all effective enumerations of classes of r. e. sets and define with this the index set IE of injectively enumerable classes. It is easy to see that this set is ∑5 in the Arithmetical Hierarchy and I describe a proof for the ∑5-hardness of IE.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2.  6
    On Injective Enumerability of Recursively Enumerable Classes of Cofinite Sets.Stephan Wehner - 1995 - Archive for Mathematical Logic 34 (3):183-196.
    To date the problem of finding a general characterization of injective enumerability of recursively enumerable (r.e) classes of r.e. sets has proved intractable. This paper investigates the problem for r.e. classes of cofinite sets. We state a suitable criterion for r.e. classesC such that there is a boundn∈ω with |ω-A|≤n for allA∈C. On the other hand an example is constructed which shows that Lachlan's condition (F) does not imply injective enumerability for r.e. classes of cofinite sets. We also look at (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  3.  18
    Introduction: Quantum Information Theory and Quantum Foundations.Howard Barnum, Stephanie Wehner & Alexander Wilce - 2018 - Foundations of Physics 48 (8):853-856.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  4.  18
    On Recursive Enumerability with Finite Repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
    It is an open problem within the study of recursively enumerable classes of recursively enumerable sets to characterize those recursively enumerable classes which can be recursively enumerated without repetitions. This paper is concerned with a weaker property of r.e. classes, namely that of being recursively enumerable with at most finite repetitions. This property is shown to behave more naturally: First we prove an extension theorem for classes satisfying this property. Then the analogous theorem for the property of recursively enumerable classes (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark