On Conservative Extensions in Logics with Infinitary Predicates

Studia Logica 92 (1):121-135 (2009)
  Copy   BIBTEX

Abstract

If the language is extended by new individual variables, in classical first order logic, then the deduction system obtained is a conservative extension of the original one. This fails to be true for the logics with infinitary predicates. But it is shown that restricting the commutativity of quantifiers and the equality axioms in the extended system and supposing the merry-go-round property in the original system, the foregoing extension is already conservative. It is shown that these restrictions are crucial for an extension to be conservative. The origin of the results is algebraic logic.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

External links

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

Through your library

Analytics

Added to PP
2009-06-01

Downloads
35 (#470,921)

6 months
7 (#491,733)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Provability with finitely many variables.Robin Hirsch, Ian Hodkinson & Roger D. Maddux - 2002 - Bulletin of Symbolic Logic 8 (3):348-379.
On representability of neatly embeddable cylindric algebras.Miklós Ferenczi - 2000 - Journal of Applied Non-Classical Logics 10 (3):303-315.
A Complete First-Order Logic with Infinitary Predicates.H. J. Keisler - 1966 - Journal of Symbolic Logic 31 (2):269-269.

Add more references