✦ LIBER ✦

Algorithmic uses of the Feferman–Vaught Theorem

✍ Scribed by J.A. Makowsky

Book ID: 108054551
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 575 KB
Volume: 126
Category: Article
ISSN: 0168-0072
DOI: 10.1016/j.apal.2003.11.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Non-Boolean Version of Feferman-Vaught

A Non-Boolean Version of Feferman-Vaught's Theorem

✍ R. Lavendhomme; Th. Lucas 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 623 KB

COMER 11.1. MAKSFIELD [BJ) has lead t o consider t'liat theorem as giving a relation between global sections of a sheaf and its local propert'ies. The aim of t>liis paper is to shon-that similar relations hold for cert'ain sheaves. to be called liere "niellon-". over other types of spaces. Our niain

Some supplements to Feferman–Vaught rela

Some supplements to Feferman–Vaught related to the model theory of adeles

✍ Derakhshan, Jamshid; Macintyre, Angus 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 634 KB

The First Order Properties of Products o

The First Order Properties of Products of Algebraic Systemsby S. Feferman; R. L. Vaught

✍ Review by: Carol Karp 📂 Article 📅 1967 🏛 Association for Symbolic Logic 🌐 English ⚖ 206 KB

Applications of Vaught Sentences and the

Applications of Vaught Sentences and the Covering Theorem

✍ Victor Harnik and Michael Makkai 📂 Article 📅 1976 🏛 Association for Symbolic Logic 🌐 English ⚖ 397 KB

An algorithmic proof of the polyhedral d

An algorithmic proof of the polyhedral decomposition theorem

✍ Mustafa Akgül 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 504 KB

On the Markov theorem on algorithmic non

On the Markov theorem on algorithmic nonrecognizability of manifolds

✍ M. A. Stan’ko 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 62 KB