| Ditemukan 16 dokumen dengan kata kunci 4473 |
Simpan CSV  |
|
Turing and enumeration jumps in the Ershov hierarchy
|
| Pengarang: Marat Kh. Faizrahmanov and Iskander Sh. Kalimullin | No. Panggil: Journal of Logic and Computation August 2012, 22 (4), p. 737-743 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Enumeration of the adjunctive hierarchy of hereditarily finite sets
|
| Pengarang: Giorgio Audrito, Alexandru I. Tomescu, Stephan Wagner | No. Panggil: Journal of Logic and Computation (Volume 25 Issue 3 june 2015, p. 943-963)
|
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Deconstructing and reconstructing the capability hierarchy
|
| Pengarang: Damian Hine, Rachel Parker, Lisette Pregelj, and Martie-Louise Verreynne | No. Panggil: Industrial and Corporate Change (Volume 15 Issue 5 October 2014, p. 1299-1325) |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Turing is among us
|
| Pengarang: Luís Moniz Pereira | No. Panggil: Journal of Logic and Computation December 2012, 22 (6), p. 1257-1277 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Singleton enumeration reducibility and arithmetic
|
| Pengarang: Daniele Marsibilio and Andrea Sorbi | No. Panggil: Journal of Logic and Computation December 2013; 23 (6), p. 1267-1292 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Enumeration Degrees and Enumerability of Familes
|
| Pengarang: Iskander Kalimullin | No. Panggil: Journal of Logic and Computation February 2009, 19 (1), p. 151-158 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Definable relations in Turing degree structures
|
| Pengarang: Marat M. Arslanov | No. Panggil: Journal of Logic and Computation December 2013; 23 (6), p. 1145-1154 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Embedding countable partial orderings in the enumeration degrees and the ω-enumeration degrees
|
| Pengarang: Mariya I. Soskova and Ivan N. Soskov | No. Panggil: Journal of Logic and Computation August 2012, 22 (4), p. 927-952 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Oracles that measure thresholds: the Turing machine and the broken balance
|
| Pengarang: Edwin Beggs, José Félix Costa, Diogo Poças, and John V. Tucker | No. Panggil: Journal of Logic and Computation December 2013; 23 (6), p. 1155-1181 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Low upper bounds in the Turing degrees revisited
|
| Pengarang: George Barmpalias and André Nies | No. Panggil: Journal of Logic and Computation August 2012, 22 (4), p. 693-699 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
Hasil Pencarian
