| Ditemukan 69 dokumen dengan kata kunci 4669 |
Simpan CSV  |
|
Borel Complexity of Topological Operations on Computable Metric Spaces
|
| Pengarang: Vasco Brattka and Guido Gherardi | No. Panggil: Journal of Logic and Computation February 2009, 19 (1), p. 45-76 |
|
|
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 ::
|
|
|
A semantic proof of strong cut-admissibility for first-order Gödel logic
|
| Pengarang: Ori Lahav and Arnon Avron | No. Panggil: Journal of Logic and Computation February 2013, 23 (1), p. 59-86 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
A Simple Proof of Completeness and Cut-admissibility for Propositional Gödel Logic
|
| Pengarang: Arnon Avron | No. Panggil: Journal of Logic and Computation October 2011, 21 (5), p. 813-821 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
From Deep Inference to Proof Nets via Cut Elimination
|
| Pengarang: Lutz Strassburger | No. Panggil: Journal of Logic and Computation August 2011, 21 (4), p. 589-624 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Towards the Proof-theoretic Unification of Dung’s Argumentation Framework: an Adaptive Logic Approach
|
| Pengarang: Christian Straßer and Dunja Šešelja | No. Panggil: Journal of Logic and Computation April 2011, 21 (3), p. 133-156 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Herbrand's Theorem, Skolemization and Proof Systems for First-Order Łukasiewicz Logic
|
| Pengarang: Matthias Baaz and George Metcalfe | No. Panggil: Journal of Logic and Computation February 2010, 20 (1), p. 35-54 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
A New Method to Obtain Termination in Backward Proof Search For Modal Logic S4
|
| Pengarang: Regimantas Pliuškevičius and Aida Pliuškevičienė | No. Panggil: Journal of Logic and Computation February 2010, 20 (1), p. 353-379 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Towards a Common Framework for Dialectical Proof Procedures in Abstract Argumentation
|
| Pengarang: Phan Minh Thang, Phan Minh Dung, and Nguyen Duy Hung | No. Panggil: Journal of Logic and Computation December 2009, 19 (6), p. 1071-1109 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
A small model theorem for the hybrid μ-calculus
|
| Pengarang: Kuniaki Tamura | No. Panggil: Journal of Logic and Computation (Volume 25 Issue 2 April 2015, p. (405-441) |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
Hasil Pencarian
