Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 224,728,529 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.
2020
2020
PROVING P 6 = NP IN FIRST-ORDER PA
Callum
2020
Corpus ID: 218720203
. The original inspiration for the argument presented here was the observation, whose proof we sketch first, that it is provable…
Expand
2018
2018
HIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC
Rasmus Blanck
The Review of Symbolic Logic
2018
Corpus ID: 91178164
Abstract There has been a recent interest in hierarchical generalizations of classic incompleteness results. This paper provides…
Expand
2016
2016
Reverse mathematics and marriage problems with finitely many solutions
J. Hirst
,
Noah A. Hughes
Archive for Mathematical Logic
2016
Corpus ID: 42095675
We analyze the logical strength of theorems on marriage problems with a fixed finite number of solutions via the techniques of…
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
2005
2005
On the Partial Respects in Which a Real Valued Arithmetic System Can Verify Its Tableaux Consistency
D. Willard
International Conference on Theorem Proving with…
2005
Corpus ID: 9977267
Godel’s Second Incompleteness Theorem states axiom systems of sufficient strength are unable to verify their own consistency. We…
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
2001
2001
N T ] 8 F eb 2 00 1 RAMIFICATION IN C-EXTENSIONS OF LOCAL FIELDS OF CHARACTERISTIC 0
O. Sauzet
2001
Corpus ID: 14493122
We construct explicitly APF extensions of finite extensions of Qp for which the Galois group is not a p-adic Lie group and which…
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
1991
1991
Arithmetical Set Theory
P. Strauss
Studia Logica: An International Journal for…
1991
Corpus ID: 30877469
It is well known that number theory can be interpreted in the usual set theories, e.g. ZF, NF and their extensions. The problem I…
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