| Ditemukan 13 dokumen dengan kata kunci 3591 |
Simpan CSV  |
|
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 ::
|
|
|
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 ::
|
|
|
Sequent Calculi for the Modal µ-Calculus over S5
|
| Pengarang: Luca Alberucci | No. Panggil: Journal of Logic and Computation December 2009, 19 (6), p. 971-985 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Cut-free sequent calculi for C-systems with generalized finite-valued semantics
|
| Pengarang: Arnon Avron, Beata Konikowska, and Anna Zamansky | No. Panggil: Journal of Logic and Computation June 2013, 23 (3), p. 517-540 |
|
|
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 ::
|
|
|
Expressing versus Proving: Relating Forms of Complexity in Logic
|
| Pengarang: Antonina Kolokolova | No. Panggil: Journal of Logic and Computation April 2012, 22 (2), p. 267-280 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Model-theoretic characterization of intuitionistic predicate formulas
|
| Pengarang: Grigory K. Olkhovikov | No. Panggil: Journal of Logic and Computation August 2014; 24 (4), p. 809-829 |
|
|
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 ::
|
|
|
Graph Polynomials: From Recursive Definitions to Subset Expansion Formulas
|
| Pengarang: B. Godlin, E. Katz, and J. A. Makowsky | No. Panggil: Journal of Logic and Computation April 2012, 22 (2), p. 237-265 |
|
|
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 ::
|
|
Hasil Pencarian
