Publications
93 results found
Hirsch R, Hodkinson I, 2000, Relation algebras with <i>n</i>-dimensional relational bases, ANNALS OF PURE AND APPLIED LOGIC, Vol: 101, Pages: 227-274, ISSN: 0168-0072
- Author Web Link
- Open Access Link
- Cite
- Citations: 11
Hodkinson I, Mikuls S, 2000, Non-finite axiomatizability of reducts of algebras of relations, Algebra Universalis, Vol: 43, Pages: 127-156
Hodkinson I, 2000, Temporal logic and automata, Temporal Logic: Mathematical Foundations and Computational Aspects, Editors: Gabbay, Reynolds, Finger, Publisher: Oxford University Press, Pages: 30-72
Andr'ka H, Hodkinson I, N'meti I, 1999, Finite algebras of relations are representable on finite sets, J.Symbolic Logic
Hirsch R, Hodkinson I, Marx M, et al., 1998, Mosaics and step-by-step, Studies in Fuzziness and Soft Computing, Vol: 24
Hodkinson IM, Mikulás S, 1998, Colorful reducts., Pages: 106-110
Hirsch R, Hodkinson IM, 1998, Connections between cylindric algebras and relation algebras., Pages: 100-105
Hodkinson I, 1997, Atom structures of cylindric algebras and relation algebras, ANNALS OF PURE AND APPLIED LOGIC, Vol: 89, Pages: 117-148, ISSN: 0168-0072
- Author Web Link
- Open Access Link
- Cite
- Citations: 27
Hirsch R, Hodkinson I, 1997, Complete representations in algebraic logic, JOURNAL OF SYMBOLIC LOGIC, Vol: 62, Pages: 816-847, ISSN: 0022-4812
- Author Web Link
- Cite
- Citations: 41
Hirsch R, 1997, Axiomatising Various Classes of Relation and Cylindric Algebras, Logic Journal of IGPL, Vol: 5, Pages: 209-229, ISSN: 1367-0751
Hodkinson I, Simon A, 1997, The k-variable property is stronger than H-dimension k, JOURNAL OF PHILOSOPHICAL LOGIC, Vol: 26, Pages: 81-101, ISSN: 0022-3611
- Author Web Link
- Open Access Link
- Cite
- Citations: 4
Hodkinson I, Simon A, 1997, The k-variable property is stronger than H-dimension k, Journal of Philosophical Logic, Vol: 26, Pages: 81-101, ISSN: 0022-3611
We study the notion of H-dimension and the formally stronger k-variable property, as considered by Gabbay, Immerman and Kozen. We exhibit a class of flows of time that has H-dimension 3, and admits a finite expressively complete set of onedimensional temporal connectives, but does not have the k-variable property for any finite k.
Hirsch R, Hodkinson I, 1997, Step by step --- building representations in algebraic logic, Journal of Symbolic Logic, Vol: 62, Pages: 225-279
Andréka H, Hodkinson IM, Németi I, 1997, The finite base property for some cylindric-relativized algebras (Abstract)., Pages: 81-81
Hodkinson I, 1997, , Journal of Logic, Language and Information, Vol: 6, Pages: 453-457, ISSN: 0925-8531
Barringer H, Brough D, Fisher M, et al., 1996, Languages, meta-languages and MetateM a discussion paper, J.IGPL, Vol: 4, Pages: 255-272, ISSN: 0945-9103
Gabbay DM, Hodkinson I, 1996, Temporal logic in the context of databases, Logic and Reality: Essays on the legacy of Arthur Prior, Editors: Copeland, Publisher: Clarendon Press, Pages: 69-87, ISBN: 9780198240600
HODKINSON I, 1995, ON GABBAY'S TEMPORAL FIXED-POINT OPERATOR, THEORETICAL COMPUTER SCIENCE, Vol: 139, Pages: 1-25, ISSN: 0304-3975
- Author Web Link
- Open Access Link
- Cite
- Citations: 5
Hodkinson I, 1995, Expressive completeness of Until and Since over dedekind complete linear time, Modal logic and process algebra, Vol: 53, Pages: 171-185
Hodkinson I, 1995, On Gabbay's temporal fixed point operator, J.Theoretical Computer Science, Vol: 139, Pages: 1-25
HODKINSON I, 1994, FINITE H-DIMENSION DOES NOT IMPLY EXPRESSIVE COMPLETENESS, JOURNAL OF PHILOSOPHICAL LOGIC, Vol: 23, Pages: 535-573, ISSN: 0022-3611
- Author Web Link
- Open Access Link
- Cite
- Citations: 3
Hodkinson IM, 1994, Addendum to: Finite Variable Logics., Bull. EATCS, Vol: 52, Pages: 278-278
Gabbay DM, Hodkinson I, Reynolds MA, 1994, Temporal Logic, Publisher: Oxford University Press on Demand
This much-needed book provides a thorough account of temporal logic, one of the most important areas of logic in computer science today. The book begins with a solid introduction to semantical and axiomatic approaches to temporal logic.
HODKINSON I, SHELAH S, 1993, A CONSTRUCTION OF MANY UNCOUNTABLE RINGS USING SFP DOMAINS AND ARONSZAJN TREES, PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, Vol: 67, Pages: 449-492, ISSN: 0024-6115
- Author Web Link
- Cite
- Citations: 1
HODGES W, HODKINSON I, LASCAR D, et al., 1993, THE SMALL INDEX PROPERTY FOR OMEGA-STABLE OMEGA-CATEGORICAL STRUCTURES AND FOR THE RANDOM GRAPH, JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, Vol: 48, Pages: 204-218, ISSN: 0024-6107
- Author Web Link
- Cite
- Citations: 98
Hodkinson IM, 1993, Finite variable logics., Bull. EATCS, Vol: 51, Pages: 111-140
Evans DM, Hodges W, Hodkinson IM, 1991, Automorphisms of Bounded Abelian Groups, Forum Mathematicum, Vol: 3, Pages: 523-542, ISSN: 0933-7741
We show that if A is a countable abelian group of finite exponent, and H is a subgroup of index less than 2ωin the automorphism group Aut(A) of A, then H contains the pointwise stabiliser of some finite set of elements of A. (Thus A has the “small index property.”) We consider groups B which are direct sums of isomorphic cyclic p-groups Z (pm), together with subgroups A which are the corresponding sums of p-groups Z (/p) for some t < m. For these pairs of groups we determine exactly when it is true that each automorphism of A extends to an automorphism of B, so that the extensions form an embedding of Aut(A) in Aut(B). Finally we discuss several connections between these results and questions in set theory and model theory. © de Gruyter 1991
GABBAY D, HODKINSON I, HUNTER A, 1991, USING THE TEMPORAL LOGIC RDL FOR DESIGN SPECIFICATIONS, LECTURE NOTES IN COMPUTER SCIENCE, Vol: 491, Pages: 64-78, ISSN: 0302-9743
- Author Web Link
- Cite
- Citations: 1
Gabbay D, Hodkinson I, Hunter A, 1990, RDL. An executable temporal logic for the specification and design of real-time systems, IEE Colloquium (Digest), ISSN: 0963-3308
RDL is an intuitionistic temporal logic for the specification of requirements and design of real-time systems for developing the design from the requirements. RDL is being developed as a formalism that would be appropriate for AI-based design support in engineering. RDL is an attempt at integrating aspects of L4344 within an executable temporal logic framework. Topics discussed are executable temporal logic, intuitionistic temporal logic and RDL.
This data is extracted from the Web of Science and reproduced under a licence from Thomson Reuters. You may not copy or re-distribute this data in whole or in part without the written consent of the Science business of Thomson Reuters.