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 Boundary Between Decidability and Undecidability for Transitive-Closure Logics
|
---|---|
Chapter number | 15 |
Book title |
Computer Science Logic
|
Published by |
Springer, Berlin, Heidelberg, September 2004
|
DOI | 10.1007/978-3-540-30124-0_15 |
Book ISBNs |
978-3-54-023024-3, 978-3-54-030124-0
|
Authors |
Neil Immerman, Alex Rabinovich, Tom Reps, Mooly Sagiv, Greta Yorsh, Immerman, Neil, Rabinovich, Alex, Reps, Tom, Sagiv, Mooly, Yorsh, Greta |
Mendeley readers
The data shown below were compiled from readership statistics for 13 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Japan | 1 | 8% |
Unknown | 12 | 92% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 4 | 31% |
Professor > Associate Professor | 4 | 31% |
Researcher | 4 | 31% |
Student > Doctoral Student | 2 | 15% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 11 | 85% |
Arts and Humanities | 1 | 8% |
Engineering | 1 | 8% |