You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Mendeley readers
Chapter title |
The Tarski-Lindenbaum Algebra of the Class of All Strongly Constructivizable Countable Saturated Models
|
---|---|
Chapter number | 41 |
Book title |
The Nature of Computation. Logic, Algorithms, Applications
|
Published by |
Springer, Berlin, Heidelberg, July 2013
|
DOI | 10.1007/978-3-642-39053-1_41 |
Book ISBNs |
978-3-64-239052-4, 978-3-64-239053-1
|
Authors |
Mikhail G. Peretyat’kin, Peretyat’kin, Mikhail G. |
Mendeley readers
The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 2 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Unknown | 2 | 100% |
Readers by discipline | Count | As % |
---|---|---|
Agricultural and Biological Sciences | 1 | 50% |
Unknown | 1 | 50% |