Search arXivSearch

arXiv · math/0311387

On finite approximations of topological algebraic systems

Abstract

We introduce and discuss a definition of approximation of a topological algebraic system $A$ by finite algebraic systems of some class $\K$. For the case of a discrete algebraic system this definition is equivalent to the well-known definition of a local embedding of an algebraic system $A$ in a class $\K$ of algebraic systems. According to this definition $A$ is locally embedded in $K$ iff it is a subsystem of an ultraproduct of some systems in $\K$. We obtain a similar characterization of approximation of a locally compact system $A$ by systems in $\K$. We inroduce the bounded formulas of the signature of $A$ and their approximations similar to those introduced by C.W.Henson \cite{he} for Banach spaces. We prove that a positive bounded formula $\f$ holds in $A$ if all precise enough approximations of $\f$ hold in all precise enough approximations of $A$. We prove that a locally compact field cannot be approximated by finite associative rings (not necessary commutative). Finite approximations of the field $\R$ can be concedered as computer systems for reals. Thus, it is impossible to construct a computer arithmetic for reals that is an associative ring.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

L. Yu. Glebsky, E. I. Gordon, C. W. Henson. 2006-07-31. On finite approximations of topological algebraic systems. https://arxiv.org/abs/math/0311387

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO