Complexity of Ehrenfeucht models
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1556962
- Putnam's theorem on the complexity of models
- Estimation of the algorithmic complexity of classes of computable models
- The epsilon calculus and Herbrand complexity
- Complexity ranks of countable models
- Polynomial time computations in models of ET
- Computation Models for Parameterized Complexity
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Problems, models and complexity. I: Theory
- Measures of -complexity
Cites work
- A decidable Ehrenfeucht theory with exactly two hyperarithmetic models
- Complexity of Categorical Theories with Computable Models
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 1936725 (Why is no real title available?)
- scientific article; zbMATH DE number 1390542 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3183991 (Why is no real title available?)
- Model theory.
- Nonarithmetical ℵ0-categorical theories with recursive models
- On complete theories with a finite number of denumerable models
- The uncountable spectra of countable theories
- Theories with recursive models
Cited in
(6)- Problems, models and complexity. II: Application to the DLSP
- Working with ARMs: Complexity results on atomic representations of Herbrand models
- A mathematical basis for egress complexity
- On the Complexity of Breaking Pseudoentropy
- Autostability of prime models under strong constructivizations
- Computing the complexity for Schelling segregation models
This page was built for publication: Complexity of Ehrenfeucht models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546055)
