Opacity and Paradox
Total Page:16
File Type:pdf, Size:1020Kb

Load more
Recommended publications
-
Peter Thomas Geach, 1916–2013
PETER GEACH Peter Thomas Geach 1916–2013 PETER GEACH was born on 29 March 1916 at 41, Royal Avenue, Chelsea. He was the son of George Hender Geach, a Cambridge graduate working in the Indian Educational Service (IES), who later taught philosophy at Lahore. George Geach was married to Eleonore Sgnonina, the daughter of a Polish civil engineer who had emigrated to England. The marriage was not a happy one: after a brief period in India Eleonore returned to England to give birth and never returned to her husband. Peter Geach’s first few years were spent in the house of his Polish grandparents in Cardiff, but at the age of four his father had him made the ward of a former nanny of his own, an elderly nonconformist lady named Miss Tarr. When Peter’s mother tried to visit him, Miss Tarr warned him that a dangerous mad woman was coming, so that he cowered away from her when she tried to embrace him. As she departed she threw a brick through a window, and from that point there was no further contact between mother and son. When he was eight years old he became a boarder at Llandaff Cathedral School. Soon afterwards his father was invalided out of the IES and took charge of his education. To the surprise of his Llandaff housemaster, Peter won a scholarship to Clifton College, Bristol. Geach père had learnt moral sciences at Trinity College Cambridge from Bertrand Russell and G. E. Moore, and he inducted his son into the delights of philosophy from an early age. -
Section 1.4: Predicate Logic
Section 1.4: Predicate Logic January 22, 2021 Abstract We now consider the logic associated with predicate wffs, including a new set of derivation rules for demonstrating validity (the analogue of tautology in the propositional calculus) – that is, for proving theorems! 1 Derivation rules • First of all, all the rules of propositional logic still hold. Whew! Propositional wffs are simply boring, variable-less predicate wffs. • Our author suggests the following “general plan of attack”: – strip off the quantifiers – work with the separate wffs – insert quantifiers as necessary Now, how may we legitimately do so? Consider the classic syllo- gism: a. (All) Humans are mortal. b. Socrates is human. Therefore Socrates is mortal. The way we reason is that the rule “Humans are mortal” applies to the specific example “Socrates”; hence this Socrates is mortal. We might write this as a. (∀x)(H(x) → M(x)) b. H(s) Therefore M(s). It seems so obvious! But how do we justify that in a proof se- quence? • New rules for predicate logic: in the following, you should un- derstand by the symbol x in P (x) an expression with free variable x, possibly containing other (quantified) variables: e.g. P (x) ≡ (∀y)(∃z)Q(x,y,z) (1) – Universal Instantiation: from (∀x)P (x) deduce P (t). Caveat: t must not already appear as a variable in the ex- pression for P (x): in the equation above, (1), it would not do to deduce P (y) or P (z), as those variables appear in the expression (in a quantified fashion) already. -
Prior's Paradigm for the Study of Time and Its Methodological Motivation
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by VBN Aalborg Universitet Prior’s paradigm for the study of time and its methodological motivation Hasle, Per; Øhrstrøm, Peter Published in: Synthese DOI (link to publication from Publisher): 10.1007/s11229-016-1161-6 Creative Commons License CC BY 4.0 Publication date: 2016 Document Version Publisher's PDF, also known as Version of record Link to publication from Aalborg University Citation for published version (APA): Hasle, P., & Øhrstrøm, P. (2016). Prior’s paradigm for the study of time and its methodological motivation. Synthese, 193(11), 3401–3416. https://doi.org/10.1007/s11229-016-1161-6 General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. ? Users may download and print one copy of any publication from the public portal for the purpose of private study or research. ? You may not further distribute the material or use it for any profit-making activity or commercial gain ? You may freely distribute the URL identifying the publication in the public portal ? Take down policy If you believe that this document breaches copyright please contact us at [email protected] providing details, and we will remove access to the work immediately and investigate your claim. Downloaded from vbn.aau.dk on: November 29, 2020 Synthese (2016) 193:3401–3416 DOI 10.1007/s11229-016-1161-6 S.I.: THE LOGIC AND PHILOSOPHY OF A.N. -
Temporal Logic and the Logic of Agency
Core Logic, ILLC / Universiteit van Amsterdam Temporal Logic and the Logic of Agency 8 December 2004 Thomas Muller¨ Philosophisches Seminar, LFB III Lennestr.´ 39 53113 Bonn, Germany currently: Wolfson College, University of Oxford [email protected] http://www.philosophie.uni-bonn.de/tmueller 1 Outline Temporal Logic * Arthur Prior and the development of (tense) logic after 1950 * Tensed vs tenseless talk * Hybrid logic * Semantics for the future tense Logic of Agency * Review of branching time * Agents and choices * “Seeing to it that” * Some further developments 2 Arthur Prior 3 Arthur Prior 1914 born in Masterton, New Zealand 1946 Lecturer, Canterbury University College, NZ 1956 John Locke Lectures, Oxford; initiated British Logic Colloquium 1958 Professor in Manchester 1960 Editor, The Journal of Symbolic Logic 1966 Fellow and Tutor, Balliol College, Oxford 1969 died in Trondheim, Norway Main works: 1957 Time and Modality 1967 Past, Present and Future 1968 Papers on Time and Tense (new ed., 2003) 1971 Objects of Thought (ed. P.T. Geach and A.J.P. Kenny) 1977 Worlds, Times and Selves (ed. K. Fine) 4 Arthur Prior and the development of (tense) logic Technical developments in logic: * among the first explicitly semantic approaches to modal logic * among the earliest expressiveness results (Hans Kamp) * earliest developments towards “hybrid logic” Other fields: * Philosophy of language: phenomenology of “essential indexicality” * Metaphysics: logical analysis of the problem of futura contingentia 5 Prior on logic and natural language * Foundational problem: How do we know what the logical connectives mean? * Prior’s argument (The runabout inference-ticket): Giving introduction- and elimination- rules alone cannot give the meaning of a connective * Logic as a certain (formal) way of studying natural language / the world: * Logic is about the real world; * No fixed boundary between logic and other sciences 6 Time and tense in natural language (1) Socrates is sitting. -
Logic and Proof
CS2209A 2017 Applied Logic for Computer Science Lecture 11, 12 Logic and Proof Instructor: Yu Zhen Xie 1 Proofs • What is a theorem? – Lemma, claim, etc • What is a proof? – Where do we start? – Where do we stop? – What steps do we take? – How much detail is needed? 2 The truth 3 Theories and theorems • Theory: axioms + everything derived from them using rules of inference – Euclidean geometry, set theory, theory of reals, theory of integers, Boolean algebra… – In verification: theory of arrays. • Theorem: a true statement in a theory – Proved from axioms (usually, from already proven theorems) Pythagorean theorem • A statement can be a theorem in one theory and false in another! – Between any two numbers there is another number. • A theorem for real numbers. False for integers! 4 Axioms example: Euclid’s postulates I. Through 2 points a line segment can be drawn II. A line segment can be extended to a straight line indefinitely III. Given a line segment, a circle can be drawn with it as a radius and one endpoint as a centre IV. All right angles are congruent V. Parallel postulate 5 Some axioms for propositional logic • For any formulas A, B, C: – A ∨ ¬ – . – . – A • Also, like in arithmetic (with as +, as *) – , – Same holds for ∧. – Also, • And unlike arithmetic – ( ) 6 Counterexamples • To disprove a statement, enough to give a counterexample: a scenario where it is false – To disprove that • Take = ", = #, • Then is false, but B is true. – To disprove that if %& '( ) &, ( , then '( %& ) &, ( , • Set the domain of x and y to be {0,1} • Set P(0,0) and P(1,1) to true, and P(0,1), P(1,0) to false. -
Philosophy 109, Modern Logic Russell Marcus
Philosophy 240: Symbolic Logic Hamilton College Fall 2014 Russell Marcus Reference Sheeet for What Follows Names of Languages PL: Propositional Logic M: Monadic (First-Order) Predicate Logic F: Full (First-Order) Predicate Logic FF: Full (First-Order) Predicate Logic with functors S: Second-Order Predicate Logic Basic Truth Tables - á á @ â á w â á e â á / â 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 0 0 1 1 0 1 0 0 1 0 0 0 0 1 0 1 1 0 1 1 0 0 1 0 0 0 0 0 0 0 1 0 0 1 0 Rules of Inference Modus Ponens (MP) Conjunction (Conj) á e â á á / â â / á A â Modus Tollens (MT) Addition (Add) á e â á / á w â -â / -á Simplification (Simp) Disjunctive Syllogism (DS) á A â / á á w â -á / â Constructive Dilemma (CD) (á e â) Hypothetical Syllogism (HS) (ã e ä) á e â á w ã / â w ä â e ã / á e ã Philosophy 240: Symbolic Logic, Prof. Marcus; Reference Sheet for What Follows, page 2 Rules of Equivalence DeMorgan’s Laws (DM) Contraposition (Cont) -(á A â) W -á w -â á e â W -â e -á -(á w â) W -á A -â Material Implication (Impl) Association (Assoc) á e â W -á w â á w (â w ã) W (á w â) w ã á A (â A ã) W (á A â) A ã Material Equivalence (Equiv) á / â W (á e â) A (â e á) Distribution (Dist) á / â W (á A â) w (-á A -â) á A (â w ã) W (á A â) w (á A ã) á w (â A ã) W (á w â) A (á w ã) Exportation (Exp) á e (â e ã) W (á A â) e ã Commutativity (Com) á w â W â w á Tautology (Taut) á A â W â A á á W á A á á W á w á Double Negation (DN) á W --á Six Derived Rules for the Biconditional Rules of Inference Rules of Equivalence Biconditional Modus Ponens (BMP) Biconditional DeMorgan’s Law (BDM) á / â -(á / â) W -á / â á / â Biconditional Modus Tollens (BMT) Biconditional Commutativity (BCom) á / â á / â W â / á -á / -â Biconditional Hypothetical Syllogism (BHS) Biconditional Contraposition (BCont) á / â á / â W -á / -â â / ã / á / ã Philosophy 240: Symbolic Logic, Prof. -
Predicate Logic
Predicate Logic Andreas Klappenecker Predicates A function P from a set D to the set Prop of propositions is called a predicate. The set D is called the domain of P. Example Let D=Z be the set of integers. Let a predicate P: Z -> Prop be given by P(x) = x>3. The predicate itself is neither true or false. However, for any given integer the predicate evaluates to a truth value. For example, P(4) is true and P(2) is false Universal Quantifier (1) Let P be a predicate with domain D. The statement “P(x) holds for all x in D” can be written shortly as ∀xP(x). Universal Quantifier (2) Suppose that P(x) is a predicate over a finite domain, say D={1,2,3}. Then ∀xP(x) is equivalent to P(1)⋀P(2)⋀P(3). Universal Quantifier (3) Let P be a predicate with domain D. ∀xP(x) is true if and only if P(x) is true for all x in D. Put differently, ∀xP(x) is false if and only if P(x) is false for some x in D. Existential Quantifier The statement P(x) holds for some x in the domain D can be written as ∃x P(x) Example: ∃x (x>0 ⋀ x2 = 2) is true if the domain is the real numbers but false if the domain is the rational numbers. Logical Equivalence (1) Two statements involving quantifiers and predicates are logically equivalent if and only if they have the same truth values no matter which predicates are substituted into these statements and which domain is used. -
Chapter 4, Propositional Calculus
ECS 20 Chapter 4, Logic using Propositional Calculus 0. Introduction to Discrete Mathematics. 0.1. Discrete = Individually separate and distinct as opposed to continuous and capable of infinitesimal change. Integers vs. real numbers, or digital sound vs. analog sound. 0.2. Discrete structures include sets, permutations, graphs, trees, variables in computer programs, and finite-state machines. 0.3. Five themes: logic and proofs, discrete structures, combinatorial analysis, induction and recursion, algorithmic thinking, and applications and modeling. 1. Introduction to Logic using Propositional Calculus and Proof 1.1. “Logic” is “the study of the principles of reasoning, especially of the structure of propositions as distinguished from their content and of method and validity in deductive reasoning.” (thefreedictionary.com) 2. Propositions and Compound Propositions 2.1. Proposition (or statement) = a declarative statement (in contrast to a command, a question, or an exclamation) which is true or false, but not both. 2.1.1. Examples: “Obama is president.” is a proposition. “Obama will be re-elected.” is not a proposition. 2.1.2. “This statement is false.” is a paradox that many would not consider a proposition. 2.1.3. For ECS 20, we will use p, q, and r to symbolize propositions, subpropositions, or logical variables which take true or false values. 2.2. Compound Proposition = a proposition that has its truth value completely determined by the truth values of two or more subpropositions and the operators (also called connectives) connecting them. 3. Basic Logical Operations 3.1. Conjunction = = “and.” If both p and q are true, then p q is true, otherwise p q is false. -
Accepting a Logic, Accepting a Theory
1 To appear in Romina Padró and Yale Weiss (eds.), Saul Kripke on Modal Logic. New York: Springer. Accepting a Logic, Accepting a Theory Timothy Williamson Abstract: This chapter responds to Saul Kripke’s critique of the idea of adopting an alternative logic. It defends an anti-exceptionalist view of logic, on which coming to accept a new logic is a special case of coming to accept a new scientific theory. The approach is illustrated in detail by debates on quantified modal logic. A distinction between folk logic and scientific logic is modelled on the distinction between folk physics and scientific physics. The importance of not confusing logic with metalogic in applying this distinction is emphasized. Defeasible inferential dispositions are shown to play a major role in theory acceptance in logic and mathematics as well as in natural and social science. Like beliefs, such dispositions are malleable in response to evidence, though not simply at will. Consideration is given to the Quinean objection that accepting an alternative logic involves changing the subject rather than denying the doctrine. The objection is shown to depend on neglect of the social dimension of meaning determination, akin to the descriptivism about proper names and natural kind terms criticized by Kripke and Putnam. Normal standards of interpretation indicate that disputes between classical and non-classical logicians are genuine disagreements. Keywords: Modal logic, intuitionistic logic, alternative logics, Kripke, Quine, Dummett, Putnam Author affiliation: Oxford University, U.K. Email: [email protected] 2 1. Introduction I first encountered Saul Kripke in my first term as an undergraduate at Oxford University, studying mathematics and philosophy, when he gave the 1973 John Locke Lectures (later published as Kripke 2013). -
Formal Logic: Quantifiers, Predicates, and Validity
Formal Logic: Quantifiers, Predicates, and Validity CS 130 – Discrete Structures Variables and Statements • Variables: A variable is a symbol that stands for an individual in a collection or set. For example, the variable x may stand for one of the days. We may let x = Monday, x = Tuesday, etc. • We normally use letters at the end of the alphabet as variables, such as x, y, z. • A collection of objects is called the domain of objects. For the above example, the days in the week is the domain of variable x. CS 130 – Discrete Structures 55 Quantifiers • Propositional wffs have rather limited expressive power. E.g., “For every x, x > 0”. • Quantifiers: Quantifiers are phrases that refer to given quantities, such as "for some" or "for all" or "for every", indicating how many objects have a certain property. • Two kinds of quantifiers: – Universal Quantifier: represented by , “for all”, “for every”, “for each”, or “for any”. – Existential Quantifier: represented by , “for some”, “there exists”, “there is a”, or “for at least one”. CS 130 – Discrete Structures 56 Predicates • Predicate: It is the verbal statement which describes the property of a variable. Usually represented by the letter P, the notation P(x) is used to represent some unspecified property or predicate that x may have. – P(x) = x has 30 days. – P(April) = April has 30 days. – What is the truth value of (x)P(x) where x is all the months and P(x) = x has less than 32 days • Combining the quantifier and the predicate, we get a complete statement of the form (x)P(x) or (x)P(x) • The collection of objects is called the domain of interpretation, and it must contain at least one object. -
Charles Sanders Peirce - Wikipedia, the Free Encyclopedia 9/2/10 4:55 PM
Charles Sanders Peirce - Wikipedia, the free encyclopedia 9/2/10 4:55 PM Charles Sanders Peirce From Wikipedia, the free encyclopedia Charles Sanders Peirce (pronounced /ˈpɜrs/ purse[1]) Charles Sanders Peirce (September 10, 1839 – April 19, 1914) was an American philosopher, logician, mathematician, and scientist, born in Cambridge, Massachusetts. Peirce was educated as a chemist and employed as a scientist for 30 years. It is largely his contributions to logic, mathematics, philosophy, and semiotics (and his founding of pragmatism) that are appreciated today. In 1934, the philosopher Paul Weiss called Peirce "the most original and versatile of American philosophers and America's greatest logician".[2] An innovator in many fields (including philosophy of science, epistemology, metaphysics, mathematics, statistics, research methodology, and the design of experiments in astronomy, geophysics, and psychology) Peirce considered himself a logician first and foremost. He made major contributions to logic, but logic for him encompassed much of that which is now called epistemology and philosophy of science. He saw logic as the Charles Sanders Peirce formal branch of semiotics, of which he is a founder. As early as 1886 he saw that logical operations could be carried out by Born September 10, 1839 electrical switching circuits, an idea used decades later to Cambridge, Massachusetts produce digital computers.[3] Died April 19, 1914 (aged 74) Milford, Pennsylvania Contents Nationality American 1 Life Fields Logic, Mathematics, 1.1 United States Coast Survey Statistics, Philosophy, 1.2 Johns Hopkins University Metrology, Chemistry 1.3 Poverty Religious Episcopal but 2 Reception 3 Works stance unconventional 4 Mathematics 4.1 Mathematics of logic C. -
How to Adopt a Logic
How to adopt a logic Daniel Cohnitz1 & Carlo Nicolai2 1Utrecht University 2King’s College London Abstract What is commonly referred to as the Adoption Problem is a challenge to the idea that the principles of logic can be rationally revised. The argument is based on a reconstruction of unpublished work by Saul Kripke. As the reconstruction has it, Kripke essentially extends the scope of Willard van Orman Quine’s regress argument against conventionalism to the possibility of adopting new logical principles. In this paper we want to discuss the scope of this challenge. Are all revisions of logic subject to the regress problem? If not, are there interesting cases of logical revision that are subject to the regress problem? We will argue that both questions should be answered negatively. 1 Introduction What is commonly referred to as the Adoption Problem1 is often considered a challenge to the idea that the principles for logic can be rationally revised. The argument is based on a reconstruction of unpublished work by Saul Kripke.2 As the reconstruction has it, Kripke essentially extends the scope of William van Orman Quine’s regress argument (Quine, 1976) against conventionalism to the possibility of adopting new logical principles or rules. According to the reconstruction, the Adoption Problem is that new logical rules cannot be adopted unless one already can infer with these rules, in which case the adoption of the rules is unnecessary (Padro, 2015, 18). In this paper we want to discuss the scope of this challenge. Are all revisions of logic subject to the regress problem? If not, are there interesting cases of logical revision that are subject to the regress problem? We will argue that both questions should be answered negatively.