Computability, complexity, logic. Transl. from the German

zbMath0669.68002MaRDI QIDQ1187648

Egon Börger

Publication date: 17 September 1992

Published in: Studies in Logic and the Foundations of Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

03D35: Undecidability and degrees of sets of sentences

03-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations

03D15: Complexity of computation (including implicit computational complexity)

03F05: Cut-elimination and normal-form theorems

68-02: Research exposition (monographs, survey articles) pertaining to computer science

03D10: Turing machines and related notions

03D60: Computability and recursion theory on ordinals, admissible sets, etc.

03Dxx: Computability and recursion theory

Related Items

A finitely axiomatizable undecidable equational theory with recursively solvable word problems, A note on the model-theoretic semantics of fuzzy logic programming for dealing with inconsistency, Free objects and equational deduction for partial conditional specifications, Termination proofs by multiset path orderings imply primitive recursive derivation lengths, Abstract state machines: a unifying view of models of computation and of system design frameworks