Logical Surface. We have a statement a = b + c What does the EQUALS represent? We want every possible inference.

Slides:



Advertisements
Similar presentations
Reason and Argument Chapter 1. Claims A claim takes the form of a proposition. A proposition has a similar relation to a sentence as a number does to.
Advertisements

Introduction to Proofs
Four Rules of Aristotelian Logic 1. Rule of Identity: A is A 2. Rule of Non-Contradiction: A is not (-A) 3. Rule of Excluded Middle: Either A or (-A)
F22H1 Logic and Proof Week 5 Overview of weeks 5—9 Predicates and Quantifiers.
F22H1 Logic and Proof Week 7 Clausal Form and Resolution.
Unit 7, Lesson 2 The Area Model for Multiplication “What do you mean, it’s the wrong kind of right?”
Ms. Sonty Moot Court November 13 th, Answer the following questions: 1.What are the two parts of an appeal for moot court? 2.What is the difference.
Python Programming Chapter 1: The way of the program Saad Bani Mohammad Department of Computer Science Al al-Bayt University 1 st 2011/2012.
Existential Graphs: Beta Introduction to Logic. Alpha Review: Symbolization ‘P’ ‘not P’ ‘P and Q’ ‘P or Q’ ‘if P then Q’ F EG PP PP P  Q P  Q P 
ESL Level 4 Mrs. Alba.  RULE: The passive voice is used when the doer of the action is unknown or when the doer is unimportant.  EXAMPLES:  The report.
Welcome: Fact or Opinion
Chapter 9 IF Statement Bernard Chen. If Statement The main statement used for selecting from alternative actions based on test results It’s the primary.
HTML Graphics 5 Adding HyperText Links to a Web Page.
Coach Crews World History. Before Define: - Philosophy - Philosopher - Socratic method.
What is RobotC?!?! Team 2425 Hydra. Overview What is RobotC What is RobotC used for What you need to program a robot How a robot program works Framework.
CSci 2011 Discrete Mathematics Lecture 3 CSci 2011.
The Foundations: Logic and Proofs
The Node Voltage Method
Introduction to Proofs
1-1 Copyright © 2015, 2010, 2007 Pearson Education, Inc. Chapter 13, Slide 1 Chapter 13 From Randomness to Probability.
MATH 224 – Discrete Mathematics
The Concept Convert free text into a structure that captures objects, relations, existential, propositional and temporal logic – the whole thing, no excuses.
First Order Logic Chapter 7. PL is a Weak Representational Language §Propositional Logic (PL) is not a very expressive language because: §Hard to identify.
Week 5 - Wednesday.  What did we talk about last time?  Exam 1!  And before that?  Review!  And before that?  if and switch statements.
CSI 3125, Axiomatic Semantics, page 1 Axiomatic semantics The assignment statement Statement composition The "if-then-else" statement The "while" statement.
The Logical Structure of Knowledge. Two Statements Olga is pretty and Fred is a liar Something is providing a True to the AND - let’s represent that with.
Chapter 1 Logic Section 1-1 Statements Open your book to page 1 and read the section titled “To the Student” Now turn to page 3 where we will read the.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Deductive Reasoning Chapter 2 Lesson 4.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
1 Predicate (Relational) Logic 1. Introduction The propositional logic is not powerful enough to express certain types of relationship between propositions.
Chapter 2 Section 5. Objective  Students will make a connection between reasoning in Algebra and reasoning in Geometry.
Section Predicates & Quantifiers. Open Statement 2 x > 8 p < q -5 x = y + 6 Neither true nor false.
Section 2-2: Conditional Statements. Conditional A statement that can be written in If-then form symbol: If p —>, then q.
Automated Reasoning Early AI explored how to automated several reasoning tasks – these were solved by what we might call weak problem solving methods as.
For Wednesday Read chapter 9, sections 1-3 Homework: –Chapter 7, exercises 8 and 9.
For Friday Read chapter 8 Homework: –Chapter 7, exercises 2 and 10 Program 1, Milestone 2 due.
CS 115 QUIZ # 2 INFORMATION 1. When TUESDAY 11/10 Worth: 8 points 2.
Be An Author! How is a book’s call number created? What kind of book would you like to write? Fiction (chapter book) or Everybody? What will your spine.
Asking Questions - Conditionals Objectives Learning the types of questions c++ can ask. Writing simple questions in c++. logical operators relational operators.
Algebra 1 Chapter 2 Section : Solving One-Step Equations An equation is a mathematical statement that two expressions are equal. A solution of an.
Predicates and Quantifiers Dr. Yasir Ali. 1.Predicates 2.Quantifiers a.Universal Quantifiers b.Existential Quantifiers 3.Negation of Quantifiers 4.Universal.
...But is it Scientific?. To answer that question, we need to look at the operation of a sequential machine Scientific?
 Session 1 Pre-Reading Strategies. 1. Look over the titles, headings, and text features  Although it sounds silly, many people jump into a text without.
Controlling Program Flow with Decision Structures.
Conditionality What does TFF mean?. The paradox of material implication p ⊨ q ⊃ p is valid (by the definition of the truth table of ⊃ ) but trivially.
1 Outline Quantifiers and predicates Translation of English sentences Predicate formulas with single variable Predicate formulas involving multiple variables.
Chapter Nine Predicate Logic Proofs. 1. Proving Validity The eighteen valid argument forms plus CP and IP that are the proof machinery of sentential logic.
Think about the meaning of the following quotes and write them on a sheet of paper.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
The Nature of God Nancy Parsons. Attributes- Nature of God Candidates should be able to demonstrate knowledge and understanding of: 1.God as eternal,
ECognition Model Components. 2. eCognition Model Components1 Model Components Variables and Constants Operators and Functions Links Logical States Messages.
. Chapter 14 From Randomness to Probability. Slide Dealing with Random Phenomena A is a situation in which we know what outcomes could happen, but.
Reminders Outliers First Reading Quiz – tomorrow
Active Reading.
Chapter 1 The Foundations: Logic and Proofs
CS201: Data Structures and Discrete Mathematics I
Axiomatic semantics Points to discuss: The assignment statement
Nonfiction vocabulary
Chapter 2: Geometric Reasoning
75 Textual Evidence and Inferences
George Boole English Mathematician
Predicates and Quantifiers
Definitions: Evidence-Based Claims- 1.) the ability to take detailed
CS201: Data Structures and Discrete Mathematics I
Dr. Unnikrishnan P.C. Professor, EEE
Writing a Literary Argument
If-Statements and If/Else Statements
Propositional Logic 1) Introduction Copyright 2008, Scott Gray.
Chapter 2 Reasoning and Proof.
Presentation transcript:

Logical Surface

We have a statement a = b + c What does the EQUALS represent? We want every possible inference

Logical Structure Statements are written on a logical surface a = b + c

They are related somehow They hang off the same spine We have two statements a = b + c d = e + f

We have a statement IF a = b + c THEN d = e + f The EQUALS expressions look the same, but there is nothing obviously linking the statement to its environment

Sentential Logic When Plato wrote down the rules for propositional logic, he wasn’t inventing something, he was trying to write down how we reason - why don’t we use those rules to drive the IF...THEN... The closer the system works to the way our reasoning works, the easier it should be to understand and to interface with.

Logical Connections The numerical statements now become part of a larger logical statement, also anchored to the spine and controlled by it. All the inferences are alive and well. IF a = b + c THEN d = e + f

The model text is written on a layered logical surface

Object Existence When dealing with objects, their existence takes the place of sentential logic Existence logic is controlling the objects, while sentential logic controls the relations among objects and the operations on numbers The logical surface becomes multi-dimensional, as only a logical surface can, as it follows and supports the logic of the problem

Relation Logical Surface A text document has its own logical surface – a discourse. Some relations support their own discourse or logical surface – “John thinks…” introduces a new discourse level, where a logical value from the ToThink relation provides control to everything hung off it. This kind of clausal logic can be overridden without error: John thinks Fred is guilty, but he is wrong John still thinks that Fred is guilty, so that part is true. It is more complicated than that, as part or all of the discourse may not exist – “Section 9 is void” – so existential control is also provided for the discourse.

An Active Surface A book has a name, a spine, chapters and sections - it has a logical, but passive, structure. It is intended to be read by an active structure, a person, which can subsume it. The model needs a logical structure - but one that is active and many- layered, as there is no other active structure to read it.