Search for Topics All Reviews
	Browse All Reviews > Theory Of Computation (F) > Mathematical Logic And Formal Languages (F.4) > Mathematical Logic (F.4.1) > Model Theory (F.4.1...)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 10 Reviews about "Model Theory (F.4.1...)": Date Reviewed   Finite and algorithmic model theory Esparza J., Michaux C., Steinhorn C., Cambridge University Press, New York, NY, 2011. 356 pp.  Type: Book (978-0-521718-20-2) Models are extensively used when building large software systems. This book focuses on the theory of models, which are perceived as mathematical structures. It presents concepts, definitions, and related theorems, and emphasizes the fi... Jan 16 2012   Models and games Väänänen J., Cambridge University Press, New York, NY, 2011. 380 pp.  Type: Book (978-0-521518-12-3) Why are games so fascinating and pervasive that they gain the attention not only of computer scientists, philosophers, economists, and social scientists but also, as in the case of this book, of logicians and mathematicians?... Jan 10 2012   Homomorphism preservation theorems Rossman B. Journal of the ACM 55(3): 1-53, 2008.  Type: Article Model theory is the abstract study of mathematical structures that satisfy axioms stated using a first-order logic. A general question that is investigated in model theory is whether a property of a structure, expressed as logical sent... Jan 6 2009   Bounded model checking of infinite state systems Schuele T., Schneider K. Formal Methods in System Design 30(1): 51-81, 2007.  Type: Article Model checking is determining whether a given structure that is derived from hardware or software design satisfies a formal specification. The formal specification is often described as a temporal logic formula. The structure is often ... Jan 18 2008    Elements of finite model theory (Texts in Theoretical Computer Science) Libkin L., SpringerVerlag, 2004.  Type: Book (9783540212027) Given that Springer already has two books on the subject of finite model theory and descriptive complexity [1,2], one would think the market was saturated. Clearly, however, there is room for more. That Libkin has managed to produce an... Mar 17 2005   Logic and complexity Lassaigne R., Rougemont M., Springer-Verlag, 2003.  Type: Book (9781852335656) This is an advanced book, suitable for upper-level graduate students in computer science or mathematics. It is based on translations of two different French books, one on model theory, and one on complexity. From the title, one might n... Mar 25 2004   Existential second-order logic over strings Eiter T., Gottlob G., Gurevich Y. Journal of the ACM 47(1): 77-131, 2000.  Type: Article Strings over a finite alphabet can be naturally represented as structures in the sense of mathematical logic. Indeed, for a string a1 ... an, we have a finite structure with n... May 1 2000   Model theory Manzano M., De Queiroz R. (trans.), Oxford University Press, Oxford, UK, 1999. 239 pp.  Type: Book (9780198538516) This graduate-level textbook (a 1999 English translation of a 1989 Spanish publication [1]) gives a detailed presentation of the classical model theory of first-order logic.... Apr 1 2000   Expressiveness of concept expressions in first-order description logics Kurtonina N., de Rijke M. Artificial Intelligence 107(2): 303-333, 1999.  Type: Article Description logics are meant to reason about concepts (subsets ofthe domain) and roles (relations on the domain), using some Boolean andnumerical connectives. From this description, it is clear that they canbe translated into first-ord... Nov 1 1999   The equational logic of fixed points Bloom S., Ésik Z. Theoretical Computer Science 179(1-2): 1-60, 1997.  Type: Article The authors survey the category of partially ordered sets in which each partially ordered subset has a least upper bound. No proofs are given. They state that every endomorphism f (or every order-preserving map of a ... Apr 1 1998       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy