Lindstrom theorems for fragments of first-order logic
Lindstr\"om theorems characterize logics in terms of model-theoretic conditions such as Compactness and the L\"owenheim-Skolem property. Most existing characterizations of this kind concern extensions of first-order logic. But on the other hand, many logics relevant to computer science are...
Main Authors: | Johan van Benthem, Balder ten Cate, Jouko Vaananen |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2009-08-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/895/pdf |
Similar Items
-
Complete Axiomatizations of Fragments of Monadic Second-Order Logic on Finite Trees
by: Amélie Gheerbrant, et al.
Published: (2012-10-01) -
An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
by: Alexis Bès
Published: (2008-03-01) -
Untyping Typed Algebras and Colouring Cyclic Linear Logic
by: Damien Pous
Published: (2012-06-01) -
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
by: Joost Engelfriet, et al.
Published: (2007-04-01) -
On Second-Order Monadic Monoidal and Groupoidal Quantifiers
by: Juha Kontinen, et al.
Published: (2010-09-01)