Arithmetic complexity of first-order definable subsets of recursive Boolean algebras

MaRDI QIDQ1284381zbMATH OpenFDO

Authors S. Yu. Podzorov

Publication date 26 April 1999

Published in Siberian Advances in Mathematics (Search for Journal in Brave)

zbMATH Keywords

arithmetic complexityarithmetic hierarchydense Boolean algebrasprime Boolean algebrasrecursive Boolean algebrassaturated Boolean algebras

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Recommendations

• Publication:4936685
• scientific article; zbMATH DE number 5267925
• Arithmetical definability and computational complexity
• DEFINABILITY OF RECURSIVELY ENUMERABLE SETS IN ABSTRACT COMPUTATIONAL COMPLEXITY THEORY
• Definable Subsets of Polynomial-Time Algebraic Structures
• On arithmetic complexity of certain constructive logics
• The Exact Complexity of the First-Order Logic Definability Problem
• Arithmetic complexity, Kleene closure, and formal power series
• Arithmetic complexity of the predicate logics of certain complete arithmetic theories
• On arithmetic complexity of some constructive logics

Cited in

(3)

• scientific article; zbMATH DE number 1396733 (Why is no real title available?)
• scientific article; zbMATH DE number 5267925 (Why is no real title available?)
• Arithmetic hierarchy and ideals of enumerated Boolean algebras

This page was built for publication: Arithmetic complexity of first-order definable subsets of recursive Boolean algebras

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