Logic for applications = 应用逻辑 / 2nd ed.
副标题:无
作 者:Anil Nerode, Richard A. Shore著.
分类号:
ISBN:9787111197720
微信扫一扫,移动浏览光盘
简介
This book is a rigorous elementary introduction to classical
predicate logic emphasizing that deduction is a form of
computation. We cover the standard topics of soundness,
completeness and compactness: our proof methods produce only valid
results, all valid sentences are provable and, if a fact is a
logical consequence of an infinite set of axioms, it is actually a
consequence of finitely many of them. The need for soundness seems
obvious but, as we see in our discussion Of PROLOG, even 更多>>
目录
preface
introduction.
i propositional logic
1 orders and trees
2 propositions. connectives and truth tables
3 truth assignments and valuations
4 tableau proofs in propositional calculus
5 soundness and completeness of tableau proofs
6 deductions from premises and compactness
7 an axiomatic approach*
8 resolution
9 refining resolution
10 linear resolution. horn clauses and prolog
ii predicate logic
1 predicates and quantifiers
2 the language: terms and formulas
3 formation trees. structures and lists
4 semantics: meaning and truth
5 interpretations of prolog programs
6 proofs: complete systematic tableaux
.7 soundness and completeness of tableau proofs
8 an axiomatic approach*
9 prenex normal form and skolemization
10 herbrand's theorem
11 unification
12 the unification algorithm
13 resolution
14 refining resolution: linear resolution
iii prolog
1 sld-resolution
2 implementations: searching and backtracking
3 controlling the implementation: cut
4 termination conditions for prolog programs
5 equality
6 negation as failure
7 negation and nonmonotonic logic
8 computability and undecidability
iv modal logic..
1 possibility and necessity; knowledge or belief
2 frames and forcing
3 modal tableaux
4 soundness and completeness
5 modal axioms and special accessibility relations
6 an axiomatic approach*
v intuitionistic logic
1 intuitionism and constructivism
2 frames and forcing
3 intuitionistic tableaux
4 soundness and completeness
5 decidability and undecidability
6 a comparative guide
vi elements of set theory
1 some basic axioms of set theory
2 boole's algebra of sets
3 relations. functions and the power set axiom
4 the natural numbers. arithmetic and infinity
5 replacement. choice and foundation
6 zermelo-fraenkel set theory in predicate logic
7 cardinality: finite and countable
8 ordinal numbers
9 ordinal arithmetic and transfinite induction
10 transfinite recursion. choice and the ranked universe
11 cardinals and cardinal arithmetic
appendix a: an historical overview
1 calculus
2 logic
3 leibniz's dream
4 nineteenth century logic
5 nineteenth century foundations of mathematics
6 twentieth century foundations of mathematics
7 early twentieth century logic
8 deduction and computation
9 recent automation of logic and prolog
10 the future
appendix b: a genealogical database
bibliography
index of symbols
index of terms...
introduction.
i propositional logic
1 orders and trees
2 propositions. connectives and truth tables
3 truth assignments and valuations
4 tableau proofs in propositional calculus
5 soundness and completeness of tableau proofs
6 deductions from premises and compactness
7 an axiomatic approach*
8 resolution
9 refining resolution
10 linear resolution. horn clauses and prolog
ii predicate logic
1 predicates and quantifiers
2 the language: terms and formulas
3 formation trees. structures and lists
4 semantics: meaning and truth
5 interpretations of prolog programs
6 proofs: complete systematic tableaux
.7 soundness and completeness of tableau proofs
8 an axiomatic approach*
9 prenex normal form and skolemization
10 herbrand's theorem
11 unification
12 the unification algorithm
13 resolution
14 refining resolution: linear resolution
iii prolog
1 sld-resolution
2 implementations: searching and backtracking
3 controlling the implementation: cut
4 termination conditions for prolog programs
5 equality
6 negation as failure
7 negation and nonmonotonic logic
8 computability and undecidability
iv modal logic..
1 possibility and necessity; knowledge or belief
2 frames and forcing
3 modal tableaux
4 soundness and completeness
5 modal axioms and special accessibility relations
6 an axiomatic approach*
v intuitionistic logic
1 intuitionism and constructivism
2 frames and forcing
3 intuitionistic tableaux
4 soundness and completeness
5 decidability and undecidability
6 a comparative guide
vi elements of set theory
1 some basic axioms of set theory
2 boole's algebra of sets
3 relations. functions and the power set axiom
4 the natural numbers. arithmetic and infinity
5 replacement. choice and foundation
6 zermelo-fraenkel set theory in predicate logic
7 cardinality: finite and countable
8 ordinal numbers
9 ordinal arithmetic and transfinite induction
10 transfinite recursion. choice and the ranked universe
11 cardinals and cardinal arithmetic
appendix a: an historical overview
1 calculus
2 logic
3 leibniz's dream
4 nineteenth century logic
5 nineteenth century foundations of mathematics
6 twentieth century foundations of mathematics
7 early twentieth century logic
8 deduction and computation
9 recent automation of logic and prolog
10 the future
appendix b: a genealogical database
bibliography
index of symbols
index of terms...
Logic for applications = 应用逻辑 / 2nd ed.
- 名称
- 类型
- 大小
光盘服务联系方式: 020-38250260 客服QQ:4006604884
云图客服:
用户发送的提问,这种方式就需要有位在线客服来回答用户的问题,这种 就属于对话式的,问题是这种提问是否需要用户登录才能提问
Video Player
×
Audio Player
×
pdf Player
×