10 found
Order:
Disambiguations
Massoud Pourmahdian [13]M. Pourmahdian [4]
  1.  21
    The Logic of Integration.Seyed-Mohammad Bagheri & Massoud Pourmahdian - 2009 - Archive for Mathematical Logic 48 (5):465-492.
    We develop a model theoretic framework for studying algebraic structures equipped with a measure. The real line is used as a value space and its usual arithmetical operations as connectives. Integration is used as a quantifier. We extend some basic results of pure model theory to this context and characterize measurable sets in terms of zero-sets of formulas.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  2.  7
    Simple Generic Structures.Massoud Pourmahdian - 2003 - Annals of Pure and Applied Logic 121 (2-3):227-260.
    A study of smooth classes whose generic structures have simple theory is carried out in a spirit similar to Hrushovski 147; Simplicity and the Lascar group, preprint, 1997) and Baldwin–Shi 1). We attach to a smooth class K0, of finite -structures a canonical inductive theory TNat, in an extension-by-definition of the language . Here TNat and the class of existentially closed models of =T+,EX, play an important role in description of the theory of the K0,-generic. We show that if M (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  3.  3
    Belegradek, O., Verbovskiy, V. And Wagner, FO, Coset.J. Y. Halpern, B. M. Kapron, V. S. Harizanov, U. Kohlenbach, P. Oliva, F. Lucas, B. Luttik, P. Matet & M. Pourmahdian - 2003 - Annals of Pure and Applied Logic 121 (1):287.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  4.  22
    Smooth Classes Without AC and Robinson Theories.Massoud Pourmahdian - 2002 - Journal of Symbolic Logic 67 (4):1274-1294.
    We study smooth classes without the algebraic closure property. For such smooth classes we investigate the simplicity of the class of generic structures, in the context of Robinson theories.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  5.  11
    First-Order Modal Logic: Frame Definability and a Lindström Theorem.R. Zoghifard & M. Pourmahdian - 2018 - Studia Logica 106 (4):699-720.
    We generalize two well-known model-theoretic characterization theorems from propositional modal logic to first-order modal logic. We first study FML-definable frames and give a version of the Goldblatt–Thomason theorem for this logic. The advantage of this result, compared with the original Goldblatt–Thomason theorem, is that it does not need the condition of ultrafilter reflection and uses only closure under bounded morphic images, generated subframes and disjoint unions. We then investigate Lindström type theorems for first-order modal logic. We show that FML has (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6.  23
    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  
  7.  7
    Preface.Ali Enayat, Massoud Pourmahdian & Ralf Schindler - 2018 - Archive for Mathematical Logic 57 (1-2):1-2.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  8.  14
    An Arithmetical View to First-Order Logic.Seyed Mohammad Bagheri, Bruno Poizat & Massoud Pourmahdian - 2010 - Annals of Pure and Applied Logic 161 (6):745-755.
    A value space is a topological algebra equipped with a non-empty family of continuous quantifiers . We will describe first-order logic on the basis of . Operations of are used as connectives and its relations are used to define statements. We prove under some normality conditions on the value space that any theory in the new setting can be represented by a classical first-order theory.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  9.  6
    The Stable Forking Conjecture and Generic Structures.Massoud Pourmahdian - 2003 - Archive for Mathematical Logic 42 (5):415-421.
    We prove that for any simple theory which is constructed via Fräissé-Hrushovski method, if the forking independence is the same as the d-independence then the stable forking property holds.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  10. Mathematical Logic.Massoud Pourmahdian - 2003 - Archive for Mathematical Logic 42:415-421.
     
    Export citation  
     
    Bookmark