The Strongest Model of Computation Obeying 0-1 Principles

Author： Levi Tamir  

Publisher： Springer Publishing Company

ISSN： 1432-4350

Source： Theory of Computing Systems, Vol.48, Iss.2, 2011-02, pp. : 374-388

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Strong 0-1 laws in finite model theory

By  

The Journal of Symbolic Logic, Vol. 65, Iss. 4, 2000-12 ,pp. : 1686-1704

Cambridge University Press

Access to resources Recommend Favorite

Exterior problem of the Darwin model and its numerical computation

By Lung-an Ying Fengyan   Li Fengyan  

ESAIM: Mathematical Modelling and Numerical Analysis, Vol. 37, Iss. 3, 2010-03 ,pp. : 515-532

Edp Sciences

Access to resources Recommend Favorite

Homology Groups of Types in Model Theory and the Computation of H 2(p)

By  

The Journal of Symbolic Logic, Vol. 78, Iss. 4, 2013-12 ,pp. : 1086-1114

Cambridge University Press

Access to resources Recommend Favorite

Integer matrices obeying generalized incidence equations

By  

Bulletin of the Australian Mathematical Society, Vol. 4, Iss. 1, 1971-02 ,pp. : 51-56

Cambridge University Press

Access to resources Recommend Favorite

First Principles Modelling of a Pasteurisation Plant for Model Predictive Control

By Khadir M.T.   Ringwood J.V.  

Mathematical and Computer Modelling of Dynamical Systems, Vol. 9, Iss. 3, 2004-01 ,pp. : 281-301

Taylor & Francis Ltd

Access to resources Recommend Favorite