✦ LIBER ✦

Circumscription and implicit definability

✍ Scribed by Jon Doyle

Publisher: Springer Netherlands
Year: 1985
Tongue: English
Weight: 887 KB
Volume: 1
Category: Article
ISSN: 0168-7433
DOI: 10.1007/bf00244277

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Permutations and implicit definability

✍ A. S. Morozov 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 798 KB

Intuitionistic logic and implicit defina

Intuitionistic logic and implicit definability

✍ Larisa Maksimova 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 142 KB

Defining ‘people-centredness’: making th

Defining ‘people-centredness’: making the implicit explicit

✍ Brian Williams; Gordon Grant 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB

Abstract minimality and circumscription

✍ Churn Jung Liau; Bertrand I-peng Lin 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 768 KB

In this paper, we present an alternative approach to the generalization of circumscription. Traditionally, the generalization of circumscription involves the change of ordering among models, while in the present study we only try to generalize the minimality criteria of models. We define the notion

Definability degrees

✍ Sy D. Friedman 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 60 KB

## Abstract We establish the equiconsistency of a simple statement in definability theory with the failure of the GCH at all infinite cardinals. The latter was shown by Foreman and Woodin ([2]) to be consistent, relative to the existence of large cardinals. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA,

Closed-world databases and circumscripti

Closed-world databases and circumscription

✍ Vladimir Lifschitz 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 250 KB

We compare two forms of non-monotonic reasoning: closed-worm evaluation of queries in databases and circumscription. For closed E-saturated databases we show that the closed-world assumption, if consistent, is equivalent to circumscribing all predicates in the database.