|
Tarski's World
Tarski's World is a computer-based introduction to first-order logic written by Jon Barwise and John Etchemendy. It is named after the mathematical logician Alfred Tarski. The package includes a book, which serves as a textbook and manual, and a computer program which together serve as an introduction to the semantics of logic through games in which simple, three-dimensional worlds are populated with various geometric figures and these are used to test the truth or falsehood of first-order logic sentences. The program is also included in Language, Proof and Logic Language, Proof and Logic is an educational software package, devised and written by Jon Barwise and John Etchemendy, geared to teaching formal logic through the use of a tight integration between a textbook (same name as the package) and four sof ... package. The programme was later extended into Hyperproof. The programme * Barwise, J., & Etchemendy, J. (1993). ''Tarski's world''. Stanford, Calif: CSLI Publ. * Barker ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
First-order 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 ax ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jon Barwise
Kenneth Jon Barwise (; June 29, 1942 – March 5, 2000) was an American mathematician, philosopher and logician who proposed some fundamental revisions to the way that logic is understood and used. Education and career Born in Independence, Missouri to Kenneth T. and Evelyn Barwise, Jon was a precocious child. A pupil of Solomon Feferman at Stanford University, Barwise started his research in infinitary logic. After positions as assistant professor at Yale University and the University of Wisconsin, during which time his interests turned to natural language, he returned to Stanford in 1983 to direct the Center for the Study of Language and Information. He began teaching at Indiana University in 1990. He was elected a Fellow of the American Academy of Arts and Sciences in 1999. In his last year, Barwise was invited to give the 2000 Gödel Lecture; he died prior to the lecture. Philosophical and logical work Barwise contended that, by being explicit about the context in whic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
John Etchemendy
John W. Etchemendy (born 1952 in Reno, Nevada) is an American logician and philosopher who served as Stanford University's twelfth Provost. He succeeded John L. Hennessy to the post on September 1, 2000 and stepped down on January 31, 2017. Education and career John Etchemendy received his bachelor's and master's degrees at the University of Nevada, Reno before earning his PhD in philosophy at Stanford in 1982. He has been a faculty member in Stanford's Department of Philosophy since 1983, prior to which he was a faculty member in the Philosophy Department at Princeton University. He is also a faculty member of Stanford's Symbolic Systems Program and a senior researcher at the Center for the Study of Language and Information at Stanford. At Stanford, Etchemendy served as director of the Center for the Study of Language and Information from 1990 to 1993, senior associate dean in the School of Humanities and Sciences from 1993 to 1997, and chair of the Department of Philosophy ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alfred Tarski
Alfred Tarski (, born Alfred Teitelbaum;School of Mathematics and Statistics, University of St Andrews ''School of Mathematics and Statistics, University of St Andrews''. January 14, 1901 – October 26, 1983) was a Polish-American logician and mathematician. A prolific author best known for his work on model theory, metamathematics, and algebraic logic, he also contributed to abstract algebra, topology, geometry, measure theory, mathematical logic, set theory, and analytic philosophy. Educated in Poland at the University of Warsaw, and a member of the Lwów–Warsaw school of logic and the Warsaw school of mathematics, he immigrated to the United States in 1939 where he became a naturalized citizen in 1945. Tarski taught and carried out research in mathematics at the University of California, Berkeley, from 1942 until his death in 1983. Feferman A. His biographers Anita Burdman Feferman and Solomon Feferman state that, "Along with his contemporary, Kurt Gödel, he cha ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Language, Proof And Logic
Language, Proof and Logic is an educational software package, devised and written by Jon Barwise and John Etchemendy, geared to teaching formal logic through the use of a tight integration between a textbook (same name as the package) and four software programs, where three of them are logic related (Boole, Fitch and Tarski's World) and the other (Submit) is an internet-based grading service. The name is a pun derived from ''Language, Truth, and Logic'', the philosophy book by A. J. Ayer. On September 2, 2014, there was launched a massive open online course (MOOC) with the same name, which utilizes this educational software package. Description A short description of the programs: * Boole (named after George Boole) - a program that facilitates the construction and checking of truth tables and related notions ( tautology, tautological consequence, etc.); * Fitch (named after Frederic Brenton Fitch) - a natural deduction proof environment in Fitch-style calculus for giving and chec ... [...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 ax ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
