Notre Dame Journal of Formal Logic

A Lindström Theorem for Intuitionistic Propositional Logic

Guillermo Badia and Grigory Olkhovikov

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


We show that propositional intuitionistic logic is the maximal (with respect to expressive power) abstract logic satisfying a certain form of compactness, the Tarski union property (TUP), and preservation under asimulations.

Article information

Notre Dame J. Formal Logic, Volume 61, Number 1 (2020), 11-30.

Received: 17 February 2017
Accepted: 22 October 2018
First available in Project Euclid: 29 November 2019

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 03C95: Abstract model theory
Secondary: 03B55: Intermediate logics

Lindström theorem intuitionistic logic abstract model theory asimulations


Badia, Guillermo; Olkhovikov, Grigory. A Lindström Theorem for Intuitionistic Propositional Logic. Notre Dame J. Formal Logic 61 (2020), no. 1, 11--30. doi:10.1215/00294527-2019-0030.

Export citation


  • [1] Barwise, K. J., “Axioms for abstract model theory,” Annals of Mathematical Logic, vol. 7 (1974), pp. 221–65.
  • [2] Barwise, J., “Model-Theoretic Logics: Background and Aims,” pp. 3–23 in Model-Theoretic Logics, edited by J. Barwise and S. Feferman, vol. 8 of Perspectives in Mathematical Logic, Springer, New York, 1985.
  • [3] Blackburn, P., M. de Rijke, and Y. Venema, Modal Logic, vol. 53 of Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, Cambridge, 2001.
  • [4] Caicedo, X., “Continuous operations on spaces of structures,” pp. 263–96 in Quantifiers: Logics, Models and Computation, Vol. 1: Surveys, edited by M. Krynicki, M. Mostowski, and L. W. Szczerba, vol. 248of Synthese Library, Kluwer, Dordrecht, 1995.
  • [5] Chagrov, A., and M. Zakharyaschev, Modal Logic, vol. 35 of Oxford Logic Guides, Oxford University Press, New York, 1997.
  • [6] de Rijke, M., “A Lindström theorem for modal logic,” pp. 217–30 in Modal Logic and Process Algebra (Amsterdam, 1994), edited by A. Ponse, M. de Rijke, and Y. Venema, vol. 53 of CSLI Lecture Notes, CSLI, Stanford, CA, 1995.
  • [7] Dontchev, J., “Contra-continuous functions and strongly $S$-closed spaces,” International Journal of Mathematical Sciences, vol. 19 (1996), pp. 303–10.
  • [8] Enqvist, S., “A general Lindström theorem for some normal modal logics,” Logica Universalis, vol. 7 (2013), pp. 233–64.
  • [9] Feferman, S., “Two notes on abstract model theory, I: Properties invariant on the range of definable relations between structures,” Fundamenta Mathematicae, vol. 82 (1974), pp. 153–65.
  • [10] Flum, J., “First-order logic and its extensions,” pp. 248–310 in Proceedings of the International Summer Institute and Logic Colloquium (Kiel, 1974), edited by G. H. Müller, A. Oberschelp, and K. Potthoff, vol. 499 of Lecture Notes in Mathematics, Springer, Berlin, 1975.
  • [11] Gabbay, D. M, and L. Maksimova, Interpolation and Definability: Modal and Intuitionistic Logics, vol. 46 of Oxford Logic Guides, Oxford University Press, Oxford, 2005.
  • [12] García-Matos, M., and J. Väänänen, “Abstract model theory as a framework for universal logic,” pp. 19–33 in Logica Universalis, edited by J.-Y. Beziau, Birkhäuser, Basel, 2005.
  • [13] Kelley, J. L., General Topology, Van Nostrand, Toronto, 1955.
  • [14] Kurtonina, N., and M. de Rijke, “Simulating without negation,” Journal of Logic and Computation, vol. 7 (1997), pp. 501–22.
  • [15] Lindström, P., “On extensions of elementary logic,” Theoria, vol. 35 (1969), pp. 1–11.
  • [16] Olkhovikov, G. K., “Model-theoretic characterization of intuitionistic propositional formulas,” Review of Symbolic Logic, vol. 6 (2013), pp. 348–65.
  • [17] Olkhovikov, G. K., “Model-theoretic characterization of intuitionistic predicate formulas,” Journal of Logic and Computation, vol. 24 (2014), pp. 809–29.
  • [18] Olkhovikov, G. K., “On expressive power of basic modal intuitionistic logic as a fragment of classical FOL,” Journal of Applied Logics, vol. 21 (2017), pp. 57–90.
  • [19] Olkhovikov, G. K., “On generalized Van Benthem-type characterizations,” Annals of Pure and Applied Logic, vol. 168 (2017), pp. 1643–91.
  • [20] Otto, M., and R. Piro, “A Lindström characterisation of the guarded fragment and of modal logic with a global modality,” pp. 273–87 in Advances in Modal Logic, Vol. 7, edited by C. Areces and R. Goldblatt, College Publications, London, 2008.
  • [21] Rasiowa, H., “A proof of the compactness theorem for arithmetical classes,” Fundamenta Mathematicae, vol. 39 (1952), pp. 8–14.
  • [22] van Benthem, J., “A new modal Lindström theorem,” Logica Universalis, vol. 1 (2007), pp. 125–38.