
Towards Machine Learning Induction
Induction lies at the heart of mathematics and computer science. However...
read it

Induction rules in bounded arithmetic
We study variants of Buss's theories of bounded arithmetic axiomatized b...
read it

A NoviceFriendly Induction Tactic for Lean
In theorem provers based on dependent type theory such as Coq and Lean, ...
read it

CounterexampleGuided kInduction Verification for Fast Bug Detection
Recently, the kinduction algorithm has proven to be a successful approa...
read it

The Implications of the NoFreeLunch Theorems for Metainduction
The important recent book by G. Schurz appreciates that the nofreelunc...
read it

Abstraction Superstructuring Normal Forms: Towards a Theory of Structural Induction
Induction is the process by which we obtain predictive laws or theories ...
read it

Induction Models on ℕ
Mathematical induction is a fundamental tool in computer science and mat...
read it
Induction and Skolemization in saturation theorem proving
We consider a typical integration of induction in saturationbased theorem provers and investigate the effects of Skolem symbols occurring in the induction formulas. In a practically relevant setting we establish a Skolemfree characterization of refutation in saturationbased proof systems with induction. Finally, we use this characterization to obtain unprovability results for a concrete saturationbased induction prover.
READ FULL TEXT
Comments
There are no comments yet.