| Ditemukan 23 dokumen dengan kata kunci 4561 |
Simpan CSV  |
|
Relations Versus Functions at the Foundations of Logic: Type-Theoretic Considerations
|
| Pengarang: Paul E. Oppenheimer and Edward N. Zalta | No. Panggil: Journal of Logic and Computation April 2011, 21 (3), p. 351-374 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
The Foundations Of Science
|
|
|
|
Algebras of Relations and Relevance Logic
|
| Pengarang: Szabolcs Mikulás | No. Panggil: Journal of Logic and Computation April 2009, 19 (2), p. 305-321 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Functions definable by numerical set-expressions
|
| Pengarang: Ian Pratt-Hartmann and Ivo Düntsch | No. Panggil: Journal of Logic and Computation August 2013, 23 (4), p. 873-895 |
|
|
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 ::
|
|
|
Incomputability at the foundations of physics (A study in the philosophy of science)
|
| Pengarang: José Félix Costa | No. Panggil: Journal of Logic and Computation December 2013; 23 (6), p. 1225-1248 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Foundations of model construction in feature-based semantic science
|
| Pengarang: David Poole | No. Panggil: Journal of Logic and Computation October 2013; 23 (5), p. 1081-1096 |
|
|
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 ::
|
|
|
Expressing versus Proving: Relating Forms of Complexity in Logic
|
| Pengarang: Antonina Kolokolova | No. Panggil: Journal of Logic and Computation April 2012, 22 (2), p. 267-280 |
|
|
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 ::
|
|
Hasil Pencarian
