Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0010160

One Form of Successive Approximation Method and Choice Problem

Valeriy K. Bulitko
View original source ↗Read source document ↗Export metadata ↓

Abstract

A mathematical model of Subject behaviour choice is proposed. The background of the model is the concept of two preference relations determining Subject behaviour. These are an "internal" or subjective preference relation and an "external" or objective preference relation. The first (internal) preference relation is defined by some partial order on a set of states of the Subject. The second (external) preference relation on the state set is defined by a mapping from the state set to another partially ordered set. The mapping will be called evaluation mapping (function). We research the process of external preference maximization in a fashion that uses the external preference as little as possible. On the contrary, Subject may use the internal preference without any restriction. The complexity of a maximization procedure depends on the disagreement between these preferences. To solve the problem we apply some kind of the successive approximations methods. In terms of evaluation mappings this method operates on a decomposition of the mapping into a superposition of several standard operations and "easy" mappings (see the details below). Obtained in such way superpositions are called approximating forms. We construct several such forms and present two applications. One of them is concerned with a hypothetic origin of logic. The other application provides a new interpretation of the well known model of human choice by Lefebvre. The interpretation seems to suggest a justification different from the one proposed by Lefebvre himself.

Explore related subjects

math.LOcs.NAmath.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Valeriy K. Bulitko. 2000-10-16. One Form of Successive Approximation Method and Choice Problem. https://arxiv.org/abs/math/0010160

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗