✦ LIBER ✦

Abstraction and definability in semantically closed structures

✍ Scribed by Timothy McCarthy

Publisher: Springer Netherlands
Year: 1985
Tongue: English
Weight: 605 KB
Volume: 14
Category: Article
ISSN: 0022-3611
DOI: 10.1007/bf00249366

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Learnability and Definability in Trees a

Learnability and Definability in Trees and Similar Structures

✍ Martin Grohe; Gy. Turán 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 382 KB

A Companion to Philosophical Logic || Lo

A Companion to Philosophical Logic || Logic in Finite Structures: Definability, Complexity, and Randomness

✍ Jacquette, Dale 📂 Article 📅 2006 🏛 Blackwell Publishing Ltd 🌐 English ⚖ 132 KB

Edited By Dale Jacquette. Includes Bibliographical References And Index.

Semantic hierarchies and abstractions in

Semantic hierarchies and abstractions in conceptual schemata

✍ Dirk Vermeir 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 731 KB

Interpolation and definability in abstra

Interpolation and definability in abstract logics

✍ Finn V. Jensen 📂 Article 📅 1974 🏛 Springer Netherlands 🌐 English ⚖ 277 KB

Definability and automorphisms in abstra

Definability and automorphisms in abstract logics

✍ Xavier Caicedo 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 160 KB

Structure and definability in general bo

Structure and definability in general bounded arithmetic theories

✍ Chris Pollett 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 399 KB

The bounded arithmetic theories R i 2 ; S i 2 , and T i 2 are closely connected with complexity theory. This paper is motivated by the questions: what are the b i+1 -deÿnable multifunctions of R i 2 ? and when is one theory conservative over another? To answer these questions we consider theories Ri