About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 31. Chapters: Truth value, Logic for Computable Functions, Boolean function, Higher-order logic, Logical matrix, Modal μ-calculus, Bunched logic, Omega-categorical theory, Set theory of the real line, Substructural logic, Extensionality, Institutional model theory, Double negation, Judgment, Boolean domain, Ω-logic, Truth-table reduction, Clone, Jonsson function, Zero dagger, Complete theory, Richardson's theorem, Jensen's covering theorem, Classical mathematics, Supernatural numbers, Sudan function, Disjunction and existence properties, Pseudo-order, Krull's theorem, Borel equivalence relation, Coherent space, Reduced product, Least fixed point, Chang's conjecture, Many-sorted logic, Conservativity theorem, Heyting arithmetic, Ludics, Minimal logic, Superposition calculus, Logical graph, Trichotomy, Kleene-Rosser paradox, Finite character, Double recursion, Material nonimplication, Kleene-Brouwer order, Paraconsistent mathematics, Semicomputable function, Lindstrom's theorem, Robinson's joint consistency theorem, Takeuti's conjecture, Elementary diagram, Constructive non-standard analysis, Loś-Tarski preservation theorem, Cantor-Dedekind axiom, Continuum, Herbrand interpretation, Diagonal intersection, Kleene fixed-point theorem, Logical machine, Michael D. Morley, Computable analysis, Bernays-Schonfinkel class, Algebraic semantics, Computable model theory, Indiscernibles, Hilbert-Bernays provability conditions, Barwise compactness theorem, Tarski-Kuratowski algorithm, Subcountability, Beth definability, Polyadic algebra, End extension, Lusin's separation theorem, Proof mining, Countryman line, Set-theoretic limit, Completeness of atomic initial sequents, Theory of pure equality, Principle of distributivity, Effective Polish space, LOGCFL, Continuous function, Herbrand structure, Milner-Rado paradox, ...
