Walter Felscher – författare
Visar alla böcker från författaren Walter Felscher. Handla med fri frakt och snabb leverans.
11 produkter
Logic of Arithmetic
Häftad, 2019
1040 kr
Lägg i varukorg
For propositional logic it can be decided whether a formula has a deduction from a finite set of other formulas. This volume begins with a method to decide this for the quantified formulas of those fragments of arithmetic which express the properties of order-plus-successor and of …
Lectures on Mathematical Logic, Volume II
Häftad, 2019
1040 kr
Lägg i varukorg
In this volume, logic starts from the observation that in everyday arguments, as brought forward by say a lawyer, statements are transformed linguistically, connecting them in formal ways irrespective of their contents. Understanding such arguments as deductive situations, or "sequents" in the …
Logic of Arithmetic
E-bok, 2000
1230 kr
Lägg i varukorg
For propositional logic it can be decided whether a formula has a deduction from a finite set of other formulas. This volume begins with a method to decide this for the quantified formulas of those fragments of arithmetic which express the properties of order-plus-successor and of …
Lectures on Mathematical Logic, Volume II
E-bok, 2000
1203 kr
Lägg i varukorg
In this volume, logic starts from the observation that in everyday arguments, as brought forward by say a lawyer, statements are transformed linguistically, connecting them in formal ways irrespective of their contents. Understanding such arguments as deductive situations, or "sequents" in the …
Logic of Arithmetic
E-bok, 2000
1230 kr
Lägg i varukorg
For propositional logic it can be decided whether a formula has a deduction from a finite set of other formulas. This volume begins with a method to decide this for the quantified formulas of those fragments of arithmetic which express the properties of order-plus-successor and of …
Berechenbarkeit
Rekursive und Programmierbare Funktionen
Häftad, 1993
514 kr
Lägg i varukorg
Dieses Lehrbuch behandelt verständlich, umfassend und modern die Theorie der Berechenbarkeit, ein klassisches Gebiet der Mathematischen Logik, das als Grundlagengebiet auch für die Informatik von höchster Bedeutung ist. Lebendig und didaktisch klar wird das Studium der berechenbaren Funktionen auf …
Berechenbarkeit
Rekursive und Programmierbare Funktionen
E-bok, 2013
542 kr
Lägg i varukorg
Dieses Lehrbuch behandelt verständlich, umfassend und modern die Theorie der Berechenbarkeit, ein klassisches Gebiet der Mathematischen Logik, das als Grundlagengebiet auch für die Informatik von höchster Bedeutung ist. Lebendig und didaktisch klar wird das Studium der berechenbaren Funktionen auf …
Lectures on Mathematical Logic, Volume II
Inbunden, 2000
2131 kr
Lägg i varukorg
In this volume, logic starts from the observation that in everyday arguments, as brought forward by say a lawyer, statements are transformed linguistically, connecting them in formal ways irrespective of their contents. Understanding such arguments as deductive situations, or "sequents" in the …
Logic of Arithmetic
Inbunden, 2000
2131 kr
Lägg i varukorg
For propositional logic it can be decided whether a formula has a deduction from a finite set of other formulas. This volume begins with a method to decide this for the quantified formulas of those fragments of arithmetic which express the properties of order-plus-successor and of …
