Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,594,392 papers from all fields of science
Search
Sign In
Create Free Account
Trakhtenbrot's theorem
Known as:
Trakhtenbrot theorem
In Logic, finite model theory, and Computability Theory, Trakhtenbrot's theorem (due to Boris Trakhtenbrot) states that the problem of validity in…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Broader (1)
Computability theory
First-order logic
Recursive set
Recursively enumerable set
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Trakhtenbrot theorem and first-order axiomatic extensions of MTL
Matteo Bianchi
2014
Corpus ID: 267898050
In 1950, B.A. Trakhtenbrot showed that the set of first-order tautologies associated to finite models is not recursively…
Expand
2014
2014
Finitely unstable theories and computational complexity
T. Kauranne
arXiv.org
2014
Corpus ID: 8444231
The complexity class $NP$ can be logically characterized both through existential second order logic $SO\exists$, as proven by…
Expand
2001
2001
A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem
Matthias Galota
,
H. Vollmer
Annual Conference for Computer Science Logic
2001
Corpus ID: 8234765
We consider the power of nondeterministic finite automata with generalized acceptance criteria and the corresponding logics. In…
Expand