Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Egly, Uwe
and
Schmitt, Stephan
2001.
Automated Reasoning.
Vol. 2083,
Issue. ,
p.
561.
Avron, A.
2001.
Classical Gentzen-type methods in propositional many-valued logics.
p.
287.
Santo, José Espírito
2002.
Logic for Programming, Artificial Intelligence, and Reasoning.
Vol. 2514,
Issue. ,
p.
352.
Manolios, Panagiotis
and
Vroon, Daron
2003.
Automated Deduction – CADE-19.
Vol. 2741,
Issue. ,
p.
243.
von Plato, Jan
2003.
Translations from natural deduction to sequent calculus.
Mathematical Logic Quarterly,
Vol. 49,
Issue. 5,
p.
435.
Avigad, Jeremy
2003.
Eliminating definitions and Skolem functions in first-order logic.
ACM Transactions on Computational Logic,
Vol. 4,
Issue. 3,
p.
402.
Kikuchi, Kentaro
2004.
Functional and Logic Programming.
Vol. 2998,
Issue. ,
p.
244.
Forcheri, Paola
and
Gentilini, Paolo
2005.
Paraconsistent conjectural deduction based on logical entropy measures I: C-systems as non-standard inference framework.
Journal of Applied Non-Classical Logics,
Vol. 15,
Issue. 3,
p.
285.
Negri, Sara
2005.
Proof Analysis in Modal Logic.
Journal of Philosophical Logic,
Vol. 34,
Issue. 5-6,
p.
507.
Manolios, Panagiotis
and
Vroon, Daron
2005.
Ordinal Arithmetic: Algorithms and Mechanization.
Journal of Automated Reasoning,
Vol. 34,
Issue. 4,
p.
387.
Tatsuta, Makoto
2005.
Second order permutative conversions with Prawitz's strong validity.
Progress in Informatics,
p.
41.
Schroeder-Heister, Peter
2006.
Validity Concepts in Proof-theoretic Semantics.
Synthese,
Vol. 148,
Issue. 3,
p.
525.
Dyckhoff, Roy
and
Lengrand, Stéphane
2006.
Logical Approaches to Computational Barriers.
Vol. 3988,
Issue. ,
p.
173.
Dyckhoff, Roy
and
Negri, Sara
2006.
Decision methods for linearly ordered Heyting algebras.
Archive for Mathematical Logic,
Vol. 45,
Issue. 4,
p.
411.
Ciabattoni, Agata
and
Terui, Kazushige
2006.
Logic for Programming, Artificial Intelligence, and Reasoning.
Vol. 4246,
Issue. ,
p.
135.
Mints, Grigori
2006.
Cut Elimination for S4C: A Case Study.
Studia Logica,
Vol. 82,
Issue. 1,
p.
121.
Dyckhoff, Roy
Kesner, Delia
and
Lengrand, Stéphane
2006.
Automated Reasoning.
Vol. 4130,
Issue. ,
p.
347.
Moser, Georg
and
Zach, Richard
2006.
The Epsilon Calculus and Herbrand Complexity.
Studia Logica,
Vol. 82,
Issue. 1,
p.
133.
Jankowski, Andrzej
and
Skowron, Andrzej
2007.
Transactions on Rough Sets VI.
Vol. 4374,
Issue. ,
p.
94.
Wang, Bow-Yaw
2007.
CONCUR 2007 – Concurrency Theory.
Vol. 4703,
Issue. ,
p.
303.