Thông tin chi tiết

Chỉ số ISBN:	3-540-10269-8
Ngôn ngữ:	eng
Ký hiệu phân loại:	03PA
Tác giả:	Wilkie, A. J Pacholski, L Wierzejewski, J
Nhan đề:	Model theory of algebra and arithmetic
Xuất bản, phát hành:	H : Berlin-Heidelberg-New York , 1980
Mô tả vật lý:	410 ; 24 cm
Từ Khóa:	Algebra , Arithmetic , arithmetic Cited , Conference , Karpacz/Poland , model theory , Proceedings
Tài liệu chủ:	Lecture notes in mathematics, Vol. 834

• Xem biểu ghi Marc

  Thông tin dữ liệu

  ×

  020	##	$a3-540-10269-8
  041	##	$aeng
  084	##	$a03PA
  090	##	$cLv1628
  100	1#	$aWilkie, A. J.
  245	##	$aModel theory of algebra and arithmetic
  246	##	$aProceedings
  260	##	$aH:$bBerlin-Heidelberg-New York,$c1980
  300	##	$a410;$c24 cm
  505	0#	$aJ.BECKER, J.DEHEP and L.LIPSHITZFurther remarks on the elementary theory of formal power series ringsCHANTAL BERLINEEliaination of quantifiers for non semi-simple rings of characteristic pM.BOFFA, A.MACINTYRE and F .POINTThe quantifier elimination problem for rings without nilpotent elements and for semi-simple ringsELISABETH BOUSCAREKExistentially closed modules : types and prime modelsGREGORY CHERLINRings of continuous functions : decision problemsPETER CLOTEWeak partition relations, finite games, and independence reaults in Peano arithmeticFRANqOISE DELONHensel fields in equal characteristic p>0M.A.DIGKMANNOn polynomials over real closed ringsJEAN-LOUIS DURETLes corps faiblement algebriquement clos non separablement clos ont la propriete d' independanceULRICH FELGNERHorn-theories of abelian groupsPETR HAJEK and PAVEL PUDLAKTwo orderinga of the class of all countable models of Peano arithmeticANGUS MACINTYRERamsey quantifiers in arithmeticKENNETH L.MANDERSComputaiional complexity of decision probleme in elementary number theoryKEMIBTH McKENNASome diophantine NullstellensatzeGEORGE MILLSA tree analysis of unprovable combinatorial atatementsJ.B.PARISA hierarchy of cuts in models of arithmeticC.SMORYNSKI and J.STAVICofinal extension preserves recursive saturationLCTJ VAN DEN DRIESSome model theory and number theory for models of weak systems of arithmeticA .J .WILKIEApplications of complexity theory to sum_o - definability problems in arithmeticGEORGE WIIMERSMinimally saturated modelsB.I.ZILBERTotally categorical theories : structural properties and the non-finite axiomatizability
  653	##	$aAlgebra
  653	##	$aArithmetic
  653	##	$aarithmetic Cited
  653	##	$aConference
  653	##	$aKarpacz/Poland
  653	##	$amodel theory
  653	##	$aProceedings
  700	1#	$aPacholski, L.
  700	1#	$aWierzejewski, J.
  773	0#	$tLecture notes in mathematics, Vol. 834
  900	##	1
  911	##	Administrator
  927	##	Sách, chuyên khảo, tuyển tập

  Số liệu bổ sung

  ×