◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Dmitriy Zhuk

1 paper here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • math.LO1

identity via Semantic Scholar / OpenAlex

collaborators
Showing math.LOShow all

1 paper · 1 filter

math.LO2011

The existence of a near-unanimity function is decidable

Dmitriy Zhuk

We prove that the following problem is decidable: given a finite set of relations, decide whether this set admits a near-unanimity function.

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.