default search action
Dugald Macpherson
Person information
- affiliation: University of Leeds, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j36]Isolde Adler
, Bjarki Geir Benediktsson, Dugald Macpherson
Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs. Discret. Appl. Math. 312: 29-44 (2022) - 2021
- [j35]Daniela A. Amato, Gregory L. Cherlin, H. Dugald Macpherson:
Metrically homogeneous graphs of diameter 3. J. Math. Log. 21(1): 2050020:1-2050020:106 (2021)
2010 – 2019
- 2018
- [j34]Dugald Macpherson:
Model theory of finite and pseudofinite groups. Arch. Math. Log. 57(1-2): 159-184 (2018) - [j33]Richard Elwes, Andy Lewis-Pye, Benedikt Löwe, Dugald Macpherson, Dag Normann, Andrea Sorbi, Alexandra A. Soskova
S. Barry Cooper (1943-2015). Comput. 7(2-3): 103-131 (2018) - 2016
- [j32]Manuel Bodirsky
Reducts of Structures and Maximal-Closed Permutation Groups. J. Symb. Log. 81(3): 1087-1114 (2016) - 2015
- [j31]Darío García
Pseudofinite structures and simplicity. J. Math. Log. 15(1): 1550002:1-1550002:41 (2015) - 2014
- [j30]Dugald Macpherson:
Recent developments in model theory, Notre Dame Journal of Formal Logic, vol.54, nos.3-4, 2013. Bull. Symb. Log. 20(3): 357-359 (2014) - 2013
- [j29]Deirdre Haskell
Unexpected imaginaries in valued fields with analytic structure. J. Symb. Log. 78(2): 523-542 (2013) - [j28]Matthias Aschenbrenner
Vapnik-Chervonenkis Density in Some Theories without the Independence Property, II. Notre Dame J. Formal Log. 54(3-4): 311-363 (2013) - [j27]Manuel Bodirsky
Constraint satisfaction tractability from semi-lattice operations on infinite sets. ACM Trans. Comput. Log. 14(4): 30:1-30:19 (2013) - 2012
- [j26]Robert Gray, Dugald Macpherson
Set-homogeneous directed graphs. J. Comb. Theory B 102(2): 474-520 (2012) - 2011
- [j25]Dugald Macpherson
A survey of homogeneous structures. Discret. Math. 311(15): 1599-1634 (2011) - [p1]Dugald Macpherson, Charles Steinhorn:
Definability in classes of finite structures. Finite and Algorithmic Model Theory 2011: 140-176 - [i1]Manuel Bodirsky, Dugald Macpherson, Johan Thapper:
Constraint Satisfaction Tractability from Semi-lattice Operations on Infinite Sets. CoRR abs/1111.6616 (2011) - 2010
- [j24]Robert Gray, Dugald Macpherson
Countable connected-homogeneous graphs. J. Comb. Theory B 100(2): 97-118 (2010)
2000 – 2009
- 2007
- [j23]Silvia Barbina, Dugald Macpherson:
Reconstruction of homogeneous relational structures. J. Symb. Log. 72(3): 792-802 (2007) - 2005
- [j22]Dugald Macpherson
Comeagre conjugacy classes and free products with amalgamation. Discret. Math. 291(1-3): 135-142 (2005) - [j21]Beibut Sh. Kulpeshov, H. Dugald Macpherson
Minimality conditions on circularly ordered structures. Math. Log. Q. 51(4): 377-399 (2005) - 2002
- [j20]Manfred Droste, Dugald Macpherson
Uncountable Homogeneous Partial Orders. Math. Log. Q. 48(4): 525-532 (2002)
1990 – 1999
- 1999
- [j19]Alexandre A. Ivanov, Dugald Macpherson:
Strongly Determined Types. Ann. Pure Appl. Log. 99(1-3): 197-230 (1999) - [j18]B. Herwig, H. D. Macpherson, G. Martin, A. Nurtazin, John Kenneth Truss:
On N0-Categorical Weakly o-Minimal Structures. Ann. Pure Appl. Log. 101(1): 65-93 (1999) - 1998
- [j17]Deirdre Haskell
A Note on Valuation Definable Expansions of Fields. J. Symb. Log. 63(2): 739-743 (1998) - 1997
- [j16]Deirdre Haskell
A Version of o-Minimality for the p-adics. J. Symb. Log. 62(4): 1075-1092 (1997) - [j15]Dugald Macpherson, Charles Steinhorn:
Extending Partial Orders on o-Minimal Structures to Definable Total Orders. Math. Log. Q. 43: 456-464 (1997) - 1996
- [j14]Dugald Macpherson
On Variants of o-Minimality. Ann. Pure Appl. Log. 79(2): 165-209 (1996) - 1995
- [j13]Manfred Droste, Michèle Giraudet, Dugald Macpherson
Periodic Ordered Permutation Groups and Cyclic Orderings. J. Comb. Theory B 63(2): 310-321 (1995) - 1994
- [j12]Deirdre Haskell
Cell Decompositions of C-Minimal Structures. Ann. Pure Appl. Log. 66(2): 113-162 (1994) - [j11]Manfred Droste, Dugald Macpherson
Set-Homogeneous Graphs. J. Comb. Theory B 62(1): 63-95 (1994) - 1992
- [j10]H. D. Macpherson, Maurice Pouzet, Robert E. Woodrow:
Countable Structures of Given Age. J. Symb. Log. 57(3): 992-1010 (1992) - 1991
- [j9]Manfred Droste, Dugald Macpherson
On k-homogeneous posets and graphs. J. Comb. Theory A 56(1): 1-15 (1991) - [j8]Dugald Macpherson, James H. Schmerl:
Binary Relational Structures Having Only Countably Many Nonisomorphic Substructures. J. Symb. Log. 56(3): 876-884 (1991) - [j7]Dugald Macpherson:
Interpreting Groups in omega-Categorical Structures. J. Symb. Log. 56(4): 1317-1324 (1991) - [j6]Dugald Macpherson
Finite Axiomatizability and Theories with Trivial Algebraic Closure. Notre Dame J. Formal Log. 32(2): 188-192 (1991) - 1990
- [j5]Wilfried Hodges, Ian M. Hodkinson, Dugald Macpherson
Omega-Categoricity, Relative Categoricity and Coordinatisation. Ann. Pure Appl. Log. 46(2): 169-199 (1990)
1980 – 1989
- 1989
- [c1]H. D. Macpherson:
Universal Closed Permutation Groups. Easter Conference on Model Theory 1989: 173-176 - 1988
- [j4]Ian M. Hodkinson, H. D. Macpherson:
Relational Structures Determined by Their Finite Induced Substructures. J. Symb. Log. 53(1): 222-230 (1988) - 1986
- [j3]H. D. Macpherson
Graphs determined by their finite induced subgraphs. J. Comb. Theory B 41(2): 230-234 (1986) - 1985
- [j2]Peter J. Cameron
Rank three permutation groups with rank three subconstituents. J. Comb. Theory B 39(1): 1-16 (1985) - 1982
- [j1]H. D. Macpherson
Infinite distance transitive graphs of finite valency. Comb. 2(1): 63-69 (1982)
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-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: