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

DOI10.1134/S1995080215040137zbMATH Open1386.03039OpenAlexW2203152860MaRDI QIDQ266237FDOQ266237

Authors: 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

Recommendations

• scientific article; zbMATH DE number 4037817
• Combinatorics of first order structures and propositional proof systems
• On the definitional embeddability of the combinatory logic theory into the first-order predicate calculus
• Transformations of logic programs on infinite lists
• Translation of first order formulas into ground formulas via a completion theory
• Systems of illative combinatory logic complete for first-order propositional and predicate calculus
• A formal system of first-order predicate calculus with infinitely long expressions
• Formalized proofs of the infinity and normal form predicates in the first-order theory of rewriting
• An algorithm for dual transformation in first-order logic
• Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus

zbMATH Keywords

c.e. Boolean algebrafinitely axiomatizable theoryfirst-order logicincomplete theorymodel-theoretic propertyTarski-Lindenbaum algebraTuring computability

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Tarski-Lindenbaum algebra of the class of all strongly constructivizable countable saturated models
• Title not available (Why is that?)
• Arithmetic hierarchy and ideals of enumerated Boolean algebras

Cited In (3)

• Combinatorial expressions and lower bounds
• Composition under distributive natural transformations: or, when predicate abstraction is impossible
• Title not available (Why is that?)

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

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