Results 21 to 30 of about 349,803 (277)
A Proof of Smarandache-Pătraşcu’s Theorem using Barycentric Coordinates [PDF]
Proving the Smarandache–Pătraşcu’s Theorem in relation to the inscribed orthohomological triangles using the barycentric ...
Coandă, Claudiu
core +1 more source
Continuity and Differentiability of Solutions with Respect to Initial Conditions and Peano Theorem for Uncertain Differential Equations [PDF]
In this paper we study the dependence of solutions of uncertain initial value problems (UIVP) on the initial values. Introducing a contraction mapping and using Banach Fixed Point Theorem (BFPT), the existence and uniqueness (EaU) of solutions of the ...
Vahid Roomi, Hamid Ahmadi
doaj +1 more source
The embedding of the spacetime in five dimensions: an extension of Campbell-Magaard theorem [PDF]
We extend Campbell-Magaard embedding theorem by proving that any n-dimensional semi-Riemannian manifold can be locally embedded in an (n+1)-dimensional Einstein space.
Antoniadis I. +7 more
core +4 more sources
Another look at automated theorem-proving
I examine the use of automated theorem-proving for reductionist security arguments in cryptography and discuss three papers that purport to show the potential of computer-assisted proof-writing and proof-checking.
Koblitz Neal
doaj +1 more source
CardS4: modal theorem proving on Java smart cards
We describe a successful implementation of a theorem prover for modal logic S4 that runs on a Java smart card with only 512 KBytes of RAM and 32 KBytes of EEPROM.
Rajeev Prabhakar Goré +1 more
doaj +1 more source
Formalization and Implementation of Algebraic Methods in Geometry [PDF]
We describe our ongoing project of formalization of algebraic methods for geometry theorem proving (Wu's method and the Groebner bases method), their implementation and integration in educational tools.
Filip Marić +3 more
doaj +1 more source
Another look at automated theorem-proving II
I continue the discussion initiated in part I (published in this journal in 2007) of whether or not computer-assisted proofs are a promising approach to preventing errors in reductionist security arguments.
Koblitz Neal
doaj +1 more source
Prototyping "Systems that Explain Themselves" for Education [PDF]
"Systems that Explain Themselves" appears a provocative wording, in particular in the context of mathematics education – it is as provocative as the idea of building educational software upon technology from computer theorem proving.
Alan Krempler, Walther Neuper
doaj +1 more source
Robust Computer Algebra, Theorem Proving, and Oracle AI [PDF]
In the context of superintelligent AI systems, the term "oracle" has two meanings. One refers to modular systems queried for domain-specific tasks. Another usage, referring to a class of systems which may be useful for addressing the value alignment and ...
Hay, Nick J., Sarma, Gopal P.
core +3 more sources
Theorem recycling for Theorem Proving
In this paper we examine two cases where solutions to one system of constraints can be used or adapted to solutions to others, for free. We first revisit a method by Bromberger for lifting solutions to systems over linear real arithmetic to solutions over integers. We extend it by identifying several scenarios where solutions over reals can be directly
Nikolaj Bjorner, Lev Nachmanson
openaire +2 more sources

