Computer-assisted proof

Known as: Computer assisted proof, Computer proof, Computer-aided proof 
A computer-assisted proof is a mathematical proof that has been at least partially generated by computer. Most computer-aided proofs to date have… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
An infinite ±1-sequence is called Apwenian if its Hankel determinant of order n divided by 2n-1 is an odd number for every… (More)
  • table 1
  • table 2
Is this relevant?
2011
2011
We present a topological proof of the existence of a normally hyperbolic invariant manifold for maps. In our approach we do not… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
The restricted circular three-body problem is considered for the following parameter values C = 3.03, μ = 0.0009537 the values… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Review
2007
Review
2007
We present a recent application area of the proof assistant Ωmega, the teaching of mathematical proofs within an environment for… (More)
  • figure 1
Is this relevant?
2006
2006
This paper discusses the problem what makes a computer-assisted proof trustworthy, the quest for an algorithmic support system… (More)
Is this relevant?
2006
2006
  • E. E. Popova
  • 12th GAMM - IMACS International Symposium on…
  • 2006
Consider a linear system A(p)x = b(p) whose input data depend on a number of uncertain parameters p = (p1,...,pk) varying within… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2002
2002
We obtain computer assisted proofs of several spherical volume inequalities that appear in the analysis of semidefinite… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Details of a new technique for obtaining rigorous results concerning the global dynamics of nonlinear systems is described. The… (More)
Is this relevant?
1997
1997
| In this paper we describe a new technique for proving that a particular system is chaotic in topological sense, i.e. that it… (More)
  • figure 1
  • figure 8
Is this relevant?
1996
1996
We introduce horseshoe-type mappings which are geometrically similar to Smale’s horseshoes. For such mappings we prove by means… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?