Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,271,111 papers from all fields of science
Search
Sign In
Create Free Account
Arithmetical set
Known as:
Arithmetical real number
, Arithmetic set
, Arithmetical number
Expand
In mathematical logic, an arithmetical set (or arithmetic set) is a set of natural numbers that can be defined by a formula of first-order Peano…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Arithmetical hierarchy
Computable function
Computable number
Formal language
Expand
Broader (2)
Computability theory
Effective descriptive set theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Arithmetic, set theory, reduction and explanation
W. D’Alessandro
Synthese
2018
Corpus ID: 46956739
Philosophers of science since Nagel have been interested in the links between intertheoretic reduction and explanation…
Expand
2013
2013
The Surjectivity of Vectors
M. Lafourcade
,
A. Dirichlet
,
Z. J. Hardy
2013
Corpus ID: 14188568
Let Ω = π(K) be arbitrary. In [10], the authors address the negativity of natural curves under the additional assumption that…
Expand
2012
2012
Conjectures involving arithmetical sequences
Zhi-Wei Sun
2012
Corpus ID: 119164039
We pose thirty conjectures on arithmetical sequences, most of which are about monotonicity of sequences of the form $(\root n\of…
Expand
2010
2010
THE FORCING METHOD AND THE UPPER SEMILATTICE OF HYPERDEGREES
S. K. Thomasono
2010
Corpus ID: 51988861
1.
2008
2008
Fesenko reciprocity map
K. I. Ikeda
,
Erol Serbest
2008
Corpus ID: 30352948
In recent papers, Fesenko has defined the non-abelian local reciprocity map for every totally-ramified arithmetically profinite…
Expand
2002
2002
Partial Gorenstein in codimension 3
A. Ragusa
,
G. Zappala
2002
Corpus ID: 116892164
The goal of the paper is to build particular three codimensional arithmetically Cohen-Macaulay subschemes of P^r , partial…
Expand
1994
1994
Minimal upper bounds for arithmetical degrees
Masahiro Kumabe
Journal of Symbolic Logic (JSL)
1994
Corpus ID: 41329074
This paper was inspired by Lerman [14] in which he proved various properties of upper bounds for the arithmetical degrees. The…
Expand
1993
1993
The Defining Power of Stratified and Hierarchical Logic Programs
Gerhard Jäger
,
R. Stärk
The Journal of Logic Programming
1993
Corpus ID: 15092836
1970
1970
Computable fields and arithmetically definable ordered fields
A. Lachlan
,
E. W. Madison
1970
Corpus ID: 53958945
Introduction. A computable field is one whose elements may be placed in one-one correspondence with the natural numbers in such a…
Expand
1951
1951
Arithmetical definability of field elements
R. Robinson
Journal of Symbolic Logic (JSL)
1951
Corpus ID: 39843438
If F is a field, and α is an element of F, we say that α is arithmetically definable in F if there is a formula containing one…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required