000 03462nam a22005055i 4500
001 978-3-540-38393-2
003 DE-He213
005 20190213151825.0
007 cr nn 008mamaa
008 121227s1980 gw | s |||| 0|eng d
020 _a9783540383932
_9978-3-540-38393-2
024 7 _a10.1007/BFb0090155
_2doi
050 4 _aQA8.9-10.3
072 7 _aPBC
_2bicssc
072 7 _aMAT018000
_2bisacsh
072 7 _aPBC
_2thema
072 7 _aPBCD
_2thema
082 0 4 _a511.3
_223
245 1 0 _aModel Theory of Algebra and Arithmetic
_h[electronic resource] :
_bProceedings of the Conference on Applications of Logic to Algebra and Arithmetic Held at Karpacz, Poland, September 1 – 7, 1979 /
_cedited by Leszek Pacholski, Jedrzej Wierzejewski, Alec J. Wilkie.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1980.
300 _aVIII, 412 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Mathematics,
_x0075-8434 ;
_v834
505 0 _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.
650 0 _aLogic, Symbolic and mathematical.
650 0 _aAlgebra.
650 1 4 _aMathematical Logic and Foundations.
_0http://scigraph.springernature.com/things/product-market-codes/M24005
650 2 4 _aAlgebra.
_0http://scigraph.springernature.com/things/product-market-codes/M11000
700 1 _aPacholski, Leszek.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aWierzejewski, Jedrzej.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aWilkie, Alec J.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783662187937
776 0 8 _iPrinted edition:
_z9783540102694
830 0 _aLecture Notes in Mathematics,
_x0075-8434 ;
_v834
856 4 0 _uhttps://doi.org/10.1007/BFb0090155
912 _aZDB-2-SMA
912 _aZDB-2-LNM
912 _aZDB-2-BAE
999 _c12008
_d12008