✦ LIBER ✦

Learnability and Definability in Trees and Similar Structures

✍ Scribed by Martin Grohe; Gy. Turán

Publisher: Springer
Year: 2004
Tongue: English
Weight: 382 KB
Volume: 37
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-003-1112-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Abstraction and definability in semantic

Abstraction and definability in semantically closed structures

✍ Timothy McCarthy 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 605 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

Interchanging branches and similarity in

Interchanging branches and similarity in a tree

✍ I. Krasikov 📂 Article 📅 1991 🏛 Springer Japan 🌐 English ⚖ 725 KB

Trees and monotone structures

✍ T. E. Hays 📂 Article 📅 1976 🏛 Springer 🌐 English ⚖ 294 KB

Definability and nondefinability results

Definability and nondefinability results for certain o-minimal structures

✍ Hassan Sfouli 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

Organization and learnability in compute

Organization and learnability in computer languages

✍ T.R.G. Green; S.J. Payne 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 712 KB

A number of"guiding principles" have been put forward for the design of easily-learnt languages, but little attention has been given to the overall structure or organization of the language. We propose a new principle, that of consistency between language rules, and show that this "organizing" princ