9783642867200 - first-order logic (ergebnisse der mathematik und ihrer grenzgebiete. 2. folge, band 43) von smullyan, raymond r. m. (4 Ergebnisse)
- Softcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 61,14
EUR 14,00 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In.
- Softcover
Anbieter: Agapea Libros, Malaga, MA, SpanienAgapea Libros
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 63,18
EUR 16,83 VersandVersand von Spanien nach USAAnzahl: 1 verfügbar
Zustand: New. Idioma/Language: Inglés. Except for this preface, this study is completely self-contained. It is intended to serve both as an introduction to Quantification Theory and as an exposition of new results and techniques in "analytic" or "cut-free" methods. We use the term "analytic" to apply to any proof procedure which… obeys the subformula principle (we think of such a procedure as "analysing" the formula into its successive components). Gentzen cut-free systems are perhaps the best known example of ana lytic proof procedures. Natural deduction systems, though not usually analytic, can be made so (as we demonstrated in [3]). In this study, we emphasize the tableau point of view, since we are struck by its simplicity and mathematical elegance. Chapter I is completely introductory. We begin with preliminary material on trees (necessary for the tableau method), and then treat the basic syntactic and semantic fundamentals of propositional logic. We use the term "Boolean valuation" to mean any assignment of truth values to all formulas which satisfies the usual truth-table conditions for the logical connectives. Given an assignment of truth-values to all propositional variables, the truth-values of all other formulas under this assignment is usually defined by an inductive procedure. We indicate in Chapter I how this inductive definition can be made explicit-to this end we find useful the notion of a formation tree (which we discuss earlier). *** Nota: Los envíos a España peninsular, Baleares y Canarias se realizan a través de mensajería urgente. No aceptamos pedidos con destino a Ceuta y Melilla.
- Softcover
Anbieter: Revaluation Books, Exeter, Vereinigtes KönigreichRevaluation Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 76,62
EUR 11,69 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 2 verfügbar
Paperback. Zustand: Brand New. reprint edition. 176 pages. 9.25x6.10x0.40 inches. In Stock.
- Softcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 53,49
EUR 61,39 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Except for this preface, this study is completely self-contained. It is intended to serve both as an introduction to Quantification Theory and as an exposition of new results and techniques in 'analytic' or 'cut-free' methods. We use the term 'analyt…ic' to apply to any proof procedure which obeys the subformula principle (we think of such a procedure as 'analysing' the formula into its successive components). Gentzen cut-free systems are perhaps the best known example of ana lytic proof procedures. Natural deduction systems, though not usually analytic, can be made so (as we demonstrated in [3]). In this study, we emphasize the tableau point of view, since we are struck by its simplicity and mathematical elegance. Chapter I is completely introductory. We begin with preliminary material on trees (necessary for the tableau method), and then treat the basic syntactic and semantic fundamentals of propositional logic. We use the term 'Boolean valuation' to mean any assignment of truth values to all formulas which satisfies the usual truth-table conditions for the logical connectives. Given an assignment of truth-values to all propositional variables, the truth-values of all other formulas under this assignment is usually defined by an inductive procedure. We indicate in Chapter I how this inductive definition can be made explicit-to this end we find useful the notion of a formation tree (which we discuss earlier).
