The Mc Carthy's recursion induction principle: «Oldy» but «Goody»

CALCOLO ◽  
1982 ◽  
Vol 19 (1) ◽  
pp. 59-69 ◽  
Author(s):  
L. Kott
Keyword(s):  
Induction Principle

Theory Design Research and the Application Prospect of the Future for the Ever Moving Car

2013 ◽  
Vol 456 ◽  
pp. 142-145
Author(s):  
Guo Qiang Cao ◽  
Yuan Ji Li ◽  
Jiang Ning Liu
Keyword(s):  
Wind Power ◽  
Power Loss ◽  
Electromagnetic Induction ◽  
Energy Recovery ◽  
Design Research ◽  
Automobile Driving ◽  
The Other ◽  
Induction Principle ◽  
Energy Maximum ◽  
Set Up

Using faraday electromagnetic induction principle will car each wheel as a generator. For car generates its own energy recovery; In the front of car set up a blade, It can recovery the wind power what automobile driving produced, For wind power generation, So that it can recover the energy maximum for the car itself. Because of the two kinds of energy all are car generates its own energy, so it can not recovery completely, in addition to there is power loss in the other part of the car, So it needs to the energy loss and power loss for supplement, I choose the solar energy used as supplementary energy that finally achieve the purpose of "ever moving".

scholarly journals On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces

1998 ◽  
Vol 8 (5) ◽  
pp. 481-540 ◽  
Author(s):  
DANIELE TURI ◽  
JAN RUTTEN
Keyword(s):  
Computer Science ◽  
Mathematical Theory ◽  
Metric Spaces ◽  
Operational Semantics ◽  
Denotational Semantics ◽  
Partial Orders ◽  
Present Survey ◽  
Induction Principle ◽  
Structural Operational Semantics ◽  
Modern Mathematics

This paper, a revised version of Rutten and Turi (1993), is part of a programme aiming at formulating a mathematical theory of structural operational semantics to complement the established theory of domains and denotational semantics to form a coherent whole (Turi 1996; Turi and Plotkin 1997). The programme is based on a suitable interplay between the induction principle, which pervades modern mathematics, and a dual, non-standard ‘coinduction principle’, which underlies many of the recursive phenomena occurring in computer science.The aim of the present survey is to show that the elementary categorical notion of a final coalgebra is a suitable foundation for such a coinduction principle. The properties of coalgebraic coinduction are studied both at an abstract categorical level and in some specific categories used in semantics, namely categories of non-well-founded sets, partial orders and metric spaces.

Contact-less revolving stage using transverse flux induction principle

2009 ◽  
Vol 33 (1) ◽  
pp. 107-115 ◽  
Author(s):  
Kwang Suk Jung ◽  
Sang Heon Lee
Keyword(s):  
Induction Principle ◽  
Transverse Flux

scholarly journals An induction principle for consequence in arithmetic universes

2012 ◽  
Vol 216 (8-9) ◽  
pp. 2049-2067 ◽  
Author(s):  
Maria Emilia Maietti ◽  
Steven Vickers
Keyword(s):  
Induction Principle

An asymmetric induction principle and biomimetics with photons via electron transfer

1998 ◽  
Vol 70 (11) ◽  
pp. 2167-2176 ◽  
Author(s):  
Christoph Heinemann ◽  
X. Xing ◽  
K.-D. Warzecha ◽  
P. Ritterskamp ◽  
H. Görner ◽  
...  
Keyword(s):  
Electron Transfer ◽  
Asymmetric Induction ◽  
Induction Principle

scholarly journals Modal logic and the approximation induction principle

2012 ◽  
Vol 22 (2) ◽  
pp. 175-201 ◽  
Author(s):  
MACIEJ GAZDA ◽  
WAN FOKKINK
Keyword(s):  
Modal Logic ◽  
Upper Bounds ◽  
Compactness Theorem ◽  
Projection Operators ◽  
Sufficient Condition ◽  
Induction Principle ◽  
Constructive Version ◽  
Trace Semantics

We prove a compactness theorem in the context of Hennessy–Milner logic and use it to derive a sufficient condition on modal characterisations for the approximation induction principle to be sound modulo the corresponding process equivalence. We show that this condition is necessary when the equivalence in question is compositional with respect to the projection operators. Furthermore, we derive different upper bounds for the constructive version of the approximation induction principle with respect to simulation and decorated trace semantics.

Sign in / Sign up

Export Citation Format

Share Document