What’s the Right Logic. What Is Logic? Joe Lau The laws of biology might be true only of living creatures, and the laws of economics are only applicable.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

Automated Theorem Proving Lecture 1. Program verification is undecidable! Given program P and specification S, does P satisfy S?
CS4026 Formal Models of Computation Part II The Logic Model Lecture 1 – Programming in Logic.
Brief Introduction to Logic. Outline Historical View Propositional Logic : Syntax Propositional Logic : Semantics Satisfiability Natural Deduction : Proofs.
1 First order theories (Chapter 1, Sections 1.4 – 1.5)
The Logic of Quantified Statements
Possible World Semantics for Modal Logic
Propositional and First Order Reasoning. Terminology Propositional variable: boolean variable (p) Literal: propositional variable or its negation p 
Rigorous Software Development CSCI-GA Instructor: Thomas Wies Spring 2012 Lecture 11.
Inference and Reasoning. Basic Idea Given a set of statements, does a new statement logically follow from this. For example If an animal has wings and.
Formal Semantics of Programming Languages 虞慧群 Topic 5: Axiomatic Semantics.
Knowledge Representation Methods
Computability and Complexity 9-1 Computability and Complexity Andrei Bulatov Logic Reminder (Cnt’d)
Artificial Intelligence Modal Logic
The Language of Theories Linking science directly to ‘meanings’
Proofs are Programs: 19th Century Logic and 21st Century Computing CS 510: Programming Languages (a talk adapted from Philip Wadler)
Search in the semantic domain. Some definitions atomic formula: smallest formula possible (no sub- formulas) literal: atomic formula or negation of an.
March 5: more on quantifiers We have encountered formulas and sentences that include multiple quantifiers: Take, for example: UD: People in Michael’s office.
Last time Proof-system search ( ` ) Interpretation search ( ² ) Quantifiers Equality Decision procedures Induction Cross-cutting aspectsMain search strategy.
1 First order theories. 2 Satisfiability The classic SAT problem: given a propositional formula , is  satisfiable ? Example:  Let x 1,x 2 be propositional.
Predicates and Quantifiers
Predicates & Quantifiers Goal: Introduce predicate logic, including existential & universal quantification Introduce translation between English sentences.
Chapter 1: The Foundations: Logic and Proofs
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
SAT and SMT solvers Ayrat Khalimov (based on Georg Hofferek‘s slides) AKDV 2014.
Atomic Sentences Chapter 1 Language, Proof and Logic.
1st-order Predicate Logic (FOL)
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Many Sorted First-order Logic Student: Liuxing Kan Instructor: William Farmer Dept. of Computing and Software McMaster University, Hamilton, CA.
CMPF144 FUNDAMENTALS OF COMPUTING THEORY Module 5: Classical Logic.
Pattern-directed inference systems
PART TWO PREDICATE LOGIC. Chapter Seven Predicate Logic Symbolization.
Propositional Logic Dr. Rogelio Dávila Pérez Profesor-Investigador División de Posgrado Universidad Autónoma Guadalajara
Copyright © Cengage Learning. All rights reserved. CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS THE LOGIC OF QUANTIFIED STATEMENTS.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Propositional Calculus CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Key Concepts Representation Inference Semantics Discourse Pragmatics Computation.
Extra slides for Chapter 3: Propositional Calculus & Normal Forms Based on Prof. Lila Kari’s slides For CS2209A, 2009 By Dr. Charles Ling;
Artificial Intelligence 2004 Non-Classical Logics Non-Classical Logics Specific Language Constructs added to classic FOPL Different Types of Logics.
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
1 Introduction to Abstract Mathematics Predicate Logic Instructor: Hayk Melikya Purpose of Section: To introduce predicate logic (or.
LDK R Logics for Data and Knowledge Representation First Order Logics (FOL) Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto.
Predicates and Quantifiers Dr. Yasir Ali. 1.Predicates 2.Quantifiers a.Universal Quantifiers b.Existential Quantifiers 3.Negation of Quantifiers 4.Universal.
ece 627 intelligent web: ontology and beyond
Semantics of Predicate Calculus For the propositional calculus, an interpretation was simply an assignment of truth values to the proposition letters of.
Predicate Logic One step stronger than propositional logic Copyright © Curt Hill.
Copyright © Peter Cappello 2011 Predicates & Quantifiers.
LDK R Logics for Data and Knowledge Representation Propositional Logic Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia,
1 First Order Logic CS 171/271 (Chapter 8) Some text and images in these slides were drawn from Russel & Norvig’s published material.
Daniel Kroening and Ofer Strichman 1 Decision Procedures An Algorithmic Point of View Basic Concepts and Background.
PREDICATES AND QUANTIFIERS COSC-1321 Discrete Structures 1.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Metalogic Soundness and Completeness. Two Notions of Logical Consequence Validity: If the premises are true, then the conclusion must be true. Provability:
1 Section 7.1 First-Order Predicate Calculus Predicate calculus studies the internal structure of sentences where subjects are applied to predicates existentially.
Chapter Eight Predicate Logic Semantics. 1. Interpretations in Predicate Logic An argument is valid in predicate logic iff there is no valuation on which.
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
Lecture 6 Modality: Possible worlds
Axiomatic Number Theory and Gödel’s Incompleteness Theorems
Propositional Calculus: Boolean Functions and Expressions
Predicates & Quantifiers
Predicate Logic Lecture 7.
Propositional Calculus: Boolean Functions and Expressions
Semantics In propositional logic, we associate atoms with propositions about the world. We specify the semantics of our logic, giving it a “meaning”. Such.
Today’s Topics Universes of Discourse
NP-Completeness Proofs
Logics for Data and Knowledge Representation
Proofs are Programs: 19th Century Logic and 21st Century Computing
Logics for Data and Knowledge Representation
Artificial Intelligence 2004 Non-Classical Logics
Presentation transcript:

What’s the Right Logic

What Is Logic?

Joe Lau The laws of biology might be true only of living creatures, and the laws of economics are only applicable to collections of agents that engage in financial transactions. But the principles of logic are universal principles which are more general than biology and economics.

Alfred Tarski “[Logic is]... the name of a discipline which analyzes the meaning of the concepts common to all the sciences, and establishes the general laws governing the concepts.”

Frege “To discover truths is the task of all sciences; it falls to logic to discern the laws of truth.... I assign to logic the task of discovering the laws of truth, not of assertion or thought.”

Different Logics

Extensions of First-Order Logic FOL with identity FOL with infinitary conjunction and disjunction FOL with ϵ and axioms of set theory FOL with modal operators □, ◊ FOL with tense operators Many-sorted FOL with < Second-order logic

Two Ways of Doing the Logic of Time Tense operators: P(φ): ‘at some time in the past, φ’ F(φ): ‘at some time in the future, φ’ H(φ): ‘it has always been true that φ’ G(φ): ‘it is always going to be true that φ’

Operators are Duals P(φ) ↔ ~H(~φ) H(φ) ↔ ~P(~φ) F(φ) ↔ ~G(~φ) G(φ) ↔ ~F(~φ)

Definitions A(φ) = H(φ) & φ & G(φ) ‘it is always true that φ’ S(φ) = P(φ) v φ v F(φ) ‘it is sometimes true that φ’ A(φ) ↔ ~S(~φ) S(φ) ↔ ~A(~φ)

Now We can also introduce a ‘now’ operator: P ⊢ N(P) N(P) ⊢ P (Note that you can’t substitute N(P) for P everywhere!)

Interpretation Standard FOL interpretation: We introduce the domain D of individuals. Models M = are composed of an interpretation function I, and an assignment to the values of variables s. I is a function from individual constants to objects in D, and from monadic predicate letters to sets of objects in D. s is a function from variables to objects in D. M ⊨ Fa iff I(a) ϵ I(F)

New Interpretation Now we introduce two domains D e and D t, the domain of entities and of times. Statements are no longer true or false relative to a model, they are true or false relative to a model at a time M, t ⊨ Fa iff I(a) ϵ I(F, t) The idea is that different predicates are satisfied by different objects at different times. M, t ⊨ P(φ) iff for some t* < t, M, t* ⊨ φ.

Different Way In addition to our old variables x, y, z… we introduce t, t 1, t 2, … In addition to our old predicates and relation symbols F, G, H… we introduce a new relation symbol < For each of the old predicates we add a new argument ‘Fb’ becomes ‘Fbt’ We add a new name n.

Past and Future Let φ(t) be some formula with free variable t. ∃ t t < n & φ(t) ‘there is a time before now at which φ’ ∃ t n < t & φ(t) ‘there is a time after now at which φ’

Interpretation This time we still have two domains, D e and D t, the domains of entities and times. t-variables range over D t. The interpretation function I assigns a relation between times to ‘<’, and we specify various properties that the relation satisfies. Everything else is standard.

Which Is Right Logic of Time?

Right Logic? Semantic considerations Metaphysical considerations Physical considerations

Semantics: Expressive Power Once, everyone who is now happy was going to be miserable. Good translation: ∃ t (t < n & ∀ x(HAPPYxn → ∃ t* (t < t* & Mxt*))) Bad translation: P( ∀ x(N(HAPPYx) → F(Mx)))

Semantics: Reference to a Time “I left the stove on!” “John came in. Then he sat down.” It was true that I was happy.

Metaphysics: Two Theories of Time The A-Theory The important metaphysical notions regarding time are: the present, the past, and the future. A-Theory is strongly allied with Presentism, the claim that only the present exists. The B-Theory The important metaphysical notions regarding time are: before and after. B-Theory is strongly allied with Eternalism, the claim that all times exist. ‘Now’ is like ‘here’: it’s not special, it’s just where we are.

Metaphysics: Two Theories of Time The A-Theory A-Theorists like an operator logic of time, because it doesn’t commit us to the existence of times! “It’s true that in the past dinosaurs existed, but there does not exist a time at which they did.” The B-Theory B-Theorists like a quantifier logic of time, because it’s not committed to a privileged present. The constant “n” receives different interpretations in different models. It can be any time you like in D t.

The Rietdijk-Putnam Argument According to the theory of relativity, different observers that are moving relative to each other, will judge the timing of events differently. A might experience X and Y as happening at the same time, B might experience X before Y, and C might experience Y before X.

The Rietdijk-Putnam Argument Let the 3D universe as A experiences it now from her frame of reference be the A-universe, and the same for the B- and C-universes. If A, B, and C are all experiencing truly, then there must be multiple 3D universes, that is, we must be living in a 4D universe that contains multiple 3D universes as parts. So there exists more than one time, and there is no special present: the B-Theory is correct.

Joe Lau The laws of biology might be true only of living creatures, and the laws of economics are only applicable to collections of agents that engage in financial transactions. But the principles of logic are universal principles which are more general than biology and economics.

Alfred Tarski “[Logic is]... the name of a discipline which analyzes the meaning of the concepts common to all the sciences, and establishes the general laws governing the concepts.”

Frege “To discover truths is the task of all sciences; it falls to logic to discern the laws of truth.... I assign to logic the task of discovering the laws of truth, not of assertion or thought.”

Is the logic of time topic neutral? Is it logic? Is it about concepts and meanings? Is it universal? Is it necessary? Are we doing it right?

Is ANY logic topic neutral? Is it about concepts and meanings? Is it universal? Is it necessary? How do we do it?

Quantum Logic

The Distribution Law P & (Q v R) ↔ (P & Q) v (P & R) Proof. 11. P & (Q v R)A 12. P1 &E 13. Q v R1 &E 44. QA for →I 1,45. P & Q2, 4 &I 16. Q → (P & Q)4,5 →I

The Distribution Law P & (Q v R) ↔ (P & Q) v (P & R) Proof. 16. Q → (P & Q)4,5 →I 77. RA for →I 1,78. P & R2, 7 &I 19. R → (P & R)7, 8 →I 110. (P & Q) v (P & R)1, 6, 9 PC Other direction cont’d on whiteboard.

Video Time!

Putnam on Logic Logic is as empirical as geometry. We live in a world with a non- classical logic. Certain statements – just the ones we encounter in daily life – do obey classical logic, but this is so because the corresponding subspaces… [form] a so-called ‘Boolean lattice’.

Putnam on Logic Quantum Mechanics explains the apparent validity of classical logic ‘in the large’, just as non- Euclidean geometry explains the approximate validity of Euclidean geometry ‘in the small’.