✦ LIBER ✦

Computable Embeddings and Strongly Minimal Theories

✍ Scribed by J. Chisholm, J. F. Knight and S. Miller

Book ID: 124973758
Publisher: Association for Symbolic Logic
Year: 2007
Tongue: English
Weight: 893 KB
Volume: 72
Category: Article
ISSN: 0022-4812
DOI: 10.2307/27588583

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Strongly minimal countably categorical t

Strongly minimal countably categorical theories

✍ B. I. Zil'ber 📂 Article 📅 1981 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 985 KB

Almost Strongly Minimal Theories. I

✍ John T. Baldwin 📂 Article 📅 1972 🏛 Association for Symbolic Logic 🌐 English ⚖ 401 KB

Almost Strongly Minimal Theories. II

✍ John T. Baldwin 📂 Article 📅 1972 🏛 Association for Symbolic Logic 🌐 English ⚖ 233 KB

On two problems of turing complexity for

On two problems of turing complexity for strongly minimal theories

✍ S. S. Goncharov 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 180 KB

Isomorphic Embeddings and Strongly Addit

Isomorphic Embeddings and Strongly Additive Measures

✍ Paul Lewis; Kimberly Muller 📂 Article 📅 2003 🏛 Springer Vienna 🌐 English ⚖ 129 KB

Minimal embeddings in the projective pla

Minimal embeddings in the projective plane

✍ Randby, Scott P. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

We show that if G is a graph embedded on the projective plane in such a way that each noncontractible cycle intersects G at least n times and the embedding is minimal with respect to this property (i.e., the representativity of the embedding is n), then G can be reduced by a series of reduction oper