Hasil Pencarian
Ditemukan 66 dokumen dengan kata kunci 4599 Simpan CSV Simpan CSV
A Proof System for Abstract Non-interference
Pengarang: Roberto Giacobazzi and Isabella Mastroeni | No. Panggil: Journal of Logic and Computation April 2010, 20 (2), p. 449-479 |
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  ::
Implementing crash-resistance and non-interference in logic-based argumentation
Pengarang: Yining Wu, Mikołaj Podlaszewski | No. Panggil: Journal of Logic and Computation (Volume 25 Issue 2 April 2015, p. 303-333) |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
On the semantics of abstract argumentation
Pengarang: A.C. Kakas and P. Mancarella | No. Panggil: Journal of Logic and Computation October 2013; 23 (5), p. 991-1015 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
An abstract view on syntax with sharing
Pengarang: Richard Garner | No. Panggil: Journal of Logic and Computation December 2012, 22 (6), p. 1427-1452 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Semantically closed intuitionistic abstract logics
Pengarang: Steffen Lewitzka | No. Panggil: Journal of Logic and Computation June 2012, 22 (3), p 351-374 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
A proof-theoretic analysis of the classical propositional matrix method
Pengarang: David Pym, Eike Ritter, and Edmund Robinson | No. Panggil: Journal of Logic and Computation February 2014; 24 (1), p.283-301 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Proof Complexity of the Cut-free Calculus of Structures
Pengarang: Emil Jeřábek | No. Panggil: Journal of Logic and Computation April 2009, 19 (2), p. 323-339 |
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  ::
Prev   1 2 3 4 5 6 7  Next