DeepAI
Log In Sign Up

Further results and examples for formal mathematical systems with structural induction

08/17/2020
by   Matthias Kunik, et al.
0

In the former article "Formal mathematical systems including a structural induction principle" we have presented a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the predicate calculus as well as a formal induction principle. In this paper we present some further results and examples in order to illustrate how this theory works.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/26/2019

Induction, Coinduction, and Fixed Points: Intuitions and Tutorial

Recently we presented a concise survey of the formulation of the inducti...
09/24/2013

Automation of Mathematical Induction as part of the History of Logic

We review the history of the automation of mathematical induction...
02/06/2013

Principles of modal and vector theory of formal intelligence systems

The paper considers the class of information systems capable of solving ...
06/03/2020

Embracing undecidability: Cognitive needs and theory evaluation

There are many ways we can not know. Even in systems that we created our...
09/27/2018

Induction rules in bounded arithmetic

We study variants of Buss's theories of bounded arithmetic axiomatized b...
08/14/2020

Induction Models on ℕ

Mathematical induction is a fundamental tool in computer science and mat...
07/15/2021

Optimal sports betting strategies in practice: an experimental review

We investigate the most popular approaches to the problem of sports bett...