LEADER 03241nam 2200601 450 001 996466643003316 005 20220908112129.0 010 $a3-540-38393-X 024 7 $a10.1007/BFb0090155 035 $a(CKB)1000000000437969 035 $a(SSID)ssj0000324889 035 $a(PQKBManifestationID)12114711 035 $a(PQKBTitleCode)TC0000324889 035 $a(PQKBWorkID)10320334 035 $a(PQKB)11447087 035 $a(DE-He213)978-3-540-38393-2 035 $a(MiAaPQ)EBC5590654 035 $a(Au-PeEL)EBL5590654 035 $a(OCoLC)1066191375 035 $a(MiAaPQ)EBC6842283 035 $a(Au-PeEL)EBL6842283 035 $a(OCoLC)793078652 035 $a(PPN)155220462 035 $a(EXLCZ)991000000000437969 100 $a20220908d1980 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aModel theory of algebra and arithmetic $eproceedings of the conference on Applications of logic to algebra and arithmetic, held at Karpacz, Poland, September 1-7, 1979 /$fedited by L. Pacholski, J. Wierzejewski, A. J. Wilkie 205 $a1st ed. 1980. 210 1$aBerlin, Germany :$cSpringer,$d[1980] 210 4$d©1980 215 $a1 online resource (VIII, 412 p.) 225 1 $aLecture Notes in Mathematics,$x0075-8434 ;$v834 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-10269-8 327 $aFurther 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. 410 0$aLecture Notes in Mathematics,$x0075-8434 ;$v834 606 $aModel theory 615 0$aModel theory. 676 $a511.34 702 $aWierzejewski$b J$g(Je?drzej), 702 $aPacholski$b Leszek 702 $aWilkie$b A. J$g(Alec J.), 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466643003316 996 $aModel theory of algebra and arithmetic$979941 997 $aUNISA