Theory of Models with Generalized Atomic Formulas. - H. Jerome Keisler (J. Symb. Log., 1960)

An Improved Prenex Normal Form. - Chen C. Chang; H. Jerome Keisler (J. Symb. Log., 1962)

Limit Ultraproducts. - H. Jerome Keisler (J. Symb. Log., 1965)

Some Applications of Infinitely Long Formulas. - H. Jerome Keisler (J. Symb. Log., 1965)

Ultraproducts which are not Saturated. - H. Jerome Keisler (J. Symb. Log., 1967)

Ultraproducts of Finite Sets. - H. Jerome Keisler (J. Symb. Log., 1967)

On Theories Categorical in Their Own Power. - H. Jerome Keisler (J. Symb. Log., 1971)

The Diversity of Quantifier Prefixes. - H. Jerome Keisler; Wilbur Walkoe Jr. (J. Symb. Log., 1973)

A Result Concerning Cardinalities of Ultraproducts. - H. Jerome Keisler; Karel Prikry (J. Symb. Log., 1974)

The Stability Function of a Theory. - H. Jerome Keisler (J. Symb. Log., 1978)

The Kleene Symposium and the Summer Meeting of the Association for Symbolic Logic. - John Addison; Jon Barwise; H. Jerome Keisler; Kenneth Kunen; Yiannis N. Moschovakis (J. Symb. Log., 1979)

LA( Finv). - Kim B. Bruce; H. Jerome Keisler (J. Symb. Log., 1979)

Meeting of the Association for Symbolic Logic: Madison 1982. - H. Jerome Keisler (J. Symb. Log., 1983)

The Strength of Nonstandard Methods in Arithmetic. - C. Ward Henson; Matt Kaufmann; H. Jerome Keisler (J. Symb. Log., 1984)

A completeness proof for adapted probability logic. - H. Jerome Keisler (Ann. Pure Appl. Log., 1986)

Hyperfinite models of adapted probability logic. - H. Jerome Keisler (Ann. Pure Appl. Log., 1986)

On the Strength of Nonstandard Analysis. - C. Ward Henson; H. Jerome Keisler (J. Symb. Log., 1986)

Measures and forking. - H. Jerome Keisler (Ann. Pure Appl. Log., 1987)

Descriptive Set Theory Over Hyperfinite Sets. - H. Jerome Keisler; Kenneth Kunen; Arnold W. Miller; Steven C. Leth (J. Symb. Log., 1989)

From Discrete to Continuous Time. - H. Jerome Keisler (Ann. Pure Appl. Log., 1991)

Meager Sets on the Hyperfinite Time Line. - H. Jerome Keisler; Steven C. Leth (J. Symb. Log., 1991)

Making the Hyperreal Line Both Saturated and Complete. - H. Jerome Keisler; James H. Schmerl (J. Symb. Log., 1991)

Model theory, Third Edition. - Chen C. Chang; H. Jerome Keisler (North-Holland, 1992)

Game Sentences and Ultrapowers. - Renling Jin; H. Jerome Keisler (Ann. Pure Appl. Log., 1993)

Expressive Power of Unary Counters. - Michael Benedikt; H. Jerome Keisler (ICDT, 1997)

Quantifier Elimination for Neocompact Sets. - H. Jerome Keisler (J. Symb. Log., 1998)

Definability over Linear Constraints. - Michael Benedikt; H. Jerome Keisler (CSL, 2000)

Maharam Spectra of Loeb Spaces. - Renling Jin; H. Jerome Keisler (J. Symb. Log., 2000)

Definability with a predicate for a semi-linear set. - Michael Benedikt; H. Jerome Keisler (J. Symb. Log., 2003)

Shrinking games and local formulas. - H. Jerome Keisler; Wafik Boulos Lotfallah (Ann. Pure Appl. Log., 2004)

Barwise: infinitary logic and admissible sets. - H. Jerome Keisler; Julia F. Knight (Bull. Symb. Log., 2004)

First order quantifiers in monadic second order logic. - H. Jerome Keisler; Wafik Boulos Lotfallah (J. Symb. Log., 2004)

A local normal form theorem for infinitary logic with unary quantifiers. - H. Jerome Keisler; Wafik Boulos Lotfallah (Math. Log. Q., 2005)

Nonstandard arithmetic and reverse mathematics. - H. Jerome Keisler (Bull. Symb. Log., 2006)

An Impossibility Theorem on Beliefs in Games. - Adam Brandenburger; H. Jerome Keisler (Stud Logica, 2006)

Almost everywhere elimination of probability quantifiers. - H. Jerome Keisler; Wafik Boulos Lotfallah (J. Symb. Log., 2009)

Iterated dominance revisited. - Amanda Friedenberg; H. Jerome Keisler (BQGT, 2010)

Nonstandard arithmetic and recursive comprehension. - H. Jerome Keisler (Ann. Pure Appl. Log., 2010)

Rank Hierarchies for Generalized Quantifiers. - H. Jerome Keisler; Wafik Boulos Lotfallah (J. Log. Comput., 2011)

Craig interpolation for networks of sentences. - H. Jerome Keisler; Jeffrey M. Keisler (Ann. Pure Appl. Log., 2012)

Use of a Canonical Hidden-Variable Space in Quantum Mechanics. - Adam Brandenburger; H. Jerome Keisler (Computation, Logic, Games, and Quantum Foundations, 2013)

Observing, reporting, and deciding in networks of sentences. - H. Jerome Keisler; Jeffrey M. Keisler (Ann. Pure Appl. Log., 2014)

Definable closure in randomizations. - Uri Andrews; Isaac Goldbring; H. Jerome Keisler (Ann. Pure Appl. Log., 2015)

Separable Models of Randomizations. - Uri Andrews; H. Jerome Keisler (J. Symb. Log., 2015)

Maryanthe Malliaris and Saharon Shelah, Cofinality spectrum problems in model theory, set theory and general topology . Journal of the American Mathematical Society, vol. 29 (2016), pp. 237-297. - Maryanthe Malliaris and Saharon Shelah, Existence of optimal ultrafilters and the fundamental complexity of simple theories. Advances in Mathematics, vol. 290 (2016), pp. 614-681. - Maryanthe Malliaris and Saharon Shelah, Keisler's order has infinitely many classes. Israel Journal of Mathematics, to appear, https://math.uchicago.edu/∼mem/. - H. Jerome Keisler (Bull. Symb. Log., 2017)

A canonical hidden-variable space. - Adam Brandenburger; H. Jerome Keisler (Ann. Pure Appl. Log., 2018)

Independence in randomizations. - Uri Andrews; Isaac Goldbring; H. Jerome Keisler (J. Math. Log., 2019)

Scattered sentences have few separable randomizations. - Uri Andrews; Isaac Goldbring; Sherwood Hachtman; H. Jerome Keisler; David Marker (Arch. Math. Log., 2020)

Continuous Sentences Preserved under Reduced Products. - Isaac Goldbring; H. Jerome Keisler (J. Symb. Log., 2022)

Using ultrapowers to compare continuous structures. - H. Jerome Keisler (Ann. Pure Appl. Log., 2024)