|
Extensional Logic
Intensional logic is an approach to predicate logic that extends first-order logic, which has quantifiers that range over the individuals of a universe (''extensions''), by additional quantifiers that range over terms that may have such individuals as their value (''intensions''). The distinction between intensional and extensional entities is parallel to the distinction between sense and reference. Overview Logic is the study of proof and deduction as manifested in language (abstracting from any underlying psychological or biological processes). Logic is not a closed, completed science, and presumably, it will never stop developing: the logical analysis can penetrate into varying depths of the language (sentences regarded as atomic, or splitting them to predicates applied to individual terms, or even revealing such fine logical structures like modal, temporal, dynamic, epistemic ones). In order to achieve its special goal, logic was forced to develop its own formal tools, mo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Predicate Logic
First-order logic—also known as predicate logic, quantificational logic, and first-order predicate calculus—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantified variables over non-logical objects, and allows the use of sentences that contain variables, so that rather than propositions such as "Socrates is a man", one can have expressions in the form "there exists x such that x is Socrates and x is a man", where "there exists''"'' is a quantifier, while ''x'' is a variable. This distinguishes it from propositional logic, which does not use quantifiers or relations; in this sense, propositional logic is the foundation of first-order logic. A theory about a topic is usually a first-order logic together with a specified domain of discourse (over which the quantified variables range), finitely many functions from that domain to itself, finitely many predicates defined on that domain, and a set of a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Aristotle
Aristotle (; grc-gre, Ἀριστοτέλης ''Aristotélēs'', ; 384–322 BC) was a Greek philosopher and polymath during the Classical period in Ancient Greece. Taught by Plato, he was the founder of the Peripatetic school of philosophy within the Lyceum and the wider Aristotelian tradition. His writings cover many subjects including physics, biology, zoology, metaphysics, logic, ethics, aesthetics, poetry, theatre, music, rhetoric, psychology, linguistics, economics, politics, meteorology, geology, and government. Aristotle provided a complex synthesis of the various philosophies existing prior to him. It was above all from his teachings that the West inherited its intellectual lexicon, as well as problems and methods of inquiry. As a result, his philosophy has exerted a unique influence on almost every form of knowledge in the West and it continues to be a subject of contemporary philosophical discussion. Little is known about his life. Aristotle was ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Open Sentence
An open formula is a formula that contains at least one free variable. An open formula does not have a truth value assigned to it, in contrast with a closed formula which constitutes a proposition and thus can have a truth value like ''true'' or ''false''. An open formula can be transformed into a closed formula by applying quantifiers or specifying of the domain of discourse of individuals for each free variable denoted x, y, z....or x1, x2, x3.... This transformation is called capture of the free variables to make them bound variables, bound to a domain of individual constants. For example, when reasoning about natural numbers, the formula "''x''+2 > ''y''" is open, since it contains the free variables ''x'' and ''y''. In contrast, the formula " ∃''y'' ∀''x'': ''x''+2 > ''y''" is closed, and has truth value ''true''. An example of closed formula with truth value ''false'' involves the sequence of Fermat numbers :F_ = 2^ + 1, studied by Fermat in connection to the primal ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
De Dicto And De Re
''De dicto'' and ''de re'' are two phrases used to mark a distinction in intensional statements, associated with the intensional operators in many such statements. The distinction is used regularly in metaphysics and in philosophy of language. The literal translation of the phrase "''de dicto''" is "about what is said", whereas ''de re'' translates as "about the thing". The original meaning of the Latin locutions may help to elucidate the living meaning of the phrases, in the distinctions they mark. The distinction can be understood by examples of intensional contexts of which three are considered here: a context of thought, a context of desire, and a context of modality. Context of thought There are two possible interpretations of the sentence "Peter believes someone is out to get him". On one interpretation, 'someone' is unspecific and Peter suffers a general paranoia; he believes that it is true that a person is out to get him, but does not necessarily have any beliefs about ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Modal Operator
A modal connective (or modal operator) is a logical connective for modal logic. It is an operator which forms propositions from propositions. In general, a modal operator has the "formal" property of being non- truth-functional in the following sense: The truth-value of composite formulae sometimes depend on factors other than the actual truth-value of their components. In the case of alethic modal logic, a modal operator can be said to be truth-functional in another sense, namely, that of being sensitive only to the distribution of truth-values across possible worlds, actual or not. Finally, a modal operator is "intuitively" characterized by expressing a modal attitude (such as necessity, possibility, belief, or knowledge) about the proposition to which the operator is applied. See also Garson, James, "Modal Logic", The Stanford Encyclopedia of Philosophy (Summer 2021 Edition), Edward N. Zalta (ed.), URL = Syntax for modal operators The syntax rules for modal operators \Box an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
De Morgan's Laws
In propositional logic and Boolean algebra, De Morgan's laws, also known as De Morgan's theorem, are a pair of transformation rules that are both valid rules of inference. They are named after Augustus De Morgan, a 19th-century British mathematician. The rules allow the expression of conjunctions and disjunctions purely in terms of each other via negation. The rules can be expressed in English as: * The negation of a disjunction is the conjunction of the negations * The negation of a conjunction is the disjunction of the negations or * The complement of the union of two sets is the same as the intersection of their complements * The complement of the intersection of two sets is the same as the union of their complements or * not (A or B) = (not A) and (not B) * not (A and B) = (not A) or (not B) where "A or B" is an " inclusive or" meaning ''at least'' one of A or B rather than an " exclusive or" that means ''exactly'' one of A or B. In set theory and Boolean algebra, th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Duality (mathematics)
In mathematics, a duality translates concepts, theorems or mathematical structures into other concepts, theorems or structures, in a one-to-one fashion, often (but not always) by means of an involution operation: if the dual of is , then the dual of is . Such involutions sometimes have fixed points, so that the dual of is itself. For example, Desargues' theorem is self-dual in this sense under the ''standard duality in projective geometry''. In mathematical contexts, ''duality'' has numerous meanings. It has been described as "a very pervasive and important concept in (modern) mathematics" and "an important general theme that has manifestations in almost every area of mathematics". Many mathematical dualities between objects of two types correspond to pairings, bilinear functions from an object of one type and another object of the second type to some family of scalars. For instance, ''linear algebra duality'' corresponds in this way to bilinear maps from pairs of ve ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Metarule
Meta (from the Greek μετά, ''meta'', meaning "after" or "beyond") is a prefix meaning "more comprehensive" or "transcending". In modern nomenclature, ''meta''- can also serve as a prefix meaning self-referential, as a field of study or endeavor (metatheory: theory about a theory, metamathematics: mathematical theories about mathematics, meta-axiomatics or meta-axiomaticity: axioms about axiomatic systems, metahumor: joking about the ways humor is expressed, etc.). Original Greek meaning In Greek, the prefix ''meta-'' is generally less esoteric than in English; Greek ''meta-'' is equivalent to the Latin words ''post-'' or ''ad-''. The use of the prefix in this sense occurs occasionally in scientific English terms derived from Greek. For example: the term ''Metatheria'' (the name for the clade of marsupial mammals) uses the prefix ''meta-'' in the sense that the ''Metatheria'' occur on the tree of life adjacent to the ''Theria'' (the placental mammals). Epistemology In epi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alethic Logic
Modal logic is a collection of formal systems developed to represent statements about necessity and possibility. It plays a major role in philosophy of language, epistemology, metaphysics, and natural language semantics. Modal logics extend other systems by adding unary operators \Diamond and \Box, representing possibility and necessity respectively. For instance the modal formula \Diamond P can be read as "possibly P" while \Box P can be read as "necessarily P". Modal logics can be used to represent different phenomena depending on what kind of necessity and possibility is under consideration. When \Box is used to represent epistemic necessity, \Box P states that P is epistemically necessary, or in other words that it is known. When \Box is used to represent deontic necessity, \Box P states that P is a moral or legal obligation. In the standard relational semantics for modal logic, formulas are assigned truth values relative to a '' possible world''. A formula's truth value at ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Transparent Intensional Logic
Transparent intensional logic (frequently abbreviated as TIL) is a logical system created by Pavel Tichý. Due to its rich ''procedural semantics'' TIL is in particular apt for the logical analysis of natural language. From the formal point of view, TIL is a hyperintensional, partial, typed lambda calculus. TIL applications cover a wide range of topics from formal semantics, philosophy of language, epistemic logic, philosophical, and formal logic. TIL provides an overarching semantic framework for all sorts of discourse, whether colloquial, scientific, mathematical or logical. The semantic theory is a procedural one, according to which sense is an abstract, pre-linguistic procedure detailing what operations to apply to what procedural constituents to arrive at the product (if any) of the procedure. TIL procedures, known as ''constructions'', are hyperintensionally individuated. Construction is the single most important notion of transparent intensional logic, being a philosophi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Proof Calculus
In mathematical logic, a proof calculus or a proof system is built to prove statements. Overview A proof system includes the components: * Language: The set ''L'' of formulas admitted by the system, for example, propositional logic or first-order logic. * Rules of inference: List of rules that can be employed to prove theorems from axioms and theorems. * Axioms: Formulas in ''L'' assumed to be valid. All theorems are derived from axioms. Usually a given proof calculus encompasses more than a single particular formal system, since many proof calculi are under-determined and can be used for radically different logics. For example, a paradigmatic case is the sequent calculus, which can be used to express the consequence relations of both intuitionistic logic and relevance logic. Thus, loosely speaking, a proof calculus is a template or design pattern, characterized by a certain style of formal inference, that may be specialized to produce specific formal systems, namely by specifying ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sense And Reference
In the philosophy of language, the distinction between sense and reference was an idea of the German philosopher and mathematician Gottlob Frege in 1892 (in his paper "On Sense and Reference"; German: "Über Sinn und Bedeutung"), reflecting the two ways he believed a singular term may have meaning. The reference (or "referent"; ''Bedeutung'') of a ''proper name'' is the object it means or indicates (''bedeuten''), whereas its sense (''Sinn'') is what the name expresses. The reference of a ''sentence'' is its truth value, whereas its sense is the thought that it expresses."On Sense and Reference" Über Sinn und Bedeutung" ''Zeitschrift für Philosophie und philosophische Kritik'', vol. 100 (1892), pp. 25–50, esp. p. 31. Frege justified the distinction in a number of ways. #Sense is something possessed by a name, whether or not it has a reference. For example, the name "Odysseus" is intelligible, and therefore has a sense, even though there is no individual object (its referenc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.jpg "Click for more on -> Metarule")
