scientific article; zbMATH DE number 1556962

MaRDI QIDQ4526735zbMATH OpenFDO

Authors Gábor Sági

Publication date 26 July 2001

zbMATH Keywords

complexity classcomplexity of axiom systemsfirst-order theory

Mathematics Subject Classification ID

Basic properties of first-order languages and structures (03C07) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• Publication:4938557
• Complexity of categorical theories with computable models
• Complexity of Categorical Theories with Computable Models
• Complexity of categorical theories with computable models
• Putnam's theorem on the complexity of models
• Applications of Kolmogorov complexity to computable model theory
• A finite-model-theoretic view on propositional proof complexity
• Complexity of the universal theory of modal algebras
• On the complexity of modal axiomatisations over many-dimensional structures
• scientific article; zbMATH DE number 1936725

Cited in

(5)

• Complexity of Ehrenfeucht models
• The model-theoretic ordinal analysis of theories of predicative strength
• Applications of Kolmogorov complexity to computable model theory
• Existence of optimal ultrafilters and the fundamental complexity of simple theories
• Complexity ranks of countable models

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4526735)