Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The collected works of Kurt Gödel is designed to be useful and accessible to as wide an audience as possible without sacrificing scientific or historical accuracy.

Logic, Symbolic and mathematical. --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Gödel, Kurt

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Landini shows that Russell's work exhibits greater consistency than previously thought. Russell's thoughts on logic are considered to be flawed yet he nevertheless attempted to salvage the guiding idea of his principal theory on the subject.

Proposition (Logic) --- Logic, Symbolic and mathematical --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Language and logic --- Logic --- History --- Russell, Bertrand,

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Kurt Gödel (1906-1978) gained world-wide fame by his incompleteness theorem of 1931. Later, he set as his aim to solve what are known as Hilbert's first and second problems, namely Cantor's continuum hypothesis about the cardinality of real numbers, and secondly the consistency of the theory of real numbers and functions. By 1940, he was halfway through the first problem, in what was his last published result in logic and foundations. His intense attempts thereafter at solving these two problems have remained behind the veil of a forgotten German shorthand he used in all of his writing. Results on Foundations is a set of four shorthand notebooks written in 1940-42 that collect results Gödel considered finished. Its main topic is set theory in which Gödel anticipated several decades of development. Secondly, Gödel completed his 1933 program of establishing the connections between intuitionistic and modal logic, by methods and results that today are at the same time new and 80 years old. The present edition of Gödel's four notebooks encompasses the 368 numbered pages and 126 numbered theorems of the Results on Foundations, together with a list of 74 problems on set theory Gödel prepared in 1946, and a list of an unknown date titled "The grand program of my research in ca. hundred questions.''.

Mathematics. --- History. --- Mathematical logic. --- History of Mathematical Sciences. --- Mathematical Logic and Foundations. --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Math --- Science --- Lògica matemàtica --- Gödel, Kurt.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book presents an in-depth and critical reconstruction of Prawitz’s epistemic grounding, and discusses it within the broader field of proof-theoretic semantics. The theory of grounds is also provided with a formal framework, through which several relevant results are proved. Investigating Prawitz’s theory of grounds, this work answers one of the most fundamental questions in logic: why and how do some inferences have the epistemic power to compel us to accept their conclusion, if we have accepted their premises? Prawitz proposes an innovative description of inferential acts, as applications of constructive operations on grounds for the premises, yielding a ground for the conclusion. The book is divided into three parts. In the first, the author discusses the reasons that have led Prawitz to abandon his previous semantics of valid arguments and proofs. The second part presents Prawitz’s grounding as found in his ground-theoretic papers. Finally, in the third part, a formal apparatus is developed, consisting of a class of languages whose terms are equipped with denotation functions associating them to operations and grounds, as well as of a class of systems where important properties of the terms can be proved.

Logic. --- Mathematical logic. --- Knowledge, Theory of. --- Mathematics—Philosophy. --- Mathematical Logic and Foundations. --- Epistemology. --- Philosophy of Mathematics. --- Epistemology --- Theory of knowledge --- Philosophy --- Psychology --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Argumentation --- Deduction (Logic) --- Deductive logic --- Dialectic (Logic) --- Logic, Deductive --- Intellect --- Science --- Reasoning --- Thought and thinking --- Methodology

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book demonstrates how to formally model various mathematical domains (including algorithms operating in these domains) in a way that makes them amenable to a fully automatic analysis by computer software. The presented domains are typically investigated in discrete mathematics, logic, algebra, and computer science; they are modeled in a formal language based on first-order logic which is sufficiently rich to express the core entities in whose correctness we are interested: mathematical theorems and algorithmic specifications. This formal language is the language of RISCAL, a “mathematical model checker” by which the validity of all formulas and the correctness of all algorithms can be automatically decided. The RISCAL software is freely available; all formal contents presented in the book are given in the form of specification files by which the reader may interact with the software while studying the corresponding book material.

Computer science—Mathematics. --- Mathematics—Data processing. --- Mathematical logic. --- Mathematics of Computing. --- Computational Mathematics and Numerical Analysis. --- Mathematical Logic and Foundations. --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Algorithms. --- Mathematical models. --- Data processing. --- Algorism --- Algebra --- Arithmetic --- Models, Mathematical --- Simulation methods --- Foundations