scientific article; zbMATH DE number 4007714

MaRDI QIDQ3757388zbMATH OpenFDO

Authors S. S. Goncharov

Publication date 1985

zbMATH Keywords

algebraic specificationsfirst-order implicational specifications of data typesnonstandard recursive models of Peano arithmeticprogram synthesis

Mathematics Subject Classification ID

Nonstandard models of arithmetic (03H15) Data structures (68P05) Abstract data types; algebraic specification (68Q65)

Recommendations

• A means for the structural synthesis of programs
• First-order specifications of programmable data types
• Weak monadic theories of the second order as a basis for creating data specification languages
• scientific article; zbMATH DE number 4145878
• scientific article; zbMATH DE number 4187806

Cited in

(13)

• On positive enumarated models
• Homomorphisms onto negative algebras
• The number of \(Q\)-congruences in positive algebras
• Estimating the execution complexity of logical specifications based on context-free grammars
• Structures of degrees of negative representations of linear orders
• Computably separable models
• Nonconstructive negative algebras with finiteness conditions
• Computability and universal determinability of negatively representable models
• scientific article; zbMATH DE number 604371 (Why is no real title available?)
• scientific article; zbMATH DE number 7561623 (Why is no real title available?)
• Separable algorithmic representations of classical systems and their applications
• Finite logical specifications of effectively separable data models
• Defining algorithmically presented structures in first order logic

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