An institution-independent generalization of Tarski's elementary chain theorem

Daniel Gǎinǎ; Andrei Popescu

doi:10.1093/logcom/exl006

An institution-independent generalization of Tarski's elementary chain theorem

Daniel Gǎinǎ, Andrei Popescu

Research output: Contribution to journal › Article › peer-review

11 Citations (Scopus)

Abstract

We prove an institutional version of Tarski's elementary chain theorem applicable to a whole plethora of 'first-orderaccessible' 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, (π ∪ ∑)_n ⁰ and full first-order logics, as well as less conventional logics, used in computer science, such as hidden or rewriting logic.

Original language	English
Pages (from-to)	713-735
Number of pages	23
Journal	Journal of Logic and Computation
Volume	16
Issue number	6
DOIs	https://doi.org/10.1093/logcom/exl006
Publication status	Published - Dec 2006
Externally published	Yes

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Software
Arts and Humanities (miscellaneous)
Hardware and Architecture
Logic

Access to Document

10.1093/logcom/exl006

Cite this

@article{6e7c8a4a3a684d9e9ba9a0205c5bf16c,

title = "An institution-independent generalization of Tarski's elementary chain theorem",

abstract = "We prove an institutional version of Tarski's elementary chain theorem applicable to a whole plethora of 'first-orderaccessible' 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, (π ∪ ∑)n 0 and full first-order logics, as well as less conventional logics, used in computer science, such as hidden or rewriting logic.",

author = "Daniel Gǎinǎ and Andrei Popescu",

year = "2006",

month = dec,

doi = "10.1093/logcom/exl006",

language = "English",

volume = "16",

pages = "713--735",

journal = "Journal of Logic and Computation",

issn = "0955-792X",

publisher = "Oxford University Press",

number = "6",

}

TY - JOUR

T1 - An institution-independent generalization of Tarski's elementary chain theorem

AU - Gǎinǎ, Daniel

AU - Popescu, Andrei

PY - 2006/12

Y1 - 2006/12

N2 - We prove an institutional version of Tarski's elementary chain theorem applicable to a whole plethora of 'first-orderaccessible' 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, (π ∪ ∑)n 0 and full first-order logics, as well as less conventional logics, used in computer science, such as hidden or rewriting logic.

AB - We prove an institutional version of Tarski's elementary chain theorem applicable to a whole plethora of 'first-orderaccessible' 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, (π ∪ ∑)n 0 and full first-order logics, as well as less conventional logics, used in computer science, such as hidden or rewriting logic.

UR - http://www.scopus.com/inward/record.url?scp=33947621089&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33947621089&partnerID=8YFLogxK

U2 - 10.1093/logcom/exl006

DO - 10.1093/logcom/exl006

M3 - Article

AN - SCOPUS:33947621089

SN - 0955-792X

VL - 16

SP - 713

EP - 735

JO - Journal of Logic and Computation

JF - Journal of Logic and Computation

IS - 6

ER -

An institution-independent generalization of Tarski's elementary chain theorem

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this