Lindstrom theorems for fragments of first-order logic

DOI10.2168/LMCS-5(3:3)2009zbMath1168.03017arXiv0905.3668MaRDI QIDQ3395097

Jouko Väänänen, Balder ten Cate, J. F. A. K. van Benthem

Publication date: 20 August 2009

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0905.3668

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Cylindric and polyadic algebras; relation algebras (03G15) Interpolation, preservation, definability (03C40) Subsystems of classical logic (including intuitionistic logic) (03B20) Basic properties of first-order languages and structures (03C07)

Related Items (8)

A general Lindström theorem for some normal modal logics ⋮ Games and Lindström theorems ⋮ MAXIMALITY OF LOGIC WITHOUT IDENTITY ⋮ Keeping logic in the trivium of computer science: a teaching perspective ⋮ Logic between Expressivity and Complexity ⋮ First-order modal logic: frame definability and a Lindström theorem ⋮ The many faces of interpolation ⋮ Chain logic and Shelah's infinitary logic

This page was built for publication: Lindstrom theorems for fragments of first-order logic