Hasil Pencarian
Ditemukan 121 dokumen dengan kata kunci 4531 Simpan CSV Simpan CSV
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  ::
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  ::
Computing Minimal Axiomatizations in Gödel Propositional Logic
Pengarang: Stefano Aguzzoli, Ottavio M. D’Antona, and Vincenzo Marra | No. Panggil: Journal of Logic and Computation October 2011, 21 (5), p. 791-812 |
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  ::
Arithmetical Completeness of the Intuitionistic Logic of Proofs
Pengarang: Evgenij Dashkov | No. Panggil: Journal of Logic and Computation August 2011, 21 (4), p. 665-682 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Social choice and the logic of simple games
Pengarang: Tijmen R. Daniëls | No. Panggil: Journal of Logic and Computation December 2011, 21 (6), p. 883-906 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Completeness and decidability results for a logic of contrary-to-duty conditionals
Pengarang: José M. C. L. M. Carmo and Andrew J. I. Jones | No. Panggil: Journal of Logic and Computation June 2013, 23 (3), p. 585-626 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Monodic temporal logic with quantified propositional variables
Pengarang: Walter Hussak | No. Panggil: Journal of Logic and Computation June 2012, 22 (3), p. 517-544 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
On Two Attempts of Describing Propositional Realizability Logic
Pengarang: Valery Plisko | No. Panggil: Journal of Logic and Computation August 2011, 21 (4), p. 639-663 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Bi-modal Gödel logic over [0,1]-valued Kripke frames
Pengarang: Xavier Caicedo and Ricardo Oscar Rodríguez | No. Panggil: Journal of Logic and Computation (Volume 25 Issue 1 February 2015, p. 37-55) |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Prev   1 2 3 4 5 6 7 8 9 10  Next