See also
Farzad Didehvar
Amir Kabir University University (Tehran Polytechnic)
  1.  80
    Effectiveness in RPL, with Applications to Continuous Logic.Farzad Didehvar, Kaveh Ghasemloo & Massoud Pourmahdian - 2010 - Annals of Pure and Applied Logic 161 (6):789-799.
    In this paper, we introduce a foundation for computable model theory of rational Pavelka logic and continuous logic, and prove effective versions of some related theorems in model theory. We show how to reduce continuous logic to rational Pavelka logic. We also define notions of computability and decidability of a model for logics with computable, but uncountable, set of truth values; we show that provability degree of a formula with respect to a linear theory is computable, and use this to (...)
    Direct download (5 more)  
    Export citation  
    Bookmark   1 citation  
  2.  16
    On a Class of Recursively Enumerable Sets.Farzad Didehvar - 1999 - Mathematical Logic Quarterly 45 (4):467-470.
    We define a class of so-called ∑-sets as a natural closure of recursively enumerable sets Wn under the relation “∈” and study its properties.
    Direct download  
    Export citation