๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Combinatorial Isols and the Arithmetic of Dekker Semirings

โœ Scribed by Thomas G. McLaughlin


Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
295 KB
Volume
48
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

โœฆ Synopsis


In his long and illuminating paper Joe Barback defined and showed to be non-vacuous a class of infinite regressive isols he has termed "completely torre" (CT) isols. These particular isols all enjoy a property that Barback has since labelled combinatoriality. In , he provides a list of properties characterizing the combinatorial isols. In Section 2 of our paper, we extend this list of characterizations to include the fact that an infinite regressive isol X is combinatorial if and only if its associated Dekker semiring D(X) satisfies all those ฮ 2 sentences of the language LN for isol theory that are true in the set ฯ‰ of natural numbers. (Moreover, with X combinatorial, the interpretations in D(X) of the various function and relation symbols of LN via the "lifting" to D(X) of their ฮฃ1 definitions in ฯ‰ coincide with their interpretations via isolic extension.) We also note in Section 2 that ฮ 2(L)-correctness, for semirings D(X), cannot be improved to ฮ 3(L)-correctness, no matter how many additional properties we succeed in attaching to a combinatorial isol; there is a fixed โˆ€ โˆƒ โˆ€ (L) sentence that blocks such extension. (Here L is the usual basic first-order language for arithmetic.) In Section 3, we provide a proof of the existence of combinatorial isols that does not involve verification of the extremely strong properties that characterize Barback's CT isols.


๐Ÿ“œ SIMILAR VOLUMES


Grids and the Arithmetics of Jordan Pair
โœ Holger P. Petersson ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 338 KB

We prove that every 2-finitedimensional covering standard division grid of a Jordan pair V over a Henselian field canonically determines a norm on V. This is used to classify maximal orders which contain a covering division grid of V. We show that weakly separable orders always satisfy this conditio

Genus Characters and the Arithmetic of C
โœ David H. Johnson; Clifford S. Queen ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 410 KB

In this paper we develop an ideal theory for certain submonoids of the nonzero integers. We associate one of these monoids to each quadratic number field and show that the genus theory of ideals and genus characters of the number field are virtually the same as the ideal theory and the characters of

On the denseness of arithmetic vectors
โœ Miriam Hausman; Harold N. Shapiro ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 362 KB