Semantic Scholar uses AI to extract papers important to this topic.
We pose thirty conjectures on arithmetical sequences, most of which are about monotonicity of sequences of the form $(\root n\of… Expand Constructing a representation in which students express their domain understanding can help them improve their knowledge. Many… Expand Pocklington certificates are known to provide short proofs of primality. We show how to perform this in the framework of formal… Expand We prove that for every countable ordinal a one cannot decide whether a given infinitary rational relation is in the Borel class… Expand Abstract We investigate the defining power of stratified and hierarchical logic programs. As an example for the treatment of… Expand Introduction. A computable field is one whose elements may be placed in one-one correspondence with the natural numbers in such a… Expand This paper presents some new theorems concerning recursively enumerable (r.e.) sets. The aim of the paper is to advance the… Expand If F is a field, and a is an element of F, we say that a is arithmetically definable in F if there is a formula containing one… Expand