Switch to: References

Citations of:

The method of alternating chains

In The theory of models. Amsterdam,: North-Holland Pub. Co.. pp. 1--16 (1965)

Add citations

You must login to add citations.
  1. Fine hierarchies and Boolean terms.V. L. Selivanov - 1995 - Journal of Symbolic Logic 60 (1):289-317.
    We consider fine hierarchies in recursion theory, descriptive set theory, logic and complexity theory. The main results state that the sets of values of different Boolean terms coincide with the levels of suitable fine hierarchies. This gives new short descriptions of these hierarchies and shows that collections of sets of values of Boolean terms are almost well ordered by inclusion. For the sake of completeness we mention also some earlier results demonstrating the usefulness of fine hierarchies.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (1 other version)Lω₁ω is enough: A reduction theorem for some infinitary languages.Gonzalo E. Reyes - 1972 - Journal of Symbolic Logic 37 (4):705-710.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The uses and abuses of the history of topos theory.Colin Mclarty - 1990 - British Journal for the Philosophy of Science 41 (3):351-375.
    The view that toposes originated as generalized set theory is a figment of set theoretically educated common sense. This false history obstructs understanding of category theory and especially of categorical foundations for mathematics. Problems in geometry, topology, and related algebra led to categories and toposes. Elementary toposes arose when Lawvere's interest in the foundations of physics and Tierney's in the foundations of topology led both to study Grothendieck's foundations for algebraic geometry. I end with remarks on a categorical view of (...)
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • (1 other version)Extensional Characterization of Index Sets.Louise Hay & Nancy Johnson - 1979 - Mathematical Logic Quarterly 25 (13‐18):227-234.
    Download  
     
    Export citation  
     
    Bookmark  
  • Fine hierarchies via Priestley duality.Victor Selivanov - 2012 - Annals of Pure and Applied Logic 163 (8):1075-1107.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)Weak axioms of determinacy and subsystems of analysis I: δmath image games.Kazuyuki Tanaka - 1990 - Mathematical Logic Quarterly 36 (6):481-491.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • The mathematical development of set theory from Cantor to Cohen.Akihiro Kanamori - 1996 - Bulletin of Symbolic Logic 2 (1):1-71.
    Set theory is an autonomous and sophisticated field of mathematics, enormously successful not only at its continuing development of its historical heritage but also at analyzing mathematical propositions cast in set-theoretic terms and gauging their consistency strength. But set theory is also distinguished by having begun intertwined with pronounced metaphysical attitudes, and these have even been regarded as crucial by some of its great developers. This has encouraged the exaggeration of crises in foundations and of metaphysical doctrines in general. However, (...)
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • (1 other version)Weak axioms of determinacy and subsystems of analysis I: δ20 games.Kazuyuki Tanaka - 1990 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 36 (6):481-491.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Bounded query classes and the difference hierarchy.Richard Beigel, William I. Gasarch & Louise Hay - 1989 - Archive for Mathematical Logic 29 (2):69-84.
    LetA be any nonrecursive set. We define a hierarchy of sets (and a corresponding hierarchy of degrees) that are reducible toA based on bounding the number of queries toA that an oracle machine can make. WhenA is the halting problemK our hierarchy of sets interleaves with the difference hierarchy on the r.e. sets in a logarithmic way; this follows from a tradeoff between the number of parallel queries and the number of serial queries needed to compute a function with oracleK.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Small recursive ordinals, many-one degrees, and the arithmetical difference hierarchy.L. Hay - 1975 - Annals of Mathematical Logic 8 (3):297.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Index Sets Universal for Differences of Arithmetic Sets.Louise Hay - 1974 - Mathematical Logic Quarterly 20 (13‐18):239-254.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)Index Sets Universal for Differences of Arithmetic Sets.Louise Hay - 1974 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 20 (13-18):239-254.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)Extensional Characterization of Index Sets.Louise Hay & Nancy Johnson - 1979 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 25 (13-18):227-234.
    Download  
     
    Export citation  
     
    Bookmark