- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Infinitely Peano differentiable functions in polynomially bounded o-minimal structures
Annals of Pure and Applied Logic 161 (12):1520-1524 (2010)
Abstract
Let be an o-minimal expansion of a real closed field. We show that the definable infinitely Peano differentiable functions are smooth if and only if is polynomially boundedMy notes
Similar books and articles
Polynomially Bounded Recursive Realizability.Saeed Salehi - 2005 - Notre Dame Journal of Formal Logic 46 (4):407-417.
Heirs of Box Types in Polynomially Bounded Structures.Marcus Tressl - 2009 - Journal of Symbolic Logic 74 (4):1225 - 1263.
On Metric Types That Are Definable in an O-Minimal Structure.Guillaume Valette - 2008 - Journal of Symbolic Logic 73 (2):439 - 447.
Upper bounds on complexity of Frege proofs with limited use of certain schemata.Pavel Naumov - 2006 - Archive for Mathematical Logic 45 (4):431-446.
The elementary theory of Dedekind cuts in polynomially bounded structures.Marcus Tressl - 2005 - Annals of Pure and Applied Logic 135 (1-3):113-134.
Automorphism groups of trivial strongly minimal structures.Thomas Blossier - 2003 - Journal of Symbolic Logic 68 (2):644-668.
Definable group extensions in semi‐bounded o‐minimal structures.Mário J. Edmundo & Pantelis E. Eleftheriou - 2009 - Mathematical Logic Quarterly 55 (6):598-604.
Infinite substructure lattices of models of Peano Arithmetic.James H. Schmerl - 2010 - Journal of Symbolic Logic 75 (4):1366-1382.
Pseudo completions and completions in stages of o-minimal structures.Marcus Tressl - 2006 - Archive for Mathematical Logic 45 (8):983-1009.
Minimal realizability of intuitionistic arithmetic and elementary analysis.Zlatan Damnjanovic - 1995 - Journal of Symbolic Logic 60 (4):1208-1241.
Notes on polynomially bounded arithmetic.Domenico Zambella - 1996 - Journal of Symbolic Logic 61 (3):942-966.
Review: Jan Krajicek, Pavel Pudlak, Gaisi Takeuti, Bounded Arithmetic and the Polynomial Hierarchy; Samuel R. Buss, Relating the Bounded Arithmetic and Polynomial Time Hierarchies; Domenico Zambella, Notes on Polynomially Bounded Arithmetic. [REVIEW]Stephen Cook - 1999 - Journal of Symbolic Logic 64 (4):1821-1823.
A Note on Weakly O-Minimal Structures and Definable Completeness.Alfred Dolich - 2007 - Notre Dame Journal of Formal Logic 48 (2):281-292.
Expansions of o-minimal structures by fast sequences.Harvey Friedman & Chris Miller - 2005 - Journal of Symbolic Logic 70 (2):410-418.
Bounded Scott Set Saturation.Alex M. McAllister - 2002 - Mathematical Logic Quarterly 48 (2):245-259.
Analytics
Added to PP
2013-12-18
Downloads
61 (#253,934)
6 months
8 (#292,366)
2013-12-18
Downloads
61 (#253,934)
6 months
8 (#292,366)
Historical graph of downloads
References found in this work
O -minimal Λ m -regular stratification.Andreas Fischer - 2007 - Annals of Pure and Applied Logic 147 (1):101-112.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6d9b7f7c4c-sqt28 uwo