Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Structural induction
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==References== * {{cite book | last = Hopcroft | first = John E.|author2=Rajeev Motwani |author3=Jeffrey D. Ullman | title = Introduction to Automata Theory, Languages, and Computation| url = https://archive.org/details/trent_0116404725818 | url-access = registration | edition = 2nd | publisher = Addison-Wesley | location = Reading Mass | year = 2001 | isbn = 978-0-201-44124-6}} * {{YouTube | u21QV-MlVDY | "Mathematical Logic - Video 01.08 - Generalized (Structural) Induction" }} Early publications about structural induction include: * {{cite journal | last = Burstall | first = R. M. | title = Proving Properties of Programs by Structural Induction | journal = The Computer Journal | volume = 12 | number = 1 | pages = 41–48 | year = 1969 | doi=10.1093/comjnl/12.1.41| doi-access = }} * {{citation | last = Aubin | first = Raymond | title = Mechanizing Structural Induction | publisher = University of Edinburgh | series = EDI-INF-PHD | volume = 76-002 | year = 1976 | hdl = 1842/6649 }} * {{cite conference | last1 = Huet | first1 = G. | last2 = Hullot | first2 = J. M. | title = Proofs by Induction in Equational Theories with Constructors | book-title = 21st Ann. Symp. on Foundations of Computer Science | publisher = IEEE | pages = 96–107 | year = 1980 | url = https://hal.inria.fr/inria-00076533/file/RR-0028.pdf}} * [[Rózsa Péter]], ''Über die Verallgemeinerung der Theorie der rekursiven Funktionen für abstrakte Mengen geeigneter Struktur als Definitionsbereiche'', Symposium International, Varsovie septembre (1959) <small>(''On the generalization of the theory of recursive functions for abstract quantities with suitable structures as domains'')</small>. {{Mathematical logic}} [[Category:Graph theory]] [[Category:Logic in computer science]] [[Category:Mathematical induction]] [[Category:Mathematical logic]] [[Category:Mathematical proofs]] [[Category:Wellfoundedness]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)