Model Theory of Algebra and Arithmetic : Proceedings of the Conference on Applications of Logic to Algebra and Arithmetic.,.,.

Pacholski, Leszek ; Wierzejewski, Jedrzej ; & Wilkie, Alec J. ; editors:

ISBN 10: 3540102698 / ISBN 13: 9783540102694

Editore: Springer-Verlag, Berlin / Heidelberg, 1980

Riguardo questo articolo

24x16cm, vi,410 pp., Series: Lecture Notes in Mathematics, 834. Full title reads: "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".

Codice articolo 027205

Dati bibliografici

• Titolo: Model Theory of Algebra and Arithmetic : Proceedings of the Conference on Applications of Logic to Algebra and Arithmetic.,.,.
• Editore: Springer-Verlag, Berlin / Heidelberg
• Data di pubblicazione: 1980
• ISBN 10: 3540102698
• ISBN 13: 9783540102694
• Rilegatura: orig. wrappers
• Condizione: Minor wear. Corner bump. VG.
• Cataloghi dei venditori:
  • Mathematics

Descrizione articolo

Contenuti

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.