Collegium Logicum: Annals of the Kurt-Gödel Society, Volumes 1-2

1-F-extension A₁ algorithm Analysis analytic applied arity atomic atomic formulas Aussage Baaz Begriff bounded arithmetic C₁ calculus CAUCHY clause clause logic complexity Computer concepts consistency constraint construct Corollary defined Definition denote derived DTM-mapping example exists extension finite first-order formal formula function symbols Gegenstände Gentzen Gerhard Gentzen gibt Gödel infinitely-valued input Krajíček Kurt Gödel Leitsch Lemma lengths of proofs logical graph Logik lower bound many-valued logics mathematical Mathematik mathematischen monotone negation normal form NP-complete occur output tape paramodulation partial functions polynomial predicate logic problem proof system propositional logic provable Pudlák quantifiers real numbers recursive refutation relation symbol resolution game result schematic system SDTM sentence sequent sequent calculi Skolemization sorted unification structure subformula substitution t₁ tableau tautology Technische Universität Wien theorem proving theory truth value Turing machine variables well-sorted Zahlen