Structure of proofs and the complexity of cut eliminationWENHUI ZHANG.Theoretical computer science. 2006, Vol 353, Num 1-3, pp 63-70, issn 0304-3975, 8 p.Article

Heuristics for a calculational proofDIJKSTRA, E. W.Information processing letters. 1995, Vol 53, Num 3, pp 141-143, issn 0020-0190Article

Temporal logic for proof-carrying codeBERNARD, Andrew; LEE, Peter.Lecture notes in computer science. 2002, pp 31-46, issn 0302-9743, isbn 3-540-43931-5, 16 p.Conference Paper

UNIVERSAL ARGUMENTS AND THEIR APPLICATIONSBARAK, Boaz; COLDREICH, Oded.SIAM journal on computing (Print). 2009, Vol 38, Num 5, pp 1661-1694, issn 0097-5397, 34 p.Article

Proof systems that take adviceBEYERSDORFF, Olaf; KÖBLER, Johannes; MÜLLER, Sebastian et al.Information and computation (Print). 2011, Vol 209, Num 3, pp 320-332, issn 0890-5401, 13 p.Conference Paper

Die Beweisentwicklungsmumgebung Ω-MKRP : Themenheft : Sonderforschungsbereich 314 - Künstliche Intelligenz - Wissensbasierte Systeme = The proof development environment Ω-MKRP^*HUANG, X; KERBER, M; KOHLHASE, M et al.Informatik (Berlin, West). 1996, Vol 11, Num 1, pp 20-26, issn 0178-3564Article

CERES : An analysis of Fürstenberg's proof of the infinity of primesBAAZ, Matthias; HETZL, Stefan; LEITSCH, Alexander et al.Theoretical computer science. 2008, Vol 403, Num 2-3, pp 160-175, issn 0304-3975, 16 p.Article

Granularity Analysis for Mathematical ProofsSCHILLER, Marvin R. G.Topics in cognitive science (Print). 2013, Vol 5, Num 2, pp 251-269, issn 1756-8757, 19 p.Conference Paper

On the expressive power of schemesDOWEK, Gilles; YING JIANG.Information and computation (Print). 2011, Vol 209, Num 9, pp 1231-1245, issn 0890-5401, 15 p.Article

The Church―Fitch knowability paradox in the light of structural proof theoryMAFFEZIOLI, Paolo; NAIBO, Alberto; NEGRI, Sara et al.Synthese (Dordrecht). 2013, Vol 190, Num 14, pp 2677-2716, issn 0039-7857, 40 p.Article

On the purpose of Event-B proof obligationsHALLERSTEDE, Stefan.Formal aspects of computing. 2011, Vol 23, Num 1, pp 133-150, issn 0934-5043, 18 p.Article

The knowledge complexity of quadratic residuosity languagesDE SANTIS, A; DI CRESCENZO, G; PERSIANO, G et al.Theoretical computer science. 1994, Vol 132, Num 1-2, pp 291-317, issn 0304-3975Article

The context of provingLIVINGSTON, Eric.Social studies of science. 2006, Vol 36, Num 1, pp 39-68, issn 0306-3127, 30 p.Article

Dealing with proofsNG, K. H; PEH, W. C. G.Singapore medical journal. 2009, Vol 50, Num 12, pp 1134-1138, issn 0037-5675, 5 p.Article

On the Security of RFID Group Scanning Protocols : Trust, security and privacy for pervasive applicationsDUC NGUYEN DANG; KIM, Kwangjo.IEICE transactions on information and systems. 2010, Vol 93, Num 3, pp 528-530, issn 0916-8532, 3 p.Article

Possible disagreements and defeat = Désaccords possibles et défaiteCAREY, Brandon.Philosophical studies. 2011, Vol 155, Num 3, pp 371-381, issn 0031-8116, 11 p.Article

Assessing impacts of dredge spoil disposal using equivalence tests: implications of a precautionary (proof of safety) approachCOLE, Russell; MCBRIDE, Graham.Marine ecology. Progress series (Halstenbek). 2004, Vol 279, pp 63-72, issn 0171-8630, 10 p.Article

Resolution remains hard under equivalence : The Satisfiability ProblemBÜNING, H. K; LETTMANN, T.Discrete applied mathematics. 1999, Vol 96-97, pp 139-148, issn 0166-218XArticle

Deriving proof rules from continuation semanticsAUDEBAUD, P; ZUCCA, E.Formal aspects of computing. 1999, Vol 11, Num 4, pp 426-447, issn 0934-5043Article

Extending Bachmair's method for proof by consistency to the final algebraLYSNE, O.Information processing letters. 1994, Vol 51, Num 6, pp 303-310, issn 0020-0190Article

Nondeterministic functions and the existence of optimal proof systemsBEYERSDORFF, Olaf; KÖBLER, Johannes; MESSNER, Jochen et al.Theoretical computer science. 2009, Vol 410, Num 38-40, pp 3839-3855, issn 0304-3975, 17 p.Article

Efficient execution in a class of term rewriting systemsSUGIYAMA, Y; TANIGUCHI, K; KASAMI, T et al.Systems, computers, controls. 1982, Vol 13, Num 4, pp 22-30, issn 0096-8765Article

Interactive proof criticsIRELAND, A; JACKSON, M; REID, G et al.Formal aspects of computing. 1999, Vol 11, Num 3, pp 302-325, issn 0934-5043Article

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

The liveness property of on-the-fly garbage collector: a proofRAMESH, S; MEHNDIRATTA, S. L.Information processing letters. 1983, Vol 17, Num 4, pp 189-195, issn 0020-0190Article