𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A characterization of retracts in certain Fraïssé limits

✍ Scribed by Igor Dolinka


Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
150 KB
Volume
58
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

Assuming certain conditions on a class \documentclass{article}\usepackage{amssymb,amsmath,mathrsfs}\begin{document}\pagestyle{empty}$\mathscr{C}$\end{document} of finitely generated first‐order structures admitting the model‐theoretical construction of a Fraïssé limit, we characterize retracts of such limits as algebraically closed structures in a class naturally related to \documentclass{article}\usepackage{amssymb,amsmath,mathrsfs}\begin{document}\pagestyle{empty}$\mathscr{C}$\end{document}. In this way we generalize an earlier description of retracts of the countably infinite random graph.


📜 SIMILAR VOLUMES


A Characterization of Certain Loop Lie A
✍ J.Marshall Osborn; Kaiming Zhao 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 113 KB

In this paper, we study Z × Z-graded Lie algebras A = i j∈Z A i j with dim A i j ≤ 1 satisfying (I) dim A ±1 0 = dim A 0 ±1 = 1, and A is generated by A ±1 0 A 0 ±1 ; (II) i∈Z A 0 j sl 2 ; (III) A -1 0 A 1 0 = 0, and adA ±1 0 act faithfully on j∈Z A j 1 . We show that A is necessarily isomorphic

A circular-arc characterization of certa
✍ S. K. Stueckle; B. L. Piazza; R. D. Ringeisen 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 268 KB

## Abstract In this paper we give a construction that produces exactly those graphs having maximum rectilinear crossing number equal to the subthrackle bound. We then prove a theorem characterizing these graphs in terms of proper circular‐arc graphs. © 1996 John Wiley & Sons, Inc.

A Characterization of a Certain Class of
✍ U. Feiste 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 226 KB

## Abstract Compact metric spaces χ of such a kind, that 𝔹~__f__~ =𝔹(__X__), are characterized, 𝔹(__X__) is the σ‐field of BOREL sets and 𝔹~__f__~(__X__) is the field generated by all open subset of __X__. Our main result is Theorem 5: If χ is a compact metric space, then the following conditions a

A combinatorial characterization of cert
✍ Tran van Trung 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 303 KB

## Abstract A new lower bound on the size of ϵ‐almost strongly universal~2~ classes of hash functions has recently been obtained by Stinson [8]. In this article we present a characterization of ϵ − ASU~2~ classes of hash functions meeting the Stinson bound in terms of combinatorial designs. © 1994