论文信息 - On Conservative Extensions in Logics with Infinitary Predicates

On Conservative Extensions in Logics with Infinitary Predicates

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.

Miklós Ferenczi | M. Ferenczi

[1] H. J. Keisler,et al. A complete first-order logic with infinitary predicates , 1963 .

[2] Joseph R. Shoenfield,et al. Mathematical logic , 1967 .

[3] James S. Johnson,et al. Axiom systems for first order logic with finitely many variables , 1973, Journal of Symbolic Logic.

[4] Ian M. Hodkinson,et al. Provability with Finitely Many Variables , 2002, Bulletin of Symbolic Logic.

[5] Tarek Sayed Ahmed,et al. A Neat Embedding Theorem for Expansions of Cylindric Algebras , 2006, Log. J. IGPL.

[6] Hajnal Andréka,et al. A Stone-type representation theorem for algebras of relations of higher rank , 1988 .

[7] Antonino Salibra. A general theory of algebras with quantifiers , 1991 .

[8] Miklós Ferenczi,et al. On representability of neatly embeddable cylindric algebras , 2000, J. Appl. Non Class. Logics.