- 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
Cell decomposition and definable functions for weak p‐adic structures
Mathematical Logic Quarterly 58 (6):482-497 (2012)
Abstract
We develop a notion of cell decomposition suitable for studying weak p-adic structures definable). As an example, we consider a structure with restricted additionLinks
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
A version of p-adic minimality.Raf Cluckers & Eva Leenknegt - 2012 - Journal of Symbolic Logic 77 (2):621-630.
Definable Open Sets As Finite Unions of Definable Open Cells.Simon Andrews - 2010 - Notre Dame Journal of Formal Logic 51 (2):247-251.
Presburger sets and p-minimal fields.Raf Cluckers - 2003 - Journal of Symbolic Logic 68 (1):153-162.
Witnessing functions in bounded arithmetic and search problems.Mario Chiari & Jan Krajíček - 1998 - Journal of Symbolic Logic 63 (3):1095-1115.
Finitude simple et structures o-minimales (finiteness property implies o-minimality).Jean-Marie Lion - 2002 - Journal of Symbolic Logic 67 (4):1616-1622.
Topological properties of sets definable in weakly o-minimal structures.Roman Wencel - 2010 - Journal of Symbolic Logic 75 (3):841-867.
Definable sets in Boolean ordered o-minimal structures. II.Roman Wencel - 2003 - Journal of Symbolic Logic 68 (1):35-51.
A proof-theoretic characterization of the primitive recursive set functions.Michael Rathjen - 1992 - Journal of Symbolic Logic 57 (3):954-969.
Noetherian varieties in definably complete structures.Tamara Servi - 2008 - Logic and Analysis 1 (3-4):187-204.
On sets ∀-definable from Pfaffian functions.Ricardo Bianconi - 1992 - Journal of Symbolic Logic 57 (2):688-697.
Analytics
Added to PP
2013-10-31
Downloads
54 (#283,495)
6 months
5 (#544,079)
2013-10-31
Downloads
54 (#283,495)
6 months
5 (#544,079)
Historical graph of downloads
Citations of this work
Reducts of p-adically closed fields.Eva Leenknegt - 2014 - Archive for Mathematical Logic 53 (3-4):285-306.
Cell decomposition for semibounded p-adic sets.Eva Leenknegt - 2013 - Archive for Mathematical Logic 52 (5-6):667-688.
References found in this work
On definable subsets of p-adic fields.Angus MacIntyre - 1976 - Journal of Symbolic Logic 41 (3):605-610.
A version of o-minimality for the p-adics.Deirdre Haskell & Dugald Macpherson - 1997 - Journal of Symbolic Logic 62 (4):1075-1092.
Cell decomposition for P‐minimal fields.Marie-Hélène Mourgues - 2009 - Mathematical Logic Quarterly 55 (5):487-492.
A structure theorem for semibounded sets in the reals.Ya'acov Peterzil - 1992 - Journal of Symbolic Logic 57 (3):779-794.
A version of p-adic minimality.Raf Cluckers & Eva Leenknegt - 2012 - Journal of Symbolic Logic 77 (2):621-630.
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-7c76586df8-l2pxr uwo