Probabilistically Checkable ProofsSUDAN, Madhu.Communications of the ACM. 2009, Vol 52, Num 3, pp 76-84, issn 0001-0782, 9 p.Article

Satisfiability Modulo Theories: Introduction and ApplicationsDE MOURA, Leonardo; BJØRNER, Nikolaj.Communications of the ACM. 2011, Vol 54, Num 9, pp 69-77, issn 0001-0782, 9 p.Article

Structured calculational proofBACK, R; GRUNDY, J; VON WRIGHT, J et al.Formal aspects of computing. 1997, Vol 9, Num 5-6, pp 469-483, issn 0934-5043Article

Categorical proof theory of classical propositional calculusBELLIN, Gianluigi; HYLAND, Martin; ROBINSON, Edmund et al.Theoretical computer science. 2006, Vol 364, Num 2, pp 146-165, issn 0304-3975, 20 p.Conference Paper

Translation of resolution proofs into short first-order proofs without choice axiomsDE NIVELLE, Hans.Information and computation (Print). 2005, Vol 199, Num 1-2, pp 24-54, issn 0890-5401, 31 p.Conference Paper

A unification-theoretic method for investigating the k-provability problemFARMER, W. M.Annals of pure and applied logic. 1991, Vol 51, Num 3, pp 173-214, issn 0168-0072, 42 p.Article

Linear logic displayedBELNAP, N.Notre Dame journal of formal logic. 1990, Vol 31, Num 1, pp 14-25, issn 0029-4527, 12 p.Article

Generalization in type theory based proof assistantsPONS, Olivier.Lecture notes in computer science. 2002, pp 217-232, issn 0302-9743, isbn 3-540-43287-6Conference Paper

Relativisation provides natural separations for resolution-based proof systemsDANTCHEV, Stefan.Lecture notes in computer science. 2006, pp 147-158, issn 0302-9743, isbn 3-540-34166-8, 1Vol, 12 p.Conference Paper

Competitive semantic tree theorem prover with resolutionsCHOON KYU KIM; NEWBORN, Monty.Lecture notes in computer science. 2003, pp 227-231, issn 0302-9743, isbn 3-540-20149-1, 5 p.Conference Paper

On generalizations of semi-terms of particularly simple formBAAZ, Matthias; MOSER, Georg.Lecture notes in computer science. 2002, pp 382-396, issn 0302-9743, isbn 3-540-44240-5, 15 p.Conference Paper

P.rex : An interactive proof explainerFIEDLER, Armin.Lecture notes in computer science. 2001, pp 416-420, issn 0302-9743, isbn 3-540-42254-4Conference Paper

Keeping the SZK-verifier honest unconditionallyDI CRESCENZO, G; OKAMOTO, T; YUNG, M et al.Lecture notes in computer science. 1997, pp 31-45, issn 0302-9743, isbn 3-540-63384-7Conference Paper

Propositional quantification for conditional logicBESNARD, P; GUINNEBAULT, J.-M; MAYER, E et al.Lecture notes in computer science. 1997, pp 183-197, issn 0302-9743, isbn 3-540-63095-3Conference Paper

Example verifications using alphabet axiomsKORVER, H; SELLINK, A.Formal aspects of computing. 1998, Vol 10, Num 1, pp 43-58, issn 0934-5043Article

Explaining Gentzen's consistency proof within infinitary proof theoryBUCHHOLZ, W.Lecture notes in computer science. 1997, pp 4-17, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Fast cut-elimination by projectionBAAZ, M; LEITSCH, A.Lecture notes in computer science. 1997, pp 18-33, issn 0302-9743, isbn 3-540-63172-0Conference Paper

The Syllogistic with UnityPRATT-HARTMANN, Ian.Journal of philosophical logic. 2013, Vol 42, Num 2, pp 391-407, issn 0022-3611, 17 p.Article

The seventeen provers of the worldWiedijk, Freek.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-30704-4, 1Vol, XVI-157 p, isbn 3-540-30704-4Book

System description : GCLCprover geothmsJANICIC, Predrag; QUARESMA, Pedro.Lecture notes in computer science. 2006, pp 145-150, issn 0302-9743, isbn 3-540-37187-7, 1Vol, 6 p.Conference Paper

Using the TPTP language for writing derivations and finite interpretationsSUTCLIFFE, Geoff; SCHULZ, Stephan; CLAESSEN, Koen et al.Lecture notes in computer science. 2006, pp 67-81, issn 0302-9743, isbn 3-540-37187-7, 1Vol, 15 p.Conference Paper

Connection Cutting for Contraction Free logicFRONHÖFER, B.Lecture notes in computer science. 1997, pp 385-388, issn 0302-9743, isbn 3-540-63493-2Conference Paper

Comments on Can backpropagation error surface not have local minima?'HAMEY, L. G. C.IEEE transactions on neural networks. 1994, Vol 5, Num 5, pp 844-845, issn 1045-9227Article

Survey of Disjoint NP-pairs and Relations to Propositional Proof SystemsGLASSER, Christian; SELMAN, Alan L; LIYU ZHANG et al.Theoretical computer science (essays in memory of Shimon Even). Lecture notes in computer science. 2006, pp 241-253, issn 0302-9743, isbn 3-540-32880-7, 1Vol, 13 p.Book Chapter

A simple proof of 1 + 1/2² + 1/3² + ... = π²/6 and related identitiesHOFBAUER, Josef.The American mathematical monthly. 2002, Vol 109, Num 2, pp 196-200, issn 0002-9890Article