Hasil Pencarian
	Ditemukan 9 dokumen dengan kata kunci 4370 Simpan CSV  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  :: Existentially Closed Models and Conservation Results in Bounded Arithmetic Pengarang: A. Cordón-Franco, A. Fernández-Margarit, and F. F. Lara-Martín | No. Panggil: Journal of Logic and Computation February 2009, 19 (1), p. 123-143 | Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  :: The Settling Time Reducibility Ordering and Δ02 Sets Pengarang: Barbara F. Csima | No. Panggil: Journal of Logic and Computation February 2009, 19 (1), p. 145-150 | 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  :: 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  :: Embedding distributive lattices in the Σ02 enumeration degrees Pengarang: Hristo Ganchev and Mariya Soskova | No. Panggil: Journal of Logic and Computation August 2012, 22 (4), p. 779-792 | Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  :: Non-cuppable enumeration degrees via finite injury Pengarang: Charles M. Harris | No. Panggil: Journal of Logic and Computation August 2012, 22 (4), p. 807-829 | Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::