|
Dialogical Logic
Dialogical logic (, also known as the logic of dialogues) is a pragmatic approach to the semantics of logic developed in the 1950s by Paul Lorenzen and Kuno Lorenz. It models logical reasoning as a dialogue game between two participants—a "Proponent" who asserts and defends a thesis and an "Opponent" who challenges it—using concepts from game theory such as "winning a play" and "winning strategy." In this framework, a formula is considered logically valid if the Proponent has a winning strategy for its defense against all possible challenges. Though dialogical logic was among the first approaches to logical semantics using game-theoretical concepts, it should be distinguished from broader concept of game semantics. While both share game-theoretical foundations, they differ in philosophical background and technical development. Dialogical logic emphasizes the normative practice of reasoning and argumentation, drawing inspiration from constructivist philosophy, whereas other game ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Semantics Of Logic
In logic, the semantics of logic or formal semantics is the study of the meaning and interpretation of formal languages, formal systems, and (idealizations of) natural languages. This field seeks to provide precise mathematical models that capture the pre-theoretic notions of truth, validity, and logical consequence. While logical syntax concerns the formal rules for constructing well-formed expressions, logical semantics establishes frameworks for determining when these expressions are true and what follows from them. The development of formal semantics has led to several influential approaches, including model-theoretic semantics (pioneered by Alfred Tarski), proof-theoretic semantics (associated with Gerhard Gentzen and Michael Dummett), possible worlds semantics (developed by Saul Kripke and others for modal logic and related systems), algebraic semantics (connecting logic to abstract algebra), and game semantics (interpreting logical validity through game ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Logical Pluralism
Logical pluralism also pluralistic logic and pluralistic logicism is the philosophical view that there is more than one correct logic. It stands in contrast to logical monism which argues that there is a single unique logic. There are different standards both for what counts as a logic and what exactly it means for a logic to be "correct", however, most debates about logical pluralism defined logic as a theory of validity. In other words, logic is the study of what constitutes a valid inference. Following from this definition, "correctness" has been defined in terms of whether or not a logic offers ''the'' correct form of valid inference. Logical pluralism holds that multiple different types of valid inference (i.e., at least two different consequence relations) can be correct. Forms of logical pluralisms have been around since the first half of the 20th century, if not earlier. Perhaps most famous of these early models is found in the work of Rudolf Carnap. Newfound interest i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rob Grootendorst
Rob Grootendorst (11 February 1944 in Schiedam – 23 February 2000 in Amsterdam) was a Dutch communication and argumentation theory scholar. He was professor for Dutch speech communication at the University of Amsterdam. His contributions to the argumentation field include the co-foundation of the pragma-dialectic school in argumentation theory. He also wrote several books on the life and works of the Dutch writer and politician Theo Thijssen. Biography Grootendorst was a teacher at an elementary school in the 1960s. He studied Dutch studies at the University of Amsterdam since 1980, and became a Ph.D. in 1982 in Speech Communication. The dissertation was jointly written with Frans H. van Eemeren. They jointly founded the International Society for the Study of Argumentation in 1986. Selected works *''Argumentation, Communication, and Fallacies: A Pragma-Dialectical Perspective'' (Hillsdale: Erlbaum, 1992), with van Eemeren *''Fundamentals of Argumentation Theory: A Handbook ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dov Gabbay
Dov M. Gabbay (, ; born October 26, 1945) is an Israeli logician. He is Augustus De Morgan Professor Emeritus of Logic at the Group of Logic, Language and Computation, Department of Computer Science, King's College London. Work Gabbay has authored over four hundred and fifty research papers and over thirty research monographs. He is editor of several international journals, and of many reference works and handbooks of logic, including the ''Handbook of Philosophical Logic'' (with Franz Guenthner), the ''Handbook of Logic in Computer Science]'' (with Samson Abramsky and T. S. E. Maibaum), and the ''Handbook of Logic in Artificial Intelligence and Logic Programming'' (with C.J. Hogger and J.A. Robinson). He is well-known for pioneering work on logic in computer science and artificial intelligence, especially the application of (executable) temporal logics in computer science, in particular formal verification, the logical foundations of non-monotonic reasoning and artificial ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Frans H
Frans is an Afrikaans, Danish, Dutch, Finnish, Icelandic, Norwegian, and Swedish given name, sometimes as a short form of ''François'' or ''Franciscus''. One cognate of Frans in English is ''Francis''. Given name * Frans van Aarssens (1572–1641), Dutch diplomat and statesman * Frans Ackerman (1330–1387), Flemish statesman * Frans Adelaar (born 1960), Dutch football player and manager * Frans Alphons Maria Alting von Geusau (born 1933), Dutch legal scholar and diplomat * Frans Aerenhouts (1937–2022), Belgian cyclist * Frans Ananias (born 1972), Namibian footballer * Frans Andersson (1911–1988), Danish bass-baritone * Frans Andriessen (1929–2019), Dutch politician * Frans Anneessens (1660–1719), Flemish protest leader * Frans van Anraat (born 1942), Dutch businessman and convicted war criminal * Frans Badens (fl. 1571–1618), Flemish painter * Frans Bak (born 1958), Danish composer, choral conductor, saxophonist, and pianist * Frans Decker (1684–1751), 18th-century p ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Andreas Blass
Andreas Raphael Blass (born October 27, 1947) is a mathematician, currently a professor at the University of Michigan. He works in mathematical logic, particularly set theory, and theoretical computer science. Blass graduated from the University of Detroit, where he was a Putnam Fellow in 1965, in 1966 with a B.S. in physics. He received his Ph.D. in 1970 from Harvard University, with a thesis on ''Orderings of Ultrafilters'' written under the supervision of Frank Wattenberg. Since 1970 he has been employed by the University of Michigan, first as a ''T.H. Hildebrandt Research Instructor'' (1970–72), then assistant professor (1972–76), associate professor (1976–84) and since 1984 he has been a full professor there. In 2014, he became a Fellow of the American Mathematical Society. Selected publications and results In 1984 Blass proved that the existence of a basis for every vector space is equivalent to the axiom of choice. He made important contributions in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Johan Van Benthem (logician)
Johannes Franciscus Abraham Karel (Johan) van Benthem (born 12 June 1949 in Rijswijk) is a University Professor (') of logic at the University of Amsterdam at the Institute for Logic, Language and Computation and professor of philosophy at Stanford University (at CSLI). He was awarded the Spinozapremie in 1996 and elected a Foreign Fellow of the American Academy of Arts & Sciences in 2015. Biography Van Benthem studied physics ( B.Sc. 1969), philosophy ( M.A. 1972) and mathematics ( M.Sc. 1973) at the University of Amsterdam and received a PhD from the same university under supervision of Martin Löb in 1977. Before becoming University Professor in 2003, he held appointments at the University of Amsterdam (1973–1977), at the University of Groningen (1977–1986), and as a professor at the University of Amsterdam (1986–2003). In 1992 he was elected member of the Royal Netherlands Academy of Arts and Sciences. Van Benthem is known for his research in the area of modal log ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Samson Abramsky
Samson Abramsky (born 12 March 1953) is a British computer scientist who is a Professor of Computer Science at University College London. He was previously the Christopher Strachey Professor of Computing at Wolfson College, Oxford, from 2000 to 2021. Abramsky's early work included contributions to domain theory and the connections thereof with geometric logic. Since then, his work has covered the lazy lambda calculus, strictness analysis, concurrency theory, interaction categories and geometry of interaction, game semantics and quantum computing. Notably, he co-pioneered categorical quantum mechanics. More recently, he has been applying methods from categorical semantics to finite model theory, with applications to descriptive complexity. Education Abramsky was educated at Hasmonean Grammar School for Boys, Hendon and at King's College, Cambridge (BA 1975, MA Philosophy 1979, Diploma in Computer Science) and Queen Mary, University of London (PhD Computer Science 1988, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Defeasible Reasoning
In philosophy of logic, defeasible reasoning is a kind of provisional reasoning that is rationally compelling, though not deductively valid. It usually occurs when a rule is given, but there may be specific exceptions to the rule, or subclasses that are subject to a different rule. Defeasibility is found in literatures that are concerned with argument and the process of argument, or heuristic reasoning. Defeasible reasoning is a particular kind of non-demonstrative reasoning, where the reasoning does not produce a full, complete, or final demonstration of a claim, i.e., where fallibility and corrigibility of a conclusion are acknowledged. In other words, defeasible reasoning produces a contingent statement or claim. Defeasible reasoning is also a kind of ampliative reasoning because its conclusions reach beyond the pure meanings of the premises. Defeasible reasoning finds its fullest expression in jurisprudence, ethics and moral philosophy, epistemology, pragmatics and con ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Argumentation Framework
In artificial intelligence and related fields, an argumentation framework is a way to deal with contentious information and draw conclusions from it using formalized arguments. In an abstract argumentation framework, entry-level information is a set of abstract arguments that, for instance, represent data or a proposition. Conflicts between arguments are represented by a binary relation on the set of arguments. In concrete terms, you represent an argumentation framework with a directed graph such that the nodes are the arguments, and the arrows represent the attack relation. There exist some extensions of the Dung's framework, like the logic-based argumentation frameworks or the value-based argumentation frameworks. Abstract argumentation frameworks Formal framework Abstract argumentation frameworks, also called argumentation frameworks ''à la Dung'', are defined formally as a pair: * A set of abstract elements called ''arguments'', denoted A * A binary relation on A, calle ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linear Logic
Linear logic is a substructural logic proposed by French logician Jean-Yves Girard as a refinement of classical and intuitionistic logic, joining the dualities of the former with many of the constructive properties of the latter. Although the logic has also been studied for its own sake, more broadly, ideas from linear logic have been influential in fields such as programming languages, game semantics, and quantum physics (because linear logic can be seen as the logic of quantum information theory), as well as linguistics, particularly because of its emphasis on resource-boundedness, duality, and interaction. Linear logic lends itself to many different presentations, explanations, and intuitions. Proof-theoretically, it derives from an analysis of classical sequent calculus in which uses of (the structural rules) contraction and weakening are carefully controlled. Operationally, this means that logical deduction is no longer merely about an ever-expanding collection of pe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jean-Yves Girard
Jean-Yves Girard (; born 1947) is a French logician working in proof theory. He is a research director (emeritus) at the mathematical institute of University of Aix-Marseille, at Luminy. Biography Jean-Yves Girard is an alumnus of the École normale supérieure de Saint-Cloud. He made a name for himself in the 1970s with his proof of strong normalization in a system of second-order logic called System F. This result gave a new proof of Takeuti's conjecture, which was proven a few years earlier by William W. Tait, Motō Takahashi and Dag Prawitz. For this purpose, he introduced the notion of "reducibility candidate" ("candidat de réducibilité"). He is also credited with the discovery of Girard's paradox, linear logic, the geometry of interaction, ludics, and (satirically) the mustard watch. He obtained the CNRS Silver Medal in 1983 and is a member of the French Academy of Sciences. Bibliography * * * * Jean-Yves Girard (2011). ''The Blind Spot: Lectures on ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |