Handbook of mathematical logic. With the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis, A. S. Troelstra. 2nd printing

No author found.

Publication date: 1978

Published in: Studies in Logic and the Foundations of Mathematics (Search for Journal in Brave)

zbMATH Keywords

forcing Martin's axiom decidable theories constructibility Peano arithmetic categorical logic homogeneous sets incompleteness theorems direct proof projective sets unsolvable problems alpha-recursion research survey articles theories of finite type type free lambda calculus

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Categorical logic, topoi (03G30) Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25) Cut-elimination and normal-form theorems (03F05) Consistency and independence results (03E35) Inner models, including constructibility, ordinal definability, and core models (03E45) First-order arithmetic and fragments (03F30) Continuum hypothesis and Martin's axiom (03E50) Consistency and independence results in general topology (54A35) Other combinatorial set theory (03E05) Other constructive mathematics (03F65) Nonstandard models in mathematics (03H05) Other set-theoretic hypotheses and axioms (03E65) Other degrees and reducibilities in computability and recursion theory (03D30) Ultraproducts and related constructions (03C20) Other classical set theory (including functions, relations, and set algebra) (03E20) Other infinitary logic (03C75) Axiom of choice and related propositions (03E25) Combinatory logic and lambda calculus (03B40) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65) Categoricity and completeness of theories (03C35) Inductive definability (03D70) Logic on admissible sets (03C70)

Related Items (14)

Algebraically closed and existentially closed abelian lattice-ordered groups ⋮ Combining Model Checking and Deduction ⋮ A simple proof of arithmetical completeness for \(\Pi_ 1\)-conservativity logic ⋮ Computing verisimilitude ⋮ High undecidability of weak bisimilarity for Petri nets ⋮ EQUATIONS IN FREE INVERSE MONOIDS ⋮ Complete systems of \(\mathcal B\)-rational identities ⋮ Consistency, mechanicalness, and the logic of the mind ⋮ Quantum value indefiniteness ⋮ The diagonalization method in quantum recursion theory ⋮ A simple proof of Parsons' theorem ⋮ Decidability results for metric and layered temporal logics ⋮ Weak measure extension axioms ⋮ Lower bound results on lengths of second-order formulas

This page was built for publication: Handbook of mathematical logic. With the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis, A. S. Troelstra. 2nd printing