Definability by programs in first-order structures
type: Item
instance of: scholarly article
title: Definability by programs in first-order structures
zbMATH Open document ID: 0499.68009
DOI: 10.1016/0304-3975(83)90013-0
author: Assaf Kfoury
published in: Theoretical Computer Science
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 03C99
Mathematics Subject Classification ID: 03D99
Mathematics Subject Classification ID: 68Q65
zbMATH DE Number: 3787993
zbMATH Keywords: relational structure
zbMATH Keywords: computational complexity
zbMATH Keywords: program semantics
zbMATH Keywords: verification
zbMATH Keywords: data type specification
zbMATH Keywords: unwind property
zbMATH Keywords: truth-table property
zbMATH Keywords: recursive programs
zbMATH Keywords: flowchart
zbMATH Keywords: recursion theory
zbMATH Keywords: model theory
zbMATH Keywords: pebble game
MaRDI profile type: Publication
full work available at URL: 0304-3975(83)90013-0
OpenAlex ID: W2088171493
cites work: Interpolation theorems for program schemata
cites work: Program Schemes with Pushdown Stores
cites work: An observation on time-storage trade off
cites work: On Classes of Program Schemata
cites work: Model theory
cites work: Algorithmic properties of structures
cites work: Q4074367
cites work: Generalized galois theory and its application to complexity
cites work: Q5625129
cites work: Program schemes, recursion schemes, and formal languages
cites work: Q3939207
cites work: On formalised computer programs
cites work: Definability in dynamic logic
cites work: Q5573961
cites work: Q4088800
cites work: Q3966122
description: scientific article; zbMATH DE number 3787993