Hasil Pencarian
Ditemukan 121 dokumen dengan kata kunci 4530 Simpan CSV Simpan CSV
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 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  ::
Undecidability of the problem of recognizing axiomatizations for propositional calculi with implication
Pengarang: Grigoriy V. Bokov | No. Panggil: Logic Journal of the IGPL (Volume 23 Issue 2 April 2015, p. 341-353) |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
The complexity of handling minimal solutions in logic-based abduction
Pengarang: Andreas Pfandler, Reinhard Pichler, Stefan Woltran | No. Panggil: Journal of Logic and Computation (Volume 25 Issue 3 june 2015, p.805-825) |
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  ::
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 binary Routley semantics for intuitionistic De Morgan minimal logic HM and its extensions
Pengarang: Gemma Robles and José M. Méndez | No. Panggil: Logic Journal of the IGPL (Volume 23 Issue 2 April 2015, p. 174-193) |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Quasi-minimal degrees for degree spectra
Pengarang: Alexandra A. Soskova and Ivan N. Soskov | No. Panggil: Journal of Logic and Computation December 2013; 23 (6), p. 1319-1334 |
Koleksi: e-Article Oxford Journal  :: Cari yang mirip  :: Tambahkan ke Favorit  ::
Prev   1 2 3 4 5 6 7 8 9 10  Next