Effective Enumerations of Abstract Structures

Alexandra A. Soskova and Ivan N. Soskov
Additional contact information
Alexandra A. Soskova: Sofia University, Mathematical Faculty
Ivan N. Soskov: Sofia University, Laboratory for Applied Logic

A chapter in Mathematical Logic, 1990, pp 361-372 from Springer

Abstract: Abstract There is a close relationship between the enumerations which admits an abstract structure A and the “effective” computable functions in A, see [1,2,3].

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_26

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

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

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 ().