This paper is a revised version of the author's thesis written under the influence of a long series of papers by E. T. Cline, B. J. Parshall, and L. L. Scott, notably their study of Mackey's imprimitivity theory for algebraic groups. The "CPS" work has emphasized the study of in…
Mathematical induction is a method of proofs that has been known to mathematicians for hundreds of years, with one of the earliest proofs dating back to Francesco Maurolico (1575). During the 19th-century it was formalized as an axiom of nonnegative integers due to the work of P…
"The main areas covered are: telescoping sums and products in algebra and trigonometry, the use of complex numbers and de Moivre's Formula, Abel's summation formula, mathematical induction, combinatorial identities, multiplicative functions and the use of Mobius function. The th…
Nondiscrete induction and iterative processes
by Potra, F.-A, Ptak, V.
fromResearch Notes in Mathematics
Nondiscrete induction and iterative processes
by Potra, F.-A, Ptak, V.
fromResearch Notes in Mathematics
Nondiscrete induction and iterative processes
by Potra, F.-A, Ptak, V.
fromResearch Notes in Mathematics
Nondiscrete induction and iterative processes
by Potra, F.-A, Ptak, V.
fromResearch Notes in Mathematics
"Induction is a pervasive tool in computer science and mathematics for defining objects and reasoning on them. Coinduction is the dual of induction and as such it brings in quite different tools. Today, it is widely used in computer science, but also in other fields, including a…
Introduction to Bisimulation and Coinduction
A comprehensive treatment of two fundamental concepts in computer science, mathematics and other fields.