Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Post's theorem · Vinony

Home
Computability theory
Post's theorem

🌐English

English Français Português Русский فارسی 日本語

EntityQ3007384· pop 8· linked from 18 articles

Post's theorem

Theorem in computability theory

Available in 8 languages

Français
日本語
Русский
Português
Czech
Ukrainian
فارسی

via Wikidata sitelinks · CC0

Connections

first-order logic

Categories

Computability theory Mathematical logic hierarchies Theorems in the foundations of mathematics

well-formed formula

Entity

International Standard Book Number

computability theory

indicator function

halting problem

universal quantification

decision problem

undecidable problem

prenex normal form

recursively enumerable set

Sign in to save

What links here18 pages

computability theory

Kripke semantics

reverse mathematics

arithmetical hierarchy

Tarski's undefinability theorem

recursively enumerable language

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

computability theory

Entitydist 0.37

Turing reduction

Entitydist 0.40

Entitydist 0.40

computational hardness assumption

Entitydist 0.45

Entitydist 0.47

Category:Theorems in computational complexity theory

Entitydist 0.50

Category:Mathematical theorems in theoretical computer science

Entitydist 0.51

Turing completeness

Entitydist 0.52

strong NP-completeness

Entitydist 0.53

descriptive complexity theory

Entitydist 0.54

Entitydist 0.55

Entitydist 0.56