Theorem Proving
Mostrando 13-14 de 14 artigos, teses e dissertações.
-
13. Programação em logica, prolog e restriçõs : poder de expressão v.s. eficiencia
An introduction to logic programming is initially presented by means of an evolutionary approach. Starting with a fairly complex first order formal system, the concepts of theorem proving and its automatization are described. From there the idea of proof efficiency is presented. The most significant advances obtained during the 20th century in this area are
Publicado em: 1991
-
14. Tubular presentations π of subsets of manifolds
In this note the Weierstrass integral J is taken as L, the Riemann integral of length. Here Mn, n > 1, is a compact, connected manifold of class C∞ with a positive definite Riemann structure. Presentations (φ, Uφ) 𝒟 ∈ Mn and geodesics (with the aid of the Euler-Riemann equations) are defined in Morse, M. (1976) “Global variational analysis: Weiers