An omitting types theorem for first order logic with infinitary relation symbols

被引：3

作者：

Ahmed, Tarek Sayed ^{[1
]}

Samir, Basim

机构：

[1] Cairo Univ, Fac Sci, Dept Math, Giza, Egypt

[2] Assiut Univ, Fac Sci, Dept Math, Assiut, Egypt

来源：

MATHEMATICAL LOGIC QUARTERLY | 2007年 / 53卷 / 06期

关键词：

algebraic logic; cylindric algebras; omitting types;

D O I：

10.1002/malq.200610050

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In this-paper, an extension of first order logic is introduced. In such logics atomic formulas may have infinite lengths. An Omitting Types Theorem is proved.(C) 2007 WILEY-VCH Verlag GmbH & Co. KGaA. Weinheim.

引用

页码：564 / 570

页数：7

共 50 条

[41] An omitting types theorem for positive bounded formulas in normed spaces
Ortiz, C
ANNALS OF PURE AND APPLIED LOGIC, 2001, 108 (1-3) : 279 - 294
[42] A relative interpolation theorem for infinitary universal Horn logic and its applications
Pynko, AP
ARCHIVE FOR MATHEMATICAL LOGIC, 2006, 45 (03) : 267 - 305
[43] YABLO'S PARADOX AND THE OMITTING TYPES THEOREM FOR PROPOSITIONAL LANGUAGES
Forster, Thomas
LOGIQUE ET ANALYSE, 2011, (215) : 323 - 326
[44] A relative interpolation theorem for infinitary universal Horn logic and its applications
Alexej P. Pynko
Archive for Mathematical Logic, 2006, 45 : 267 - 305
[45] Infinitary calculus for a restricted first-order linear temporal logic without contraction on quantified formulas
Pliuškevičius R.
Lithuanian Mathematical Journal, 1999, 39 (3) : 301 - 314
[46] ENCODING OF PSEUDOBOOLEAN MODELS FOR INFINITARY NONCLASSICAL LOGIC OF TRANSFINITE ORDER
TAUTS, A
SIBERIAN MATHEMATICAL JOURNAL, 1990, 31 (01) : 128 - 136
[47] A Transformation Scheme for Infinitary First-Order Combinatorics Presenting Computational Level of Expressiveness in Predicate Logic
Peretyat'kin, M. G.
LOBACHEVSKII JOURNAL OF MATHEMATICS, 2015, 36 (04) : 407 - 418
[48] Infinitary calculus without loop rules for restricted sequents of the first-order linear temporal logic
Pliuškevičius R.
Lithuanian Mathematical Journal, 2000, 40 (4) : 379 - 388
[49] The completeness theorem of GödelHenkin’s proof for first order logic
S. M. Srivastava
Resonance, 2001, 6 (8) : 60 - 71
[50] First-Order Modal Logic: Frame Definability and a Lindstrom Theorem
Zoghifard, R.
Pourmahdian, M.
STUDIA LOGICA, 2018, 106 (04) : 699 - 720

← 1 2 3 4 5 →