Search results

From Maths
Jump to: navigation, search
  • ..., they are covered in the motivation for set theory page, and "D" denotes "definition" - which is something that is natural to define at that point | There exists an [[Inductive property]]
    3 KB (619 words) - 10:25, 11 March 2015
  • ==Definition== ...t order language]], {{M|\mathscr{L} }} we define the ''terms'' [[inductive definition|inductively]] using the following 3 rules{{rMLFFISWL}}:
    1,006 B (165 words) - 05:15, 8 September 2016
  • ==Definition== ...al formulas of a [[FOL]] are (like {{link|terms|FOL}}) defined [[inductive definition|inductively]] by the following 5 rules{{rMLFFISWL}}:
    3 KB (500 words) - 05:37, 8 September 2016
  • ==Definition== ...f all the [[terms (FOL)|terms of a FOL]], {{M|\mathscr{L}_T}}, [[inductive definition|inductively]] using the following two rules{{rMLFFISWL}}:
    1 KB (209 words) - 08:35, 8 September 2016
  • ==Definition== ...cr{L}_T}}, which we denote by {{M|t_{\mathbf{M}[\sigma]} }} is [[inductive definition|defined inductively]] as follows{{rMLFFISWL}}:
    1 KB (216 words) - 07:49, 10 September 2016
  • ==Definition== ...r{L}_F}}, which we denote by {{M|A_{\mathbf{M}[\sigma]} }}, is [[inductive definition|defined inductively]] as follows{{rMLFFISWL}}:
    3 KB (523 words) - 07:53, 11 September 2016
  • ==Definition== * [[Inductive set]]
    2 KB (305 words) - 15:14, 3 February 2017
  • ==Definition== Let {{M|I}} be a [[set]]. We call {{M|I}} an ''inductive set'' if{{rITSTHJ}} both of the following properties hold:
    924 B (162 words) - 15:56, 3 February 2017