Live briefing
Everything about Structural induction
Proof method in mathematical logic
Structural induction is a proof method that is used in mathematical logic, computer science, graph theory, and some other mathematical fields. It is a generalization of mathematical induction over natural numbers and can be further generalized to arbitrary Noetherian induction. Structural recursion is a recursion method bearing the same relationship to structural induction as ordinary recursion bears to ordinary mathematical induction. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Structural inductionA 5-minute orientation
- Skim a recent paper: Inter-site structural heterogeneity induction of single atom Fe catalysts for robust oxygen reductionInfluential work since 2022
- Pick up a classic book: Introduction to algorithmsThe most-reprinted book on the subject
- Read the landmark paper: Structural Mechanisms of QacR Induction and Multidrug RecognitionCited 339 times
- Go sideways: Recursion (computer science)A closely related topic
- Go sideways: Recursive definitionA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Structural Mechanisms of QacR Induction and Multidrug Recognition
Proving Properties of Programs by Structural Induction
LTP induction by structural rather than enzymatic functions of CaMKII
Structural Induction and Coinduction in a Fibrational Setting
Structural Mechanism of Organic Hydroperoxide Induction of the Transcription Regulator OhrR
Induction of Human UDP-Glucuronosyltransferase UGT1A1 by Flavonoids—Structural Requirements
Alpha-structural recursion and induction
A Polynomial Approach to the Constructive Induction of Structural Knowledge
🆕 Influential since 2022
Inter-site structural heterogeneity induction of single atom Fe catalysts for robust oxygen reduction
Structural build-up at rest in the induction and acceleration periods of Portland Cement
Structural characterization and induction of tumor cell apoptosis of polysaccharide from purple sweet potato (Ipomoea batatas (L.) Lam)
Oleogels based on peanut protein isolate fibrils: Structural characterization dependent on induction time and suitability in marguerite biscuits
Structural basis of apoptosis induction by the mitochondrial voltage-dependent anion channel
📚 Books worth reading
Introduction to algorithmsUdi Manber · 1989- 📕Utilization of induction bonding for automated fabrication of TIGR · 1999
- 📕Rationality and experienceRobert Sugden · 1997
De l'idée au texteBarbara Minto · 1993- 📕Hopf algebras and tensor categoriesConference on Hopf Algebras and Tensor Categories (2011 University of Almeria) · 2013
- 📕Hopf Algebras, Tensor Categories and Related TopicsNicolás Andruskiewitsch, Gongxiang Liu · 2021
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Recursion (computer science) In computer science, recursion is a method of solving a computational problem where the solution depends on solutions to smaller instances of the same…
- Recursive definition In mathematics and computer science, a recursive definition, or inductive definition, is used to define the elements in a set in terms of other elements…
- Recursion Recursion occurs when the definition of a concept or process depends on a simpler or previous version of itself. Recursion is used in a variety of disciplines…
- Inductive type In type theory, a system has inductive types if it has facilities for creating a new type from constants and functions that create terms of that type.…
- Fold (higher-order function) In functional programming, a fold is a higher-order function that analyzes a recursive data structure and, through use of a given combining operation,…
- Transfinite induction Transfinite induction is an extension of mathematical induction to ordinal numbers. Its correctness is a theorem of ZF, and relies on the fact that the…
- Minimal counterexample In mathematics, a minimal counterexample is the smallest example which falsifies a claim. It is also sometimes called a minimal criminal, smallest criminal…
- Binary tree In computer science, a binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child…