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

Bibliographic Details
Other Authors: Pacholski, L. (Editor), Wierzejewski, J. (Editor), Wilkie, A.J. (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1980, 1980
Edition:1st ed. 1980
Series:Lecture Notes in Mathematics
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 02480nmm a2200301 u 4500
001 EB000654274
003 EBX01000000000000000507356
005 00000000000000.0
007 cr|||||||||||||||||||||
008 140122 ||| eng
020 |a 9783540383932 
100 1 |a Pacholski, L.  |e [editor] 
245 0 0 |a Model Theory of Algebra and Arithmetic  |h Elektronische Ressource  |b Proceedings of the Conference on Applications of Logic to Algebra and Arithmetic held at Karpacz,Poland, September 1-7, 1979  |c edited by L. Pacholski, J Wierzejewski, A.J. Wilkie 
250 |a 1st ed. 1980 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 1980, 1980 
300 |a VIII, 412 p  |b online resource 
505 0 |a 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 
653 |a Mathematical logic 
653 |a Algebra 
653 |a Mathematical Logic and Foundations 
700 1 |a Wierzejewski, J.  |e [editor] 
700 1 |a Wilkie, A.J.  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a Lecture Notes in Mathematics 
028 5 0 |a 10.1007/BFb0090155 
856 4 0 |u https://doi.org/10.1007/BFb0090155?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 511.3