|
Hans Kamp
Johan Anthony Willem "Hans" Kamp (born 5 September 1940) is a Dutch philosopher and linguist, responsible for introducing discourse representation theory (DRT) in 1981. Kamp was born in Den Burg. He received a Ph.D. in Philosophy from UCLA in 1968, and has taught at Cornell University, University of London, University of Texas, Austin, and University of Stuttgart. His dissertation, ''Tense Logic and the Theory of Linear Order'' (1968) was devoted to functional completeness in tense logic, the main result being that all temporal operators are definable in terms of "since" and "until", provided that the underlying temporal structure is a continuous linear ordering. Kamp's 1971 paper on "now" (published in ''Theoria'') was the first employment of double-indexing in model theoretic semantics. His doctoral committee included Richard Montague as chairman, Chen Chung Chang, Alonzo Church, David Kaplan, Yiannis N. Moschovakis, and Jordan Howard Sobel. Kamp became a corresponding membe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Western Philosophy
Western philosophy encompasses the philosophical thought and work of the Western world. Historically, the term refers to the philosophical thinking of Western culture, beginning with the ancient Greek philosophy of the pre-Socratics. The word ''philosophy'' itself originated from the Ancient Greek (φιλοσοφία), literally, "the love of wisdom" grc, φιλεῖν , "to love" and σοφία '' sophía'', "wisdom"). History Ancient The scope of ancient Western philosophy included the problems of philosophy as they are understood today; but it also included many other disciplines, such as pure mathematics and natural sciences such as physics, astronomy, and biology (Aristotle, for example, wrote on all of these topics). Pre-Socratics The pre-Socratic philosophers were interested in cosmology; the nature and origin of the universe, while rejecting mythical answers to such questions. They were specifically interested in the (the cause or first principle) of the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cornell University
Cornell University is a private statutory land-grant research university based in Ithaca, New York. It is a member of the Ivy League. Founded in 1865 by Ezra Cornell and Andrew Dickson White, Cornell was founded with the intention to teach and make contributions in all fields of knowledge—from the classics to the sciences, and from the theoretical to the applied. These ideals, unconventional for the time, are captured in Cornell's founding principle, a popular 1868 quotation from founder Ezra Cornell: "I would found an institution where any person can find instruction in any study." Cornell is ranked among the top global universities. The university is organized into seven undergraduate colleges and seven graduate divisions at its main Ithaca campus, with each college and division defining its specific admission standards and academic programs in near autonomy. The university also administers three satellite campuses, two in New York City and one in Education City, Qatar ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
David Kaplan (philosopher)
David Benjamin Kaplan (; born September 17, 1933) is an American philosopher. He is the Hans Reichenbach Professor of Scientific Philosophy at the UCLA Department of Philosophy. His philosophical work focuses on the philosophy of language, logic, metaphysics, epistemology and the philosophy of Frege and Russell. He is best known for his work on demonstratives, propositions, and reference in intensional contexts. He was elected a Fellow of the American Academy of Arts & Sciences in 1983 and a Corresponding Fellow of the British Academy in 2007. Education and career Kaplan began as an undergraduate at UCLA in 1951, admitted on academic probation "owing to poor grades." While he started as a music major due to his interest in jazz, he was soon persuaded by his academic counselor Veronica Kalish to take the logic course taught by her husband Donald Kalish. Kaplan went on to earn a BA in philosophy in 1956 and a BA in mathematics in 1957, continuing in the department of philosophy ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alonzo Church
Alonzo Church (June 14, 1903 – August 11, 1995) was an American mathematician, computer scientist, logician, philosopher, professor and editor who made major contributions to mathematical logic and the foundations of theoretical computer science. He is best known for the lambda calculus, the Church–Turing thesis, proving the unsolvability of the Entscheidungsproblem, the Frege–Church ontology, and the Church–Rosser theorem. He also worked on philosophy of language (see e.g. Church 1970). Alongside his student Alan Turing, Church is considered one of the founders of computer science. Life Alonzo Church was born on June 14, 1903, in Washington, D.C., where his father, Samuel Robbins Church, was a Justice of the Peace and the judge of the Municipal Court for the District of Columbia. He was the grandson of Alonzo Webster Church (1829-1909), United States Senate Librarian from 1881-1901, and great grandson of Alonzo Church, a Professor of Mathematics and Astronomy and 6th Pr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Chen Chung Chang
Chen Chung Chang (Chinese: 张晨钟) was a mathematician who worked in model theory. He obtained his PhD from Berkeley in 1955 on "Cardinal and Ordinal Factorization of Relation Types" under Alfred Tarski. He wrote the standard text on model theory. Chang's conjecture and Chang's model are named after him. He also proved the ordinal partition theorem (expressed in the arrow notation for Ramsey theory) ωω→(ωω,3)2, originally a problem of Erdős and Hajnal. He also introduced MV-algebras as models for Łukasiewicz logic. Chang was a professor at the mathematics department of the University of California, Los Angeles The University of California, Los Angeles (UCLA) is a public land-grant research university in Los Angeles, California. UCLA's academic roots were established in 1881 as a teachers college then known as the southern branch of the California St .... Selected publications * * * C. C. Chang. Algebraic analysis of many-valued logics. Transactions of the Am ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Semantics
Semantics (from grc, σημαντικός ''sēmantikós'', "significant") is the study of reference, meaning, or truth. The term can be used to refer to subfields of several distinct disciplines, including philosophy Philosophy (from , ) is the systematized study of general and fundamental questions, such as those about existence, reason, knowledge, values, mind, and language. Such questions are often posed as problems to be studied or resolved. Some ..., linguistics and computer science. History In English, the study of meaning in language has been known by many names that involve the Ancient Greek word (''sema'', "sign, mark, token"). In 1690, a Greek rendering of the term ''semiotics'', the interpretation of signs and symbols, finds an early allusion in John Locke's ''An Essay Concerning Human Understanding'': The third Branch may be called [''simeiotikí'', "semiotics"], or the Doctrine of Signs, the most usual whereof being words, it is aptly enough ter ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Model Theory
In mathematical logic, model theory is the study of the relationship between formal theories (a collection of sentences in a formal language expressing statements about a mathematical structure), and their models (those structures in which the statements of the theory hold). The aspects investigated include the number and size of models of a theory, the relationship of different models to each other, and their interaction with the formal language itself. In particular, model theorists also investigate the sets that can be defined in a model of a theory, and the relationship of such definable sets to each other. As a separate discipline, model theory goes back to Alfred Tarski, who first used the term "Theory of Models" in publication in 1954. Since the 1970s, the subject has been shaped decisively by Saharon Shelah's stability theory. Compared to other areas of mathematical logic such as proof theory, model theory is often less concerned with formal rigour and closer in spirit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Theoria (philosophy Journal)
''Theoria: A Swedish Journal of Philosophy and Psychology'' is a peer review, peer-reviewed academic journal publishing research in all areas of philosophy established in 1935 by Åke Petzäll (:sv:Åke Petzäll, sv). It is published quarterly by Wiley-Blackwell on behalf of Stiftelsen Theoria. The current editor-in-chief is Sven Ove Hansson. ''Theoria'' publishes articles, reviews, and shorter notes and discussions. Editors Notable articles Among the contributions to philosophy, logic, and mathematics first published in ''Theoria'' are: * Carl Gustav Hempel, Le problème de la vérité, ''Theoria'' 3, 1937, 206–244. (Hempel's paradox, Hempel's confirmation paradoxes) * Ernst Cassirer, Was ist "Subjektivismus"?, ''Theoria'' 5, 1939, 111–140. * Alf Ross, Imperatives and Logic, ''Theoria'' 7, 1941, 53–71. (Ross' deontic paradox) * Georg Henrik von Wright, The Paradoxes of Confirmation, ''Theoria'' 31, 1965, 255–274. * Per Lindström, First Order Predicate Logic with Gene ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Total Order
In mathematics, a total or linear order is a partial order in which any two elements are comparable. That is, a total order is a binary relation \leq on some set X, which satisfies the following for all a, b and c in X: # a \leq a ( reflexive). # If a \leq b and b \leq c then a \leq c ( transitive). # If a \leq b and b \leq a then a = b ( antisymmetric). # a \leq b or b \leq a (strongly connected, formerly called total). Total orders are sometimes also called simple, connex, or full orders. A set equipped with a total order is a totally ordered set; the terms simply ordered set, linearly ordered set, and loset are also used. The term ''chain'' is sometimes defined as a synonym of ''totally ordered set'', but refers generally to some sort of totally ordered subsets of a given partially ordered set. An extension of a given partial order to a total order is called a linear extension of that partial order. Strict and non-strict total orders A on a set X is a strict partial ord ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tense Logic
In logic, temporal logic is any system of rules and symbolism for representing, and reasoning about, propositions qualified in terms of time (for example, "I am ''always'' hungry", "I will ''eventually'' be hungry", or "I will be hungry ''until'' I eat something"). It is sometimes also used to refer to tense logic, a modal logic-based system of temporal logic introduced by Arthur Prior in the late 1950s, with important contributions by Hans Kamp. It has been further developed by computer scientists, notably Amir Pnueli, and logicians. Temporal logic has found an important application in formal verification, where it is used to state requirements of hardware or software systems. For instance, one may wish to say that ''whenever'' a request is made, access to a resource is ''eventually'' granted, but it is ''never'' granted to two requestors simultaneously. Such a statement can conveniently be expressed in a temporal logic. Motivation Consider the statement "I am hungry". Though its m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Functional Completeness
In logic, a functionally complete set of logical connectives or Boolean operators is one which can be used to express all possible truth tables by combining members of the set into a Boolean expression.. ("Complete set of logical connectives").. (" nctional completeness of set of logical operators"). A well-known complete set of connectives is . Each of the singleton sets and is functionally complete. A gate or set of gates which is functionally complete can also be called a universal gate / gates. A functionally complete set of gates may utilise or generate 'garbage bits' as part of its computation which are either not part of the input or not part of the output to the system. In a context of propositional logic, functionally complete sets of connectives are also called (expressively) adequate.. (Defines "expressively adequate", shortened to "adequate set of connectives" in a section heading.) From the point of view of digital electronics, functional completeness means that ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
