scientific article; zbMATH DE number 934778

MaRDI QIDQ4895324zbMATH OpenFDO

Authors Mikhaĭl G. Peretyat'kin

Publication date 14 October 1996

zbMATH Keywords

complexity of semantic classes of sentencesexpressive powerfinitely axiomatizableLindenbaum algebrarecursive isomorphismrecursively axiomatizable

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Model theory (03Cxx)

Cited in

(9)

• Degree spectra and computable dimensions in algebraic structures
• Finiteness and the falsification by fellow traveler property.
• Virtual algebraic isomorphisms between predicate calculi of finite rich signatures
• A.D. Taimanov and model theory in Kazakhstan
• A transformation scheme for infinitary first-order combinatorics presenting computational level of expressiveness in predicate logic
• Completeness and categoricity (in power): formalization without foundationalism
• First-order combinatorics and model-theoretical properties that can be distinct for mutually interpretable theories
• FINITENESS RESULTS IN DESCENT THEORY
• scientific article; zbMATH DE number 1357400 (Why is no real title available?)

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 Q4895324)