第一章 集合论、逻辑与算法基础
1.1集合
set(集合) power set(幂)
complement of a set(补集) roster method(枚举法)
universalset set(全集) symmetric difference(对称差集)
set-builder method(集合构造方法) Venn diagrams(文氏图)
ordered pair(有序对) subset(子集)
union of sets(并集) Cartesian product(笛卡尔积)
superset(父集) intersection of sets(交集)
diagonal of a set(对角集) proper subset(真子集)
disjoint sets(不相交集) ordered n-tuples(有序n元组)
equal sets(相等集合) index set(索引集)
n-flod Cartesian product(n次笛卡尔积)
empty (null)set(空集) set difference(差集)
bit string(位串) finite set(有限集)
mutually disjoint(互不相交) length(长度)
infinite set(无限集) pairwise disjoint(互不相交)
singleton set(单体集合) relative complement(相对补集)
1.2数理逻辑
statement(命题) condition(条件)
converse(逆命题) proposition(命题)
biimplication(双向蕴涵) inverse(反命题)
truth value(真值) biconditional(双向条件)
contrapositive(逆否命题) negation(非)
logical connectives(逻辑连接词) statement formula(命题公式)
conjunction(合取) well-formed formulas(良态公式)
formula(公式) disjunction(析取)
tautology(重言式) implication(蕴涵)
contradiction(矛盾式)
1.3论证有效性
proof(证明) modus tollens(否定法)
disjunctive addition(析取加法) argument(论证)
disjunctive syllogisms(析取三段论) conjunctive addition(合取加法)
conclusion(结论) hypothetical syllogism(假设三段论)
logically valid(逻辑有效) premise(前提)
dilemma(二难推论) modus ponens(断言法)
conjunctive simpli fications(合取简化)
1.4量词与一阶逻辑
statement logic(命题逻辑) predicate(谓词)
domain(域) propositional logic(命题逻辑)
propositional function(命题函数) free vricable(自由变量)
n-place predicate(n位谓词) bound variable(约束变量)
first-order logic(一阶逻辑) universal quantifier(全称量词)
counterexample(反例) existential quantifier(存在量词)
disproof(反证)
1.5证明方法
theorem(定理) indirect proof(间接证明)
proof by contradiction(反证法) proof by direct method(直接证明方法)
direct proof(直接证明)
1.6 算法
algorithm(算法) two-way selection(双路选择)
list(列表) input(输入)
if two-dimensional array(二维数组)
output(输出) then
read precision(精度)
else print
uniqueness(唯一性) while
subproprams(子程序) finiteness(有限性)
do procedure
generality(通用性) for
function assignment operator(赋值运算符)
begin constant polynomial(常量多项式)
assignment statement(赋值语句) end
degree(次数) control structures(控制结构)
return one-way selection(单路选择)
arrays(数组)
第三章 关系与偏序集
3.1关系与偏序集
binary relation (二元关系) directed graph representation(有向图表示)
digraph (有向图) relation (关系) vertex(顶点)
adjacent to (与...相邻) R-related (R-相关) directed edge(有向边)
adjacent from(从...相邻) related (相关) directed arc(有向弧)
loop (环) empty relation (空关系) arrow diagram (矢量图)
identity matrix是什么意思domain (域) universal relation (全称关系) directed graph(有向图)
range (值域) image (映像) equivalence class (等价类)
transitive closure (传递闭包) inverse (逆) R-class(R-类)
directed walk (有向通路) composition (复合) reflexive (自反)
R-equivalence class (R-等价类) walk (通路) partition (划分)
vertices of the walk (通路顶点) transitive (传递)
equivalence relation induced by the partition (划分推出的等价关系)
terminal vertex (终止顶点) equivalence relation (等价关系)
internal vertices (内部顶点) equality relation (相等性关系)
reflexive closure (自反闭包) path (路径)
版权声明:本站内容均来自互联网,仅供演示用,请勿用于商业和其他非法用途。如果侵犯了您的权益请与我们联系QQ:729038198,我们将在24小时内删除。
发表评论