✦ LIBER ✦

Logical definability of fixed points

✍ Scribed by André Arnold

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 940 KB
Volume: 61
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(88)90129-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Logical Definability of Counting Functio

Logical Definability of Counting Functions

✍ Kevin J. Compton; Erich Grädel 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 797 KB

The relationship between counting functions and logical expressibility is explored. The most well studied class of counting functions is \*P, which consists of the functions counting the accepting computation paths of a nondeterministic polynomial-time Turing machine. For a logic L, \*L is the class

SUPERVALUATION FIXED-POINT LOGICS OF TRU

SUPERVALUATION FIXED-POINT LOGICS OF TRUTH

✍ Philip Kremer; Alasdair Urquhart 📂 Article 📅 2008 🏛 Springer Netherlands 🌐 English ⚖ 373 KB

Monadic logical definability of nondeter

Monadic logical definability of nondeterministic linear time

✍ É. Grandjean; F. Olive 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 602 KB

Explicit Fixed Points in Interpretabilit

Explicit Fixed Points in Interpretability Logic

✍ Dick Jongh; Albert Visser 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 496 KB

The problem of Uniqueness and Explicit Definability of Fixed Points for Interpretability Logic is considered. It turns out that Uniqueness is an immediate corollary of a theorem of Smoryfiski.

Fixed-Point Logics and Solitaire Games

✍ Dietmar Berwanger; Erich Grädel 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 288 KB

Fixed points in the propositional nonmon

Fixed points in the propositional nonmonotonic logic

✍ Grigory F. Shvarts 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 317 KB

We give an explicit description of fixed points for propositional theories in the nonmonotonic logic of McDermott and Doyle. Using this description we refute two claims from McDermott and Doyle's original paper.