Skip to main content
SpringerLink
Log in

A Computational Approach to an Alternative Working Environment for the Constructible Universe

  • Conference paper
Models of Computation in Context (CiE 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6735))

Included in the following conference series:

  • 498 Accesses

Abstract

We exhibit aspects of fine structure theory related to infinitary computations and describe a new approach to fine structure based on it, the F-hierarchy, and its refinement, the hyperings. As a sample application, we prove a variant of a theorem of Magidor.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Carl, M.: Alternative Finestructural and Computational Approaches to Constructibility. Submitted as PhD thesis at the university of Bonn (2010)

    Google Scholar 

  2. Devlin, K.: Constructibility. Perspectives in Mathematical Logic. Springer, Heidelberg (1984)

    Book  MATH  Google Scholar 

  3. Donder, H.-D.: Coarse Morasses in L. In: Jensen, R.B., Prestel, A. (eds.) Set theory and model theory. Proceedings of a Symposium held in Bonn, June 1-3. Lecture Notes in Mathematics, vol. 872, pp. 37–54. Springer, Heidelberg (1979)

    Chapter  Google Scholar 

  4. Friedman, S.D., Koepke, P.: An elementary approach to the fine structure of L. Bulletin of Symbolic Logic 4, 453–468

    Google Scholar 

  5. Hamkins, J.D., Lewis, A.: Infinite Time Turing Machines. Journal of Symbolic Logic 65(2), 567–604 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  6. Jensen, R.B.: The fine structure of the constructible hierarchy. Annals of Mathematical Logic 4, 229–308 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  7. Koepke, P.: A new finestructural hierarchy for the constructible niverse. CRM preprints, Barcelona 554 (2003)

    Google Scholar 

  8. Koepke, P.: Ordinal Computability and Fine Structure. Talk iven in the Oberseminar Mathematische Logik, Bonn (2005)

    Google Scholar 

  9. Koepke, P., Siders, R.: Register Computations on Ordinals. Archive for Mathematical Logic 47(6), 529–548 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  10. Magidor, M.: Representing sets of ordinals as countable unions of sets in the core model. Transactions of the American Mathematical Society 317(1), 91–121 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  11. Richardson, T.L.: Silver Machine approach to the constructible universe. Ph.D. thesis, University of California, Berkeley (1979)

    Google Scholar 

  12. Sacks, G.E.: Higher Recursion Theory. Perspectives in Mathematical Logic, vol. 2. Springer, Heidelberg (1990)

    Book  Google Scholar 

  13. van Eijmeren, M., Koepke, P.: A refinement of Jensen’s constructible hierarchy. In: Löwe, B., Piwinger, B., Räsch, T. (eds.) Classical and new paradigms of computation and their complexity hierarchies. Papers from the Conference Foundations of the Formal Sciences III (FotFS III) held at the Universität Wien, Vienna, September 21-24 (2001); Trends in Logic, vol. 23, Kluwer, 159-169 (2004)

    Google Scholar 

  14. Weckbecker, G.: Ordinal Register Machines and Constructibility. Dipl.-Math. Thesis. Bonn (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Logic, Language and Computation, Universiteit van Amsterdam, Postbus 94242, 1090, GE, Amsterdam, The Netherlands

    Merlin Carl

  2. Mathematisches Institut, Rheinische Friedrich-Wilhelms-Universität Bonn, Endenicher Allee 60, 53115, Bonn, Germany

    Merlin Carl

Authors
  1. Merlin Carl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Logic, Language and Computation, University of Amsterdam, 1090, Amsterdam, GE, The Netherlands

    Benedikt Löwe

  2. Department of Mathematics, University of Oslo, 0316, Oslo, Norway

    Dag Normann

  3. Department of Mathematical Logic and Applications, Sofia University, 1164, Sofia, Bulgaria

    Ivan Soskov  & Alexandra Soskova  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Carl, M. (2011). A Computational Approach to an Alternative Working Environment for the Constructible Universe. In: Löwe, B., Normann, D., Soskov, I., Soskova, A. (eds) Models of Computation in Context. CiE 2011. Lecture Notes in Computer Science, vol 6735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21875-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21875-0_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21874-3

  • Online ISBN: 978-3-642-21875-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation