default search action
Bradd Hart
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i3]Alec Fox, Isaac Goldbring, Bradd Hart:
Locally universal C*-algebras with computable presentations. CoRR abs/2303.02301 (2023) - 2022
- [i2]Isaac Goldbring, Bradd Hart:
Approximate traces on groups and the quantum complexity class MIPco, s. CoRR abs/2209.08009 (2022) - [i1]Isaac Goldbring, Bradd Hart:
On Tsirelson pairs of C*-algebras. CoRR abs/2210.15509 (2022) - 2021
- [j19]Isaac Goldbring, Bradd Hart:
Operator algebras with hyperarithmetic theory. J. Log. Comput. 31(2): 612-629 (2021)
2010 – 2019
- 2016
- [j18]Isaac Goldbring, Bradd Hart:
Computability and the Connes Embedding Problem. Bull. Symb. Log. 22(2): 238-248 (2016) - [j17]Christopher J. Eagle
, Ilijas Farah
Fraïssé Limits of C*-Algebras. J. Symb. Log. 81(2): 755-773 (2016) - 2015
- [j16]Bradd Hart:
K. Tent and M. Ziegler. A Course in Model Theory. Lecture Notes in Logic, vol. 40. Cambridge University Press, United Kingdom, 2012, x + 248 pp. Bull. Symb. Log. 21(3): 342-343 (2015) - 2014
- [j15]Kevin Carlson, Enoch Cheung, Ilijas Farah
Omitting types and AF algebras. Arch. Math. Log. 53(1-2): 157-169 (2014) - 2013
- [j14]Isaac Goldbring, Bradd Hart, Thomas Sinclair
The theory of tracial von Neumann algebras does not have a model companion. J. Symb. Log. 78(3): 1000-1004 (2013)
2000 – 2009
- 2005
- [j13]Bradd Hart, Ziv Shami:
On the type-definability of the binding group in simple theories. J. Symb. Log. 70(2): 379-388 (2005) - 2002
- [j12]Bradd Hart, Ehud Hrushovski, Michael C. Laskowski:
Unique Decomposition in Classifiable Theories. J. Symb. Log. 67(1): 61-68 (2002) - 2000
- [j11]Bradd Hart, Byunghan Kim, Anand Pillay:
Coordinatisation and Canonical Bases in Simple Theories. J. Symb. Log. 65(1): 293-309 (2000)
1990 – 1999
- 1999
- [j10]Bradd Hart, Zeljko Sokolovic, Predrag Tanovic
A Note On Alpha-Prime Models. J. Symb. Log. 64(4): 1557-1562 (1999) - 1997
- [j9]Ambar Chowdhury, Bradd Hart:
An Unclassifiable Unidimensional Theory without OTOP. Notre Dame J. Formal Log. 38(1): 93-103 (1997) - 1995
- [j8]Bradd Hart, Anand Pillay, Sergei Starchenko:
1-based theories - the main gap fora-models. Arch. Math. Log. 34(5): 285-300 (1995) - 1994
- [j7]Bradd Hart, Sergei Starchenko:
Superstable Quasi-Varieties. Ann. Pure Appl. Log. 69(1): 53-71 (1994) - 1993
- [j6]Bradd Hart, Anand Pillay, Sergei Starchenko:
Triviality, NDOP and Stable Varieties. Ann. Pure Appl. Log. 62(2): 119-146 (1993) - [j5]Saharon Shelah
Models with Second Order Properties V: A General Principle. Ann. Pure Appl. Log. 64(2): 169-194 (1993) - [j4]Bradd Hart, Sergei Starchenko:
Addendum to "A Structure Theorem for Strongly Abelian Varieties". J. Symb. Log. 58(4): 1419-1425 (1993) - 1991
- [j3]Bradd Hart, Matthew Valeriote
A Structure Theorem for Strongly Abelian Varieties with Few Models. J. Symb. Log. 56(3): 832-852 (1991)
1980 – 1989
- 1989
- [j2]Bradd Hart:
A Proof of Morley's Conjecture. J. Symb. Log. 54(4): 1346-1358 (1989) - [j1]Rami P. Grossberg, Bradd Hart:
The Classification of Excellent Classes. J. Symb. Log. 54(4): 1359-1381 (1989) - 1986
- [c1]László Csirmaz, Bradd Hart:
Program Correctness on Finite Fields. LICS 1986: 4-10
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:19 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: