First-order approximation of algorithmic theories

DOI10.1016/0304-3975(86)90097-6MaRDI QIDQ1095655zbMATH OpenOpenAlexFDO

Authors Wiktor Dańko

Publication date 1986

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(86)90097-6

zbMATH Keywords

model theoryalgorithmic theoryfirst-order languagealgorithmic logiccoding diverging computations

Mathematics Subject Classification ID

Logic in computer science (03B70) Basic properties of first-order languages and structures (03C07) Abstract data types; algebraic specification (68Q65)

Recommendations

• scientific article; zbMATH DE number 23020
• scientific article; zbMATH DE number 3858395
• Elementary approximation theory
• First order theories for partial models
• scientific article; zbMATH DE number 3892594

Cites work

• scientific article; zbMATH DE number 3131480 (Why is no real title available?)
• scientific article; zbMATH DE number 3959378 (Why is no real title available?)
• scientific article; zbMATH DE number 3959379 (Why is no real title available?)
• scientific article; zbMATH DE number 3688681 (Why is no real title available?)
• scientific article; zbMATH DE number 3688691 (Why is no real title available?)
• scientific article; zbMATH DE number 3708360 (Why is no real title available?)
• scientific article; zbMATH DE number 3558938 (Why is no real title available?)
• scientific article; zbMATH DE number 3558940 (Why is no real title available?)
• scientific article; zbMATH DE number 3597842 (Why is no real title available?)
• scientific article; zbMATH DE number 3601100 (Why is no real title available?)
• scientific article; zbMATH DE number 3602669 (Why is no real title available?)
• scientific article; zbMATH DE number 3801514 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3198011 (Why is no real title available?)
• First-order dynamic logic

Cited in

(6)

• A Characterization of Alternating Log Time by First Order Functional Programs
• Towards an Axiomatization of Simple Analog Algorithms
• Algorithmic problems and hierarchies of first-order languages
• Elementary approximation theory
• Algorithmic Pirogov-Sinai theory
• The collapse theorem for theories ofI-reducible algebraic systems

This page was built for publication: First-order approximation of algorithmic theories

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