Results 1 - 10
of
19
The Boyer-Moore Theorem Prover and Its Interactive Enhancement
, 1995
"... . The so-called "Boyer-Moore Theorem Prover" (otherwise known as "Nqthm") has been used to perform a variety of verification tasks for two decades. We give an overview of both this system and an interactive enhancement of it, "Pc-Nqthm," from a number of perspectives. First we introduce the logic in ..."
Abstract
-
Cited by 27 (0 self)
- Add to MetaCart
. The so-called "Boyer-Moore Theorem Prover" (otherwise known as "Nqthm") has been used to perform a variety of verification tasks for two decades. We give an overview of both this system and an interactive enhancement of it, "Pc-Nqthm," from a number of perspectives. First we introduce the logic in which theorems are proved. Then we briefly describe the two mechanized theorem proving systems. Next, we present a simple but illustrative example in some detail in order to give an impression of how these systems may be used successfully. Finally, we give extremely short descriptions of a large number of applications of these systems, in order to give an idea of the breadth of their uses. This paper is intended as an informal introduction to systems that have been described in detail and similarly summarized in many other books and papers; no new results are reported here. Our intention here is merely to present Nqthm to a new audience. This research was supported in part by ONR Contract N...
A Theorem Prover for a Computational Logic
, 1990
"... We briefly review a mechanical theorem-prover for a logic of recursive functions over finitely generated objects including the integers, ordered pairs, and symbols. The prover, known both as NQTHM and as the Boyer-Moore prover, contains a mechanized principle of induction and implementations of line ..."
Abstract
-
Cited by 22 (0 self)
- Add to MetaCart
We briefly review a mechanical theorem-prover for a logic of recursive functions over finitely generated objects including the integers, ordered pairs, and symbols. The prover, known both as NQTHM and as the Boyer-Moore prover, contains a mechanized principle of induction and implementations of linear resolution, rewriting, and arithmetic decision procedures. We describe some applications of the prover, including a proof of the correct implementation of a higher level language on a microprocessor defined at the gate level. We also describe the ongoing project of recoding the entire prover as an applicative function within its own logic.
Proof checking the RSA public key encryption algorithm
- American Mathematical Monthly
, 1984
"... The authors describe the use of a mechanical theorem-prover to check the published proof of the invertibility of the public key encryption algorithm of Rivest, Shamir and Adleman: (M mod n) mod N=M, provided n is the product of two distinct primes p and q, M
Abstract
-
Cited by 21 (9 self)
- Add to MetaCart
The authors describe the use of a mechanical theorem-prover to check the published proof of the invertibility of the public key encryption algorithm of Rivest, Shamir and Adleman: (M mod n) mod N=M, provided n is the product of two distinct primes p and q, M<n, and e and d are multiplicative inverses in the ring of integers modulo (p-1)*(q-1). Among the lemmas proved mechanically and used in the main proof are many familiar theorems of number theory, including Fermat’s theorem: M mod p=1, when p M. The axioms underlying the proofs are those of Peano arithmetic and ordered pairs. The development of mathematics toward greater precision has led, as is well known, to the formalization of large tracts of it, so that one can prove any theorem using nothing but a few mechanical rules.-- Godel [11] But formalized mathematics cannot in practice be written down in full, and therefore we must have confidence in what might be called the common sense of the mathematician... We shall therefore very quickly abandon formalized mathematics...-- Bourbaki [1] 1.
Partition Algebras
, 2005
"... The partition algebra CAk(n) is the centralizer algebra of Sn acting on the k-fold tensor product V ⊗k of its n-dimensional permutation representation V.The partition algebra CA 1 (n) k+ 2 is the centralizer algebra of the restriction of V ⊗k to Sn−1 ⊆ Sn. Weapply the theory of the basic constructio ..."
Abstract
-
Cited by 20 (3 self)
- Add to MetaCart
The partition algebra CAk(n) is the centralizer algebra of Sn acting on the k-fold tensor product V ⊗k of its n-dimensional permutation representation V.The partition algebra CA 1 (n) k+ 2 is the centralizer algebra of the restriction of V ⊗k to Sn−1 ⊆ Sn. Weapply the theory of the basic construction (generalized matrix algebras) to the tower of partition algebras CA0(n) ⊆ CA 1 (n) CA1(n) ⊆ CA 1 (n) ⊆···.Ourmainresults are: 2 1 2 (a) a presentation on generators and relations for CAk(n); (b) aderivation of “Specht modules ” from the basic construction; (c) a proof that CAk(n) is semisimple if and only if k ≤ (n + 1)/2 (except for a few special cases); (d) Murphy elements for CAk(n);and (e) an exposition on the theory of the basic construction and semisimple algebras.
Constructing the real numbers in HOL
, 1992
"... This paper describes a construction of the real numbers in the HOL theorem-prover by strictly definitional means using a version of Dedekind's method. It also outlines the theory of mathematical analysis that has been built on top of it and discusses current and potential applications in verificatio ..."
Abstract
-
Cited by 7 (1 self)
- Add to MetaCart
This paper describes a construction of the real numbers in the HOL theorem-prover by strictly definitional means using a version of Dedekind's method. It also outlines the theory of mathematical analysis that has been built on top of it and discusses current and potential applications in verification and computer algebra. Keywords: Mathematical Logic; Deduction and Theorem Proving 1 The real numbers For some mathematical tasks, the natural numbers N = f0; 1; 2; : : :g are sufficient. However for many purposes it is convenient to use a more extensive system, such as the integers (Z) or the rational (Q ), real (R) or complex (C ) numbers. In particular the real numbers are normally used for the measurement of physical quantities which (at least in abstract models) are continuously variable, and are therefore ubiquitous in scientific applications. 1.1 Properties of the real numbers We can characterize the reals as the unique `complete ordered field'. More precisely, the reals are a set ...
Derived Categories of Quadric Fibrations and Intersections of Quadrics. math.AG/0510670
"... Abstract. We construct a semiorthogonal decomposition of the derived category of coherent sheaves on a quadric fibration consisting of several copies of the derived category of the base of the fibration and the derived category of coherent sheaves of modules over the sheaf of even parts of the Cliff ..."
Abstract
-
Cited by 7 (1 self)
- Add to MetaCart
Abstract. We construct a semiorthogonal decomposition of the derived category of coherent sheaves on a quadric fibration consisting of several copies of the derived category of the base of the fibration and the derived category of coherent sheaves of modules over the sheaf of even parts of the Clifford algebras on the base corresponding to this quadric fibration generalizing the Kapranov’s description of the derived category of a single quadric. As an application we verify that the noncommutative algebraic variety (P(S 2 W ∗), B0), where B0 is the universal sheaf of even parts of Clifford algebras, is Homologically Projectively Dual to the projective space P(W) in the double Veronese embedding P(W) → P(S 2 W). Using the properties of the Homological Projective Duality we obtain a description of the derived category of coherent sheaves on a complete intersection of any number of quadrics. 1.
Inductive Theory of Vision
, 1996
"... In spite of the fact that some of the outstanding physiologists and neurophysiologists (e.g. Hermann von Helmholtz and Horace Barlow) insisted on the central role of inductive learning processes in vision as well as in other sensory processes, there are absolutely no (computational) theories of visi ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
In spite of the fact that some of the outstanding physiologists and neurophysiologists (e.g. Hermann von Helmholtz and Horace Barlow) insisted on the central role of inductive learning processes in vision as well as in other sensory processes, there are absolutely no (computational) theories of vision that are guided by these processes. It appears that this is mainly due to the lack of understanding of what inductive learning processes are. We strongly believe in the central role of inductive learning processes, around which, we think, all other (intelligent) biological processes have evolved. In this paper we outline a (computational) theory of vision completely built around the inductive learning processes for all levels in vision. The development of such a theory became possible with the advent of the formal model of inductive learning---evolving transformation system (ETS). The proposed theory is based on the concept of structured measurement device, which is motivated by the formal model of inductive learning and is a far-reaching generalization of the concept of classical measurement device
Convergence of Automorphisms of Compact Projective Planes
"... Introduction Convergence and continuity properties of homomorphisms play an important role in the theory of topological projective planes. Grundhofer [8] showed that the set \Sigma of all automorphisms of a compact projective plane is a locally compact transformation group with respect to the topol ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Introduction Convergence and continuity properties of homomorphisms play an important role in the theory of topological projective planes. Grundhofer [8] showed that the set \Sigma of all automorphisms of a compact projective plane is a locally compact transformation group with respect to the topology of uniform convergence; for the special case of compact connected projective planes see also Salzmann [21]. With regards to classification, compact connected projective planes have been successfully investigated by studying their automorphism group, see Salzmann, Betten, Grundhofer, Hahl, Lowen, and Stroppel [22] for a detailed exposition. Salzmann [20] proved that if \Pi is a 2-dimensional compact projective plane, then on \Sigma the topology of pointwise convergence coincides with the topology of uniform convergence. He also showed ([19]) that any homomorphism between 2-dimensional compact projective planes is in fact a homeomorphism. Grundhofer [9] characterized the continuity of non-
Proper actions and proper invariant metrics
, 2008
"... We show that if a (locally compact) group G acts properly on a locally compact σ-compact space X then there is a family of G-invariant proper continuous finite-valued pseudometrics which induces the topology of X. If X is furthermore metrizable then G acts properly on X if and only if there exists a ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
We show that if a (locally compact) group G acts properly on a locally compact σ-compact space X then there is a family of G-invariant proper continuous finite-valued pseudometrics which induces the topology of X. If X is furthermore metrizable then G acts properly on X if and only if there exists a G-invariant proper compatible metric on X.

