✦ LIBER ✦

Computational inductive definability

✍ Scribed by Dexter Kozen

Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 217 KB
Volume: 126
Category: Article
ISSN: 0168-0072
DOI: 10.1016/j.apal.2003.10.013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Inductive definability in formal languag

Inductive definability in formal language theory

✍ P.F. Schuler 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 690 KB

DEFINABILITY OF RECURSIVELY ENUMERABLE S

DEFINABILITY OF RECURSIVELY ENUMERABLE SETS IN ABSTRACT COMPUTATIONAL COMPLEXITY THEORY

✍ Robert E. Byerly 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 330 KB

Defining Deduction, Induction, and Valid

Defining Deduction, Induction, and Validity

✍ Jan J. Wilbanks 📂 Article 📅 2009 🏛 Springer Netherlands 🌐 English ⚖ 204 KB

Deductively Definable Logics of Inductio

Deductively Definable Logics of Induction

✍ John D. Norton 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 643 KB

Total objects in inductively defined typ

Total objects in inductively defined types

✍ Lill Kristiansen; Dag Normann 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 254 KB

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,