A transformation scheme for infinitary first-order combinatorics presenting computational level of expressiveness in predicate logic

DOI10.1134/S1995080215040137zbMath1386.03039OpenAlexW2203152860MaRDI QIDQ266237

Mikhaĭl G. Peretyat'kin

Publication date: 13 April 2016

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995080215040137

zbMATH Keywords

first-order logicTuring computabilityc.e. Boolean algebrafinitely axiomatizable theoryincomplete theorymodel-theoretic propertyTarski-Lindenbaum algebra

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Basic properties of first-order languages and structures (03C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Arithmetic hierarchy and ideals of enumerated Boolean algebras
• The Tarski-Lindenbaum Algebra of the Class of All Strongly Constructivizable Countable Saturated Models

This page was built for publication: A transformation scheme for infinitary first-order combinatorics presenting computational level of expressiveness in predicate logic