BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Graph explorer

Computable paradoxical decompositions

We prove a computable version of Hall's Harem Theorem and apply it to computable versions of Tarski's alternative theorem.

5 nodes4 linksoverview previewComputable paradoxical decompositions
SearchCollections
5 nodes4 links
Computable paradoxical decompositions5 visible / 5 total nodes / 5 links
Co-authorshipAuthorshipAuthorshipTopic signalTopic signalWComputable paradoxical decompos...preprint / 2022AKarol DudaResearcherAAleksander IvanovResearcherTmath.GR2651 worksTmath.LO1661 works
PaperSignal 104 links

Computable paradoxical decompositions

preprint / 2022

Open

Personal maps

Sign in to save graph views

Saved views keep the query, focus and filters attached to this map.

Sign in

Public snapshots

1 shared view(s)