Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

We pose thirty conjectures on arithmetical sequences, most of which are about monotonicity of sequences of the form $(\root n\of… Expand

Is this relevant?

Highly Cited

2011

Highly Cited

2011

Constructing a representation in which students express their domain understanding can help them improve their knowledge. Many… Expand

Is this relevant?

2008

2008

In recent papers, Fesenko has defined the non-abelian local reciprocity map for every totally-ramified arithmetically profinite… Expand

Is this relevant?

2006

2006

Pocklington certificates are known to provide short proofs of primality. We show how to perform this in the framework of formal… Expand

Is this relevant?

2005

2005

On the Partial Respects in Which a Real Valued Arithmetic System Can Verify Its Tableaux Consistency

Godel’s Second Incompleteness Theorem states axiom systems of sufficient strength are unable to verify their own consistency. We… Expand

Is this relevant?

2003

2003

We prove that for every countable ordinal a one cannot decide whether a given infinitary rational relation is in the Borel class… Expand

Is this relevant?

2002

2002

The goal of the paper is to build particular three codimensional arithmetically Cohen-Macaulay subschemes of P^r , partial… Expand

Is this relevant?

1993

1993

Abstract We investigate the defining power of stratified and hierarchical logic programs. As an example for the treatment of… Expand

Is this relevant?

1970

1970

Introduction. A computable field is one whose elements may be placed in one-one correspondence with the natural numbers in such a… Expand

Is this relevant?

Highly Cited

1968

Highly Cited

1968

This paper presents some new theorems concerning recursively enumerable (r.e.) sets. The aim of the paper is to advance the… Expand

Is this relevant?