Least Fixed Points in Preassociative Combinatory Algebras

J. Zashev
Additional contact information
J. Zashev: Sofia University, Laboratory for Applied Logic

A chapter in Mathematical Logic, 1990, pp 389-397 from Springer

Abstract: 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.

Date: 1990
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0609-2_28

Ordering information: This item can be ordered from
http://www.springer.com/9781461306092

DOI: 10.1007/978-1-4613-0609-2_28

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().