Ian M. Hodkinson

Affiliations:
  • Imperial College London, London, UK


According to our database1, Ian M. Hodkinson authored at least 61 papers between 1988 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Canonicity in power and modal logics of finite achronal width.
CoRR, 2022

2020
Strong Completeness of Modal Logics over 0-dimensional Metric Spaces.
Rev. Symb. Log., 2020

2018
The Finite Model Property for Logics with the Tangle Modality.
Stud Logica, 2018

2017
Spatial logic of tangled closure operators and modal mu-calculus.
Ann. Pure Appl. Log., 2017

2016
Spatial logic of modal mu-calculus and tangled closure operators.
CoRR, 2016

The Tangled Derivative Logic of the Real Line and Zero-Dimensional Space.
Proceedings of the Advances in Modal Logic 11, 2016

2015
Connections between Relation Algebras and Cylindric Algebras.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2015

2014
On the Priorean temporal logic with 'around now' over the real line.
J. Log. Comput., 2014

2013
Bare canonicity of representable cylindric and polyadic algebras.
Ann. Pure Appl. Log., 2013

2012
Sahlqvist theorem for modal fixed point logic.
Theor. Comput. Sci., 2012

Sahlqvist Correspondence for Modal mu-calculus.
Stud Logica, 2012

On canonicity and completions of weakly representable relation algebras.
J. Symb. Log., 2012

2011
Weak representations of relation algebras and relational bases.
J. Symb. Log., 2011

2010
A Bisimulation characterization Theorem for Hybrid Logic with the current-State Binder.
Rev. Symb. Log., 2010

The Bounded Fragment and Hybrid Logic with Polyadic Modalities.
Rev. Symb. Log., 2010

Axiomatizing hybrid logic using modal logic.
J. Appl. Log., 2010

Interval Temporal Logics with Chop-Like Operators.
Proceedings of the TIME 2010, 2010

2009
Strongly representable atom structures of cylindric algebras.
J. Symb. Log., 2009

Commutativity of Quantifiers in Varying-Domain Kripke Models.
Proceedings of the Towards Mathematical Philosophy, 2009

2008
The modal logic of affine planes is not finitely axiomatisable.
J. Symb. Log., 2008

Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T.
Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

2007
Temporal logic.
Proceedings of the Handbook of Modal Logic., 2007

2006
Hybrid Formulas and Elementarily Generated Modal Logics.
Notre Dame J. Formal Log., 2006

Complexity of monodic guarded fragments over linear and real time.
Ann. Pure Appl. Log., 2006

2005
Separation - Past, Present, and Future.
Proceedings of the We Will Show Them! Essays in Honour of Dov Gabbay, Volume Two, 2005

2004
All Normal Extensions of S5-squared Are Finitely Axiomatizable.
Stud Logica, 2004

On Non-local Propositional and Weak Monodic Quantified CTL.
J. Log. Comput., 2004

Erdös graphs resolve Fine's canonicity problem.
Bull. Symb. Log., 2004

2003
Finite conformal hypergraph covers and Gaifman cliques in finite structures.
Bull. Symb. Log., 2003

On the Computational Complexity of Decidable Fragments of First-Order Linear Temporal Logics.
Proceedings of the 10th International Symposium on Temporal Representation and Reasoning / 4th International Conference on Temporal Logic (TIME-ICTL 2003), 2003

2002
Monodic Packed Fragment with Equality is Decidable.
Stud Logica, 2002

Loosely Guarded Fragment of First-Order Logic has the Finite Model Property.
Stud Logica, 2002

Relation Algebra Reducts of Cylindric Algebras and An Application to Proof Theory.
J. Symb. Log., 2002

On Modal Logics Between K x K x K and S5 x S5 x S5.
J. Symb. Log., 2002

Provability with finitely many variables.
Bull. Symb. Log., 2002

On Non-Local Propositional and Local One-Variable Quantified CTL*.
Proceedings of the 9th International Symposium on Temporal Representation and Reasoning, 2002

Decidable and Undecidable Fragments of First-Order Branching Temporal Logics.
Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

2001
Relation algebras form cylindric algebras, II.
Ann. Pure Appl. Log., 2001

Relation algebras form cylindric algebras, I.
Ann. Pure Appl. Log., 2001

Monodic fragments of first-order temporal logics: 2000-2001 A.D.
Proceedings of the Logic for Programming, 2001

2000
Decidable fragment of first-order temporal logics.
Ann. Pure Appl. Log., 2000

Relation Algebras with n-Dimensional Relational Bases.
Ann. Pure Appl. Log., 2000

1999
Finite Algebras of Relations Are Representable on Finite Sets.
J. Symb. Log., 1999

1998
Colorful reducts.
Proceedings of the Participants Copies for Relational Methods in Logic, 1998

Connections between cylindric algebras and relation algebras.
Proceedings of the Participants Copies for Relational Methods in Logic, 1998

1997
Complete Representations in Algebraic Logic.
J. Symb. Log., 1997

Step by Step - Building Representations in Algebraic Logic.
J. Symb. Log., 1997

The <i>k</i>-variable property is stronger than H-dimension <i>k</i>.
J. Philos. Log., 1997

L. Csirmaz, D. Gabbay, M. de Rijke, eds., Logic Colloquium '92, Studies in Logic Language, and Information.
J. Log. Lang. Inf., 1997

Axiomatising Various Classes of Relation and Cylindric Algebras.
Log. J. IGPL, 1997

Atom Structures of Cylindric Algebras and Relation Algebras.
Ann. Pure Appl. Log., 1997

The finite base property for some cylindric-relativized algebras (Abstract).
Proceedings of the Participants Copies of Third International Seminar on the Use of Relational Methods in Computer Science, 1997

1996
Languages, Meta-languages and METATEM, A Discussion Paper.
Log. J. IGPL, 1996

1995
On Gabbay's Temporal Fixed Point Operator.
Theor. Comput. Sci., 1995

1994
Finite H-dimension does not imply expressive completeness.
J. Philos. Log., 1994

Addendum to: Finite Variable Logics.
Bull. EATCS, 1994

1993
Finite variable logics.
Bull. EATCS, 1993

1990
An Axiomitization of the Temporal Logic with Until and Since over the Real Numbers.
J. Log. Comput., 1990

Omega-Categoricity, Relative Categoricity and Coordinatisation.
Ann. Pure Appl. Log., 1990

1989
Using the Temporal Logic RDL for Design Specifications.
Proceedings of the Concurrency: Theory, 1989

1988
Relational Structures Determined by Their Finite Induced Substructures.
J. Symb. Log., 1988


  Loading...