- 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
The theory of integer multiplication with order restricted to primes is decidable
Journal of Symbolic Logic 62 (1):123-130 (1997)
Abstract
We show here that the first order theory of the positive integers equipped with multiplication remains decidable when one adds to the language the usual order restricted to the prime numbers. We see moreover that the complexity of the latter theory is a tower of exponentials, of height O(n)Links
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
Pure Second-Order Logic with Second-Order Identity.Alexander Paseau - 2010 - Notre Dame Journal of Formal Logic 51 (3):351-360.
Theories of arithmetics in finite models.Michał Krynicki & Konrad Zdanowski - 2005 - Journal of Symbolic Logic 70 (1):1-28.
On first-order theories with provability operator.Sergei Artëmov & Franco Montagna - 1994 - Journal of Symbolic Logic 59 (4):1139-1153.
Undecidable extensions of Skolem arithmetic.Alexis Bès & Denis Richard - 1998 - Journal of Symbolic Logic 63 (2):379-401.
Un Principe d'ax-kochen-Ershov pour Des structures intermediares entre groupes et corps values.Françoise Delon & Patrick Simonetta - 1999 - Journal of Symbolic Logic 64 (3):991-1027.
On a decidable generalized quantifier logic corresponding to a decidable fragment of first-order logic.Natasha Alechina - 1995 - Journal of Logic, Language and Information 4 (3):177-189.
Degree Spectra of Prime Models.Barbara F. Csima - 2004 - Journal of Symbolic Logic 69 (2):430 - 442.
A decidable variety that is finitely undecidable.Joohee Jeong - 1999 - Journal of Symbolic Logic 64 (2):651-677.
Decidability and undecidability of theories with a predicate for the primes.P. T. Bateman, C. G. Jockusch & A. R. Woods - 1993 - Journal of Symbolic Logic 58 (2):672-687.
Analytics
Added to PP
2009-01-28
Downloads
45 (#346,111)
6 months
19 (#130,686)
2009-01-28
Downloads
45 (#346,111)
6 months
19 (#130,686)
Historical graph of downloads
References found in this work
Weak Second‐Order Arithmetic and Finite Automata.J. Richard Büchi - 1960 - Mathematical Logic Quarterly 6 (1-6):66-92.
A uniform method for proving lower bounds on the computational complexity of logical theories.Kevin J. Compton & C. Ward Henson - 1990 - Annals of Pure and Applied Logic 48 (1):1.
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-5tf24 uwo