default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammad Ardeshir
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j33]Mohammad Ardeshir, Wim Ruitenburg:
Kolmogorov and Kuroda Translations Into Basic Predicate Logic. Log. J. IGPL 32(1): 47-63 (2024)- 2023
- [j32]Majid Alizadeh
, Mohammad Ardeshir, Philippe Balbiani, Mojtaba Mojtahedi:
Unification types in Euclidean modal logics. Log. J. IGPL 31(3): 422-440 (2023)
2010 – 2019
- 2019
- [j31]Majid Alizadeh, Mohammad Ardeshir:
Basic propositional logic and the weak excluded middle. Log. J. IGPL 27(3): 371-383 (2019) - [j30]Mohammad Ardeshir, S. Mojtaba Mojtahedi:
THE ${\text{\Sigma }}_1 $ -PROVABILITY LOGIC OF $HA^{\text{*}} $. J. Symb. Log. 84(3): 1118-1135 (2019) - [j29]Mohammad Ardeshir, Erfan Khaniki, Mohsen Shahriari:
A Counterexample to Polynomially Bounded Realizability of Basic Arithmetic. Notre Dame J. Formal Log. 60(3): 481-489 (2019) - 2018
- [j28]Mohammad Ardeshir, S. Mojtaba Mojtahedi:
The Σ1-provability logic of HA. Ann. Pure Appl. Log. 169(10): 997-1043 (2018) - [j27]Mohammad Ardeshir, Zahra Ghafouri:
Compactness, colocatedness, measurability and ED. Log. J. IGPL 26(2): 244-254 (2018) - [j26]Mohammad Ardeshir, Wim Ruitenburg:
Latarres, Lattices with an Arrow. Stud Logica 106(4): 757-788 (2018) - 2017
- [j25]Mohammad Ardeshir, Zahra Ghafouri:
The principle of open induction and Specker sequences. Log. J. IGPL 25(2): 232-238 (2017) - 2016
- [j24]Majid Alizadeh, Mohammad Ardeshir, Wim Ruitenburg:
Boolean Algebras in Visser Algebras. Notre Dame J. Formal Log. 57(1): 141-150 (2016) - 2015
- [j23]Mohammad Ardeshir, S. Mojtaba Mojtahedi:
Reduction of provability logics to Σ1-provability logics. Log. J. IGPL 23(5): 842-847 (2015) - 2014
- [j22]Mohammad Ardeshir, S. Mojtaba Mojtahedi:
The de Jongh property for Basic Arithmetic. Arch. Math. Log. 53(7-8): 881-895 (2014) - [j21]Mohammad Ardeshir, S. Mojtaba Mojtahedi:
Completeness of intermediate logics with doubly negated axioms. Math. Log. Q. 60(1-2): 6-11 (2014) - 2013
- [c1]Majid Alizadeh, Mohammad Ardeshir, Wim Ruitenburg:
A new Glivenko Theorem. TACL 2013: 191-194 - [i1]Mohammad Ardeshir, Rasoul Ramezanian:
Epistemic Learning Programs A Calculus for Describing Epistemic Action Models. CoRR abs/1304.6276 (2013) - 2012
- [j20]Majid Alizadeh, Mohammad Ardeshir:
On Löb algebras, II. Log. J. IGPL 20(1): 27-44 (2012) - [j19]Mohammad Ardeshir, Vahid Vaezian:
A unification of the basic logics of Sambin and Visser. Log. J. IGPL 20(6): 1202-1213 (2012) - [j18]Mohammad Ardeshir, Rasoul Ramezanian:
On the constructive notion of closure maps. Math. Log. Q. 58(4-5): 348-355 (2012) - [j17]Mohammad Ardeshir, Rasoul Ramezanian:
A solution to the Surprise Exam Paradox in Constructive Mathematics. Rev. Symb. Log. 5(4): 679-686 (2012) - 2010
- [j16]Mohammad Ardeshir, Rasoul Ramezanian:
The double negation of the intermediate value theorem. Ann. Pure Appl. Log. 161(6): 737-744 (2010)
2000 – 2009
- 2009
- [j15]Mohammad Ardeshir, Rasoul Ramezanian:
Decidability and Specker sequences in intuitionistic mathematics. Math. Log. Q. 55(6): 637-648 (2009) - 2008
- [j14]Mohammad Ardeshir, Bardyaa Hesaam:
An Introduction to Basic Arithmetic. Log. J. IGPL 16(1): 1-13 (2008) - [p1]Mohammad Ardeshir:
Ibn Sī: nā's Philosophy of Mathematics. The Unity of Science in the Arabic Tradition 2008: 43-61 - 2006
- [j13]Majid Alizadeh, Mohammad Ardeshir:
Amalgamation property for the class of basic algebras and some of its natural subclasses. Arch. Math. Log. 45(8): 913-930 (2006) - [j12]Mohammad Ardeshir, Fateme Nabavi:
On some questions of L. Åqvist. Log. J. IGPL 14(1): 1-13 (2006) - [j11]Majid Alizadeh, Mohammad Ardeshir:
On Löb algebras. Math. Log. Q. 52(1): 95-105 (2006) - 2004
- [j10]Majid Alizadeh, Mohammad Ardeshir:
On the linear Lindenbaum algebra of Basic Propositional Logic. Math. Log. Q. 50(1): 65-70 (2004) - 2003
- [j9]Mojtaba Aghaei, Mohammad Ardeshir:
A Gentzen-style axiomatization for basic predicate calculus. Arch. Math. Log. 42(3): 245-259 (2003) - [j8]Mohammad Ardeshir, Wim Ruitenburg, Saeed Salehi:
Intuitionistic axiomatizations for bounded extension Kripke models. Ann. Pure Appl. Log. 124(1-3): 267-285 (2003) - 2002
- [j7]Mohammad Ardeshir, Bardyaa Hesaam:
Every Rooted Narrow Tree Kripke Model of HA is Locally PA. Math. Log. Q. 48(3): 391-395 (2002) - 2001
- [j6]Mohammad Ardeshir, Wim Ruitenburg:
Basic Propositional Calculus II. Interpolation. Arch. Math. Log. 40(5): 349-364 (2001) - [j5]Mojtaba Aghaei, Mohammad Ardeshir:
Gentzen-Style Axiomatizations for Some Conservative Extensions of Basic Propositional Logic. Stud Logica 68(2): 263-285 (2001) - 2000
- [j4]Mojtaba Aghaei, Mohammad Ardeshir:
A Bounded Translation of Intuitionistic Propositional Logic into Basic Propositional Logic. Math. Log. Q. 46(2): 199-206 (2000)
1990 – 1999
- 1999
- [j3]Mohammad Ardeshir:
A Translation of Intuitionistic Predicate Logic into Basic Predicate Logic. Stud Logica 62(3): 341-352 (1999) - 1998
- [j2]Mohammad Ardeshir, Wim Ruitenburg:
Basic Propositional Calculus I. Math. Log. Q. 44: 317-343 (1998) - [j1]Mohammad Ardeshir, Mojtaba Moniri:
Intuitionistic Open Induction and Least Number Principle and the Buss Operator. Notre Dame J. Formal Log. 39(2): 212-220 (1998)
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:57 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:
