Summaries of Talks Presented at the Summer Institute for Symbolic LogicCommunications Research Division, Institute for Defense Analyses, 1960 - Logic, Symbolic and mathematical - 427 pages |
Other editions - View all
Common terms and phrases
A₁ algorithm applied arbitrary automaton axiom of constructibility axiomatizable axioms Boolean algebra cell circuit satisfying coefficients computable conjunction consistent constructive contains corresponding cylindrical algebras decision problem defined definition digits disjunction elementary elements finite automata finite number formal formula given Gödel's Hence inputs integers interpretation intuitionistic isomorphic Kleene Lemma machine Math mathematical method natural numbers normal form notation notion obtained operation ordinals outputs P₁ partial recursive function polynomial potentially infinite automaton predicate calculus predicate logic prenex normal form primitive recursive functions procedure proof propositional calculus provable quantifiers r₁ real closed fields recursion equivalences recursive set recursively enumerable reduced relation relay replaced represented restricted recursive arithmetic result sentences sentential calculus sequence set theory solution Subcase subset symbols synthesis problem synthesis requirement Tarski tion true values wider restricted recursion X₁