Decidability questions for a ring of Laurent polynomials

Annals of Pure and Applied Logic 163 (5):615-619 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,745

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Factorization of polynomials and °1 induction.S. G. Simpson - 1986 - Annals of Pure and Applied Logic 31:289.
Decidability and the number of countable models.Terrence Millar - 1984 - Annals of Pure and Applied Logic 27 (2):137-153.
A valuation ring analogue of von Neumann regularity.Claude Sureson - 2007 - Annals of Pure and Applied Logic 145 (2):204-222.
Quantifier elimination for modules with scalar variables.Lou van den Dries & Jan Holly - 1992 - Annals of Pure and Applied Logic 57 (2):161-179.
A logician's view of graph polynomials.J. A. Makowsky, E. V. Ravve & T. Kotek - 2019 - Annals of Pure and Applied Logic 170 (9):1030-1069.
Ten questions and one problem on fuzzy logic.Petr Hájek - 1999 - Annals of Pure and Applied Logic 96 (1-3):157-165.
Model theory of modules over a serial ring.Paul C. Eklof & Ivo Herzog - 1995 - Annals of Pure and Applied Logic 72 (2):145-176.

Analytics

Added to PP
2013-10-27

Downloads
9 (#449,242)

6 months
3 (#1,723,834)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Definability and decision problems in arithmetic.Julia Robinson - 1949 - Journal of Symbolic Logic 14 (2):98-114.
Undecidable-Rings.Raphael M. Robinson - 1952 - Journal of Symbolic Logic 17 (4):268-269.
Extensions of Hilbert's tenth problem.Thanases Pheidas - 1994 - Journal of Symbolic Logic 59 (2):372-397.

Add more references