Logic逻辑学

Walk recurrence 001 Measurable function 002 Complementary slackness 003 Total preorder 004 Dominance 005 Mutual exclusivity 006 Proof system 007 Minimal Unsatisfiable Subset 008 Model 009 Short-circuit evaluation 010 Halfway case 011 Edit graph 012 Presburger arithmetic 013 Universal quantifier elimination 014 Free variable 015 Universal quantification 016 Alpha-conversion 017 free variables 018 membership predicate 019 characteristic predicate 020 Total computable function 021 Decidable set 022 Completeness under reductions 023 Reduction chain 024 Computable mapping reduction 025 Oracle computability 026 Quantifier alternation 027 Decidable problem 028 Uncountable set 029 Equipotent sets 030 Multivalued inverse 031 Dialectic 032 Satisfiability 033 Zero distance equivalence 034 Yoneda lemma 035 Hom-set 036 Strong normalization 037 Weak normalization 038 Termination 039 Five-term exact diagram 040 Five lemma 041 Satisfiability checking 042 Branch closure 043 Antecedent 044 Sequent calculus 045 Eigenvariable 046 Introduction rule 047 Soundness 048 Comparability 049 Hasse diagram 050