The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Ian M. Hodkinson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ian M. Hodkinson
    On Gabbay's Temporal Fixed Point Operator. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:139, n:1&2, pp:1-25 [Journal]
  2. Hajnal Andréka, Ian M. Hodkinson, István Németi
    The finite base property for some cylindric-relativized algebras (Abstract). [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:81- [Conf]
  3. Ian M. Hodkinson, Szabolcs Mikulás
    Colorful reducts. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1998, pp:106-110 [Conf]
  4. Robin Hirsch, Ian M. Hodkinson
    Connections between cylindric algebras and relation algebras. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1998, pp:100-105 [Conf]
  5. Ian M. Hodkinson, Mark Reynolds
    Separation - Past, Present, and Future. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (2), 2005, pp:117-142 [Conf]
  6. Dov M. Gabbay, Ian M. Hodkinson, Anthony Hunter
    Using the Temporal Logic RDL for Design Specifications. [Citation Graph (0, 0)][DBLP]
    Concurrency: Theory, Language, And Architecture, 1989, pp:64-78 [Conf]
  7. Ian M. Hodkinson, Frank Wolter, Michael Zakharyaschev
    Decidable and Undecidable Fragments of First-Order Branching Temporal Logics. [Citation Graph (0, 0)][DBLP]
    LICS, 2002, pp:393-402 [Conf]
  8. Ian M. Hodkinson, Frank Wolter, Michael Zakharyaschev
    Monodic fragments of first-order temporal logics: 2000-2001 A.D. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:1-23 [Conf]
  9. Sebastian Bauer, Ian M. Hodkinson, Frank Wolter, Michael Zakharyaschev
    On Non-Local Propositional and Local One-Variable Quantified CTL*. [Citation Graph (0, 0)][DBLP]
    TIME, 2002, pp:2-9 [Conf]
  10. Ian M. Hodkinson, Roman Kontchakov, Agi Kurucz, Frank Wolter, Michael Zakharyaschev
    On the Computational Complexity of Decidable Fragments of First-Order Linear Temporal Logics. [Citation Graph (0, 0)][DBLP]
    TIME, 2003, pp:91-98 [Conf]
  11. Robin Hirsch, Ian M. Hodkinson
    Relation Algebras with n-Dimensional Relational Bases. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:101, n:2-3, pp:227-274 [Journal]
  12. Robin Hirsch, Ian M. Hodkinson
    Relation algebras form cylindric algebras, I. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:112, n:2-3, pp:225-266 [Journal]
  13. Robin Hirsch, Ian M. Hodkinson
    Relation algebras form cylindric algebras, II. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:112, n:2-3, pp:267-297 [Journal]
  14. Wilfried Hodges, Ian M. Hodkinson, Dugald Macpherson
    Omega-Categoricity, Relative Categoricity and Coordinatisation. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1990, v:46, n:2, pp:169-199 [Journal]
  15. Ian M. Hodkinson
    Complexity of monodic guarded fragments over linear and real time. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:138, n:1-3, pp:94-125 [Journal]
  16. Ian M. Hodkinson
    Atom Structures of Cylindric Algebras and Relation Algebras. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1997, v:89, n:2-3, pp:117-148 [Journal]
  17. Ian M. Hodkinson, Frank Wolter, Michael Zakharyaschev
    Decidable fragment of first-order temporal logics. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:106, n:1-3, pp:85-134 [Journal]
  18. Robin Hirsch, Ian M. Hodkinson, Roger D. Maddux
    Provability with finitely many variables. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 2002, v:8, n:3, pp:348-379 [Journal]
  19. Robert Goldblatt, Ian M. Hodkinson, Yde Venema
    Erdös graphs resolve Fine's canonicity problem. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 2004, v:10, n:2, pp:186-208 [Journal]
  20. Ian M. Hodkinson, Martin Otto
    Finite conformal hypergraph covers and Gaifman cliques in finite structures. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 2003, v:9, n:3, pp:387-407 [Journal]
  21. Ian M. Hodkinson
    Finite variable logics. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1993, v:51, n:, pp:111-140 [Journal]
  22. Ian M. Hodkinson
    Addendum to: Finite Variable Logics. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1994, v:52, n:, pp:278- [Journal]
  23. Robin Hirsch, Ian M. Hodkinson
    Axiomatising Various Classes of Relation and Cylindric Algebras. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 1997, v:5, n:2, pp:- [Journal]
  24. Ian M. Hodkinson
    L. Csirmaz, D. Gabbay, M. de Rijke, eds., Logic Colloquium '92, Studies in Logic Language, and Information. [Citation Graph (0, 0)][DBLP]
    Journal of Logic, Language and Information, 1997, v:6, n:4, pp:453-457 [Journal]
  25. Hajnal Andréka, Ian M. Hodkinson, István Németi
    Finite Algebras of Relations Are Representable on Finite Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1999, v:64, n:1, pp:243-267 [Journal]
  26. Robin Hirsch, Ian M. Hodkinson
    Step by Step - Building Representations in Algebraic Logic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1997, v:62, n:1, pp:225-279 [Journal]
  27. Robin Hirsch, Ian M. Hodkinson
    Complete Representations in Algebraic Logic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1997, v:62, n:3, pp:816-847 [Journal]
  28. Robin Hirsch, Ian M. Hodkinson, Ágnes Kurucz
    On Modal Logics Between K x K x K and S5 x S5 x S5. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2002, v:67, n:1, pp:221-234 [Journal]
  29. Robin Hirsch, Ian M. Hodkinson, Roger D. Maddux
    Relation Algebra Reducts of Cylindric Algebras and An Application to Proof Theory. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2002, v:67, n:1, pp:197-213 [Journal]
  30. Ian M. Hodkinson, H. D. Macpherson
    Relational Structures Determined by Their Finite Induced Substructures. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1988, v:53, n:1, pp:222-230 [Journal]
  31. Sebastian Bauer, Ian M. Hodkinson, Frank Wolter, Michael Zakharyaschev
    On Non-local Propositional and Weak Monodic Quantified CTL. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2004, v:14, n:1, pp:3-22 [Journal]
  32. Dov M. Gabbay, Ian M. Hodkinson
    An Axiomitization of the Temporal Logic with Until and Since over the Real Numbers. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1990, v:1, n:2, pp:229-259 [Journal]
  33. Nick Bezhanishvili, Ian M. Hodkinson
    All Normal Extensions of S5-squared Are Finitely Axiomatizable. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2004, v:78, n:3, pp:443-457 [Journal]
  34. Ian M. Hodkinson
    Loosely Guarded Fragment of First-Order Logic has the Finite Model Property. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2002, v:70, n:2, pp:205-240 [Journal]
  35. Ian M. Hodkinson
    Monodic Packed Fragment with Equality is Decidable. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2002, v:72, n:2, pp:185-197 [Journal]

Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002