Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDAsher M. Kach
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j13]Marat Kh. Faizrahmanov
, Asher M. Kach, Iskander Sh. Kalimullin, Antonio Montalbán, Vadim Puzarenko:
Jump inversions of algebraic structures and Σ-definability. Math. Log. Q. 65(1): 37-45 (2019)- 2015
- [j12]Noam Greenberg, Asher M. Kach, Steffen Lempp, Daniel Turetsky:
Computability and uncountable Linear Orders I: Computable Categoricity. J. Symb. Log. 80(1): 116-144 (2015) - [j11]Noam Greenberg, Asher M. Kach, Steffen Lempp, Daniel D. Turetsky:
Computability and uncountable Linear Orders II: degree spectra. J. Symb. Log. 80(1): 145-178 (2015) - 2014
- [j10]Asher M. Kach, Antonio Montalbán:
Undecidability of the Theories of Classes of Structures. J. Symb. Log. 79(4): 1001-1019 (2014) - 2013
- [j9]Asher M. Kach, Karen M. Lange, Reed Solomon:
Degrees of orders on torsion-free Abelian groups. Ann. Pure Appl. Log. 164(7-8): 822-836 (2013) - [c1]Johanna N. Y. Franklin, Asher M. Kach, Russell G. Miller, Reed Solomon:
Local Computability for Ordinals. CiE 2013: 161-170 - 2012
- [j8]Brooke M. Andersen, Asher M. Kach, Alexander G. Melnikov, Reed Solomon:
Jump degrees of torsion-free abelian groups. J. Symb. Log. 77(4): 1067-1100 (2012) - [j7]Asher M. Kach:
Book Reviews. Stud Logica 100(3): 659-662 (2012) - 2011
- [j6]Rodney G. Downey, Asher M. Kach:
Euclidean Functions of Computable Euclidean Domains. Notre Dame J. Formal Log. 52(2): 163-172 (2011) - [j5]Asher M. Kach, Antonio Montalbán:
Cuts of Linear Orders. Order 28(3): 593-600 (2011) - 2010
- [j4]Asher M. Kach, Daniel Turetsky:
Limitwise monotonic functions, sets, and degrees on computable domains. J. Symb. Log. 75(1): 131-154 (2010) - [j3]Asher M. Kach, Oscar Levin, Reed Solomon:
Embeddings of Computable Structures. Notre Dame J. Formal Log. 51(1): 55-68 (2010) - [j2]Rodney G. Downey, Sergei S. Goncharov, Asher M. Kach, Julia F. Knight, Oleg V. Kudinov, Alexander G. Melnikov, Daniel Turetsky:
Decidability and Computability of Certain Torsion-Free Abelian Groups. Notre Dame J. Formal Log. 51(1): 85-96 (2010)
2000 – 2009
- 2008
- [j1]Asher M. Kach:
Computable shuffle sums of ordinals. Arch. Math. Log. 47(3): 211-219 (2008)
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2022-03-20 21:51 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 has been originally created in 1993 at:
since 2018, dblp is operated and maintained by:
the dblp computer science bibliography is funded and supported by:
