No label defined (Q3819964)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4092732
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4092732

      Statements

      1987
      0 references
      logical \(\Sigma\)-programs
      0 references
      positive inductive definitions
      0 references
      logical calculus
      0 references
      lists
      0 references
      first-order theory
      0 references
      operational semantics
      0 references
      0 references
      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.
      0 references

      Identifiers