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
Enregistré dans:
| Institution som forfatter: | |
|---|---|
| Andre forfattere: | , , |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in mathematics
834 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
Une contribution en français Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • 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, edited by L. Pacholski, J. Wierzejewski, and A. J. Wilkie, 1980, Berlin [etc.], Springer-Verlag, 1 volume (VI- 410 p.), Lecture notes in mathematics, 0-387-10269-8 • Model Theory of Algebra and Arithmetic, Texte imprimé, 9783662187937 |
Indholdsfortegnelse:
- 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.