default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIraj Kalantari
Person information
- affiliation: Western Illinois University, Macomb, IL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2013
[j23]Iraj Kalantari, Larry Welch:
When series of computable functions with varying domains are computable. Math. Log. Q. 59(6): 471-493 (2013)- [j22]Ross Berkowitz, Bahman Kalantari, Iraj Kalantari, David Menendez:
On Properties of Forbidden Zones of Polygons and Polytopes. Trans. Comput. Sci. 20: 112-137 (2013) - 2011
- [j21]Sergio Coutinho de Biasi, Bahman Kalantari, Iraj Kalantari:
Mollified Zone Diagrams and Their Computation. Trans. Comput. Sci. 14: 31-59 (2011) - 2010
- [j20]Ali Enayat, Iraj Kalantari:
Preface. Ann. Pure Appl. Log. 161(6): 709-710 (2010) - 2008
- [j19]Iraj Kalantari, Larry Welch:
On degree-preserving homeomorphisms between trees in computable topology. Arch. Math. Log. 46(7-8): 679-693 (2008) - [j18]Iraj Kalantari, Larry Welch:
On Turing degrees of points in computable topology. Math. Log. Q. 54(5): 470-482 (2008) - 2004
- [j17]Iraj Kalantari, Larry Welch:
A blend of methods of recursion theory and topology: A Pi10 tree of shadow points. Arch. Math. Log. 43(8): 991-1008 (2004) - [j16]Iraj Kalantari, Larry Welch:
Density and Baire category in recursive topology. Math. Log. Q. 50(4-5): 381-391 (2004) - 2003
- [j15]Iraj Kalantari, Larry Welch:
A blend of methods of recursion theory and topology. Ann. Pure Appl. Log. 124(1-3): 141-178 (2003) - 1999
- [j14]Iraj Kalantari, Lawrence Welch:
Recursive and Nonextendible Functions over the Reals; Filter Foundation for Recursive Analysis, II. Ann. Pure Appl. Log. 98(1-3): 87-110 (1999) - 1998
- [j13]Iraj Kalantari, Lawrence Welch:
Point-Free Topological Spaces, Functions and Recursive Points: Filter Foundation for Recursive Analysis I. Ann. Pure Appl. Log. 93(1-3): 125-151 (1998) - 1987
- [j12]Iraj Kalantari, Galen Weitkamp:
Effective topological spaces III: Forcing and definability. Ann. Pure Appl. Log. 36: 17-27 (1987) - 1985
- [j11]Iraj Kalantari, Galen Weitkamp:
Effective topological spaces I: a definability theory. Ann. Pure Appl. Log. 29(1): 1-27 (1985) - [j10]Iraj Kalantari, Galen Weitkamp:
Effective topological spaces II: A hierarchy. Ann. Pure Appl. Log. 29(2): 207-224 (1985) - [j9]Rodney G. Downey, Iraj Kalantari:
Effective Extensions of Linear Forms on a Recursive Vector Space Over a Recursive Field. Math. Log. Q. 31(13): 193-200 (1985) - 1983
- [j8]Iraj Kalantari, Anne Leggett:
Maximality in Effective Topology. J. Symb. Log. 48(1): 100-112 (1983) - [j7]Iraj Kalantari, Jeffrey B. Remmel:
Degrees of Recursively Enumerable Topological Spaces. J. Symb. Log. 48(3): 610-622 (1983) - [j6]Iraj Kalantari, Gerard McDonald:
A Data Structure and an Algorithm for the Nearest Point Problem. IEEE Trans. Software Eng. 9(5): 631-634 (1983) - 1982
- [j5]Iraj Kalantari, Anne Leggett:
Simplicity in Effective Topology. J. Symb. Log. 47(1): 169-183 (1982) - 1979
- [j4]Iraj Kalantari, Allen Retzlaff:
Recursive Constructions in Topological Spaces. J. Symb. Log. 44(4): 609-625 (1979) - [j3]Iraj Kalantari:
Automorphisms of the Lattice of Recursively Enumerable Vector Spaces. Math. Log. Q. 25(25-29): 385-401 (1979) - 1978
- [j2]Iraj Kalantari:
Major Subspaces of Recursively Enumerable Vector Spaces. J. Symb. Log. 43(2): 293-303 (1978) - 1977
- [j1]Iraj Kalantari, Allen Retzlaff:
Maximal Vector Spaces Under Automorphisms of the Lattice of Recursively Enumerable Vector Spaces. J. Symb. Log. 42(4): 481-491 (1977)
Conference and Workshop Papers
- 2012
- [c5]Ross Berkowitz, Bahman Kalantari, David Menendez, Iraj Kalantari:
On Properties of Forbidden Zones of Polygons and Polytopes. ISVD 2012: 56-65 - [c4]Fedor Andreev, Iraj Kalantari:
Collinearity of Iterations and Real Plane Algebraic Curves. ISVD 2012: 126-131 - 2010
- [c3]Sergio Coutinho de Biasi, Bahman Kalantari, Iraj Kalantari:
Maximal Zone Diagrams and their Computation. ISVD 2010: 171-180 - 2004
- [c2]Bahman Kalantari, Iraj Kalantari, Fedor Andreev:
Animation of mathematical concepts using polynomiography. SIGGRAPH Educators Program 2004: 27 - 2002
- [c1]Iraj Kalantari, Larry Welch:
Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis. CCA 2002: 79-90
Parts in Books or Collections
- 2007
- [p1]Iraj Kalantari:
Induction over the Continuum. Induction, Algorithmic Learning Theory, and Philosophy 2007: 145-154
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-04-25 05:42 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:
