Formal sciences形式科学

Heapsort 051 Sorting algorithms 052 Complexity classes 053 Compactness 054 Exponential tightness 055 Mutual exclusion 056 F statistic 057 Model checking 058 Model theory 059 Transfinite recursion 060 Non-projective structure 061 Shift-reduce parsing 062 Dependency reachability 063 Noether current 064 Dimensionless parameter 065 Karoubi completion 066 Redundant component 067 Pseudo-counts 068 Fusion frames 069 Jeffreys’ divergence 070 Confluence 071 Parameter-Bounded Rewriting 072 Snake lemma 073 Unobservable subspace 074 CP decomposition 075 Invariant theory 076 Posterior predictive distribution 077 Lower bounds 078 SMT modulo theories 079 Tableaux 080 Cut elimination 081 Inference rule 082 Type system 083 Predicate 084 Partial order 085 Logical equivalence 086 Phasor 087 Complex representation 088 FOLLOW set 089 LL parsing 090 Predictive parsing 091 Left recursion 092 Parsing table 093 Shift-reduce conflict 094 Parse table 095 Parse tree 096 Chart parsing 097 Support 098 Tempered distribution 099 Derived functor 100