ternary variables
Recently Published Documents


TOTAL DOCUMENTS

4
(FIVE YEARS 0)

H-INDEX

3
(FIVE YEARS 0)

2014 ◽  
Vol 2014 ◽  
pp. 1-5
Author(s):  
Guolong He ◽  
Yafeng Zhan ◽  
Yukui Pei ◽  
Bin Wu

Ternary adjusting method is proposed and combined with particle swarm optimization (PSO) algorithm for subarrayed antenna array synthesis. Ternary variables are introduced to represent element adjustments between adjacent subarrays. Compared to previous methods, rounding-off operations are not required any longer, and the equation constraint of the fixed total element number is also removed, which effectively reduces the complexity of implementation while obtaining improved topology exploration capability simultaneously.


2001 ◽  
Vol 55 (3) ◽  
pp. 240-243 ◽  
Author(s):  
Graham J. G Upton

1939 ◽  
Vol 4 (1) ◽  
pp. 1-9 ◽  
Author(s):  
László Kalmár

1. Although the decision problem of the first order predicate calculus has been proved by Church to be unsolvable by any (general) recursive process, perhaps it is not superfluous to investigate the possible reductions of the general problem to simple special cases of it. Indeed, the situation after Church's discovery seems to be analogous to that in algebra after the Ruffini-Abel theorem; and investigations on the reduction of the decision problem might prepare the way for a theory in logic, analogous to that of Galois.It has been proved by Ackermann that any first order formula is equivalent to another having a prefix of the form(1) (Ex1)(x2)(Ex3)(x4)…(xm).On the other hand, I have proved that any first order formula is equivalent to some first order formula containing a single, binary, predicate variable. In the present paper, I shall show that both results can be combined; more explicitly, I shall prove theTheorem. To any given first order formula it is possible to construct an equivalent one with a prefix of the form (1) and a matrix containing no other predicate variable than a single binary one.2. Of course, this theorem cannot be proved by a mere application of the Ackermann reduction method and mine, one after the other. Indeed, Ackermann's method requires the introduction of three auxiliary predicate variables, two of them being ternary variables; on the other hand, my reduction process leads to a more complicated prefix, viz.,(2) (Ex1)…(Exm)(xm+1)(xm+2)(Exm+3)(Exm+4).


Sign in / Sign up

Export Citation Format

Share Document