A combinatorial version of the Svenonius theorem on definability

Logic Journal of the IGPL 23 (6):966-975 (2015)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,503

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A proofless proof of the Barwise compactness theorem.Mark Howard - 1988 - Journal of Symbolic Logic 53 (2):597-602.
Definability and automorphisms in abstract logics.Xavier Caicedo - 2004 - Archive for Mathematical Logic 43 (8):937-945.
Intrinsically Hyperarithmetical Sets.Ivan N. Soskov - 1996 - Mathematical Logic Quarterly 42 (1):469-480.
Definability and simplicity.Lars Svenonius - 1955 - Journal of Symbolic Logic 20 (3):235-250.
Abstract Beth Definability in Institutions.Marius Petria & Răzvan Diaconescu - 2006 - Journal of Symbolic Logic 71 (3):1002 - 1028.
On definability in multimodal logic.Joseph Y. Halpern, Dov Samet & Ella Segev - 2009 - Review of Symbolic Logic 2 (3):451-468.
On definability of normal subgroups of a superstable group.Akito Tsuboi - 1992 - Mathematical Logic Quarterly 38 (1):101-106.

Analytics

Added to PP
2016-06-30

Downloads
9 (#1,245,240)

6 months
2 (#1,194,813)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Model Theory.Michael Makkai, C. C. Chang & H. J. Keisler - 1991 - Journal of Symbolic Logic 56 (3):1096.
An elementary definability theorem for first order logic.C. Butz & I. Moerdijk - 1999 - Journal of Symbolic Logic 64 (3):1028-1036.

Add more references