Recursive Arithmetic of Skolem II.

Pogorzelski, H. A.

doi:10.7146/math.scand.a-10662

Search citation statements

Order By: Relevance

Paper Sections

Select...

11) ]1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1964

1965

Publication Types

Select...

Article5

Relationship

Self Cite1

Independent4

Authors

Journals

Cited by 7 publications

(1 citation statement)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…. (see author) 6 which can be constructed along the general lines indicated in this paper, the author's 4 earlier paper, and the paper by Vuckovic 10 in particular. §4.…”

Section: 11) ]mentioning

confidence: 94%

Commutative recursive word arithmetic in the alphabet of prime numbers.

Pogorzelski¹

1964

Notre Dame J. Formal Logic

View full text Add to dashboard Cite

show abstract

“…. (see author) 6 which can be constructed along the general lines indicated in this paper, the author's 4 earlier paper, and the paper by Vuckovic 10 in particular. §4.…”

Section: 11) ]mentioning

confidence: 94%

Commutative recursive word arithmetic in the alphabet of prime numbers.

Pogorzelski¹

1964

Notre Dame J. Formal Logic

View full text Add to dashboard Cite

show abstract

Primitive Words in an Infinite Abstract Alphabet

Pogorzelski

1964

Mathematical Logic Qtrly

Self Cite

View full text Add to dashboard Cite

Nonconcatenative Abstract Skolem Arithmetics I

Pogorzelski

1965

Mathematical Logic Qtrly

View full text Add to dashboard Cite

An abstract Skolem arithmetic is an arithmetic constructible on an abstract word system in a finite or denumerably infinite abstract alphabet by means of propositional calculus, definition by composition and recursion in the word system, and proof by induction in the word system, without the use of unbounded quantifiers.Using versions of RABIN'S [2] nonconcatenative operations, are ordinary operations of addition and multiplication, we first construct an abstract SKOLEM arithmetic on the set A itself, and in turn we extend this arithmetic to an abstract SKOLEM arithmetic on the noncommutative word system Q(A) in the alphabet A [4], constructing i t up through its multiplicative unique word resolution theorem.

show abstract

Recursive Arithmetic of Skolem II.

Cited by 7 publications

References 4 publications

Commutative recursive word arithmetic in the alphabet of prime numbers.

Commutative recursive word arithmetic in the alphabet of prime numbers.

Primitive Words in an Infinite Abstract Alphabet

Nonconcatenative Abstract Skolem Arithmetics I

Contact Info

Product

Resources

About