Games with finitely generated structures

Adam Krawczyk; Wies{\l}aw Kubi\'s

Games with finitely generated structures

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1701.05756 v5 pith:2DWQSR3G submitted 2017-01-20 math.LO

Adam Krawczyk , Wies{l}aw Kubiś This is my paper · ORCID

classification math.LO

keywords generatedbanach-mazurfinitelyfraissegamestructuresabstractaiming

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original abstract

We study the abstract Banach-Mazur game played with finitely generated structures instead of open sets. We characterize the existence of winning strategies aiming at a single countably generated structure. We also introduce the concept of weak Fraisse classes, extending the classical Fraisse theory and revealing its relations to our Banach-Mazur game.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Remarks on weak amalgamation and large conjugacy classes in non-archimedean groups
math.LO 2019-08 conditional novelty 6.0 of 10

A generalization of Kechris-Rosendal characterizes comeager diagonal conjugacy classes in arbitrary Polish permutation groups, and ball-preserving groups of ordered ultrametric spaces are shown to have a generic eleme...

Pith tools