A-computable graphs
- 期刊名称Annals of Pure and Applied Logic
- 作者Jura, Matthew; Levin, Oscar; Markkanen, Tyler
- 卷第167卷
- 期第3期
- 印刷ISSN0168-0072
- 文件大小398.37KB
- 发表时间2016-03
- DOI10.1016/j.apal.2015.11.003
- 页码235-246
Computability of the ergodic decompositionHoyrup, Mathieu · Annals of Pure and Applied Logic · 2013
Reverse-engineering Reverse MathematicsSanders, Sam · Annals of Pure and Applied Logic · 2013
Highness, locally noncappability and nonboundingsStephan, Frank; Wu, Guohua · Annals of Pure and Applied Logic · 2013
Computability in Europe 2011Buss, Sam; Löwe, Benedikt; Normann, Dag; Soskov, Ivan · Annals of Pure and Applied Logic · 2013
About Goodmanʼs TheoremCoquand, Thierry · Annals of Pure and Applied Logic · 2013
Consistent amalgamation for þ-forkingEaly, Clifton; Onshuus, Alf · Annals of Pure and Applied Logic · 2014
Chain conditions in dependent groupsKaplan, Itay; Shelah, Saharon · Annals of Pure and Applied Logic · 2013
PrefaceAmbos-Spies, Klaus; Bagaria, Joan; Casanovas, Enrique; Kohlenbach, Ulrich · Annals of Pure and Applied Logic · 2013