Searcharxiv⌕ 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

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗
arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗
arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗