Hasil Pencarian
	Ditemukan 9 dokumen dengan kata kunci 4673 Simpan CSV  Indifferent Sets Pengarang: Santiago Figueira, Joseph S. Miller, and André Nies | No. Panggil: Journal of Logic and Computation April 2009, 19 (2), p. 425-443 | Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  :: Some properties of maximal sets Pengarang: Roland SH. Omanadze and Irakli O. Chitaia | No. Panggil: Logic Journal of the IGPL (Volume 23 Issue 4 August 2015, p. 628-639) | Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  :: K-Triviality of Closed Sets and Continuous Functions Pengarang: George Barmpalias, Douglas Cenzer, Jeffrey B. Remmel, and Rebecca Weber | No. Panggil: Journal of Logic and Computation February 2009, 19 (1), p. 3-16 | 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  :: Counting the changes of random Δ20 sets Pengarang: Santiago Figueira,Denis R. Hirschfeldt,Joseph S. Miller,Keng Meng Ng, | No. Panggil: Journal of Logic and Computation (Volume 25 Issue 4 Agustus 2015, p. 1073-1089) | 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  :: Quantifiers in logic and proof-search using permissive-nominal terms and sets Pengarang: Murdoch J. Gabbay, Claus-Peter Wirth | No. Panggil: Journal of Logic and Computation (Volume 25 Issue 2 April 2015, p. (473-523) | Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  :: Joining non-low C.E. sets with diagonally non-computable functions Pengarang: Laurent Bienvenu, Noam Greenberg, Antonín Kučera, Joseph S. Miller, dll | No. Panggil: Journal of Logic and Computation December 2013; 23 (6), p. 1183-1194 | Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  :: Compactness arguments with effectively closed sets for the study of relative randomness Pengarang: George Barmpalias | No. Panggil: Journal of Logic and Computation August 2012, 22 (4), p. 679-691 | Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::