Computational model theory: an overview

DOI10.1093/JIGPAL/6.4.601MaRDI QIDQ4210768zbMATH OpenOpenAlexFDO

Authors Moshe Y. Vardi

Publication date 8 April 1999

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/44021c16e96f106923439c5abdcef049a8c0df26

zbMATH Keywords

complexity of relational computationscomputational model theoryexpressibilityfinite model theoryfixpoint logicsinfinitary logicsrelational machinerelational model of database computation

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Model theory of finite structures (03C13) Other infinitary logic (03C75) Turing machines and related notions (03D10) Complexity of computation (including implicit computational complexity) (03D15) Database theory (68P15)

Recommendations

• scientific article; zbMATH DE number 939032
• Models of computation. An introduction to computability theory
• Model theory in computer science: my own recurrent themes
• Models and computability
• scientific article; zbMATH DE number 6845502
• scientific article; zbMATH DE number 1534487
• Computability and computable models
• scientific article; zbMATH DE number 733393
• Model-theoretic methods of analysis of computer arithmetic
• scientific article; zbMATH DE number 1533641

Cited in

(3)

• Computing with first-order logic
• Using temporal logics to express search control knowledge for planning
• Fixpoint logics, relational machines, and computational complexity

This page was built for publication: Computational model theory: an overview

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210768)