Foundations of Mathematical LogicCourier Corporation, 1 janv. 1977 - 408 pages Written by a pioneer of mathematical logic, this comprehensive graduate-level text explores the constructive theory of first-order predicate calculus. It covers formal methods, including algorithms and epitheory, and offers a brief treatment of Markov's approach to algorithms, explains elementary facts about lattices and similar algebraic systems, and more. 1963 edition. |
Table des matières
INTRODUCTION | 1 |
FORMAL SYSTEMS | 28 |
EPITHEORY | 93 |
RELATIONAL LOGICAL ALGEBRA | 125 |
THE THEORY OF IMPLICATION | 165 |
NEGATION | 254 |
QUANTIFICATION | 311 |
MODALITY | 359 |
Autres éditions - Tout afficher
Expressions et termes fréquents
A₁ algorithm application argument assertional atoms axiom schemes Boolean algebra Boolean ring called Chap classical combinatory logic completes the proof consider construction contains contensive COROLLARY corresponding counteraxioms deductive induction defined definition demonstration derivation discussion distributive lattice elementary statements elementary theorem elements elimination theorem epitheorems equivalent Example expressions finite formal objects formal system formed by adjoining formulation functors Gentzen Gödel hence Hilbert holds implicative lattice indeterminates inference infix interpretation introduced intuitionistic inversion L systems language letters Markov algorithm Math mathematical logic modal logic multiple natural numbers negation node notion obtained occur operations parametric postulates premise prime statement principal constituent propositional algebra prosequence quantification quasi ordering relation replaced respect rules satisfy semantical semilattice sense sentences singular Skolem normal form subaltern substitution subtractive lattice Suppose symbols syntactical tableau Tarski term theory tion valid void
Fréquemment cités
Page 386 - An informal exposition of proofs of Godel's theorems and Church's theorem, J.