24 found
Order:
  1. New Constructions of Satisfaction Classes.Albert Visser & Ali Enayat - 2015 - In Kentaro Fujimoto, José Martínez Fernández, Henri Galinon & Theodora Achourioti (eds.), Unifying the Philosophy of Truth. Springer Verlag.
    No categories
     
    Export citation  
     
    Bookmark   4 citations  
  2.  4
    Largest Initial Segments Pointwise Fixed by Automorphisms of Models of Set Theory.Ali Enayat, Matt Kaufmann & Zachiri McKenzie - 2018 - Archive for Mathematical Logic 57 (1-2):91-139.
    Given a model \ of set theory, and a nontrivial automorphism j of \, let \\) be the submodel of \ whose universe consists of elements m of \ such that \=x\) for every x in the transitive closure of m ). Here we study the class \ of structures of the form \\), where the ambient model \ satisfies a frugal yet robust fragment of \ known as \, and \=m\) whenever m is a finite ordinal in the sense (...)
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  3.  7
    Iterated Ultrapowers for the Masses.Ali Enayat, Matt Kaufmann & Zachiri McKenzie - 2018 - Archive for Mathematical Logic 57 (5-6):557-576.
    We present a novel, perspicuous framework for building iterated ultrapowers. Furthermore, our framework naturally lends itself to the construction of a certain type of order indiscernibles, here dubbed tight indiscernibles, which are shown to provide smooth proofs of several results in general model theory.
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4.  3
    Truth, Disjunction, and Induction.Ali Enayat & Fedor Pakhomov - forthcoming - Archive for Mathematical Logic:1-14.
    By a well-known result of Kotlarski et al., first-order Peano arithmetic \ can be conservatively extended to the theory \ of a truth predicate satisfying compositional axioms, i.e., axioms stating that the truth predicate is correct on atomic formulae and commutes with all the propositional connectives and quantifiers. This result motivates the general question of determining natural axioms concerning the truth predicate that can be added to \ while maintaining conservativity over \. Our main result shows that conservativity fails even (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5.  19
    Models of Set Theory with Definable Ordinals.Ali Enayat - 2004 - Archive for Mathematical Logic 44 (3):363-385.
    A DO model (here also referred to a Paris model) is a model of set theory all of whose ordinals are first order definable in . Jeffrey Paris (1973) initiated the study of DO models and showed that (1) every consistent extension T of ZF has a DO model, and (2) for complete extensions T, T has a unique DO model up to isomorphism iff T proves V=OD. Here we provide a comprehensive treatment of Paris models. Our results include the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  6.  1
    A Standard Model of Peano Arithmetic with No Conservative Elementary Extension.Ali Enayat - 2008 - Annals of Pure and Applied Logic 156 (2):308-318.
    The principal result of this paper answers a long-standing question in the model theory of arithmetic [R. Kossak, J. Schmerl, The Structure of Models of Peano Arithmetic, Oxford University Press, 2006, Question 7] by showing that there exists an uncountable arithmetically closed family of subsets of the set ω of natural numbers such that the expansion of the standard model of Peano arithmetic has no conservative elementary extension, i.e., for any elementary extension of , there is a subset of ω* (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  7.  5
    Automorphisms of Models of Arithmetic: A Unified View.Ali Enayat - 2007 - Annals of Pure and Applied Logic 145 (1):16-36.
    We develop the method of iterated ultrapower representation to provide a unified and perspicuous approach for building automorphisms of countable recursively saturated models of Peano arithmetic . In particular, we use this method to prove Theorem A below, which confirms a long-standing conjecture of James Schmerl.Theorem AIf is a countable recursively saturated model of in which is a strong cut, then for any there is an automorphism j of such that the fixed point set of j is isomorphic to .We (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  8.  26
    Power-Like Models of Set Theory.Ali Enayat - 2001 - Journal of Symbolic Logic 66 (4):1766-1782.
    A model M = (M, E,...) of Zermelo-Fraenkel set theory ZF is said to be θ-like, where E interprets ∈ and θ is an uncountable cardinal, if |M| = θ but $|\{b \in M: bEa\}| for each a ∈ M. An immediate corollary of the classical theorem of Keisler and Morley on elementary end extensions of models of set theory is that every consistent extension of ZF has an ℵ 1 -like model. Coupled with Chang's two cardinal theorem this implies (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  9.  32
    Leibnizian Models of Set Theory.Ali Enayat - 2004 - Journal of Symbolic Logic 69 (3):775-789.
    A model is said to be Leibnizian if it has no pair of indiscernibles. Mycielski has shown that there is a first order axiom LM (the Leibniz-Mycielski axiom) such that for any completion T of Zermelo-Fraenkel set theory ZF, T has a Leibnizian model if and only if T proves LM. Here we prove: THEOREM A. Every complete theory T extending ZF + LM has $2^{\aleph_{0}}$ nonisomorphic countable Leibnizian models. THEOREM B. If $\kappa$ is aprescribed definable infinite cardinal of a (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  10.  27
    Model Theory of the Regularity and Reflection Schemes.Ali Enayat & Shahram Mohsenipour - 2008 - Archive for Mathematical Logic 47 (5):447-464.
    This paper develops the model theory of ordered structures that satisfy Keisler’s regularity scheme and its strengthening REF ${(\mathcal{L})}$ (the reflection scheme) which is an analogue of the reflection principle of Zermelo-Fraenkel set theory. Here ${\mathcal{L}}$ is a language with a distinguished linear order <, and REF ${(\mathcal {L})}$ consists of formulas of the form $$\exists x \forall y_{1} < x \ldots \forall y_{n} < x \varphi (y_{1},\ldots ,y_{n})\leftrightarrow \varphi^{ < x}(y_1, \ldots ,y_n),$$ where φ is an ${\mathcal{L}}$ -formula, φ (...))
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  11.  11
    Fixed Points of Self-Embeddings of Models of Arithmetic.Saeideh Bahrami & Ali Enayat - 2018 - Annals of Pure and Applied Logic 169 (6):487-513.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  12.  35
    Weakly Compact Cardinals in Models of Set Theory.Ali Enayat - 1985 - Journal of Symbolic Logic 50 (2):476-486.
  13.  23
    Minimal Elementary Extensions of Models of Set Theory and Arithmetic.Ali Enayat - 1990 - Archive for Mathematical Logic 30 (3):181-192.
    TheoremEvery model of ZFChas a conservative elementary extension which possesses a cofinal minimal elementary extension.An application of Boolean ultrapowers to models of full arithmetic is also presented.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  14.  5
    Conservative Extensions of Models of Set Theory and Generalizations.Ali Enayat - 1986 - Journal of Symbolic Logic 51 (4):1005-1021.
  15.  13
    Preface.Ali Enayat & Iraj Kalantari - 2010 - Annals of Pure and Applied Logic 161 (6):709-710.
  16.  4
    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  
  17.  10
    Trees and Keislers Problem.Ali Enayat - 2001 - Archive for Mathematical Logic 40 (4):273-276.
    We give a new negative solution to Keisler's problem regarding Skolem functions and elementary extensions. In contrast to existing ad hoc solutions due to Payne, Knight, and Lachlan, our solution uses well-known models.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  18.  6
    Unifying the Model Theory of First-Order and Second-Order Arithmetic viaWKL0⁎.Ali Enayat & Tin Lok Wong - 2017 - Annals of Pure and Applied Logic 168 (6):1247-1283.
  19.  5
    Marginalia on a Theorem of Woodin.Rasmus Blanck & Ali Enayat - 2017 - Journal of Symbolic Logic 82 (1):359-374.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  20. Marriott Wardman Park Hotel, Washington, DC January 7–8, 2009.Barbara F. Csima, Inessa Epstein, Rahim Moosa, Christian Rosendal, Jouko Väänänen & Ali Enayat - 2009 - Bulletin of Symbolic Logic 15 (2).
     
    Export citation  
     
    Bookmark  
  21.  1
    Zfc Proves That the Class of Ordinals is Not Weakly Compact for Definable Classes.Ali Enayat & Joel David Hamkins - 2018 - Journal of Symbolic Logic 83 (1):146-164.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  22.  5
    The First Iranian Summer School in Logic.Ali Enayat - 1993 - Journal of Symbolic Logic 58 (4):1476.
  23.  3
    2008-2009 Winter Meeting of the Association for Symbolic Logic.Ali Enayat & Barbara F. Csima - 2009 - Bulletin of Symbolic Logic 15 (2):237.
  24. Manteghe Riazi.M. Ardeshir & Ali Enayat - 2008 - Bulletin of Symbolic Logic 14 (1):118-119.
     
    Export citation  
     
    Bookmark