First-Order Modal Logic [electronic resource] / by M. Fitting, Richard L. Mendelsohn.
Erişim Adresi
ISBN
9789401152921
Dil Kodu
İngilizce
Yer Numarası
DK/12629
Basım Bildirimi
1st ed. 1998.
Yayın Bilgisi
Dordrecht : Springer Netherlands : Imprint: Springer, 1998.
Fiziksel Niteleme
XII, 292 p. online resource.
Dizi
Synthese Library, Studies in Epistemology, Logic, Methodology, and Philosophy of Science, 2542-8292 ; 277
İçindekiler Notu
One/Propositional Modal Logic -- 1.1 What is a Modal? -- 1.2 Can There Be a Modal Logic? -- 1.3 What Are The Formulas? -- 1.4 Aristotle’s Modal Square -- 1.5 Informal Interpretations -- 1.6 What Are the Models? -- 1.7 Examples -- 1.8 Some Important Logics -- 1.9 Logical Consequence -- 1.10 Temporal Logic -- 1.11 Epistemic Logic -- 1.12 Historical Highlights -- Two/Tableau Proof Systems -- 2.1 What Is a Proof -- 2.2 Tableaus -- 2.3 More Tableau Systems -- 2.4 Logical Consequence and Tableaus -- 2.5 Tableaus Work -- Three/Axiom Systems -- 3.1 What Is an Axiomatic Proof -- 3.2 More Axiom Systems -- 3.3 Logical Consequence, Axiomatically -- 3.4 Axiom Systems Work Too -- Four/Quantified Modal Logic -- 4.1 First-Order Formulas -- 4.2 An Informal Introduction -- 4.3 Necessity De Re and De Dicto -- 4.4 Is Quantified Modal Logic Possible? -- 4.5 What the Quantifiers Quantify Over -- 4.6 Constant Domain Models -- 4.7 Varying Domain Models -- 4.8 Different Media, Same Message -- 4.9 Barcan and Converse Barcan Formulas -- Five/First-Order Tableaus -- 5.1 Constant Domain Tableaus -- 5.2 Varying Domain Tableaus -- 5.3 Tableaus Still Work -- Six/First-Order Axiom Systems -- 6.1 A Classical First-Order Axiom System -- 6.2 Varying Domain Modal Axiom Systems -- 6.3 Constant Domain Systems -- 6.4 Miscellany -- Seven/Equality -- 7.1 Classical Background -- 7.2 Frege’s Puzzle -- 7.3 The Indiscernibility of Identicals -- 7.4 The Formal Details -- 7.5 Tableau Equality Rules -- 7.6 Tableau Soundness and Completeness -- 7.7 An Example -- Eight/Existence and Actualist Quantification -- 8.1 To Be -- 8.2 Tableau Proofs -- 8.3 The Paradox of NonBeing -- 8.4 Deflationists -- 8.5 Parmenides’ Principle -- 8.6 Inflationists -- 8.7 Unactualized Possibles -- 8.8 Barcan and Converse Barcan, Again -- 8.9 Using Validities in Tableaus -- 8.10 On Symmetry.-Nine/Terms and Predicate Abstraction -- 9.1 Why constants should not be constant -- 9.2 Scope -- 9.3 Predicate Abstraction -- 9.4 Abstraction in the Concrete -- 9.5 Reading Predicate Abstracts -- Ten/Abstraction Continued -- 10.1 Equality -- 10.2 Rigidity -- 10.3 A Dynamic Logic Example -- 10.4 Rigid Designators -- 10.5 Existence -- 10.6 Tableau Rules, Varying Domain -- 10.7 Tableau Rules, Constant Domain -- Eleven/Designation -- 11.1 The Formal Machinery -- 11.2 Designation and Existence -- 11.3 Existence and Designation -- 11.4 Fiction -- 11.5 Tableau Rules -- Twelve/Definite Descriptions -- 12.1 Notation -- 12.2 Two Theories of Descriptions -- 12.3 The Semantics of Definite Descriptions -- 12.4 Some Examples -- 12.5 Hintikka’s Schema and Variations -- 12.6 Varying Domain Tableaus -- 12.7 Russell’s Approach -- 12.8 Possibilist Quantifiers -- References.
Özet, vb.
Fitting and Mendelsohn present a thorough treatment of first-order modal logic, together with some propositional background. They adopt throughout a threefold approach. Semantically, they use possible world models; the formal proof machinery is tableaus; and full philosophical discussions are provided of the way that technical developments bear on well-known philosophical problems. The book covers quantification itself, including the difference between actualist and possibilist quantifiers; equality, leading to a treatment of Frege's morning star/evening star puzzle; the notion of existence and the logical problems surrounding it; non-rigid constants and function symbols; predicate abstraction, which abstracts a predicate from a formula, in effect providing a scoping function for constants and function symbols, leading to a clarification of ambiguous readings at the heart of several philosophical problems; the distinction between nonexistence and nondesignation; and definite descriptions, borrowing from both Fregean and Russellian paradigms.
Konu
Logic.
Mathematical logic.
Computational linguistics.
Logic.
Mathematical Logic and Foundations.
Computational Linguistics.
Mathematical logic.
Computational linguistics.
Logic.
Mathematical Logic and Foundations.
Computational Linguistics.
Diğer Yazarlar
Kurum Adı
Eseri Alıntıla
Referansları kullanmadan önce gözden geçirmeniz ve varsa gerekli düzeltmeleri yapmanız önerilir.
Dijital Kaynak
MARC Görünümü
LEADER 06641nam a22005895i 4500
001 811366
003 TR_AnAIT
005 20260131010736
007 cr nn 008mamaa
008 121227s1998 ne | s |||| 0|eng d
020 |a9789401152921|9978-94-011-5292-1
024 7 |a10.1007/978-94-011-5292-1|2doi
041 |aeng
049 |aTürk Tarih Kurumu Kütüphanesi
050 4|aBC1-199
072 7|aHPL|2bicssc
072 7|aPHI011000|2bisacsh
072 7|aQDTL|2thema
082 04|a160|223
090 |aDK/12629
100 1 |aFitting, M.|eauthor.|0(orcid)0000-0003-0229-114X|1https://orcid.org/0000-0003-0229-114X|4aut|4http://id.loc.gov/vocabulary/relators/aut
245 10|aFirst-Order Modal Logic|h[electronic resource] /|cby M. Fitting, Richard L. Mendelsohn.
250 |a1st ed. 1998.
264 1|aDordrecht :|bSpringer Netherlands :|bImprint: Springer,|c1998.
300 |aXII, 292 p.|bonline resource.
336 |atext|btxt|2rdacontent
337 |acomputer|bc|2rdamedia
338 |aonline resource|bcr|2rdacarrier
347 |atext file|bPDF|2rda
490 1 |aSynthese Library, Studies in Epistemology, Logic, Methodology, and Philosophy of Science,|x2542-8292 ;|v277
505 0 |aOne/Propositional Modal Logic -- 1.1 What is a Modal? -- 1.2 Can There Be a Modal Logic? -- 1.3 What Are The Formulas? -- 1.4 Aristotle’s Modal Square -- 1.5 Informal Interpretations -- 1.6 What Are the Models? -- 1.7 Examples -- 1.8 Some Important Logics -- 1.9 Logical Consequence -- 1.10 Temporal Logic -- 1.11 Epistemic Logic -- 1.12 Historical Highlights -- Two/Tableau Proof Systems -- 2.1 What Is a Proof -- 2.2 Tableaus -- 2.3 More Tableau Systems -- 2.4 Logical Consequence and Tableaus -- 2.5 Tableaus Work -- Three/Axiom Systems -- 3.1 What Is an Axiomatic Proof -- 3.2 More Axiom Systems -- 3.3 Logical Consequence, Axiomatically -- 3.4 Axiom Systems Work Too -- Four/Quantified Modal Logic -- 4.1 First-Order Formulas -- 4.2 An Informal Introduction -- 4.3 Necessity De Re and De Dicto -- 4.4 Is Quantified Modal Logic Possible? -- 4.5 What the Quantifiers Quantify Over -- 4.6 Constant Domain Models -- 4.7 Varying Domain Models -- 4.8 Different Media, Same Message -- 4.9 Barcan and Converse Barcan Formulas -- Five/First-Order Tableaus -- 5.1 Constant Domain Tableaus -- 5.2 Varying Domain Tableaus -- 5.3 Tableaus Still Work -- Six/First-Order Axiom Systems -- 6.1 A Classical First-Order Axiom System -- 6.2 Varying Domain Modal Axiom Systems -- 6.3 Constant Domain Systems -- 6.4 Miscellany -- Seven/Equality -- 7.1 Classical Background -- 7.2 Frege’s Puzzle -- 7.3 The Indiscernibility of Identicals -- 7.4 The Formal Details -- 7.5 Tableau Equality Rules -- 7.6 Tableau Soundness and Completeness -- 7.7 An Example -- Eight/Existence and Actualist Quantification -- 8.1 To Be -- 8.2 Tableau Proofs -- 8.3 The Paradox of NonBeing -- 8.4 Deflationists -- 8.5 Parmenides’ Principle -- 8.6 Inflationists -- 8.7 Unactualized Possibles -- 8.8 Barcan and Converse Barcan, Again -- 8.9 Using Validities in Tableaus -- 8.10 On Symmetry.-Nine/Terms and Predicate Abstraction -- 9.1 Why constants should not be constant -- 9.2 Scope -- 9.3 Predicate Abstraction -- 9.4 Abstraction in the Concrete -- 9.5 Reading Predicate Abstracts -- Ten/Abstraction Continued -- 10.1 Equality -- 10.2 Rigidity -- 10.3 A Dynamic Logic Example -- 10.4 Rigid Designators -- 10.5 Existence -- 10.6 Tableau Rules, Varying Domain -- 10.7 Tableau Rules, Constant Domain -- Eleven/Designation -- 11.1 The Formal Machinery -- 11.2 Designation and Existence -- 11.3 Existence and Designation -- 11.4 Fiction -- 11.5 Tableau Rules -- Twelve/Definite Descriptions -- 12.1 Notation -- 12.2 Two Theories of Descriptions -- 12.3 The Semantics of Definite Descriptions -- 12.4 Some Examples -- 12.5 Hintikka’s Schema and Variations -- 12.6 Varying Domain Tableaus -- 12.7 Russell’s Approach -- 12.8 Possibilist Quantifiers -- References.
520 |aFitting and Mendelsohn present a thorough treatment of first-order modal logic, together with some propositional background. They adopt throughout a threefold approach. Semantically, they use possible world models; the formal proof machinery is tableaus; and full philosophical discussions are provided of the way that technical developments bear on well-known philosophical problems. The book covers quantification itself, including the difference between actualist and possibilist quantifiers; equality, leading to a treatment of Frege's morning star/evening star puzzle; the notion of existence and the logical problems surrounding it; non-rigid constants and function symbols; predicate abstraction, which abstracts a predicate from a formula, in effect providing a scoping function for constants and function symbols, leading to a clarification of ambiguous readings at the heart of several philosophical problems; the distinction between nonexistence and nondesignation; and definite descriptions, borrowing from both Fregean and Russellian paradigms.
532 8 |aAccessibility summary: This PDF is not accessible. It is based on scanned pages and does not support features such as screen reader compatibility or described non-text content (images, graphs etc). However, it likely supports searchable and selectable text based on OCR (Optical Character Recognition). Users with accessibility needs may not be able to use this content effectively. Please contact us at accessibilitysupport@springernature.com if you require assistance or an alternative format.
532 8 |aInaccessible, or known limited accessibility
532 8 |aNo reading system accessibility options actively disabled
532 8 |aPublisher contact for further accessibility information: accessibilitysupport@springernature.com
650 0|aLogic.
650 0|aMathematical logic.
650 0|aComputational linguistics.
650 14|aLogic.
650 24|aMathematical Logic and Foundations.
650 24|aComputational Linguistics.
700 1 |aMendelsohn, Richard L.|eauthor.|4aut|4http://id.loc.gov/vocabulary/relators/aut
710 2 |aSpringerLink (Online service)
773 0 |tSpringer Nature eBook
776 08|iPrinted edition:|z9780792353348
776 08|iPrinted edition:|z9780792353355
776 08|iPrinted edition:|z9789401152938
830 0|aSynthese Library, Studies in Epistemology, Logic, Methodology, and Philosophy of Science,|x2542-8292 ;|v277
856 40|uhttps://doi.org/10.1007/978-94-011-5292-1
912 |aZDB-2-SHU
912 |aZDB-2-SXPR
912 |aZDB-2-BAE
950 |aHumanities, Social Sciences and Law (SpringerNature-11648)
950 |aPhilosophy and Religion (R0) (SpringerNature-43725)
001 811366
003 TR_AnAIT
005 20260131010736
007 cr nn 008mamaa
008 121227s1998 ne | s |||| 0|eng d
020 |a9789401152921|9978-94-011-5292-1
024 7 |a10.1007/978-94-011-5292-1|2doi
041 |aeng
049 |aTürk Tarih Kurumu Kütüphanesi
050 4|aBC1-199
072 7|aHPL|2bicssc
072 7|aPHI011000|2bisacsh
072 7|aQDTL|2thema
082 04|a160|223
090 |aDK/12629
100 1 |aFitting, M.|eauthor.|0(orcid)0000-0003-0229-114X|1https://orcid.org/0000-0003-0229-114X|4aut|4http://id.loc.gov/vocabulary/relators/aut
245 10|aFirst-Order Modal Logic|h[electronic resource] /|cby M. Fitting, Richard L. Mendelsohn.
250 |a1st ed. 1998.
264 1|aDordrecht :|bSpringer Netherlands :|bImprint: Springer,|c1998.
300 |aXII, 292 p.|bonline resource.
336 |atext|btxt|2rdacontent
337 |acomputer|bc|2rdamedia
338 |aonline resource|bcr|2rdacarrier
347 |atext file|bPDF|2rda
490 1 |aSynthese Library, Studies in Epistemology, Logic, Methodology, and Philosophy of Science,|x2542-8292 ;|v277
505 0 |aOne/Propositional Modal Logic -- 1.1 What is a Modal? -- 1.2 Can There Be a Modal Logic? -- 1.3 What Are The Formulas? -- 1.4 Aristotle’s Modal Square -- 1.5 Informal Interpretations -- 1.6 What Are the Models? -- 1.7 Examples -- 1.8 Some Important Logics -- 1.9 Logical Consequence -- 1.10 Temporal Logic -- 1.11 Epistemic Logic -- 1.12 Historical Highlights -- Two/Tableau Proof Systems -- 2.1 What Is a Proof -- 2.2 Tableaus -- 2.3 More Tableau Systems -- 2.4 Logical Consequence and Tableaus -- 2.5 Tableaus Work -- Three/Axiom Systems -- 3.1 What Is an Axiomatic Proof -- 3.2 More Axiom Systems -- 3.3 Logical Consequence, Axiomatically -- 3.4 Axiom Systems Work Too -- Four/Quantified Modal Logic -- 4.1 First-Order Formulas -- 4.2 An Informal Introduction -- 4.3 Necessity De Re and De Dicto -- 4.4 Is Quantified Modal Logic Possible? -- 4.5 What the Quantifiers Quantify Over -- 4.6 Constant Domain Models -- 4.7 Varying Domain Models -- 4.8 Different Media, Same Message -- 4.9 Barcan and Converse Barcan Formulas -- Five/First-Order Tableaus -- 5.1 Constant Domain Tableaus -- 5.2 Varying Domain Tableaus -- 5.3 Tableaus Still Work -- Six/First-Order Axiom Systems -- 6.1 A Classical First-Order Axiom System -- 6.2 Varying Domain Modal Axiom Systems -- 6.3 Constant Domain Systems -- 6.4 Miscellany -- Seven/Equality -- 7.1 Classical Background -- 7.2 Frege’s Puzzle -- 7.3 The Indiscernibility of Identicals -- 7.4 The Formal Details -- 7.5 Tableau Equality Rules -- 7.6 Tableau Soundness and Completeness -- 7.7 An Example -- Eight/Existence and Actualist Quantification -- 8.1 To Be -- 8.2 Tableau Proofs -- 8.3 The Paradox of NonBeing -- 8.4 Deflationists -- 8.5 Parmenides’ Principle -- 8.6 Inflationists -- 8.7 Unactualized Possibles -- 8.8 Barcan and Converse Barcan, Again -- 8.9 Using Validities in Tableaus -- 8.10 On Symmetry.-Nine/Terms and Predicate Abstraction -- 9.1 Why constants should not be constant -- 9.2 Scope -- 9.3 Predicate Abstraction -- 9.4 Abstraction in the Concrete -- 9.5 Reading Predicate Abstracts -- Ten/Abstraction Continued -- 10.1 Equality -- 10.2 Rigidity -- 10.3 A Dynamic Logic Example -- 10.4 Rigid Designators -- 10.5 Existence -- 10.6 Tableau Rules, Varying Domain -- 10.7 Tableau Rules, Constant Domain -- Eleven/Designation -- 11.1 The Formal Machinery -- 11.2 Designation and Existence -- 11.3 Existence and Designation -- 11.4 Fiction -- 11.5 Tableau Rules -- Twelve/Definite Descriptions -- 12.1 Notation -- 12.2 Two Theories of Descriptions -- 12.3 The Semantics of Definite Descriptions -- 12.4 Some Examples -- 12.5 Hintikka’s Schema and Variations -- 12.6 Varying Domain Tableaus -- 12.7 Russell’s Approach -- 12.8 Possibilist Quantifiers -- References.
520 |aFitting and Mendelsohn present a thorough treatment of first-order modal logic, together with some propositional background. They adopt throughout a threefold approach. Semantically, they use possible world models; the formal proof machinery is tableaus; and full philosophical discussions are provided of the way that technical developments bear on well-known philosophical problems. The book covers quantification itself, including the difference between actualist and possibilist quantifiers; equality, leading to a treatment of Frege's morning star/evening star puzzle; the notion of existence and the logical problems surrounding it; non-rigid constants and function symbols; predicate abstraction, which abstracts a predicate from a formula, in effect providing a scoping function for constants and function symbols, leading to a clarification of ambiguous readings at the heart of several philosophical problems; the distinction between nonexistence and nondesignation; and definite descriptions, borrowing from both Fregean and Russellian paradigms.
532 8 |aAccessibility summary: This PDF is not accessible. It is based on scanned pages and does not support features such as screen reader compatibility or described non-text content (images, graphs etc). However, it likely supports searchable and selectable text based on OCR (Optical Character Recognition). Users with accessibility needs may not be able to use this content effectively. Please contact us at accessibilitysupport@springernature.com if you require assistance or an alternative format.
532 8 |aInaccessible, or known limited accessibility
532 8 |aNo reading system accessibility options actively disabled
532 8 |aPublisher contact for further accessibility information: accessibilitysupport@springernature.com
650 0|aLogic.
650 0|aMathematical logic.
650 0|aComputational linguistics.
650 14|aLogic.
650 24|aMathematical Logic and Foundations.
650 24|aComputational Linguistics.
700 1 |aMendelsohn, Richard L.|eauthor.|4aut|4http://id.loc.gov/vocabulary/relators/aut
710 2 |aSpringerLink (Online service)
773 0 |tSpringer Nature eBook
776 08|iPrinted edition:|z9780792353348
776 08|iPrinted edition:|z9780792353355
776 08|iPrinted edition:|z9789401152938
830 0|aSynthese Library, Studies in Epistemology, Logic, Methodology, and Philosophy of Science,|x2542-8292 ;|v277
856 40|uhttps://doi.org/10.1007/978-94-011-5292-1
912 |aZDB-2-SHU
912 |aZDB-2-SXPR
912 |aZDB-2-BAE
950 |aHumanities, Social Sciences and Law (SpringerNature-11648)
950 |aPhilosophy and Religion (R0) (SpringerNature-43725)
Materyaller
Depodan talep edilen materyal sadece kütüphane içerisinde kullanılmaktadır.
Materyal dışarıya ödünç verilmemektedir.
Materyal dışarıya ödünç verilmemektedir.
