Abstract
Let the possible ways of development of some system from the initial state X0 be given by the deductive system <α;X0> (X0 is an axiom, the algorithm α defines the relation of deducibility in one step). Let Y1,..., Ye be all states directly derivable from X [i.e., α (X)={y1,..., Ye]. Let α be an algorithm assigning for each X transition probabilities p1,..., p l , where\(p = i - \sum\limits_{i = 1}^\ell {Pi} \) is the transition probability to the special state STOP.
defines a probability measure on the set of all deductions. We define the information in the pair < α;X0> by the forla:
where px is the probability of being in X directly before STOP. We consider α, assigning a fixed p for each X and satisfying the condition p1= ...=p l . Then the information in < α; X0> becomes a function <α;X0> of one p. The essential characteristic of the system <α;X > is given by the asymptotic behavior of <α;X0> as p → 0. This characteristic corresponds well with the intuitive notion of the relative “power” of calculi. Now we consider <α,X>(p) as a function of X. For many types of systems there is a useful strategy for maximizing this function (the strategy of increasing freedom of choice); we consider in this connection the simplest systems of economic character. Let X, Y, Z be n-dimensional vectors with nonnegative components (the components are interpreted as resources and products of a certain economic system, α gives the technological possibility of transformations of the resources). Let
Similar content being viewed by others
Literature cited
E. Post, “Formal reductions of the general combinatorial decision problem,” Am. J. Math.,65, No. 2, 197–215 (1943).
Methods of Structural Tuning of Systems of Production Control [in Russian], Moscow (1976).
S. Yu. Maslov, “The relation of consumption on regular sets,” Zap. Nauchn, Sem. Leningr, Otd. Mat. Inst. Akad, Nauk SSSR,60, 65–74 (1976).
S. Yu. Maslov, “Mutational calculi,” Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst. Akad. Nauk SSSR,49, 7–30 (1975).
S. Yu. Maslov, “Some properties of the apparatus of canonical calculi of E. L. Post,” Tr. Mat. Inst. Akad. Nauk SSSR,72, 5–56 (1964).
I. D. Zaslavskii, “Graph-schemes with memory,” Tr. Mat. Inst. Akad. Nauk SSSR,72, 99–192 (1964).
S. Yu. Maslov, “Information in a calculus and rationalization of resortings,” Kibernetika, No. 2 (1979).
S. Yu. Maslov, “Information in a calculus as a measure of indeterminacy of the set of derivable words,” in: Abstracts of the Fourth Conference on Mathematical Logic [in Russian], Kishinev (1976), p. 88.
S. Yu. Maslov and E. D. Rusakov, “Probabilistic canonical calculi,” Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst. Akad. Nauk SSSR,32, 66–76 (1972).
Additional information
Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 88, pp. 90–104, 1979.
Rights and permissions
About this article
Cite this article
Maslov, S.Y. Calculi with monotone deductions and their economic interpretation. J Math Sci 20, 2314–2321 (1982). https://doi.org/10.1007/BF01629441
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01629441