default search action
Ian M. Hodkinson
Person information
- affiliation: Imperial College London, London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [i4]Robert Goldblatt, Ian M. Hodkinson:
Canonicity in power and modal logics of finite achronal width. CoRR abs/2207.12596 (2022) - 2020
- [j44]Robert Goldblatt, Ian M. Hodkinson:
Strong Completeness of Modal Logics over 0-dimensional Metric Spaces. Rev. Symb. Log. 13(3): 611-632 (2020)
2010 – 2019
- 2019
- [i3]Robert Goldblatt, Ian M. Hodkinson:
Strong completeness of modal logics over 0-dimensional metric spaces. CoRR abs/1905.03477 (2019) - 2018
- [j43]Robert Goldblatt, Ian M. Hodkinson:
The Finite Model Property for Logics with the Tangle Modality. Stud Logica 106(1): 131-166 (2018) - 2017
- [j42]Robert Goldblatt, Ian M. Hodkinson:
Spatial logic of tangled closure operators and modal mu-calculus. Ann. Pure Appl. Log. 168(5): 1032-1090 (2017) - 2016
- [c13]Robert Goldblatt, Ian M. Hodkinson:
The Tangled Derivative Logic of the Real Line and Zero-Dimensional Space. Advances in Modal Logic 2016: 342-361 - [i2]Robert Goldblatt, Ian M. Hodkinson:
Spatial logic of modal mu-calculus and tangled closure operators. CoRR abs/1603.01766 (2016) - 2015
- [c12]Ian M. Hodkinson:
Connections between Relation Algebras and Cylindric Algebras. RAMiCS 2015: 27-42 - 2014
- [j41]Ian M. Hodkinson:
On the Priorean temporal logic with 'around now' over the real line. J. Log. Comput. 24(5): 1071-1110 (2014) - 2013
- [j40]Jannis Bulian, Ian M. Hodkinson:
Bare canonicity of representable cylindric and polyadic algebras. Ann. Pure Appl. Log. 164(9): 884-906 (2013) - 2012
- [j39]Ian M. Hodkinson, Szabolcs Mikulás:
On canonicity and completions of weakly representable relation algebras. J. Symb. Log. 77(1): 245-262 (2012) - [j38]Johan van Benthem, Nick Bezhanishvili, Ian M. Hodkinson:
Sahlqvist Correspondence for Modal mu-calculus. Stud Logica 100(1-2): 31-60 (2012) - [j37]Nick Bezhanishvili, Ian M. Hodkinson:
Sahlqvist theorem for modal fixed point logic. Theor. Comput. Sci. 424: 1-19 (2012) - [i1]Jannis Bulian, Ian M. Hodkinson:
Bare canonicity of representable cylindric and polyadic algebras. CoRR abs/1202.5961 (2012) - 2011
- [j36]Robin Hirsch, Ian M. Hodkinson, Roger D. Maddux:
Weak representations of relation algebras and relational bases. J. Symb. Log. 76(3): 870-882 (2011) - 2010
- [j35]Ian M. Hodkinson, Louis Paternault:
Axiomatizing hybrid logic using modal logic. J. Appl. Log. 8(4): 386-396 (2010) - [j34]Ian M. Hodkinson, Hicham Tahiri:
A Bisimulation characterization Theorem for Hybrid Logic with the current-State Binder. Rev. Symb. Log. 3(2): 247-261 (2010) - [j33]Ian M. Hodkinson:
The Bounded Fragment and Hybrid Logic with Polyadic Modalities. Rev. Symb. Log. 3(2): 279-286 (2010) - [c11]Ian M. Hodkinson:
Interval Temporal Logics with Chop-Like Operators. TIME 2010: 6
2000 – 2009
- 2009
- [j32]Robin Hirsch, Ian M. Hodkinson:
Strongly representable atom structures of cylindric algebras. J. Symb. Log. 74(3): 811-828 (2009) - [p2]Robert Goldblatt, Ian M. Hodkinson:
Commutativity of Quantifiers in Varying-Domain Kripke Models. Towards Mathematical Philosophy 2009: 9-30 - 2008
- [j31]Ian M. Hodkinson, Altaf Hussain:
The modal logic of affine planes is not finitely axiomatisable. J. Symb. Log. 73(3): 940-952 (2008) - [c10]Ian M. Hodkinson, Angelo Montanari, Guido Sciavicco:
Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T. CSL 2008: 308-322 - 2007
- [p1]Ian M. Hodkinson, Mark Reynolds:
Temporal logic. Handbook of Modal Logic 2007: 655-720 - 2006
- [j30]Ian M. Hodkinson:
Complexity of monodic guarded fragments over linear and real time. Ann. Pure Appl. Log. 138(1-3): 94-125 (2006) - [j29]Ian M. Hodkinson:
Hybrid Formulas and Elementarily Generated Modal Logics. Notre Dame J. Formal Log. 47(4): 443-478 (2006) - [e1]Guido Governatori, Ian M. Hodkinson, Yde Venema:
Advances in Modal Logic 6, papers from the sixth conference on "Advances in Modal Logic," held in Noosa, Queensland, Australia, on 25-28 September 2006. College Publications 2006, ISBN 1-904987-20-6 [contents] - 2005
- [c9]Ian M. Hodkinson, Mark Reynolds:
Separation - Past, Present, and Future. We Will Show Them! (2) 2005: 117-142 - 2004
- [j28]Robert Goldblatt, Ian M. Hodkinson, Yde Venema:
Erdös graphs resolve Fine's canonicity problem. Bull. Symb. Log. 10(2): 186-208 (2004) - [j27]Sebastian Bauer, Ian M. Hodkinson, Frank Wolter, Michael Zakharyaschev:
On Non-local Propositional and Weak Monodic Quantified CTL. J. Log. Comput. 14(1): 3-22 (2004) - [j26]Nick Bezhanishvili, Ian M. Hodkinson:
All Normal Extensions of S5-squared Are Finitely Axiomatizable. Stud Logica 78(3): 443-457 (2004) - 2003
- [j25]Ian M. Hodkinson, Martin Otto:
Finite conformal hypergraph covers and Gaifman cliques in finite structures. Bull. Symb. Log. 9(3): 387-407 (2003) - [c8]Ian M. Hodkinson, Roman Kontchakov, Agi Kurucz, Frank Wolter, Michael Zakharyaschev:
On the Computational Complexity of Decidable Fragments of First-Order Linear Temporal Logics. TIME 2003: 91-98 - 2002
- [j24]Robin Hirsch, Ian M. Hodkinson, Roger D. Maddux:
Provability with finitely many variables. Bull. Symb. Log. 8(3): 348-379 (2002) - [j23]Robin Hirsch, Ian M. Hodkinson, Roger D. Maddux:
Relation Algebra Reducts of Cylindric Algebras and An Application to Proof Theory. J. Symb. Log. 67(1): 197-213 (2002) - [j22]Robin Hirsch, Ian M. Hodkinson, Ágnes Kurucz:
On Modal Logics Between K x K x K and S5 x S5 x S5. J. Symb. Log. 67(1): 221-234 (2002) - [j21]Ian M. Hodkinson:
Loosely Guarded Fragment of First-Order Logic has the Finite Model Property. Stud Logica 70(2): 205-240 (2002) - [j20]Ian M. Hodkinson:
Monodic Packed Fragment with Equality is Decidable. Stud Logica 72(2): 185-197 (2002) - [c7]Ian M. Hodkinson, Frank Wolter, Michael Zakharyaschev:
Decidable and Undecidable Fragments of First-Order Branching Temporal Logics. LICS 2002: 393-402 - [c6]Sebastian Bauer, Ian M. Hodkinson, Frank Wolter, Michael Zakharyaschev:
On Non-Local Propositional and Local One-Variable Quantified CTL*. TIME 2002: 2-9 - 2001
- [j19]Robin Hirsch, Ian M. Hodkinson:
Relation algebras form cylindric algebras, I. Ann. Pure Appl. Log. 112(2-3): 225-266 (2001) - [j18]Robin Hirsch, Ian M. Hodkinson:
Relation algebras form cylindric algebras, II. Ann. Pure Appl. Log. 112(2-3): 267-297 (2001) - [c5]Ian M. Hodkinson, Frank Wolter, Michael Zakharyaschev:
Monodic fragments of first-order temporal logics: 2000-2001 A.D. LPAR 2001: 1-23 - 2000
- [j17]Robin Hirsch, Ian M. Hodkinson:
Relation Algebras with n-Dimensional Relational Bases. Ann. Pure Appl. Log. 101(2-3): 227-274 (2000) - [j16]Ian M. Hodkinson, Frank Wolter, Michael Zakharyaschev:
Decidable fragment of first-order temporal logics. Ann. Pure Appl. Log. 106(1-3): 85-134 (2000)
1990 – 1999
- 1999
- [j15]Hajnal Andréka, Ian M. Hodkinson, István Németi:
Finite Algebras of Relations Are Representable on Finite Sets. J. Symb. Log. 64(1): 243-267 (1999) - 1998
- [c4]Robin Hirsch, Ian M. Hodkinson:
Connections between cylindric algebras and relation algebras. RelMiCS 1998: 100-105 - [c3]Ian M. Hodkinson, Szabolcs Mikulás:
Colorful reducts. RelMiCS 1998: 106-110 - 1997
- [j14]Ian M. Hodkinson:
Atom Structures of Cylindric Algebras and Relation Algebras. Ann. Pure Appl. Log. 89(2-3): 117-148 (1997) - [j13]Robin Hirsch, Ian M. Hodkinson:
Axiomatising Various Classes of Relation and Cylindric Algebras. Log. J. IGPL 5(2): 209-229 (1997) - [j12]Ian M. Hodkinson:
L. Csirmaz, D. Gabbay, M. de Rijke, eds., Logic Colloquium '92, Studies in Logic Language, and Information. J. Log. Lang. Inf. 6(4): 453-457 (1997) - [j11]Ian M. Hodkinson, András Simon:
The k-variable property is stronger than H-dimension k. J. Philos. Log. 26(1): 81-101 (1997) - [j10]Robin Hirsch, Ian M. Hodkinson:
Step by Step - Building Representations in Algebraic Logic. J. Symb. Log. 62(1): 225-279 (1997) - [j9]Robin Hirsch, Ian M. Hodkinson:
Complete Representations in Algebraic Logic. J. Symb. Log. 62(3): 816-847 (1997) - [c2]Hajnal Andréka, Ian M. Hodkinson, István Németi:
The finite base property for some cylindric-relativized algebras (Abstract). RelMiCS 1997: 81 - 1996
- [j8]Howard Barringer, Graham Gough, Derek Brough, Dov M. Gabbay, Ian M. Hodkinson, Anthony Hunter, Richard Owens, Peter McBrien, Mark Reynolds, Michael Fisher:
Languages, Meta-languages and METATEM, A Discussion Paper. Log. J. IGPL 4(2): 255-272 (1996) - 1995
- [j7]Ian M. Hodkinson:
On Gabbay's Temporal Fixed Point Operator. Theor. Comput. Sci. 139(1&2): 1-25 (1995) - 1994
- [j6]Ian M. Hodkinson:
Addendum to: Finite Variable Logics. Bull. EATCS 52: 278 (1994) - [j5]Ian M. Hodkinson:
Finite H-dimension does not imply expressive completeness. J. Philos. Log. 23(5): 535-573 (1994) - 1993
- [j4]Ian M. Hodkinson:
Finite variable logics. Bull. EATCS 51: 111-140 (1993) - 1990
- [j3]Wilfried Hodges, Ian M. Hodkinson, Dugald Macpherson:
Omega-Categoricity, Relative Categoricity and Coordinatisation. Ann. Pure Appl. Log. 46(2): 169-199 (1990) - [j2]Dov M. Gabbay, Ian M. Hodkinson:
An Axiomitization of the Temporal Logic with Until and Since over the Real Numbers. J. Log. Comput. 1(2): 229-259 (1990)
1980 – 1989
- 1989
- [c1]Dov M. Gabbay, Ian M. Hodkinson, Anthony Hunter:
Using the Temporal Logic RDL for Design Specifications. Concurrency: Theory, Language, And Architecture 1989: 64-78 - 1988
- [j1]Ian M. Hodkinson, H. D. Macpherson:
Relational Structures Determined by Their Finite Induced Substructures. J. Symb. Log. 53(1): 222-230 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint