Definability by programs in first-order structures

DOI10.1016/0304-3975(83)90013-0MaRDI QIDQ1171876zbMATH OpenOpenAlexFDO

Authors Assaf Kfoury

Publication date 1983

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(83)90013-0

zbMATH Keywords

verificationcomputational complexitymodel theoryprogram semanticsrecursion theoryrelational structurerecursive programsdata type specificationflowcharttruth-table propertyunwind propertypebble game

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Computability and recursion theory (03D99) Model theory (03C99)

Cites work

• scientific article; zbMATH DE number 3755841 (Why is no real title available?)
• scientific article; zbMATH DE number 3788603 (Why is no real title available?)
• scientific article; zbMATH DE number 3492141 (Why is no real title available?)
• scientific article; zbMATH DE number 3508476 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3349780 (Why is no real title available?)
• Algorithmic properties of structures
• An observation on time-storage trade off
• Definability by programs in first-order structures
• Definability in dynamic logic
• Generalized galois theory and its application to complexity
• Interpolation theorems for program schemata
• Model theory
• On Classes of Program Schemata
• On formalised computer programs
• Program Schemes with Pushdown Stores
• Program schemes, recursion schemes, and formal languages

Cited in

(9)

• On approximate and algebraic computability over the real numbers
• An infinite pebble game and applications
• ``During cannot be expressed by ``after
• Program correctness on finite fields
• The unwind property for programs with bounded memory
• Necessary and sufficient conditions for the universality of programming formalisms
• Weakly expressive models for Hoare logic
• Some questions about expressiveness and relative completeness in Hoare's logic
• Definability by programs in first-order structures

This page was built for publication: Definability by programs in first-order structures

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