Skip header Section
Skip Bibliometrics Section
A shorter model theoryApril 1997
- Author:
- Wilfrid Hodges
Abstract
No abstract available.
Cited By
- Peretyat’kin M (2025). The Tarski–Lindenbaum algebra of the class of strongly constructivizable models with -stable theories, Archive for Mathematical Logic, 64:1, (67-78), Online publication date: 1-Feb-2025.
- Barrett C, Tinelli C, Barbosa H, Niemetz A, Preiner M, Reynolds A and Zohar Y Satisfiability Modulo Theories: A Beginner’s Tutorial Formal Methods, (571-596)
- Hanneke S, Moran S and Shafer J A trichotomy for transductive online learning Proceedings of the 37th International Conference on Neural Information Processing Systems, (19502-19519)
- Goel S, Hanneke S, Moran S and Shetty A Adversarial resilience in sequential prediction via abstention Proceedings of the 37th International Conference on Neural Information Processing Systems, (8027-8047)
- Guingona V and Parnes M (2023). Ranks based on strong amalgamation Fraïssé classes, Archive for Mathematical Logic, 62:7-8, (889-929), Online publication date: 1-Nov-2023.
- Bodirsky M and Rydval J (2022). On the Descriptive Complexity of Temporal Constraint Satisfaction Problems, Journal of the ACM, 70:1, (1-58), Online publication date: 28-Feb-2023.
- Bellier D, Benerecetti M, Monica D and Mogavero F (2022). Good-for-Game QPTL: An Alternating Hodges Semantics, ACM Transactions on Computational Logic, 24:1, (1-57), Online publication date: 31-Jan-2023.
- Jonsson P and Lagerkvist V (2023). General Lower Bounds and Improved Algorithms for Infinite–Domain CSPs, Algorithmica, 85:1, (188-215), Online publication date: 1-Jan-2023.
- Li G, Kamath P, Foster D and Srebro N Understanding the eluder dimension Proceedings of the 36th International Conference on Neural Information Processing Systems, (23737-23750)
- Galliani P Strongly First Order, Domain Independent Dependencies: The Union-Closed Case Logic, Language, Information, and Computation, (263-279)
- Alon N, Bun M, Livni R, Malliaris M and Moran S (2022). Private and Online Learnability Are Equivalent, Journal of the ACM, 69:4, (1-34), Online publication date: 31-Aug-2022.
- Vepštas L Purely Symbolic Induction of Structure Artificial General Intelligence, (134-144)
- Baader F and Rydval J (2022). Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains, Journal of Automated Reasoning, 66:3, (357-407), Online publication date: 1-Aug-2022.
- Bodirsky M, Mamino M and Viola C (2021). Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation, ACM Transactions on Computational Logic, 23:1, (1-35), Online publication date: 31-Jan-2022.
- Kruszelnicka M (2021). Games and Bisimulations for Intuitionistic First-Order Kripke Models, Studia Logica, 109:5, (903-916), Online publication date: 1-Oct-2021.
- Bodirsky M and Bodor B Canonical polymorphisms of ramsey structures and the unique interpolation property Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, (1-13)
- Kostana Z (2021). On countably saturated linear orders and certain class of countably saturated graphs, Archive for Mathematical Logic, 60:1-2, (189-209), Online publication date: 1-Feb-2021.
- Bodirsky M and Knäuer S Hardness of Network Satisfaction for Relation Algebras with Normal Representations Relational and Algebraic Methods in Computer Science, (31-46)
- Baader F and Rydval J Description Logics with Concrete Domains and General Concept Inclusions Revisited Automated Reasoning, (413-431)
- Bodirsky M, Mottet A, Olšák M, Opršal J, Pinsker M and Willard R Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems) Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, (1-12)
- Alon N, Livni R, Malliaris M and Moran S Private PAC learning implies finite Littlestone dimension Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, (852-860)
- Villegas Silva L (2018). The gap‐two cardinal problem for uncountable languages, Mathematical Logic Quarterly, 64:4-5, (262-285), Online publication date: 22-Nov-2018.
- Goncharov S, Knight J and Souldatos I (2018). Hanf number for Scott sentences of computable structures, Archive for Mathematical Logic, 57:7-8, (889-907), Online publication date: 1-Nov-2018.
- Grilletti G and Ciardelli I An Ehrenfeucht-Fraïssé Game for Inquisitive First-Order Logic Language, Logic, and Computation, (166-186)
- Lucas S and Gutiérrez R (2018). Automatic Synthesis of Logical Models for Order-Sorted First-Order Theories, Journal of Automated Reasoning, 60:4, (465-501), Online publication date: 1-Apr-2018.
- Bodirsky M and Mamino M (2018). Tropically Convex Constraint Satisfaction, Theory of Computing Systems, 62:3, (481-509), Online publication date: 1-Apr-2018.
- Bodirsky M, Martin B and Mottet A (2018). Discrete Temporal Constraint Satisfaction Problems, Journal of the ACM, 65:2, (1-41), Online publication date: 8-Mar-2018.
- Bulian J and Dawar A (2017). Fixed-Parameter Tractable Distances to Sparse Graph Classes, Algorithmica, 79:1, (139-158), Online publication date: 1-Sep-2017.
- Barto L, Kompatscher M, Olšák M, Van Pham T and Pinsker M The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, (1-12)
- Bova S and Mogavero F Herbrand property, finite quasi-herbrand models, and a chandra-merlin theorem for quantified conjunctive queries Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, (1-12)
- Kopczyński E and Toruńczyk S (2017). LOIS: syntax and semantics, ACM SIGPLAN Notices, 52:1, (586-598), Online publication date: 11-May-2017.
- Kopczyński E and Toruńczyk S LOIS: syntax and semantics Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, (586-598)
- Barto L and Pinsker M The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, (615-622)
- Bodirsky M and Mottet A Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, (623-632)
- Sofronie-Stokkermans V On Interpolation and Symbol Elimination in Theory Extensions Proceedings of the 8th International Joint Conference on Automated Reasoning - Volume 9706, (273-289)
- Bodirsky M and Mamino M Max-Closed Semilinear Constraint Satisfaction Proceedings of the 11th International Computer Science Symposium on Computer Science --- Theory and Applications - Volume 9691, (88-101)
- Pech C and Pech M (2016). Towards a Ryll‐Nardzewski‐type theorem for weakly oligomorphic structures, Mathematical Logic Quarterly, 62:1-2, (25-34), Online publication date: 19-Feb-2016.
- Polozov O and Gulwani S (2015). FlashMeta: a framework for inductive program synthesis, ACM SIGPLAN Notices, 50:10, (107-126), Online publication date: 18-Dec-2015.
- Polozov O and Gulwani S FlashMeta: a framework for inductive program synthesis Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, (107-126)
- Bodirsky M and Pinsker M (2015). Schaefer's Theorem for Graphs, Journal of the ACM, 62:3, (1-52), Online publication date: 30-Jun-2015.
- Madeira A, Martins M, Barbosa L and Hennicker R (2015). Refinement in hybridised institutions, Formal Aspects of Computing, 27:2, (375-395), Online publication date: 1-Mar-2015.
- Bodirsky M, Macpherson H and Thapper J (2013). Constraint satisfaction tractability from semi-lattice operations on infinite sets, ACM Transactions on Computational Logic, 14:4, (1-19), Online publication date: 1-Nov-2013.
- Caso G, Braberman V, Garbervetsky D and Uchitel S (2013). Enabledness-based program abstractions for behavior validation, ACM Transactions on Software Engineering and Methodology, 22:3, (1-46), Online publication date: 1-Jul-2013.
- Bojańczyk M, Segoufin L and Toruńczyk S Verification of database-driven systems via amalgamation Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems, (63-74)
- Steiner R (2013). Effective algebraicity, Archive for Mathematical Logic, 52:1-2, (91-112), Online publication date: 1-Feb-2013.
- Jacobs S, Kuncak V and Suter P Reductions for Synthesis Procedures Proceedings of the 14th International Conference on Verification, Model Checking, and Abstract Interpretation - Volume 7737, (88-107)
- Wrona M Syntactically Characterizing Local-to-Global Consistency in ORD-Horn Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming - Volume 7514, (704-719)
- Alexe B, Cate B, Kolaitis P and Tan W (2011). Characterizing schema mappings via data examples, ACM Transactions on Database Systems, 36:4, (1-48), Online publication date: 1-Dec-2011.
- Moniri M and Zaare M (2011). Homomorphisms and chains of Kripke models, Archive for Mathematical Logic, 50:3-4, (431-443), Online publication date: 1-May-2011.
- Hedman S and Pong W (2011). Quantifier‐eliminable locally finite graphs, Mathematical Logic Quarterly, 57:2, (180-185), Online publication date: 30-Mar-2011.
- Bettin J and Clark T Advanced modelling made simple with the Gmodel metalanguage Proceedings of the First International Workshop on Model-Driven Interoperability, (79-88)
- Bodirsky M, Dalmau V, Martin B and Pinsker M Distance constraint satisfaction problems Proceedings of the 35th international conference on Mathematical foundations of computer science, (162-173)
- Ihlemann C and Sofronie-Stokkermans V On hierarchical reasoning in combinations of theories Proceedings of the 5th international conference on Automated Reasoning, (30-45)
- Cohen C and Mahboubi A A formal quantifier elimination for algebraically closed fields Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics, (189-203)
- Alexe B, Kolaitis P and Tan W Characterizing schema mappings via data examples Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (261-272)
- Bodirsky M and Kára J (2010). A fast algorithm and datalog inexpressibility for temporal reasoning, ACM Transactions on Computational Logic, 11:3, (1-21), Online publication date: 1-May-2010.
- Bodirsky M and Kára J (2010). The complexity of temporal constraint satisfaction problems, Journal of the ACM, 57:2, (1-41), Online publication date: 1-Jan-2010.
- Bailey J, Dong G and To A (2010). Logical queries over views, ACM Transactions on Computational Logic, 11:2, (1-35), Online publication date: 1-Jan-2010.
- Bodirsky M and Chen H (2010). Peek arc consistency, Theoretical Computer Science, 411:2, (445-453), Online publication date: 1-Jan-2010.
- Delugach H (2009). Representing metadata constraints in Common Logic, International Journal of Metadata, Semantics and Ontologies, 4:4, (277-286), Online publication date: 1-Nov-2009.
- Shankar N (2009). Automated deduction for verification, ACM Computing Surveys, 41:4, (1-56), Online publication date: 1-Oct-2009.
- Atserias A and Weyer M Decidable relationships between consistency notions for constraint satisfaction problems Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic, (102-116)
- Romov B (2009). Homogeneous and strictly homogeneous criteria for partial structures, Discrete Applied Mathematics, 157:4, (699-709), Online publication date: 20-Feb-2009.
- Charatonik W and Wrona M Quantified Positive Temporal Constraints Proceedings of the 22nd international workshop on Computer Science Logic, (94-108)
- Eisinger J Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract) Proceedings of the 22nd international workshop on Computer Science Logic, (431-445)
- Delugach H and Rochowiak D Grounded Conceptual Graph Models Proceedings of the 16th international conference on Conceptual Structures: Knowledge Visualization and Reasoning, (269-281)
- Bodirsky M and Grohe M Non-dichotomies in Constraint Satisfaction Complexity Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II, (184-196)
- Bodirsky M and Kara J The complexity of temporal constraint satisfaction problems Proceedings of the fortieth annual ACM symposium on Theory of computing, (29-38)
- Bodirsky M and Chen H Qualitative temporal and spatial reasoning revisited Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic, (194-207)
- Bodirsky M, Chen H, Kára J and von Oertzen T Maximal infinite-valued constraint languages Proceedings of the 34th international conference on Automata, Languages and Programming, (546-557)
- Bouyer P, Brihaye T and Chevalier F Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata! Proceedings of the international symposium on Logical Foundations of Computer Science, (69-83)
- Bodirsky M and Chen H Collapsibility in infinite-domain quantified constraint satisfaction Proceedings of the 20th international conference on Computer Science Logic, (197-211)
- Bodirsky M and Kára J The complexity of equality constraint languages Proceedings of the First international computer science conference on Theory and Applications, (114-126)
- Bodirsky M and Dalmau V Datalog and constraint satisfaction with infinite templates Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science, (646-659)
- Bodirsky M The core of a countably categorical structure Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science, (110-120)
- Duby G (2003). Countable ultrahomogeneous antimatroids of convex dimension 2, Discrete Mathematics, 269:1-3, (113-125), Online publication date: 28-Jul-2003.
- Farrugia J Model-theoretic semantics for the web Proceedings of the 12th international conference on World Wide Web, (29-38)
- McBurney P and Parsons S (2001). Representing Epistemic Uncertainty by Means of Dialectical Argumentation, Annals of Mathematics and Artificial Intelligence, 32:1-4, (125-169), Online publication date: 27-Aug-2001.
- Bodirsky M and Bodor B A Complexity Dichotomy in Spatial Reasoning via Ramsey Theory, ACM Transactions on Computation Theory, 0:0
Index Terms
- A shorter model theory
Reviews
Ralph Walter Wilkerson
As the title indicates, this book is a shorter version of a much longer book by the same author [1]. This textbook on the elements of model theory is clearly aimed at mature mathematicians or computer scientists. The only background assumed is a knowledge of Zermelo-Fra¨nkel set theory. From this, the author carefully develops model theory, starting with structures and concluding with a proof of Morley's t heorem. Exercises are given at the end of each chapter. Computer science researchers working in term rewriting, automated reasoning, or logical inference systems may find this book useful for understanding the logical tools they use.
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Please enable JavaScript to view thecomments powered by Disqus.
Recommendations
Incremental model synchronization based on a trace model
SMO'09: Proceedings of the 9th WSEAS international conference on Simulation, modelling and optimizationModel synchronization is an extant and significant problem in model-related technologies. In general, a modeled system is composed of several models that are often related to one another. Consequently, if one model is altered in the development process, ...
Wind speed forecast based on combined theory, multi-objective optimisation, and sub-model selection
AbstractWind energy is the primary energy source for a sustainable and pollution-free global power supply. However, because of its characteristic irregularity, nonlinearity, non-stationarity, randomness, and intermittency, previous studies have only ...
Graph theory and model collection management: conceptual framework and runtime analysis of selected graph algorithms
Analysing conceptual models is a frequent task of business process management (BPM), for instance to support comparison or integration of business processes, to check business processes for compliance or weaknesses, or to tailor conceptual models for ...