| Ditemukan 22 dokumen dengan kata kunci 4689 |
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 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 ::
|
|
|
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 ::
|
|
|
Solving a PSPACE-complete problem by gene assembly
|
| Pengarang: Thomas Zerjatke and Monika Sturm | No. Panggil: Journal of Logic and Computation August 2013, 23 (4), p. 897-908 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Generalized constraint diagrams and the classical decision problem
|
| Pengarang: Jim Burton, Gem Stapleton, and John Howse | No. Panggil: Journal of Logic and Computation February 2013, 23 (1), p. 199-262 |
|
|
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 ::
|
|
|
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 ::
|
|
|
An improved hybrid algorithm for capacitated fixed-charge transportation problem
|
| Pengarang: Camelia-M. Pintea and Petrică C. Pop | No. Panggil: Logic Journal of the IGPL (Volume 23 Issue 3 June 2015, p. 369-378) |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Diffraction by an impedance strip I. Reducing diffraction problem to Riemann–Hilbert problems
|
| Pengarang: A. V. Shanin and A. I. Korolkov | No. Panggil: The Quarterly Journal of Mechanics and Applied Mathematics (Volume 68 Issue 3 Agustus 2015, p. 321-339) |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Polynomial time certifying algorithms for the planar quantified integer programming problem
|
| Pengarang: Z. Liang, K. Subramani, and J. Worthington | No. Panggil: Journal of Logic and Computation October 2013; 23 (5), p. 1017-1033 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
Hasil Pencarian
