Leloup, G., Rings of monoids elementarily equivalent to polynomial rings Miller, C., Expansions of the real field with power functions Ozawa, M., Forcing in nonstandard analysis Rathjen, M., Proof theory of reflection [Book Review]

, , &
Annals of Pure and Applied Logic 68:343 (1994)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,793

External links

  • This entry has no external links. Add one.
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

Rings of monoids elementarily equivalent to polynomial rings.Gérard Leloup - 1994 - Annals of Pure and Applied Logic 68 (2):173-180.
M. Gitik Blowing up power of a singular cardinalYwider gaps 1 D. Pitteloud Algebraic properties of rings of generalized power series 39.I. Neeman, D. M. Evans, M. Menni, R. D. Schindler, K. Ho & F. Stephan - 2002 - Annals of Pure and Applied Logic 116 (1):3-15.
BLASS. A., A game semantics for linear logic CENZER, D. and REMMEL, J., Polynomial-time Abehan groups CLOTE, P. and TAKEUTI, G., Bounded arithmetic for NC, ALogTIME, L and NL. [REVIEW]P. Lincoln, J. Mitchell & A. Scedrov - 1992 - Annals of Pure and Applied Logic 56:365.
GlaR, T., Rathjen, M. and Schliiter, A., On the proof-theoretic.G. Japaridze, R. Jin, S. Shelah, M. Otto, E. Palmgren & M. C. Stanley - 1997 - Annals of Pure and Applied Logic 85 (1):283.
Boolean products of real closed valuation rings and fields.Jorge I. Guier - 2001 - Annals of Pure and Applied Logic 112 (2-3):119-150.
The Woods–Erdös conjecture for polynomial rings.Maxim Vsemirnov - 2001 - Annals of Pure and Applied Logic 113 (1-3):331-344.
Flawed Liberation: Socialism and Feminism.Sally M. Miller - 1981 - Praeger.
J. C. Shepherdson. Algorithmic procedures, generalized Turing algorithms, and elementary recursion theory. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 285–308. - J. C. Shepherdson. Computational complexity of real functions. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 309–315. - A. J. Kfoury. The pebble game and logics of programs. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, an. [REVIEW]J. V. Tucker - 1990 - Journal of Symbolic Logic 55 (2):876-878.
Aristotle.J. M. E. Moravcsik - 1967 - Garden City, N.Y.,: Anchor Books.
First-order rigidity of rings satisfying polynomial identities.Be'eri Greenfeld - 2022 - Annals of Pure and Applied Logic 173 (6):103109.

Analytics

Added to PP
2014-03-27

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author Profiles

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references