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

Analysis of algorithms and problem complexity (68Q25) Undecidability and degrees of sets of sentences (03D35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Complexity of computation (including implicit computational complexity) (03D15) Cut-elimination and normal-form theorems (03F05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Computability and recursion theory (03Dxx)

Related Items

Time bounded rewrite systems and termination proofs by generalized embedding, 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, A finitely axiomatizable undecidable equational theory with recursively solvable word problems, Termination proofs by multiset path orderings imply primitive recursive derivation lengths, Computation on structures. Behavioural theory, logic, complexity