Three Views of Logic (eBook)

Mathematics, Philosophy, and Computer Science

Donald W. Loveland, Richard E. Hodel, S. G. Sterrett (Autoren)

eBook Download: PDF

2014 | 1. Auflage
344 Seiten
Princeton University Press (Verlag)
978-1-4008-4875-1 (ISBN)

Infos

Donald W. Loveland is professor emeritus of computer science at Duke University and the author of Automated Theorem Proving: A Logical Basis. Richard E. Hodel is associate professor emeritus of mathematics at Duke University and the author of An Introduction to Mathematical Logic. S. G. Sterrett is the Curtis D. Gridley Distinguished Professor of History and Philosophy of Science at Wichita State University and the author of Wittgenstein Flies a Kite: A Story of Models of Wings and Models of the World.

Produkt-Details

• Erscheint lt. Verlag: 26.1.2014
• Zusatzinfo: 7 line illus. 10 tables.
• Verlagsort: Princeton
• Sprache: englisch
• Themenwelt: Geisteswissenschaften ► Philosophie ► Allgemeines / Lexika
• Themenwelt: Geisteswissenschaften ► Philosophie ► Logik
• Themenwelt: Mathematik / Informatik ► Informatik ► Theorie / Studium
• Themenwelt: Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
• Themenwelt: Mathematik / Informatik ► Mathematik ► Finanz- / Wirtschaftsmathematik
• Themenwelt: Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre
• Themenwelt: Technik
• Schlagworte: abstract algebra • Ackermann function • Admissible Rule • algorithm • arity • Axiom • Calculation • Cantor's Diagonal Argument • Characterization (mathematics) • Church–Turing thesis • Classical Logic • Computability • Computability Theory • computable function • Computation • Conjunction elimination • Conjunction introduction • Contradiction • Decidability (logic) • Decision problem • Deduction theorem • Deontic Logic • Diagram (category theory) • Disjunction elimination • Disjunction introduction • Disjunctive syllogism • Equation • existential quantification • Expression (mathematics) • First-Order Logic • formal proof • four-valued logic • Function (mathematics) • Gödel's Incompleteness Theorems • Halting Problem • Hilbert's program • inference • Infimum and supremum • Intuitionistic Logic • Logic • Logical conjunction • Logical connective • logical consequence • Logical disjunction • Logic Programming • Material implication (rule of inference) • Mathematical Induction • Mathematical Logic • mathematical practice • Mathematical problem • Mathematical Proof • mathematical structure • Mathematics • Modal Logic • Model of computation • Monotonic Function • Natural deduction • Negation • Negation introduction • Notation • Occurs check • paraconsistent logic • Partial function • partially ordered set • Philosophical Logic • philosophy of mathematics • Predicate logic • Predicate (mathematical logic) • Primitive Recursive Function • Proof calculus • Proof procedure • Proof theory • Propositional Calculus • Propositional variable • Quantifier (logic) • Reasoning system • Recursion (computer science) • Recursive set • Register machine • relevance logic • Resolution (logic) • Rule of inference • Semantics • Set (mathematics) • soundness • Special case • Subset • Substructural Logic • Tautology (logic) • Theorem • Transitive relation • truth table • Truth value • Turing Machine • Turing's proof • Unification (computer science) • Upper and lower bounds • Variable (computer science) • Variable (mathematics) • Word problem (mathematics)
• ISBN-10: 1-4008-4875-X / 140084875X
• ISBN-13: 978-1-4008-4875-1 / 9781400848751