✦ LIBER ✦

Inductive definitions over finite structures

✍ Scribed by Daniel Leivant

Book ID: 113383934
Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 732 KB
Volume: 89
Category: Article
ISSN: 0890-5401
DOI: 10.1016/0890-5401(90)90006-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Inductive definitions over a predicative

Inductive definitions over a predicative arithmetic

✍ Stanley S. Wainer; Richard S. Williams 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 200 KB

Δ11-Good Inductive Definitions Over The

Δ11-Good Inductive Definitions Over The Continuum

✍ Jacques Grassin 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 318 KB

Modal Logic over Finite Structures

✍ Eric Rosen 📂 Article 📅 1997 🏛 Springer Netherlands 🌐 English ⚖ 136 KB

Arithmetical definability over finite st

Arithmetical definability over finite structures

✍ Troy Lee 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

## Abstract Arithmetical definability has been extensively studied over the natural numbers. In this paper, we take up the study of arithmetical definability over finite structures, motivated by the correspondence between uniform AC^0^ and FO(PLUS, TIMES). We prove finite analogs of three classic r

Structuring Metatheory on Inductive Defi

Structuring Metatheory on Inductive Definitions

✍ David Basin; Seán Matthews 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 149 KB

Verifying definite iteration over data s

Verifying definite iteration over data structures

✍ Stavely, A.M. 📂 Article 📅 1995 🏛 IEEE 🌐 English ⚖ 917 KB