Name
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, ${\left ( \prod \bigcup \sum\right )}^{0}_{n}$ and fu... |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1093/logcom/exl006 | Journal of Logic and Computation |
Keywords | Field | DocType |
Institution,elementary morphism,elementary chain property | Discrete mathematics,T-norm fuzzy logics,Łukasiewicz logic,Algorithm,Rewriting,Classical logic,Monoidal t-norm logic,Mathematics | Journal |
Volume | Issue | ISSN |
16 | 6 | 0955-792X |
Citations | PageRank | References |
7 | 0.47 | 19 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Găină | 1 | 42 | 5.30 |
| Andrei Popescu | 2 | 454 | 40.04 |