default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew Harrison-Trainor
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j32]Adam R. Day, Noam Greenberg
, Matthew Harrison-Trainor, Dan Turetsky:
Iterated Priority Arguments in Descriptive Set Theory. Bull. Symb. Log. 30(2): 199-226 (2024)- [j31]Noam Greenberg, Matthew Harrison-Trainor, Joseph S. Miller, Dan Turetsky:
Enumerations of families closed under finite differences. Comput. 13(1): 89-104 (2024) - [i5]Matthew Harrison-Trainor, Syed Akbari:
Computable learning of natural hypothesis classes. CoRR abs/2407.16663 (2024) - 2023
- [j30]Nikolay Bazhenov, Matthew Harrison-Trainor, Alexander G. Melnikov:
Computable Stone spaces. Ann. Pure Appl. Log. 174(9): 103304 (2023) - [j29]Will Boney, Barbara F. Csima, Nancy A. Day, Matthew Harrison-Trainor:
Which Classes of Structures Are Both Pseudo-Elementary and Definable by an Infinitary Sentence? Bull. Symb. Log. 29(1): 1-18 (2023) - [i4]Matthew Harrison-Trainor, Patrick Lutz:
Coding information into all infinite subsets of a dense set. CoRR abs/2306.01226 (2023) - 2022
- [j28]Matthew Harrison-Trainor:
An Introduction to the Scott Complexity of Countable Structures and a Survey of Recent Results. Bull. Symb. Log. 28(1): 71-103 (2022) - [j27]Matthew Harrison-Trainor, Antonio Montalbán:
The Tree of Tuples of a Structure. J. Symb. Log. 87(1): 21-46 (2022) - [j26]Rod Downey, Noam Greenberg, Matthew Harrison-Trainor, Ludovic Patey, Dan Turetsky:
Relationships between Computability-Theoretic Properties of Problems. J. Symb. Log. 87(1): 47-71 (2022) - [j25]Rod Downey, Matthew Harrison-Trainor:
A Minimal Set Low for Speed. J. Symb. Log. 87(4): 1693-1728 (2022) - [j24]Matthew Harrison-Trainor:
An analysis of random elections with large numbers of voters. Math. Soc. Sci. 116: 68-84 (2022) - 2021
- [j23]Matthew Harrison-Trainor, Meng-Che Turbo Ho:
Finitely generated groups are universal among finitely generated structures. Ann. Pure Appl. Log. 172(1): 102855 (2021) - [j22]Noam Greenberg, Matthew Harrison-Trainor, Alexander G. Melnikov, Dan Turetsky:
Non-density in punctual computability. Ann. Pure Appl. Log. 172(9): 102985 (2021) - [j21]Uri Andrews, Matthew Harrison-Trainor, Noah Schweber:
The property "arithmetic-is-recursive" on a cone. J. Math. Log. 21(3): 2150021:1-2150021:18 (2021) - [j20]Laurent Bienvenu, Barbara F. Csima, Matthew Harrison-Trainor:
Some Questions of Uniformity in Algorithmic Randomness. J. Symb. Log. 86(4): 1612-1631 (2021) - [j19]Rachael Alvir, Noam Greenberg, Matthew Harrison-Trainor, Dan Turetsky:
Scott Complexity of Countable Structures. J. Symb. Log. 86(4): 1706-1720 (2021) - [i3]Matthew Harrison-Trainor, Wesley H. Holliday, Thomas F. Icard III:
Preferential Structures for Comparative Probabilistic Reasoning. CoRR abs/2104.02287 (2021) - [i2]Laurent Bienvenu, Barbara F. Csima, Matthew Harrison-Trainor:
Some Questions of Uniformity in Algorithmic Randomness. CoRR abs/2111.01472 (2021) - 2020
- [j18]Barbara F. Csima, Michael Deveau, Matthew Harrison-Trainor, Mohammad Assem Mahmoud:
Degrees of categoricity above limit ordinals. Comput. 9(2): 127-137 (2020) - [j17]Rodney G. Downey, Matthew Harrison-Trainor, Iskander Sh. Kalimullin, Alexander G. Melnikov, Daniel Turetsky:
Graphs are not universal for online computability. J. Comput. Syst. Sci. 112: 1-12 (2020) - [j16]Yifeng Ding, Matthew Harrison-Trainor, Wesley H. Holliday:
The Logic of Comparative Cardinality. J. Symb. Log. 85(3): 972-1005 (2020) - [j15]Matthew Harrison-Trainor, Alexander G. Melnikov, Keng Meng Ng:
Computability of Polish Spaces up to Homeomorphism. J. Symb. Log. 85(4): 1664-1686 (2020) - [i1]Matthew Harrison-Trainor:
An Analysis of Random Elections with Large Numbers of Voters. CoRR abs/2009.02979 (2020)
2010 – 2019
- 2019
- [j14]Matthew Harrison-Trainor:
A first-order theory of Ulm type. Comput. 8(3-4): 347-358 (2019) - [j13]Matthew Harrison-Trainor, Bakh Khoussainov, Daniel Turetsky:
Effective aspects of algorithmically random structures. Comput. 8(3-4): 359-375 (2019) - [j12]Nikolay Bazhenov, Matthew Harrison-Trainor, Iskander Sh. Kalimullin, Alexander G. Melnikov, Keng Meng Ng:
Automatic and Polynomial-Time Algebraic Structures. J. Symb. Log. 84(4): 1630-1669 (2019) - [j11]Matthew Harrison-Trainor:
First-order possibility Models and Finitary Completeness Proofs. Rev. Symb. Log. 12(4): 637-662 (2019) - 2018
- [j10]Matthew Harrison-Trainor:
Computable valued fields. Arch. Math. Log. 57(5-6): 473-495 (2018) - [j9]Matthew Harrison-Trainor:
The Complexity of Countable Structures. Bull. Symb. Log. 24(4): 465-466 (2018) - [j8]Matthew Harrison-Trainor:
There is no classification of the decidably presentable structures. J. Math. Log. 18(2): 1850010:1-1850010:41 (2018) - [j7]Matthew Harrison-Trainor:
Left-orderable Computable Groups. J. Symb. Log. 83(1): 237-255 (2018) - [j6]Matthew Harrison-Trainor, Russell G. Miller, Antonio Montalbán:
Borel Functors and Infinitary Interpretations. J. Symb. Log. 83(4): 1434-1456 (2018) - [j5]Matthew Harrison-Trainor, Wesley H. Holliday, Thomas F. Icard III:
Inferring probability comparisons. Math. Soc. Sci. 91: 62-70 (2018) - 2017
- [j4]Matthew Harrison-Trainor:
The Gamma question for many-one degrees. Ann. Pure Appl. Log. 168(7): 1396-1405 (2017) - [j3]Matthew Harrison-Trainor, Alexander G. Melnikov, Russell G. Miller, Antonio Montalbán:
Computable Functors and Effective interpretability. J. Symb. Log. 82(1): 77-97 (2017) - [j2]Barbara F. Csima, Matthew Harrison-Trainor:
Degrees of Categoricity on a cone via η-Systems. J. Symb. Log. 82(1): 325-346 (2017) - [c1]Matthew Harrison-Trainor, Wesley H. Holliday, Thomas F. Icard III:
Preferential Structures for Comparative Probabilistic Reasoning. AAAI 2017: 1135-1141 - 2015
- [j1]Zoé Chatzidakis, Matthew Harrison-Trainor, Rahim Moosa:
Differential-Algebraic jet Spaces Preserve Internality to the Constants. J. Symb. Log. 80(3): 1022-1034 (2015)
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 2025-01-09 13:28 CET 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:
