A set C can be strongly coded under condition < B, C(A) >, where B and C are classes of sets possibly with other parameters, iff there exists A ∈ B such that every Z ∈ C(A) can be used to compute C. The issue is widely studied especially in effective mathematics and reverse mathematics. In this paper, we focus on three kinds of conditions, namely, density condition, enumeration condition and pa...

Theories of ‘growth models’ explain capitalist diversity by reference to shifting drivers aggregate demand in different national economies. This article expands the growth models framework beyond its conventional focus on debt-driven and export-driven demand, through an ideational analysis Thatcher’s vision a property-owning democracy, Blair’s knowledge-driven agenda. Drawing policymakers’ stat...

In this paper a smooth control algorithm for gear shifting is proposed for improving longitudinal dynamic performance during dry dual-clutch engagements while shifting up or down takes place based on measurements of engine speed and clutch speed, and on estimation of the dual-clutch engaging torque. Simulation effort is made by Matlab/Simulink for transient responses of the overall propulsion s...