IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4613-0609-2_28.html

Least Fixed Points in Preassociative Combinatory Algebras

In: Mathematical Logic

Author

Listed:
  • J. Zashev

    (Sofia University, Laboratory for Applied Logic)

Abstract

The intention of the investigations to which the present work belongs is to find an axiomatic basis of the recursion theory for which the following qualities are desirable to possess:(1) to be algebraically styled; that means we expect to find a suitable algebraic language, which is simple and well working and allows us to obtain a connection between recursion theory and same algebraic structures which may be interesting by themselves; (2) to have as large as possible area of applications, i.e. we expect for those structures to have many and easy constructable models: (3) to allow us to prove all the basic facts of the recursion theory in the abstract case, especially the least fixed point or first recursion theorem.

Suggested Citation

  • J. Zashev, 1990. "Least Fixed Points in Preassociative Combinatory Algebras," Springer Books, in: Petio Petrov Petkov (ed.), Mathematical Logic, pages 389-397, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4613-0609-2_28
    DOI: 10.1007/978-1-4613-0609-2_28
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4613-0609-2_28. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.