| Ditemukan 69 dokumen dengan kata kunci 4669 |
Simpan CSV  |
|
Proof Complexity of the Cut-free Calculus of Structures
|
| Pengarang: Emil Jeřábek | No. Panggil: Journal of Logic and Computation April 2009, 19 (2), p. 323-339 |
|
|
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 ::
|
|
|
Combining Derivations and Refutations for Cut-free Completeness in Bi-intuitionistic Logic
|
| Pengarang: Rajeev Goré and Linda Postniece | No. Panggil: Journal of Logic and Computation February 2010, 20 (1), p. 233-260 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Calculus
|
|
|
|
Calculus
|
|
|
|
Calculus
|
|
|
|
Beginning Calculus
|
|
|
|
Embedding the hypersequent calculus in the display calculus
|
| Pengarang: Revantha Ramanayake | No. Panggil: Journal of Logic and Computation (Volume 25 Issue 3 june 2015, p. 921-942) |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Two-to-one structures
|
| Pengarang: Douglas Cenzer, Valentina Harizanov, and Jeffrey B. Remmel | No. Panggil: Journal of Logic and Computation December 2013; 23 (6), p. 1195-223 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
|
Least enumerations of partial structures
|
| Pengarang: Angel V. Ditchev | No. Panggil: Journal of Logic and Computation August 2012, 22 (4), p. 717-735 |
|
|
Koleksi: e-Article Oxford Journal ::
Cari yang mirip ::
Tambahkan ke Favorit ::
|
|
Hasil Pencarian
