Polynomial rings and weak second-order logic

Journal of Symbolic Logic 50 (4):953-972 (1985)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273983

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,907

External links

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

Through your library

My notes

Similar books and articles

A feasible theory for analysis.Fernando Ferreira - 1994 - Journal of Symbolic Logic 59 (3):1001-1011.
Anneaux de fonctions p-adiques.Luc Bélair - 1995 - Journal of Symbolic Logic 60 (2):484-497.
Weak Cardinality Theorems.Till Tantau - 2005 - Journal of Symbolic Logic 70 (3):861 - 878.
On polynomial time computation over unordered structures.Andreas Blass, Yuri Gurevich & Saharon Shelah - 2002 - Journal of Symbolic Logic 67 (3):1093-1125.
Polynomial time operations in explicit mathematics.Thomas Strahm - 1997 - Journal of Symbolic Logic 62 (2):575-594.
Logical Hierarchies in PTIME.Lauri Hella - 1996 - Information And Computation 129 (1):1--19.
Eliminating definitions and Skolem functions in first-order logic.Jeremy Avigad - manuscript
Diophantine equivalence and countable rings.Alexandra Shlapentokh - 1994 - Journal of Symbolic Logic 59 (3):1068-1095.

Analytics

Added to PP
2009-01-28

Downloads
38 (#430,901)

6 months
7 (#486,539)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Rings of monoids elementarily equivalent to polynomial rings.Gérard Leloup - 1994 - Annals of Pure and Applied Logic 68 (2):173-180.

Add more citations

References found in this work

Model Theory.Michael Makkai, C. C. Chang & H. J. Keisler - 1991 - Journal of Symbolic Logic 56 (3):1096.
Introduction to Mathematical Logic.Dirk van Dalen - 1964 - Journal of Symbolic Logic 34 (1):110-111.

Add more references