×
Author ID: salehi.saeed Recent zbMATH articles by "Salehi, Saeed"
Published as: Salehi, Saeed
Homepage: https://saeedsalehi.ir/
External Links: MGP · ORCID · Wikidata · arXiv · MathOverflow · Math-Net.Ru · dblp
Documents Indexed: 31 Publications since 2002
Reviewing Activity: 79 Reviews
Co-Authors: 9 Co-Authors with 11 Joint Publications
51 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

17 Publications have been cited 53 times in 37 Documents Cited by Year
Provably total functions of basic arithmetic. Zbl 1026.03045
Salehi, Saeed
10
2003
Tree algebras and varieties of tree languages. Zbl 1118.68089
Salehi, Saeed; Steinby, Magnus
9
2007
Positive varieties of tree languages. Zbl 1080.68068
Petković, Tatjana; Salehi, Saeed
7
2005
Varieties of tree languages definable by syntactic monoids. Zbl 1084.68078
Salehi, Saeed
4
2005
On constructivity and the Rosser property: a closer look at some Gödelean proofs. Zbl 1434.03135
Salehi, Saeed; Seraji, Payam
3
2018
Gödel-Rosser’s incompleteness theorem, generalized and optimized for definable theories. Zbl 1444.03166
Salehi, Saeed; Seraji, Payam
3
2017
Gödel’s incompleteness phenomenon – computationally. Zbl 1325.03074
Salehi, Saeed
2
2014
Intuitionistic axiomatizations for bounded extension Kripke models. Zbl 1040.03044
Ardeshir, Mohammad; Ruitenburg, Wim; Salehi, Saeed
2
2003
On axiomatizability of the multiplicative theory of numbers. Zbl 1436.03307
Salehi, Saeed
2
2018
Separating bounded arithmetical theories by Herbrand consistency. Zbl 1252.03136
Salehi, Saeed
2
2012
Herbrand consistency of some arithmetical theories. Zbl 1256.03065
Salehi, Saeed
2
2012
Varieties of many-sorted recognizable sets. Zbl 1224.68056
Salehi, Saeed; Steinby, Magnus
2
2007
Polynomially bounded recursive realizability. Zbl 1097.03051
Salehi, Saeed
1
2005
Kripke semantics for fuzzy logics. Zbl 1398.03131
Safari, Parvin; Salehi, Saeed
1
2018
On decidability and axiomatizability of some ordered structures. Zbl 1418.03171
Assadi, Ziba; Salehi, Saeed
1
2019
First-order continuous induction and a logical study of real closed fields. Zbl 1486.03060
Salehi, Saeed; Zarza, Mohammadsaleh
1
2020
Diagonal arguments and fixed points. Zbl 1405.18001
Karimi, Ahmad; Salehi, Saeed
1
2017
First-order continuous induction and a logical study of real closed fields. Zbl 1486.03060
Salehi, Saeed; Zarza, Mohammadsaleh
1
2020
On decidability and axiomatizability of some ordered structures. Zbl 1418.03171
Assadi, Ziba; Salehi, Saeed
1
2019
On constructivity and the Rosser property: a closer look at some Gödelean proofs. Zbl 1434.03135
Salehi, Saeed; Seraji, Payam
3
2018
On axiomatizability of the multiplicative theory of numbers. Zbl 1436.03307
Salehi, Saeed
2
2018
Kripke semantics for fuzzy logics. Zbl 1398.03131
Safari, Parvin; Salehi, Saeed
1
2018
Gödel-Rosser’s incompleteness theorem, generalized and optimized for definable theories. Zbl 1444.03166
Salehi, Saeed; Seraji, Payam
3
2017
Diagonal arguments and fixed points. Zbl 1405.18001
Karimi, Ahmad; Salehi, Saeed
1
2017
Gödel’s incompleteness phenomenon – computationally. Zbl 1325.03074
Salehi, Saeed
2
2014
Separating bounded arithmetical theories by Herbrand consistency. Zbl 1252.03136
Salehi, Saeed
2
2012
Herbrand consistency of some arithmetical theories. Zbl 1256.03065
Salehi, Saeed
2
2012
Tree algebras and varieties of tree languages. Zbl 1118.68089
Salehi, Saeed; Steinby, Magnus
9
2007
Varieties of many-sorted recognizable sets. Zbl 1224.68056
Salehi, Saeed; Steinby, Magnus
2
2007
Positive varieties of tree languages. Zbl 1080.68068
Petković, Tatjana; Salehi, Saeed
7
2005
Varieties of tree languages definable by syntactic monoids. Zbl 1084.68078
Salehi, Saeed
4
2005
Polynomially bounded recursive realizability. Zbl 1097.03051
Salehi, Saeed
1
2005
Provably total functions of basic arithmetic. Zbl 1026.03045
Salehi, Saeed
10
2003
Intuitionistic axiomatizations for bounded extension Kripke models. Zbl 1040.03044
Ardeshir, Mohammad; Ruitenburg, Wim; Salehi, Saeed
2
2003

Citations by Year

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.