ALLEN, B., Arithmetizing Uniform NC BASARAB, SA, Relative elimination of quantifiers for Hen-selian valued fields BUSS, SR, The undecidability of k-provability GALLIER, JH, What's so special about Kruskal's theorem and

, &
Annals of Pure and Applied Logic 53:297 (1991)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

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

Relative elimination of quantifiers for Henselian valued fields.Serban A. Basarab - 1991 - Annals of Pure and Applied Logic 53 (1):51-74.
Quantifier elimination for the theory of algebraically closed valued fields with analytic structure.Yalin Firat Çelikler - 2007 - Mathematical Logic Quarterly 53 (3):237-246.
What's so special about Kruskal's theorem and the ordinal Γo? A survey of some results in proof theory.Jean H. Gallier - 1991 - Annals of Pure and Applied Logic 53 (3):199-260.
0-D-Valued Fields.Nicolas Guzy - 2006 - Journal of Symbolic Logic 71 (2):639 - 660.
Rings which admit elimination of quantifiers.Bruce I. Rose - 1978 - Journal of Symbolic Logic 43 (1):92-112.
Multiplicative valued difference fields.Koushik Pal - 2012 - Journal of Symbolic Logic 77 (2):545-579.
Δ-core Fuzzy Logics with Propositional Quantifiers, Quantifier Elimination and Uniform Craig Interpolation.Franco Montagna - 2012 - Studia Logica 100 (1-2):289-317.
Relative decidability and definability in henselian valued fields.Joseph Flenner - 2011 - Journal of Symbolic Logic 76 (4):1240-1260.
Arithmetizing Uniform NC.Bill Allen - 1991 - Annals of Pure and Applied Logic 53 (1):1-50.
The undecidability of k-provability.Samuel R. Buss - 1991 - Annals of Pure and Applied Logic 53 (1):75-102.
Prototypes for definable subsets of algebraically closed valued fields.Jan E. Holly - 1997 - Journal of Symbolic Logic 62 (4):1093-1141.
Review: Samuel R. Buss, The Undecidability of $k$-Provability. [REVIEW]Alessandra Carbone - 1997 - Journal of Symbolic Logic 62 (4):1480-1481.
Μ-programs, uniform interpolation and bisimulation quantifiers for modal logics ★.Giovanna D'Agostino, Giacomo Lenzi & Tim French - 2006 - Journal of Applied Non-Classical Logics 16 (3-4):297-309.
Elimination of algorithmic quantifiers for ordered differential algebra.Yunfu Shen - 1999 - Archive for Mathematical Logic 38 (3):139-144.

Analytics

Added to PP
2014-03-31

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?

Citations of this work

Finitely based theories.Ehud Hrushovski - 1989 - Journal of Symbolic Logic 54 (1):221-225.

Add more citations

References found in this work

No references found.

Add more references