Model theory of algebra and arithmetic : proceedings of the Conference on Applications of Logic to Algebra and Arithmetic held at Karpacz, Poland, September 1-7, 1979 / edited by L. Pacholski, J. Wierzejewski, and A.J. Wilkie.
Material type:
TextLanguage: English, French Series: Lecture notes in mathematics (Springer-Verlag) ; 834.Publication details: Berlin ; New York : Springer-Verlag, 1980.Description: 1 online resource (vi, 410 pages) : illustrationsContent type: - text
- computer
- online resource
- 9783540383932
- 354038393X
- Model theory -- Congresses
- Logic, Symbolic and mathematical
- Algebraic logic
- Logique symbolique et mathématique
- Logique algébrique
- Théorie des modèles -- Congrès
- Teoría de modelos -- Congresos y asambleas
- Lógica matemática
- Lógica algebraica
- Logic, Symbolic and mathematical
- Algebraic logic
- Model theory
- 511.34 22
- QA3 .L28 no. 834 QA9.7
- 31.10
- P 63
- 03Cxx
- 19a
- digitized 2010 HathiTrust Digital Library committed to preserve
| Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|---|
eBook
|
e-Library | eBook LN Mathematic | Available |
Includes bibliographical references.
Further remarks on the elementary theory of formal power series rings -- Elimination of quantifiers for non semi-simple rings of characteristic p -- The quantifier elimination problem for rings without nilpotent elements and for semi-simple rings -- Existentially closed modules: Types and prime models -- Rings of continuous functions: Decision problems -- Weak partition relations, finite games, and independence results in Peano arithmetic -- Hensel fields in equal characteristic p>0 -- On polynomials over real closed rings -- Les corps faiblement algebriquement clos non separablement clos ont la propriete d'independance -- Horn-theories of abelian groups -- Two orderings of the class of all countable models of peano arithmetic -- Ramsey quantifiers in arithmetic -- Computational complexity of decision problems in elementary number theory -- Some diophantine nullstellensätze -- A tree analysis of unprovable combinatorial statements -- A hierarchy of cuts in models of arithmetic -- Cofinal extension preserves recursive saturation -- Some model theory and number theory for models of weak systems of arithmetic -- Applications of complexity theory to?o-definability Problems in arithmetic -- Minimally saturated models -- Totally categorical theories: Structural properties and the non-finite axiomatizability.
Use copy Restrictions unspecified star MiAaHDL
Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2010. MiAaHDL
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. MiAaHDL
http://purl.oclc.org/DLF/benchrepro0212
digitized 2010 HathiTrust Digital Library committed to preserve pda MiAaHDL
Print version record.