Narrow your search

Library

KU Leuven (2)

LUCA School of Arts (1)

Odisee (1)

Thomas More Kempen (1)

Thomas More Mechelen (1)

UCLL (1)

VIVES (1)

VUB (1)


Resource type

book (2)


Language

English (2)


Year
From To Submit

2016 (1)

2014 (1)

Listing 1 - 2 of 2
Sort by

Book
Predicative Arithmetic. (MN-32).
Author:
ISBN: 9781400858927 1400858925 Year: 2014 Publisher: Princeton Princeton University Press

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book develops arithmetic without the induction principle, working in theories that are interpretable in Raphael Robinson's theory Q. Certain inductive formulas, the bounded ones, are interpretable in Q. A mathematically strong, but logically very weak, predicative arithmetic is constructed.Originally published in 1986.The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.

Keywords

Constructive mathematics. --- Arithmetic. --- Mathematics --- Set theory --- Calculators --- Numbers, Real --- Mathematics, Constructive --- Logic, Symbolic and mathematical --- Addition. --- Adjunction (field theory). --- Age of the universe. --- Almost surely. --- Arithmetic IF. --- Atomic formula. --- Axiom. --- Axiomatic system. --- Beta function. --- Big O notation. --- Binary number. --- Binary relation. --- Brownian motion. --- Canonical form. --- Cardinality. --- Cartesian coordinate system. --- Chessboard. --- Classical mathematics. --- Closed-form expression. --- Commutative property. --- Computation. --- Conservative extension. --- Consistency. --- Contradiction. --- Deduction theorem. --- Diameter. --- Direct proof. --- Domain of discourse. --- Elementary mathematics. --- Elias M. Stein. --- Existential quantification. --- Exponential function. --- Exponentiation. --- Extension by definitions. --- Finitary. --- Finite set. --- Formula C (SCCA). --- Foundations of mathematics. --- Fundamenta Mathematicae. --- Gödel's completeness theorem. --- Herbrand's theorem. --- Impredicativity. --- Inaccessible cardinal. --- Inference. --- Interpretability. --- John Milnor. --- Logic. --- Logical connective. --- Mathematical induction. --- Mathematical logic. --- Mathematician. --- Mathematics. --- Measurable cardinal. --- Metamathematics. --- Metatheorem. --- Model theory. --- Mostowski. --- Natural number. --- Negation. --- Non-standard analysis. --- Notation. --- P-adic analysis. --- Peano axioms. --- Polynomial. --- Positional notation. --- Power of two. --- Power set. --- Primitive notion. --- Primitive recursive function. --- Principia Mathematica. --- Probability theory. --- Quantifier (logic). --- Quantity. --- Ranking (information retrieval). --- Rational number. --- Real number. --- Recursion (computer science). --- Remainder. --- Requirement. --- Robert Langlands. --- Rule of inference. --- Scientific notation. --- Sequence. --- Set theory. --- Subset. --- Theorem. --- Theory. --- Transfer principle. --- Transfinite number. --- Triviality (mathematics). --- Tuple. --- Uniqueness. --- Universal quantification. --- Variable (mathematics). --- Zermelo–Fraenkel set theory.


Book
Introduction to Mathematical Logic (PMS-13), Volume 13
Author:
ISBN: 1400881455 Year: 2016 Publisher: Princeton, NJ : Princeton University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Logic is sometimes called the foundation of mathematics: the logician studies the kinds of reasoning used in the individual steps of a proof. Alonzo Church was a pioneer in the field of mathematical logic, whose contributions to number theory and the theories of algorithms and computability laid the theoretical foundations of computer science. His first Princeton book, The Calculi of Lambda-Conversion (1941), established an invaluable tool that computer scientists still use today. Even beyond the accomplishment of that book, however, his second Princeton book, Introduction to Mathematical Logic, defined its subject for a generation. Originally published in Princeton's Annals of Mathematics Studies series, this book was revised in 1956 and reprinted a third time, in 1996, in the Princeton Landmarks in Mathematics series. Although new results in mathematical logic have been developed and other textbooks have been published, it remains, sixty years later, a basic source for understanding formal logic. Church was one of the principal founders of the Association for Symbolic Logic; he founded the Journal of Symbolic Logic in 1936 and remained an editor until 1979 At his death in 1995, Church was still regarded as the greatest mathematical logician in the world.

Keywords

Logic, Symbolic and mathematical. --- Abstract algebra. --- Acta Mathematica. --- Arithmetic. --- Axiom of choice. --- Axiom of infinity. --- Axiom of reducibility. --- Axiom schema. --- Axiom. --- Axiomatic system. --- Binary function. --- Boolean algebra (structure). --- Boolean ring. --- Calculus ratiocinator. --- Characterization (mathematics). --- Class (set theory). --- Classical mathematics. --- Commutative property. --- Commutative ring. --- Conditional disjunction. --- David Hilbert. --- Decision problem. --- Deduction theorem. --- Denotation. --- Disjunctive syllogism. --- Double negation. --- Duality (mathematics). --- Elementary algebra. --- Elementary arithmetic. --- English alphabet. --- Equation. --- Existential quantification. --- Expression (mathematics). --- Formation rule. --- Frege (programming language). --- Function (mathematics). --- Functional calculus. --- Fundamenta Mathematicae. --- Gödel numbering. --- Gödel's completeness theorem. --- Gödel's incompleteness theorems. --- Hilbert's program. --- Hypothetical syllogism. --- Imperative logic. --- Inference. --- Introduction to Mathematical Philosophy. --- Lambda calculus. --- Linear differential equation. --- Logic. --- Logical connective. --- Logical disjunction. --- Material implication (rule of inference). --- Mathematical analysis. --- Mathematical induction. --- Mathematical logic. --- Mathematical notation. --- Mathematical practice. --- Mathematical problem. --- Mathematical theory. --- Mathematics. --- Mathematische Zeitschrift. --- Metatheorem. --- Modal logic. --- Modus ponendo tollens. --- Natural number. --- Naturalness (physics). --- Negation. --- Notation. --- Number theory. --- Object language. --- Parity (mathematics). --- Predicate (mathematical logic). --- Prenex normal form. --- Principia Mathematica. --- Propositional calculus. --- Propositional function. --- Propositional variable. --- Quantifier (logic). --- Range (mathematics). --- Real number. --- Recursion (computer science). --- Restriction (mathematics). --- Riemann surface. --- Ring (mathematics). --- Rule of inference. --- Scientific notation. --- Second-order arithmetic. --- Series (mathematics). --- Sign (mathematics). --- Skolem normal form. --- Special case. --- Tautology (logic). --- Term logic. --- The Principles of Mathematics. --- Theorem. --- Three-dimensional space (mathematics). --- Transfinite number. --- Triviality (mathematics). --- Truth table. --- Variable (mathematics). --- Zermelo set theory.

Listing 1 - 2 of 2
Sort by