Course of Mathematical Logic: Volume 2 Model Theory: Synthese Library, cartea 69
Autor R. Fraïssé Traducere de David Louvishen Limba Engleză Hardback – 31 oct 1974
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 372.80 lei 6-8 săpt. | |
SPRINGER NETHERLANDS – 31 oct 1974 | 372.80 lei 6-8 săpt. | |
Hardback (2) | 378.62 lei 6-8 săpt. | |
SPRINGER NETHERLANDS – 31 oct 1974 | 378.62 lei 6-8 săpt. | |
SPRINGER NETHERLANDS – 29 noi 1973 | 785.58 lei 38-44 zile |
Din seria Synthese Library
- Preț: 543.25 lei
- 15% Preț: 620.15 lei
- 18% Preț: 961.55 lei
- 15% Preț: 579.62 lei
- 18% Preț: 877.99 lei
- 15% Preț: 570.10 lei
- 15% Preț: 676.55 lei
- 18% Preț: 867.29 lei
- 15% Preț: 624.92 lei
- Preț: 282.32 lei
- Preț: 430.47 lei
- 5% Preț: 361.60 lei
- 15% Preț: 619.34 lei
- 18% Preț: 931.35 lei
- 15% Preț: 623.96 lei
- 18% Preț: 1195.31 lei
- 15% Preț: 624.42 lei
- 18% Preț: 971.67 lei
- Preț: 378.62 lei
- 15% Preț: 619.03 lei
- 18% Preț: 924.93 lei
- 18% Preț: 1195.96 lei
- 15% Preț: 627.46 lei
- Preț: 384.58 lei
- Preț: 389.09 lei
- 18% Preț: 1190.28 lei
- 15% Preț: 620.61 lei
- 18% Preț: 1196.70 lei
- Preț: 369.64 lei
- Preț: 383.65 lei
- 15% Preț: 622.04 lei
- 15% Preț: 620.78 lei
- Preț: 371.11 lei
- 15% Preț: 624.59 lei
Preț: 378.62 lei
Nou
Puncte Express: 568
Preț estimativ în valută:
72.47€ • 75.53$ • 60.33£
72.47€ • 75.53$ • 60.33£
Carte tipărită la comandă
Livrare economică 04-18 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9789027702692
ISBN-10: 9027702691
Pagini: 222
Ilustrații: XX, 198 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.45 kg
Ediția:1974
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Synthese Library
Locul publicării:Dordrecht, Netherlands
ISBN-10: 9027702691
Pagini: 222
Ilustrații: XX, 198 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.45 kg
Ediția:1974
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Synthese Library
Locul publicării:Dordrecht, Netherlands
Public țintă
ResearchCuprins
1/Local Isomorphism and Logical Formula; Logical Restriction Theorem.- 1.1. (k,p)-Isomorphism.- 1.2. (k,p)-Equivalence.- 1.3. Characteristic of a Logical Formula. Relations Between (k,p) -Isomorphism and Logical Formula.- 1.4. Logical Extension and Logical Restriction; Logical Restriction Theorem.- 1.5. Examples of Finitely-Axiomatizable and Non-Finitely-Axiomatizable Multirelations.- 1.6. (k,p)-Interpretability.- 1.7. Homogeneous and Logically Homogeneous Multirelations.- 1.8. Rigid and Logically Rigid Multirelations.- Exercises.- 2/Logical Convergence; Compactness, Omission and Interpretability Theorems.- 2.1. Logical Convergence.- 2.2. Compactness Theorem.- 2.3. Omission Theorem.- 2.4. Interpretability Theorem.- 2.5. Every Injective Logical Operator is Invertible.- Exercise.- 3/Elimination of Quantifiers.- 3.1. Absolute Eliminant.- 3.2. (k,p)-Eliminant.- 3.3. Elimination Algorithms for the Chain of Rational Numbers and the Chain of Natural Numbers.- 3.4. Positive Dense Sum; Elimination of Quantifiers over the Sum of Rational or Real Numbers.- 3.5. Positive Discrete Divisible Sum; Elimination of Quantifiers over the Sum of Natural Numbers.- 3.6. Real Field; Elimination of Quantifiers over the Sum and Product of Algebraic Numbers or Real Numbers.- Exercises.- 4/Extension Theorems.- 4.1. Restrictive Sequence; (k,p)-Isomorphism and (k,p)-Identimorphism.- 4.2. Application to Logical Restriction.- 4.3. Projection Filter.- 4.4. Logical Extension Theorems.- 4.5. Theorem on Common Logical Extensions.- 4.6. Logical Morphism and Logical Embedding.- Exercises.- 5/Theories and Axiom Systems.- 5.1. Theory: Consistency; Intersection of Theories.- 5.1 Axiom System. Class of Models; Union-Theory, Finitely-Axiomatizable Theory, Saturated Theory.- 5.3. Complement of a Theory.- 5.4. Categoricity.- 5.5. Model-Saturated Theory.- Exercises.- 6/Pseudo-Logical Class; Interpretability of Theories; Expansion of a Theory; Axiomatizability.- 6.1. Pseudo-Logical Class.- 6.2. Interpretability of Theories.- 6.3. Canonical Expansion, Semantic Expansion, and Other Expansions.- 6.4. Axiomatizable Multirelations and Theories.- 6.5. Free Expansion.- Exercises.- 7/Ultraproduct.- 7.1. Family of Multirelations, Ultrafilter, Induced Logical Equivalence Class; Ultraproduct and Ultrapower; Maximal Case.- 7.2. Logical Equivalence Implies the Existence of Isomorphic Ultrapowers.- 7.3. Characterization of Logical Classes.- 7.4. Normal Ultraproduct; Definitions and Examples.- 7.5. Normal Ultraproducts and Logical Equivalence.- Exercises.- 8/Forcing.- 8.1. Generic Predicate; System: (+)-Forced and (?)-Forced Formulas.- 8.2. Elementary Properties.- 8.3. Forcing with Constraints.- 8.4. General Relation.- 8.5. Forcing and Deduction; Theory Forced by a Generic Predicate.- Exercises.- 9/Isomorphisms and Equivalences in Relation to the Calculus of Infinitely Long Formulas with Finite Quantifiers.- 9.1. ?-Isomorphism and ?-Equivalence.- 9.2. ?-Isomorphism and ?-Equivalence; Karpian Families.- 9.3. Automorphic Rank of a Multirelation.- 9.4. Multirelations with Denumerable Bases and ?-Isomorphisms.- 9.5. ?-Extension and ?-Interpretability.- 9.6. Infinite Logical Calculi and their Relation to Local Isomorphisms and Equivalences.- Proof of Lemmas Needed to Prove J. Robinson’s Theorem.- Closure of a Relation.- References.