Skip Navigation


Journal of Logic and Computation Advance Access originally published online on August 12, 2006
Journal of Logic and Computation 2006 16(6):713-735; doi:10.1093/logcom/exl006
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
16/6/713    most recent
exl006v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Gaina, D.
Right arrow Articles by Popescu, A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2006. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Original Articles

An Institution-independent Generalization of Tarski's Elementary Chain Theorem

Daniel Gaina and Andrei Popescu

Department of Fundamentals of Computer Science, Faculty of Mathematics, University of Bucharest.

Email: gaina_daniel{at}yahoo.com; uuomul{at}yahoo.com


  Abstract

We prove an institutional version of Tarski's elementary chain theorem applicable to a whole plethora of ‘first-order-accessible’ logics, which are, roughly speaking, logics whose sentences can be constructed from atomic formulae by means of classical first-order connectives and quantifiers. These include the unconditional equational, positive, Formula and full first-order logics, as well as less conventional logics, used in computer science, such as hidden or rewriting logic.

Keywords: Institution; elementary morphism; elementary chain property


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.