Term Logic with Choice Operator
Autor Hans Hermesen Limba Engleză Paperback –
Preț: 258.81 lei
Nou
Puncte Express: 388
Preț estimativ în valută:
45.80€ • 53.70$ • 40.22£
45.80€ • 53.70$ • 40.22£
Carte tipărită la comandă
Livrare economică 03-17 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540048992
ISBN-10: 3540048995
Pagini: 52
Ilustrații: III, 59 p.
Dimensiuni: 155 x 235 x 4 mm
Greutate: 0.1 kg
Ediția:1965
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540048995
Pagini: 52
Ilustrații: III, 59 p.
Dimensiuni: 155 x 235 x 4 mm
Greutate: 0.1 kg
Ediția:1965
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
V-ar putea interesa
-
Handbook of Regression AnalysisS Chatterjee-9%Preț: 818.08 lei898.99 lei -
-8%Preț: 496.03 lei539.16 lei -
The Cartoon Introduction to StatisticsGrady KleinPreț: 125.07 lei -
Resampling Methods and R 2ePhillip I Good-8%Preț: 388.34 lei422.11 lei -
Preț: 204.11 lei -
Advanced Topics in Computational Number TheoryHenri CohenPreț: 485.94 lei -
Modular Functions and Dirichlet Series in Number TheoryTom M. ApostolPreț: 432.97 lei -
Introduction to Cyclotomic FieldsLawrence C. Washington-15%Preț: 516.88 lei608.10 lei -
The Noether Theorems: Invariance and Conservation Laws in the Twentieth CenturyYvette Kosmann-Schwarzbach-15%Preț: 557.83 lei656.27 lei -
Looking at NumbersTom Johnson-15%Preț: 667.23 lei784.98 lei -
-15%Preț: 620.07 lei729.49 lei -
-18%Preț: 1301.19 lei1586.81 lei -
-15%Preț: 620.07 lei729.49 lei
Public țintă
ResearchCuprins
Foreword to the Revised Edition.- First order predicate logic with choice operator.- First order term logic with choice operator.- Embedding of predicate logic in term logic.- Embedding of term logic in predicate logic.- Free occurence of a variable. Rank of term. Elementary substitution.- A term calculus.- Soundness of the rules.- Survey of the completeness proof.- Some theorems concerning deducibility.- Substitution.- Further theorems concerning deducibility.- Survey of the proof of the Theorem on satisfiability.- Details of the proof.- Completeness of restricted term calculus.