Unbounded program memory adds to the expressive power of first-order programming logic

DOI10.1016/S0019-9958(84)80020-0zbMath0599.68034OpenAlexW2062949454MaRDI QIDQ3735076

Jerzy Tiuryn

Publication date: 1984

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(84)80020-0

zbMATH Keywords

logic of programsfirst-order definability in the algebra of finite binary trees

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01)

Related Items

Some relationships between logics of programs and complexity theory, An infinite pebble game and applications, Computational inductive definability, Definability with bounded number of bound variables