scientific article; zbMATH DE number 4092732
A logical calculus NAT is defined whose language consists only of closed \(\Sigma\)-formulas over lists with atoms from any first-order model \({\mathfrak M}\). The main result states that for every closed \(\Sigma\)- formula A relativized to some \(\Sigma\)-program S over LISTS(\({\mathfrak M})\) [cf. \textit{S. S. Goncharov} and \textit{D. I. Sviridenko}, ibid. 107, 3-29 (1985; Zbl 0628.03015)] \[ A\quad is\quad true\quad in\quad LISTS({\mathfrak M})\quad iff\quad NAT({\mathfrak M};S)\vdash A\quad iff\quad NIL({\mathfrak M},S)\vdash A\quad iff\quad GES({\mathfrak M},S)\vdash A. \] Here GES is the first-order theory of lists from op. cit., NIL is its intuitionistic version and \(S\rightleftharpoons \{P_ i(\bar x_ i)\) \underbar{def} \(A_ i(\bar x_ i,\bar P)\), \(A_ i\quad -\quad \Sigma -formulas\) positive in the predicates \(\bar P,\) \(i\leq n\}\). This approach is considered as construction of an operational semantics to \(\Sigma\)- programs.
- Calculability and logic programs
- scientific article; zbMATH DE number 4139721 (Why is no real title available?)
- scientific article; zbMATH DE number 4045728 (Why is no real title available?)
- scientific article; zbMATH DE number 4057488 (Why is no real title available?)
- scientific article; zbMATH DE number 4106288 (Why is no real title available?)
- THE Σλ-CALCULUS AND DERIVED PROGRAM FORMS
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 Q3819964)