コンテンツへ移動
A course on mathematical logic 資料のプレビュー
閉じる資料のプレビュー
確認中…

A course on mathematical logic

著者: S M Srivastava
出版: New York : Springer, ©2008.
シリーズ: Universitext.
エディション/フォーマット:   書籍 : Englishすべてのエディションとフォーマットを見る
データベース:WorldCat
概要:

This book provides a distinctive, well-motivated introduction to mathematical logic. It starts with the definition of first order languages, proceeds through propositional logic, completeness  続きを読む

評価:

(まだ評価がありません) 0 件のレビュー - 是非あなたから!

件名:
関連情報:

 

オンラインで入手

この資料へのリンク

オフラインで入手

&AllPage.SpinnerRetrieving; この資料の所蔵館を検索中…

詳細

資料の種類: インターネット資料
ドキュメントの種類: 図書, インターネットリソース
すべての著者/寄与者: S M Srivastava
ISBN: 9780387762753 0387762752
OCLC No.: 180470520
物理形態: x, 140 p. ; 23 cm.
コンテンツ: 1. Syntax of First-Order Logic --
First-order languages --
Terms of a language --
Formulas of a language --
First-order theories --
2. Semantics of First-Order Languages --
Structures of first-order languages --
Truth in a structure --
Model of a theory --
Embeddings and isomorphisms --
3. Propositional Logic --
Syntax of propositional logic --
Semantics of propositional logic --
Compactness theorem for propositional logic --
Proof in propositional logic --
Metatheorems in propositional logic --
Post tautology theorem --
4. Proof and Metatheorems in First-Order Logic --
Proof in first-order logic --
Metatheorems in first-order logic --
Some metatheorems in arithmetic --
Consistency and completeness --
5. Completeness Theorem and Model Theory --
Completeness theorem --
Interpretations in a theory --
Extension by definitions --
Compactness theorem and applications --
Complete theories --
Applications in algebra --
6. Recursive Functions and Arithmetization of Theories --
Recursive functions and recursive predicates --
Semirecursive predicates --
Arithmetization of theories --
Decidable theories --
7. Incompleteness Theorems and Recursion Theory --
Representability --
First incompleteness theorem --
Arithmetical sets --
Recursive extensions of peano arithemetic --
Second incompleteness theorem.
シリーズタイトル: Universitext.
責任者: S.M. Srivastava.
その他の情報:

レビュー

編集者のレビュー

出版社によるあらすじ

From the reviews: "This is an introductory textbook on modern mathematical logic, aimed at upper-level undergraduates. ... The book is well-equipped with examples ... ." (Allen Stenger, MathDL, July, 続きを読む

 
ユーザーレビュー
GoodReadsのレビューを取得中…
DOGObooksのレビューを取得中…

タグ

まずはあなたから!
リクエストの確認

あなたは既にこの資料をリクエストしている可能性があります。このリクエストを続行してよろしければ、OK を選択してください。

リンクデータ


<http://www.worldcat.org/oclc/180470520>
library:oclcnum"180470520"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/180470520>
rdf:typeschema:Book
schema:about
schema:about
schema:about
<http://id.worldcat.org/fast/1002068>
rdf:typeschema:Intangible
schema:name"Logic, Symbolic and mathematical"@en
schema:name"Logic, Symbolic and mathematical."@en
schema:about
schema:about
schema:copyrightYear"2008"
schema:creator
schema:datePublished"2008"
schema:description"1. Syntax of First-Order Logic -- First-order languages -- Terms of a language -- Formulas of a language -- First-order theories -- 2. Semantics of First-Order Languages -- Structures of first-order languages -- Truth in a structure -- Model of a theory -- Embeddings and isomorphisms -- 3. Propositional Logic -- Syntax of propositional logic -- Semantics of propositional logic -- Compactness theorem for propositional logic -- Proof in propositional logic -- Metatheorems in propositional logic -- Post tautology theorem -- 4. Proof and Metatheorems in First-Order Logic -- Proof in first-order logic -- Metatheorems in first-order logic -- Some metatheorems in arithmetic -- Consistency and completeness -- 5. Completeness Theorem and Model Theory -- Completeness theorem -- Interpretations in a theory -- Extension by definitions -- Compactness theorem and applications -- Complete theories -- Applications in algebra -- 6. Recursive Functions and Arithmetization of Theories -- Recursive functions and recursive predicates -- Semirecursive predicates -- Arithmetization of theories -- Decidable theories -- 7. Incompleteness Theorems and Recursion Theory -- Representability -- First incompleteness theorem -- Arithmetical sets -- Recursive extensions of peano arithemetic -- Second incompleteness theorem."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/158307196>
schema:inLanguage"en"
schema:name"A course on mathematical logic"@en
schema:numberOfPages"140"
schema:publisher
schema:url
schema:workExample
umbel:isLike<http://bnb.data.bl.uk/id/resource/GBA788111>
umbel:isLike<http://d-nb.info/985775416>

Content-negotiable representations

ウインドウを閉じる

WorldCatにログインしてください 

アカウントをお持ちではないですか?簡単に 無料アカウントを作成することができます。.