scientific article; zbMATH DE number 4007714

zbMATH Open0621.68020MaRDI QIDQ3757388FDOQ3757388

S. S. Goncharov

Publication date: 1985

Title of this publication is not available (Why is that?)

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
• Publication:3476793
• Publication:5752570

zbMATH Keywords

algebraic specificationsprogram synthesisfirst-order implicational specifications of data typesnonstandard recursive models of Peano arithmetic

Mathematics Subject Classification ID

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

Cited In (11)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Separable algorithmic representations of classical systems and their applications
• Homomorphisms onto negative algebras
• The number of \(Q\)-congruences in positive algebras
• Computably separable models
• On positive enumarated models
• Structures of degrees of negative representations of linear orders
• Computability and universal determinability of negatively representable models
• Nonconstructive negative algebras with finiteness conditions
• Estimating the execution complexity of logical specifications based on context-free grammars

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)