The unwind property in certain algebras

DOI10.1016/S0019-9958(81)90163-7zbMath0491.03018MaRDI QIDQ3952091

Paweł Urzyczyn

Publication date: 1981

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

zbMATH Keywords

computabilityreal closed fieldsalgebraically closed fieldsterm algebrarecursive realsprogram schemescomputable functioncomputable predicateflow-chart schemes with countersgeneric points of algebraic varietiesopen formulas in a first-order languagerecursive schemes with counters

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Applications of computability and recursion theory (03D80) General topics in the theory of software (68N01) Algebraic structures (08A99) Varieties (08B99) Real and complex fields (12D99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items

Necessary and sufficient conditions for the universality of programming formalisms, Some questions about expressiveness and relative completeness in Hoare's logic