Halting and Equivalence of Program Schemes in Models of Arbitrary Theories
From MaRDI portal
Publication:3586015
DOI10.1007/978-3-642-15025-8_22zbMath1287.03026OpenAlexW1760218648MaRDI QIDQ3586015
Publication date: 3 September 2010
Published in: Fields of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15025-8_22
Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Turing machines and related notions (03D10) Other Turing degree structures (03D28)
Cites Work