Premium
An Omitting Types Theorem for first order logic with infinitary relation symbols
Author(s) -
Ahmed Tarek Sayed,
Samir Basim
Publication year - 2007
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.200610050
Subject(s) - mathematics , extension (predicate logic) , order (exchange) , relation (database) , discrete mathematics , second order logic , pure mathematics , calculus (dental) , higher order logic , computer science , artificial intelligence , medicine , dentistry , finance , economics , description logic , programming language , database
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. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom