Listing 1 - 8 of 8 |
Sort by
|
Choose an application
Kurt Gödel, mathematician and logician, was one of the most influential thinkers of the twentieth century. Gödel fled Nazi Germany, fearing for his Jewish wife and fed up with Nazi interference in the affairs of the mathematics institute at the University of Göttingen. In 1933 he settled at the Institute for Advanced Study in Princeton, where he joined the group of world-famous mathematicians who made up its original faculty. His 1940 book, better known by its short title, The Consistency of the Continuum Hypothesis, is a classic of modern mathematics. The continuum hypothesis, introduced by mathematician George Cantor in 1877, states that there is no set of numbers between the integers and real numbers. It was later included as the first of mathematician David Hilbert's twenty-three unsolved math problems, famously delivered as a manifesto to the field of mathematics at the International Congress of Mathematicians in Paris in 1900. In The Consistency of the Continuum Hypothesis Gödel set forth his proof for this problem. In 1999, Time magazine ranked him higher than fellow scientists Edwin Hubble, Enrico Fermi, John Maynard Keynes, James Watson, Francis Crick, and Jonas Salk. He is most renowned for his proof in 1931 of the 'incompleteness theorem,' in which he demonstrated that there are problems that cannot be solved by any set of rules or procedures. His proof wrought fruitful havoc in mathematics, logic, and beyond.
Mathematical logic --- Mathematics --- Logic, Symbolic and mathematical --- Mathématiques --- Logique symbolique et mathématique --- Philosophy --- Philosophie --- Logic, Symbolic and mathematical. --- Philosophy. --- Set theory --- Théorie des ensembles --- Continuity --- Continu (philosophie) --- Algebra of logic --- Logic, Universal --- Symbolic and mathematical logic --- Symbolic logic --- Algebra, Abstract --- Metamathematics --- Syllogism --- Logic of mathematics --- Mathematics, Logic of --- Absoluteness. --- Addition. --- Axiom of choice. --- Axiom of extensionality. --- Axiom of infinity. --- Axiom. --- Axiomatic system. --- Boolean algebra (structure). --- Constructible set (topology). --- Continuum hypothesis. --- Existence theorem. --- Existential quantification. --- Integer. --- Mathematical induction. --- Mathematical logic. --- Mathematics. --- Metatheorem. --- Order by. --- Ordinal number. --- Propositional function. --- Quantifier (logic). --- Reductio ad absurdum. --- Requirement. --- Set theory. --- Theorem. --- Transfinite induction. --- Transfinite. --- Variable (mathematics). --- Well-order. --- Théorie des ensembles --- Logique mathématique --- Axiome du choix
Choose an application
Using only the very elementary framework of finite probability spaces, this book treats a number of topics in the modern theory of stochastic processes. This is made possible by using a small amount of Abraham Robinson's nonstandard analysis and not attempting to convert the results into conventional form.
Martingales (Mathematics) --- Stochastic processes. --- Probabilities. --- Martingales (Mathematics). --- Stochastic processes --- Probability --- Statistical inference --- Combinations --- Mathematics --- Chance --- Least squares --- Mathematical statistics --- Risk --- Random processes --- Probabilities --- Abraham Robinson. --- Absolute value. --- Addition. --- Algebra of random variables. --- Almost surely. --- Axiom. --- Axiomatic system. --- Borel set. --- Bounded function. --- Cantor's diagonal argument. --- Cardinality. --- Cartesian product. --- Central limit theorem. --- Chebyshev's inequality. --- Compact space. --- Contradiction. --- Convergence of random variables. --- Corollary. --- Correlation coefficient. --- Counterexample. --- Dimension (vector space). --- Dimension. --- Division by zero. --- Elementary function. --- Estimation. --- Existential quantification. --- Family of sets. --- Finite set. --- Hyperplane. --- Idealization. --- Independence (probability theory). --- Indicator function. --- Infinitesimal. --- Internal set theory. --- Joint probability distribution. --- Law of large numbers. --- Linear function. --- Martingale (probability theory). --- Mathematical induction. --- Mathematician. --- Mathematics. --- Measure (mathematics). --- N0. --- Natural number. --- Non-standard analysis. --- Norm (mathematics). --- Orthogonal complement. --- Parameter. --- Path space. --- Predictable process. --- Probability distribution. --- Probability measure. --- Probability space. --- Probability theory. --- Probability. --- Product topology. --- Projection (linear algebra). --- Quadratic variation. --- Random variable. --- Real number. --- Requirement. --- Scientific notation. --- Sequence. --- Set (mathematics). --- Significant figures. --- Special case. --- Standard deviation. --- Statistical mechanics. --- Stochastic process. --- Subalgebra. --- Subset. --- Summation. --- Theorem. --- Theory. --- Total variation. --- Transfer principle. --- Transfinite number. --- Trigonometric functions. --- Upper and lower bounds. --- Variable (mathematics). --- Variance. --- Vector space. --- W0. --- Wiener process. --- Without loss of generality.
Choose an application
Fibre bundles, now an integral part of differential geometry, are also of great importance in modern physics--such as in gauge theory. This book, a succinct introduction to the subject by renown mathematician Norman Steenrod, was the first to present the subject systematically. It begins with a general introduction to bundles, including such topics as differentiable manifolds and covering spaces. The author then provides brief surveys of advanced topics, such as homotopy theory and cohomology theory, before using them to study further properties of fibre bundles. The result is a classic and timeless work of great utility that will appeal to serious mathematicians and theoretical physicists alike.
#WWIS:d.d. Prof. L. Bouckaert/ALTO --- 515.1 --- 515.1 Topology --- Topology --- Topology. --- Analysis situs --- Position analysis --- Rubber-sheet geometry --- Geometry --- Polyhedra --- Set theory --- Algebras, Linear --- Algebraic topology. --- Associated bundle. --- Associative algebra. --- Associative property. --- Atlas (topology). --- Automorphism. --- Axiomatic system. --- Barycentric subdivision. --- Bilinear map. --- Bundle map. --- Classification theorem. --- Coefficient. --- Cohomology ring. --- Cohomology. --- Conjugacy class. --- Connected component (graph theory). --- Connected space. --- Coordinate system. --- Coset. --- Cup product. --- Cyclic group. --- Determinant. --- Differentiable manifold. --- Differential structure. --- Dimension (vector space). --- Direct product. --- Division algebra. --- Equivalence class. --- Equivalence relation. --- Euler number. --- Existence theorem. --- Existential quantification. --- Factorization. --- Fiber bundle. --- Frenet–Serret formulas. --- Gram–Schmidt process. --- Group theory. --- Homeomorphism. --- Homology (mathematics). --- Homomorphism. --- Homotopy group. --- Homotopy. --- Hopf theorem. --- Hurewicz theorem. --- Identity element. --- Inclusion map. --- Inner automorphism. --- Invariant subspace. --- Invertible matrix. --- Jacobian matrix and determinant. --- Klein bottle. --- Lattice of subgroups. --- Lie group. --- Line element. --- Line segment. --- Linear map. --- Linear space (geometry). --- Linear subspace. --- Manifold. --- Mapping cylinder. --- Metric tensor. --- N-sphere. --- Natural topology. --- Octonion. --- Open set. --- Orientability. --- Orthogonal group. --- Orthogonalization. --- Permutation. --- Principal bundle. --- Product topology. --- Quadratic form. --- Quaternion. --- Retract. --- Separable space. --- Set theory. --- Simplicial complex. --- Special case. --- Stiefel manifold. --- Subalgebra. --- Subbase. --- Subgroup. --- Subset. --- Symmetric tensor. --- Tangent bundle. --- Tangent space. --- Tangent vector. --- Tensor field. --- Tensor. --- Theorem. --- Tietze extension theorem. --- Topological group. --- Topological space. --- Transitive relation. --- Transpose. --- Union (set theory). --- Unit sphere. --- Universal bundle. --- Vector field.
Choose an application
In today's unpredictable and chaotic world, we look to science to provide certainty and answers--and often blame it when things go wrong. The Blind Spot reveals why our faith in scientific certainty is a dangerous illusion, and how only by embracing science's inherent ambiguities and paradoxes can we truly appreciate its beauty and harness its potential. Crackling with insights into our most perplexing contemporary dilemmas, from climate change to the global financial meltdown, this book challenges our most sacredly held beliefs about science, technology, and progress. At the same time, it shows how the secret to better science can be found where we least expect it--in the uncertain, the ambiguous, and the inevitably unpredictable. William Byers explains why the subjective element in scientific inquiry is in fact what makes it so dynamic, and deftly balances the need for certainty and rigor in science with the equally important need for creativity, freedom, and downright wonder. Drawing on an array of fascinating examples--from Wall Street's overreliance on algorithms to provide certainty in uncertain markets, to undecidable problems in mathematics and computer science, to Georg Cantor's paradoxical but true assertion about infinity--Byers demonstrates how we can and must learn from the existence of blind spots in our scientific and mathematical understanding. The Blind Spot offers an entirely new way of thinking about science, one that highlights its strengths and limitations, its unrealized promise, and, above all, its unavoidable ambiguity. It also points to a more sophisticated approach to the most intractable problems of our time.
Uncertainty (Information theory) --- Science --- Measure of uncertainty (Information theory) --- Shannon's measure of uncertainty --- System uncertainty --- Information measurement --- Probabilities --- Questions and answers --- Science and society --- Sociology of science --- Social aspects. --- Acknowledgment (creative arts and sciences). --- Algorithm. --- Ambiguity. --- Analogy. --- Approximation. --- Axiom. --- Axiomatic system. --- Basic research. --- Big O notation. --- Calculation. --- Certainty. --- Chaos theory. --- Circumference. --- Computation. --- Concept. --- Conjecture. --- Consciousness. --- Consistency. --- Contingency (philosophy). --- Continuous function. --- Continuum hypothesis. --- Contradiction. --- Counting. --- David Bohm. --- Dynamism (metaphysics). --- Emergence. --- Euclidean geometry. --- Explanation. --- Feeling. --- Fermat's Last Theorem. --- Geometry. --- Gestalt psychology. --- Gregory Chaitin. --- Gödel's incompleteness theorems. --- Human behavior. --- Human intelligence. --- Hypothesis. --- Ideology. --- Inference. --- Integer. --- Irrational number. --- Learning. --- Logic. --- Logical reasoning. --- Mathematician. --- Mathematics. --- Measurement. --- Methodology. --- Modernity. --- Molecule. --- Natural number. --- Nature. --- Paradigm shift. --- Paradox. --- Participant. --- Phenomenon. --- Philosopher. --- Philosophy of mathematics. --- Philosophy of science. --- Philosophy. --- Platonism. --- Prediction. --- Principle. --- Probability. --- Pythagoreanism. --- Qualitative property. --- Quantification (science). --- Quantity. --- Quantum mechanics. --- Randomness. --- Rational number. --- Rationality. --- Real number. --- Reality. --- Reason. --- Reductionism. --- Relationship between religion and science. --- Result. --- Science. --- Scientific method. --- Scientific progress. --- Scientific theory. --- Scientist. --- Self-reference. --- Set theory. --- Special case. --- Subatomic particle. --- Subjectivity. --- Suggestion. --- Technology. --- The Philosopher. --- Theorem. --- Theoretical physics. --- Theory of everything. --- Theory. --- Thomas Kuhn. --- Thought. --- Uncertainty. --- Universality (philosophy). --- Writing. --- Sociology of knowledge
Choose an application
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.
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.
Choose an application
The book provides a contemporary view on different aspects of the deductive systems in various types of logics including term logics, propositional logics, logics of refutation, non-Fregean logics, higher order logics and arithmetic.
Research & information: general --- Mathematics & science --- quine --- logic --- ontology --- multiple conclusion rule --- disjunction property --- metadisjunction --- axiomatizations of arithmetic of natural and integers numbers --- second-order theories --- Peano's axioms --- Wilkosz's axioms --- axioms of integer arithmetic modeled on Peano and Wilkosz axioms --- equivalent axiomatizations --- metalogic --- categoricity --- independence --- consistency --- logic of typical and atypical instances (LTA) --- logic of determination of objects (LDO) --- quasi topology structure (QTS) --- concept --- object --- typical object --- atypical object --- lattice --- filter --- ideal --- discussive logics --- the smallest discussive logic --- discussive operators --- seriality --- accessibility relation --- Kotas' method --- modal logic --- deontic logic --- ontology of situations --- semantics of law --- formal theory of law --- Wittgenstein --- Wolniewicz --- non-Fregean logic --- identity connective --- sentential calculus with identity --- situational semantics --- deduction --- (dual) tableau --- Gentzen system --- deductive refutability --- refutation systems --- hybrid deduction-refutation rules --- derivative hybrid rules --- soundness --- completeness --- natural deduction --- meta-proof theory --- synthetic tableaux --- principle of bivalence --- cut --- first-order theory --- universal axiom --- Peano's axiomatics of natural numbers --- Leśniewski's elementary ontology --- Frege's predication scheme --- Frege's Zahl-Anzahl distinction --- term logic --- Franz Brentano --- Lewis Carroll --- logic trees --- logic diagrams --- paraconsistent logic --- paraconsistency --- Sette's calculus --- the law of explosion --- the principle of ex contradictione sequitur quodlibet --- semantic tree --- distribution --- Aristotle's logic --- syllogistic --- Jan Łukasiewicz --- axiomatic system --- axiomatic refutation --- temporal logic --- intuitionistic logic --- minimal system --- knowledge --- sequent-type calculi --- nonmonotonic logics --- default logic --- rejection systems --- Kripke models --- logics of evidence and truth
Choose an application
The book provides a contemporary view on different aspects of the deductive systems in various types of logics including term logics, propositional logics, logics of refutation, non-Fregean logics, higher order logics and arithmetic.
Research & information: general --- Mathematics & science --- quine --- logic --- ontology --- multiple conclusion rule --- disjunction property --- metadisjunction --- axiomatizations of arithmetic of natural and integers numbers --- second-order theories --- Peano’s axioms --- Wilkosz’s axioms --- axioms of integer arithmetic modeled on Peano and Wilkosz axioms --- equivalent axiomatizations --- metalogic --- categoricity --- independence --- consistency --- logic of typical and atypical instances (LTA) --- logic of determination of objects (LDO) --- quasi topology structure (QTS) --- concept --- object --- typical object --- atypical object --- lattice --- filter --- ideal --- discussive logics --- the smallest discussive logic --- discussive operators --- seriality --- accessibility relation --- Kotas’ method --- modal logic --- deontic logic --- ontology of situations --- semantics of law --- formal theory of law --- Wittgenstein --- Wolniewicz --- non-Fregean logic --- identity connective --- sentential calculus with identity --- situational semantics --- deduction --- (dual) tableau --- Gentzen system --- deductive refutability --- refutation systems --- hybrid deduction–refutation rules --- derivative hybrid rules --- soundness --- completeness --- natural deduction --- meta-proof theory --- synthetic tableaux --- principle of bivalence --- cut --- first-order theory --- universal axiom --- Peano’s axiomatics of natural numbers --- Leśniewski’s elementary ontology --- Frege’s predication scheme --- Frege’s Zahl-Anzahl distinction --- term logic --- Franz Brentano --- Lewis Carroll --- logic trees --- logic diagrams --- paraconsistent logic --- paraconsistency --- Sette’s calculus --- the law of explosion --- the principle of ex contradictione sequitur quodlibet --- semantic tree --- distribution --- Aristotle’s logic --- syllogistic --- Jan Łukasiewicz --- axiomatic system --- axiomatic refutation --- temporal logic --- intuitionistic logic --- minimal system --- knowledge --- sequent-type calculi --- nonmonotonic logics --- default logic --- rejection systems --- Kripke models --- logics of evidence and truth --- n/a --- Peano's axioms --- Wilkosz's axioms --- Kotas' method --- hybrid deduction-refutation rules --- Peano's axiomatics of natural numbers --- Leśniewski's elementary ontology --- Frege's predication scheme --- Frege's Zahl-Anzahl distinction --- Sette's calculus --- Aristotle's logic
Choose an application
The book provides a contemporary view on different aspects of the deductive systems in various types of logics including term logics, propositional logics, logics of refutation, non-Fregean logics, higher order logics and arithmetic.
quine --- logic --- ontology --- multiple conclusion rule --- disjunction property --- metadisjunction --- axiomatizations of arithmetic of natural and integers numbers --- second-order theories --- Peano’s axioms --- Wilkosz’s axioms --- axioms of integer arithmetic modeled on Peano and Wilkosz axioms --- equivalent axiomatizations --- metalogic --- categoricity --- independence --- consistency --- logic of typical and atypical instances (LTA) --- logic of determination of objects (LDO) --- quasi topology structure (QTS) --- concept --- object --- typical object --- atypical object --- lattice --- filter --- ideal --- discussive logics --- the smallest discussive logic --- discussive operators --- seriality --- accessibility relation --- Kotas’ method --- modal logic --- deontic logic --- ontology of situations --- semantics of law --- formal theory of law --- Wittgenstein --- Wolniewicz --- non-Fregean logic --- identity connective --- sentential calculus with identity --- situational semantics --- deduction --- (dual) tableau --- Gentzen system --- deductive refutability --- refutation systems --- hybrid deduction–refutation rules --- derivative hybrid rules --- soundness --- completeness --- natural deduction --- meta-proof theory --- synthetic tableaux --- principle of bivalence --- cut --- first-order theory --- universal axiom --- Peano’s axiomatics of natural numbers --- Leśniewski’s elementary ontology --- Frege’s predication scheme --- Frege’s Zahl-Anzahl distinction --- term logic --- Franz Brentano --- Lewis Carroll --- logic trees --- logic diagrams --- paraconsistent logic --- paraconsistency --- Sette’s calculus --- the law of explosion --- the principle of ex contradictione sequitur quodlibet --- semantic tree --- distribution --- Aristotle’s logic --- syllogistic --- Jan Łukasiewicz --- axiomatic system --- axiomatic refutation --- temporal logic --- intuitionistic logic --- minimal system --- knowledge --- sequent-type calculi --- nonmonotonic logics --- default logic --- rejection systems --- Kripke models --- logics of evidence and truth --- n/a --- Peano's axioms --- Wilkosz's axioms --- Kotas' method --- hybrid deduction-refutation rules --- Peano's axiomatics of natural numbers --- Leśniewski's elementary ontology --- Frege's predication scheme --- Frege's Zahl-Anzahl distinction --- Sette's calculus --- Aristotle's logic
Listing 1 - 8 of 8 |
Sort by
|