scientific article

zbMATH Open0649.03028MaRDI QIDQ3794169

Egon Börger

Publication date: 1986

Title of this publication is not available (Why is that?)

zbMATH Keywords

truthsemanticstheory of computationcomputabilityproofpredicate logicarithmetic hierarchysyntaxcomplexity classescomplexity of decision problemsrecursivityrecursively unsolvable problemstheory of algorithms

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Undecidability and degrees of sets of sentences (03D35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Automata and formal grammars in connection with logical questions (03D05) Classical first-order logic (03B10) Complexity of computation (including implicit computational complexity) (03D15) Cut-elimination and normal-form theorems (03F05) Recursive functions and relations, subrecursive hierarchies (03D20) Other degrees and reducibilities in computability and recursion theory (03D30) Algorithms in computer science (68W99) Hierarchies of computability and definability (03D55) Computability and recursion theory (03Dxx)

Related Items (1)

Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3794169)