Σ-programming

DOI10.1090/TRANS2/142/10MaRDI QIDQ3824396zbMATH OpenOpenAlexFDO

Authors D. I. Sviridenko, S. S. Goncharov

Publication date 1989

Published in American Mathematical Society Translations: Series 2 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/trans2/142/10

zbMATH Keywords

first-order languagerecursive functionsSigma-formulas

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic on admissible sets (03C70) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) General topics in the theory of software (68N01) Abstract data types; algebraic specification (68Q65)

Cited in

(11)

• Conditional terms in semantic programming
• Recursive terms in semantic programming
• \(\Sigma\)-definability in hereditarily finite superstructures and computable analysis
• Towards semantic document modelling of business processes
• On termination of transactions over semantic document models
• On decidability of list structures
• Sigma*
• scientific article; zbMATH DE number 4007715 (Why is no real title available?)
• scientific article; zbMATH DE number 1191243 (Why is no real title available?)
• Definable Subsets of Polynomial-Time Algebraic Structures
• Some questions on polynomially computable representations for generating grammars and Backus-Naur forms

This page was built for publication: Σ-programming

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