RNS to Binary Conversion Using Diagonal Function and Pirlo and Impedovo Monotonic Function

2015 ◽  
Vol 35 (3) ◽  
pp. 1063-1076 ◽  
Author(s):  
P. V. Ananda Mohan
Author(s):  
Raymond M. Smullyan

§1. Some Preliminary Theorems. we continue to let S be an arbitrary system, P be the set of Gödel numbers of the provable formulas of S and R be the set of Gödel numbers of the refutable formulas of S. Theorem 1. The set P̃* is not representable in S. Proof. This is the diagonal argument all over again. If H(v1) represents P̃* and h is the Gödel number of H(v1), the H[h̅] is provable in S iff h Ï p* iff d(h) ÏP iff H[h̅] is not provable in S, which is a contradiction. Theorem 1.1. If S is consistent, then P* is not definable in S. Proof. Suppose P* is definable in S. If S were consistent, then P* would be completely representable in S (cf. §3.1, Ch. 0). Hence P̃* would be representable in S, contrary to Theorem 1. Therefore, if S is consistent, then P* is not definable in S. Theorem 1.2. If the diagonal function d(x) is strongly definable in S and S is consistent, then P is not definable in S. Proof. Suppose d(x) is strongly definable in S. Since P* = d -1(P), then if P were definable in S, P* would be definable in S (by Th. 11.2, Ch. 0). Hence S would be inconsistent by Theorem 1.1. Exercise 1. Show that if S is consistent, then R* is not definable in S. Exercise 2. Show that if S is consistent, then no superset of R* disjoint from P* is definable in S, and no superset of P* disjoint from R* is definable in S. Exercise 3. Prove that if S is consistent and if the diagonal function is strongly definable in S, then no superset of P disjoint from R is definable in S. [This is stronger than Theorem 1.2.] §2. Undecidable Systems. A system S is said to be decidable (or to admit of a decision procedure) if the set P of Gödel numbers of the provable formulas of S is a recursive set. It is undecidable if P is not recursive. This meaning of ‘undecidable’ should not be confused with the meaning of ‘undecidable’ when applied to a particular formula (as being undecidable in a given system S).


1993 ◽  
Vol 43 (1-2) ◽  
pp. 123-126 ◽  
Author(s):  
Sadao Tomizawa

For square contingency tables, with ordered categories, this short note decomposes the marginal homogeneity (MH) model into an extended MH model and the model of equality of expectation of monotonic function of row and column variables. This decomposition is a generalization of the decomposition of the MH model which was earlier considered by Tomizawa (1991, Cal. Statist. Assoc. Bull., 41, 201-207).


2015 ◽  
Vol 3 (4) ◽  
pp. 140 ◽  
Author(s):  
Fang-Fang Liu ◽  
Xiao-Ting Shi ◽  
Feng Qi

<p><span>In the paper, the authors find necessary conditions and sufficient conditions for a function involving the gamma function and originating from investigation of properties of the Catalan numbers and function in combinatorics to be logarithmically completely monotonic.</span></p>


Entropy ◽  
2020 ◽  
Vol 22 (8) ◽  
pp. 804
Author(s):  
L. P. Horwitz

We discuss a covariant relativistic Boltzmann equation which describes the evolution of a system of particles in spacetime evolving with a universal invariant parameter τ . The observed time t of Einstein and Maxwell, in the presence of interaction, is not necessarily a monotonic function of τ . If t ( τ ) increases with τ , the worldline may be associated with a normal particle, but if it is decreasing in τ , it is observed in the laboratory as an antiparticle. This paper discusses the implications for entropy evolution in this relativistic framework. It is shown that if an ensemble of particles and antiparticles, converge in a region of pair annihilation, the entropy of the antiparticle beam may decreaase in time.


Author(s):  
Michael Sivak ◽  
Michael Flannagan ◽  
Paul L. Olson

The objective of this study was to evaluate the relationship of lamp photometrics to differentiation between brake and presence signals. To assess this relationship, signal identification was evaluated as a function of lamp photometrics under simulated dusk/dawn conditions. The following were the main results: (1) Luminous intensity was a better predictor of signal identification than was average luminance. (2) The likelihood of identifying a signal as a brake signal was a monotonic function of lamp intensity. (3) Reaction time was positively related to the degree of subjects' uncertainty (as measured by the relative likelihood of “brake” responses): reaction time was slowest when the likelihood of “brake” or “presence” responses was close to 50%, and it decreased as the likelihood increased or decreased away from 50%. (4) Reaction time in a condition simulating typical U.S. rear-lighting configuration was significantly faster than in a condition simulating typical European configuration. The present results provide support for retaining luminous intensity as the relevant parameter of automobile brake-lighting specifications. Furthermore, these results argue against reducing the current minimum of 80 cd for the brake-lamp luminous intensity.


1964 ◽  
Vol 15 (2) ◽  
pp. 527-534 ◽  
Author(s):  
Howard R. Pollio ◽  
Edward G. Christy

Three groups of 20 Ss each were asked for the free recall of three different lists of 28 meaningful English words. Each list contained the associative responses evoked by a different Kent-Rosanoff stimulus word, and differed in the amount of its inter-item associative strength (IIAS). The words in a given list also differed in terms of the number of other words (Nc) in that list producing or cueing that word as an associate. Results showed that the number of items appearing in free recall was a non-monotonic function of IIAS. For two of the three word sets, Nc was positively correlated with the frequency of recall of individual items; while for the third set Nc value and frequency of recall were negatively correlated. The relationship between Nc and order of recall was non-linear, and some tendency toward alternating the recall of high and low Nc words appeared in the data. Thus, IIAS produced both facilitation and interference effects on free recall, the latter being the result of a factor similar to verbal satiation.


2019 ◽  
Vol 124 (1) ◽  
pp. 81-101
Author(s):  
Manfred Stoll

In the paper we characterize the reproducing kernel $\mathcal {K}_{n,h}$ for the Hardy space $\mathcal {H}^2$ of hyperbolic harmonic functions on the unit ball $\mathbb {B}$ in $\mathbb {R}^n$. Specifically we prove that \[ \mathcal {K}_{n,h}(x,y) = \sum _{\alpha =0}^\infty S_{n,\alpha }(\lvert x\rvert )S_{n,\alpha }(\lvert y\rvert ) Z_\alpha (x,y), \] where the series converges absolutely and uniformly on $K\times \mathbb {B}$ for every compact subset $K$ of $\mathbb {B}$. In the above, $S_{n,\alpha }$ is a hypergeometric function and $Z_\alpha $ is the reproducing kernel of the space of spherical harmonics of degree α. In the paper we prove that \[ 0\le \mathcal K_{n,h}(x,y) \le \frac {C_n}{(1-2\langle x,y\rangle + \lvert x \rvert^2 \lvert y \rvert^2)^{n-1}}, \] where $C_n$ is a constant depending only on $n$. It is known that the diagonal function $\mathcal K_{n,h}(x,x)$ is a radial eigenfunction of the hyperbolic Laplacian $\varDelta_h $ on $\mathbb{B} $ with eigenvalue $\lambda _2 = 8(n-1)^2$. The result for $n=4$ provides motivation that leads to an explicit characterization of all radial eigenfunctions of $\varDelta_h $ on $\mathbb{B} $. Specifically, if $g$ is a radial eigenfunction of $\varDelta_h $ with eigenvalue $\lambda _\alpha = 4(n-1)^2\alpha (\alpha -1)$, then \[ g(r) = g(0) \frac {p_{n,\alpha }(r^2)}{(1-r^2)^{(\alpha -1)(n-1)}}, \] where $p_{n,\alpha }$ is again a hypergeometric function. If α is an integer, then $p_{n,\alpha }(r^2)$ is a polynomial of degree $2(\alpha -1)(n-1)$.


Author(s):  
L. BASILE ◽  
L. D’APUZZO

Some procedures for synthesizing values of judgements in multicriteria decision making have been provided by several authors. The functionals of synthesis they consider are frequently means. The most general form of these operators involves both a weighting function w and a continuous and strictly monotonic function φ. Our aim is to analyze the behaviour of the aggregation operator Fωφ depending on w and φ. To this purpose we introduce a pre-ordering relation on the set W of weighting functions and on the set Φ of continuous and strictly monotonic functions, which allows us to compare the synthesizing functionals.


Sign in / Sign up

Export Citation Format

Share Document