| Ditemukan 27 dokumen dengan kata kunci 3702 |
Simpan CSV  |
|
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 ::
|
|
|
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 ::
|
|
|
The Expansion Problem in Lambda Calculi with Explicit Substitution
|
| Pengarang: Ariel Arbiser | No. Panggil: Journal of Logic and Computation December 2008, 18 (6), p. 849-883 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
The Complexity of the Warranted Formula Problem in Propositional Argumentation
|
| Pengarang: Robin Hirsch and Nikos Gorogiannis | No. Panggil: Journal of Logic and Computation April 2010, 20 (2), p. 481-499 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Intuitionistic implication without disjunction
|
| Pengarang: Gerard R. Renardel de Lavalette, Alex Hendriks, and Dick H.J. de Jongh | No. Panggil: Journal of Logic and Computation June 2012, 22 (3), p. 375-404 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Labelled calculi of resources
|
| Pengarang: Maribel Fernández and Nikolaos Siafakas | No. Panggil: Journal of Logic and Computation June 2014; 24 (3), p. 591-613 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Undecidability in Some Structures Related to Computation Theory
|
| Pengarang: Victor L. Selivanov | No. Panggil: Journal of Logic and Computation February 2009, 19 (1), p. 177-197 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Sequent calculi for induction and infinite descent
|
| Pengarang: James Brotherston and Alex Simpson | No. Panggil: Journal of Logic and Computation December 2011, 21 (6), p. 1177-1216 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Tractable and intractable classes of propositional schemata
|
| Pengarang: Nicolas Peltier | No. Panggil: Journal of Logic and Computation (October 2014; 24 (5), p. 1111-1139) |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Terminating sequent calculi for proving and refuting formulas in S4
|
| Pengarang: Camillo Fiorentini | No. Panggil: Journal of Logic and Computation (Volume 25 Issue 1 February 2015, p. 179-205) |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
Hasil Pencarian
