Model Theory of Algebra and Arithmetic [electronic resource] : Proceedings of the Conference on Applications of Logic to Algebra and Arithmetic Held at Karpacz, Poland, September 1 – 7, 1979 / edited by Leszek Pacholski, Jedrzej Wierzejewski, Alec J. Wilkie.
Material type: TextSeries: Lecture Notes in Mathematics ; 834Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1980Description: VIII, 412 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540383932Subject(s): Mathematics | Algebra | Logic, Symbolic and mathematical | Mathematics | Mathematical Logic and Foundations | AlgebraAdditional physical formats: Printed edition:: No titleDDC classification: 511.3 LOC classification: QA8.9-10.3Online resources: Click here to access onlineCurrent library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
IMSc Library | IMSc Library | Link to resource | Available | EBK758 |
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.
There are no comments on this title.