The original definition of interactive proof-systems, as given by Goldwasser, Micali and Rackoff, does not impose limits on the prover's computing power [GMR89]. This is also the case for Babai's Arthur-Merlin games IBM88]. Hence, the prover may wish to convince the verifier of the t ru th of an assertion, but it does not really make sense for the prover to convince the verifier that she 1 know...

The recent rise of “computer-assisted” and “experimental” mathematics raises intriguing questions as to the future role of computation in mathematics. These results also draw into question the traditional distinctions that have been drawn between formal proof and computationally-assisted proof. This article explores these questions in the context of the growing consensus among computer technolo...

A shallow semantical embedding of a dyadic deontic logic by Carmo and Jones in classical higher-order logic is presented. This embedding is proven sound and complete, that is, faithful. The work presented here provides the theoretical foundation for the implementation and automation of dyadic deontic logic within off-the-shelf higherorder theorem provers and proof assistants.

We present a computer assisted proof of existence of a family of Lyapunov orbits which stretches from L2 (the collinear libration point between the primaries) up to half the distance to the smaller primary in the Jupiter-Sun planar circular restricted three body problem. We then focus on a small family of Lyapunov orbits with energies close to comet Oterma and show that their associated invaria...

Recent results in interactive proof systems [?][?] [?] seem to indicate that it is easier for a prover in a single prover interactive proof system to cheat the verifier than it is for a prover in a multiple prover interactive proof system. We show that this is not the case for a single prover in which all but a fixed polynomial of the prover’s space is erased between each round. One consequence...

The HOL system is an LCF-style mechanized proof-assistant for conducting proofs in higher order logic. This paper discusses a proposal to extend the primitive basis of the logic underlying the HOL system with a very simple form of quantification over types. It is shown how certain practical problems with using the definitional mechanisms of HOL would be solved by the additional expressive power...

We present the generic system framework of Isabelle/Isar underlying recent versions of Isabelle. Among other things, Isar provides an infrastructure for Isabelle plug-ins, comprising extensible state components and extensible syntax that can be bound to tactical ML programs. Thus the Isabelle/Isar architecture may be understood as an extension and refinement of the traditional “LCF approach”, w...

This paper presents a machine-checked proof of the Basic Theorem on Concept Lattices, which appears in the book ”Formal Concept Analysis” by Ganter and Wille, in the Isabelle/HOL Proof Assistant. As a by-product, the underlying lattice theory by Kammueller has been extended.

We consider zero knowledge interactive proofs in a richer, more realistic communication environment. In this setting, one may simultaneously engage in many interactive proofs, and these proofs may take place in an asynchronous fashion. It is known that zero-knowledge is not necessarily preserved in such an environment; we show that for a large class of protocols, it cannot be preserved. Any 4 r...