Frege's Propositional Calculus
In mathematical logic, Frege's propositional calculus was the first axiomatization of propositional calculus. It was invented by Gottlob Frege, who also invented predicate calculus, in 1879 as part of his second-order predicate calculus (although Charles Peirce was the first to use the term "second-order" and developed his own version of the predicate calculus independently of Frege). It makes use of just two logical operators: implication and negation, and it is constituted by six axioms and one inference rule: modus ponens. Frege's propositional calculus is equivalent to any other classical propositional calculus, such as the "standard PC" with 11 axioms. Frege's PC and standard PC share two common axioms: THEN-1 and THEN-2. Notice that axioms THEN-1 through THEN-3 only make use of (and define) the implication operator, whereas axioms FRG-1 through FRG-3 define the negation operator. The following theorems will aim to find the remaining nine axioms of standard PC within the ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Mathematical Logic
Mathematical logic is the study of logic, formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory. Research in mathematical logic commonly addresses the mathematical properties of formal systems of logic such as their expressive or deductive power. However, it can also include uses of logic to characterize correct mathematical reasoning or to establish foundations of mathematics. Since its inception, mathematical logic has both contributed to and been motivated by the study of foundations of mathematics. This study began in the late 19th century with the development of axiomatic frameworks for geometry, arithmetic, and Mathematical analysis, analysis. In the early 20th century it was shaped by David Hilbert's Hilbert's program, program to prove the consistency of foundational theories. Results of Kurt Gödel, Gerhard Gentzen, and others provided partial resolution to the program, and clarified the issues involved in pr ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Converse (logic)
In logic and mathematics, the converse of a categorical or implicational statement is the result of reversing its two constituent statements. For the implication ''P'' → ''Q'', the converse is ''Q'' → ''P''. For the categorical proposition ''All S are P'', the converse is ''All P are S''. Either way, the truth of the converse is generally independent from that of the original statement.Robert Audi, ed. (1999), ''The Cambridge Dictionary of Philosophy'', 2nd ed., Cambridge University Press: "converse". Implicational converse Let ''S'' be a statement of the form ''P implies Q'' (''P'' → ''Q''). Then the converse of ''S'' is the statement ''Q implies P'' (''Q'' → ''P''). In general, the truth of ''S'' says nothing about the truth of its converse, unless the antecedent ''P'' and the consequent ''Q'' are logically equivalent. For example, consider the true statement "If I am a human, then I am mortal." The converse of that statement is "If I am mortal, then I am ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Systems Of Formal Logic
A system is a group of interacting or interrelated elements that act according to a set of rules to form a unified whole. A system, surrounded and influenced by its environment, is described by its boundaries, structure and purpose and expressed in its functioning. Systems are the subjects of study of systems theory and other systems sciences. Systems have several common properties and characteristics, including structure, function(s), behavior and interconnectivity. Etymology The term ''system'' comes from the Latin word ''systēma'', in turn from Greek ''systēma'': "whole concept made of several parts or members, system", literary "composition"."σύστημα" Henry George Liddell, Robert Scott, '' [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
University Of Latvia
University of Latvia ( lv, Latvijas Universitāte, shortened ''LU'') is a state-run university located in Riga, Latvia established in 1919. The ''QS World University Rankings'' places the university between 801st and 1000th globally, seventh in the Baltic states, and 50th in the EECA (Emerging Europe and Central Asia) category. History The University of Latvia, initially named as the Higher School of Latvia ( lv, Latvijas Augstskola) was founded on September 28, 1919, on the basis of the former Riga Polytechnic (founded in 1862). The first rector of the university was chemist Paul Walden. In 1923, the school received its current name with the approval of its constitution, the University of Latvia (Universitas Latviensis). In the period between 1919 and 1940, the University of Latvia was the main centre of higher education, science and culture in the Republic of Latvia. The former building of the Riga Polytechnic on Raiņa bulvāris 19 serves as the university's main buildin ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Calculus Of Equivalent Statements
Hugh MacColl (before April 1885 spelled as Hugh McColl; 1831–1909) was a Scottish mathematician, logician and novelist. Life MacColl was the youngest son of a poor Highland family that was at least partly Gaelic-speaking. Hugh's father died when he was still an infant, and Hugh was educated largely thanks to the efforts of his elder brother Malcolm MacColl, an Episcopalian clergyman and friend and political ally of William Ewart Gladstone. Early in his acquaintanceship with Gladstone, Malcolm MacColl persuaded the Liberal politician to provide funds for Hugh's education at Oxford. It was proposed to send him to Oxford University's St. Edmund Hall, but Gladstone made this conditional on Hugh MacColl agreeing to take orders in the Church of England. Hugh MacColl refused this condition and, as a result, never obtained a university education, which may have limited his contribution to philosophy, and certainly prevented him from ever obtaining a formal academic position. After a ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Hugh MacColl
Hugh MacColl (before April 1885 spelled as Hugh McColl; 1831–1909) was a Scottish mathematician, logician and novelist. Life MacColl was the youngest son of a poor Highland family that was at least partly Gaelic-speaking. Hugh's father died when he was still an infant, and Hugh was educated largely thanks to the efforts of his elder brother Malcolm MacColl, an Episcopalian clergyman and friend and political ally of William Ewart Gladstone. Early in his acquaintanceship with Gladstone, Malcolm MacColl persuaded the Liberal politician to provide funds for Hugh's education at Oxford. It was proposed to send him to Oxford University's St. Edmund Hall, but Gladstone made this conditional on Hugh MacColl agreeing to take orders in the Church of England. Hugh MacColl refused this condition and, as a result, never obtained a university education, which may have limited his contribution to philosophy, and certainly prevented him from ever obtaining a formal academic position. After a ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Begriffsschrift
''Begriffsschrift'' (German for, roughly, "concept-script") is a book on logic by Gottlob Frege, published in 1879, and the formal system set out in that book. ''Begriffsschrift'' is usually translated as ''concept writing'' or ''concept notation''; the full title of the book identifies it as "a formula language, modeled on that of arithmetic, for pure thought." Frege's motivation for developing his formal approach to logic resembled Leibniz's motivation for his ''calculus ratiocinator'' (despite that, in the foreword Frege clearly denies that he achieved this aim, and also that his main aim would be constructing an ideal language like Leibniz's, which Frege declares to be a quite hard and idealistic—though not impossible—task). Frege went on to employ his logical calculus in his research on the foundations of mathematics, carried out over the next quarter century. This is the first work in Analytical Philosophy, a field that future British and Anglo philosophers such as Bertr ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Logical Disjunction
In logic, disjunction is a logical connective typically notated as \lor and read aloud as "or". For instance, the English language sentence "it is raining or it is snowing" can be represented in logic using the disjunctive formula R \lor S , assuming that R abbreviates "it is raining" and S abbreviates "it is snowing". In classical logic, disjunction is given a truth functional semantics according to which a formula \phi \lor \psi is true unless both \phi and \psi are false. Because this semantics allows a disjunctive formula to be true when both of its disjuncts are true, it is an ''inclusive'' interpretation of disjunction, in contrast with exclusive disjunction. Classical proof theoretical treatments are often given in terms of rules such as disjunction introduction and disjunction elimination. Disjunction has also been given numerous non-classical treatments, motivated by problems including Aristotle's sea battle argument, Heisenberg's uncertainty principle, as well ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Logical Conjunction
In logic, mathematics and linguistics, And (\wedge) is the truth-functional operator of logical conjunction; the ''and'' of a set of operands is true if and only if ''all'' of its operands are true. The logical connective that represents this operator is typically written as \wedge or . A \land B is true if and only if A is true and B is true, otherwise it is false. An operand of a conjunction is a conjunct. Beyond logic, the term "conjunction" also refers to similar concepts in other fields: * In natural language, the denotation of expressions such as English "and". * In programming languages, the short-circuit and control structure. * In set theory, intersection. * In lattice theory, logical conjunction ( greatest lower bound). * In predicate logic, universal quantification. Notation And is usually denoted by an infix operator: in mathematics and logic, it is denoted by \wedge, or ; in electronics, ; and in programming languages, &, &&, or and. In Jan ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Ex Contradictione Quodlibet
In classical logic, intuitionistic logic and similar logical systems, the principle of explosion (, 'from falsehood, anything ollows; or ), or the principle of Pseudo-Scotus, is the law according to which any statement can be proven from a contradiction. That is, once a contradiction has been asserted, any proposition (including their negations) can be inferred from it; this is known as deductive explosion. The proof of this principle was first given by 12th-century French philosopher William of Soissons. Priest, Graham. 2011. "What's so bad about contradictions?" In ''The Law of Non-Contradicton'', edited by Priest, Beal, and Armour-Garb. Oxford: Clarendon Press. p. 25. Due to the principle of explosion, the existence of a contradiction ( inconsistency) in a formal axiomatic system is disastrous; since any statement can be proven, it trivializes the concepts of truth and falsity. Around the turn of the 20th century, the discovery of contradictions such as Russell's parado ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Tertium Non Datur
In logic, the law of excluded middle (or the principle of excluded middle) states that for every proposition, either this proposition or its negation is true. It is one of the so-called three laws of thought, along with the law of noncontradiction, and the law of identity. However, no system of logic is built on just these laws, and none of these laws provides inference rules, such as modus ponens or De Morgan's laws. The law is also known as the law (or principle) of the excluded third, in Latin ''principium tertii exclusi''. Another Latin designation for this law is ''tertium non datur'': "no third ossibilityis given". It is a tautology. The principle should not be confused with the semantical principle of bivalence, which states that every proposition is either true or false. The principle of bivalence always implies the law of excluded middle, while the converse is not always true. A commonly cited counterexample uses statements unprovable now, but provable in the future ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Reductio Ad Absurdum
In logic, (Latin for "reduction to absurdity"), also known as (Latin for "argument to absurdity") or ''apagogical arguments'', is the form of argument that attempts to establish a claim by showing that the opposite scenario would lead to absurdity or contradiction. This argument form traces back to Ancient Greek philosophy and has been used throughout history in both formal mathematical and philosophical reasoning, as well as in debate. Examples The "absurd" conclusion of a ''reductio ad absurdum'' argument can take a range of forms, as these examples show: * The Earth cannot be flat; otherwise, since Earth assumed to be finite in extent, we would find people falling off the edge. * There is no smallest positive rational number because, if there were, then it could be divided by two to get a smaller one. The first example argues that denial of the premise would result in a ridiculous conclusion, against the evidence of our senses. The second example is a mathematical proof ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |