The Size of the World of Logic

Slides:



Advertisements
Similar presentations
PROOF BY CONTRADICTION
Advertisements

The Logic of Quantified Statements
Techniques for Proving the Completeness of a Proof System Hongseok Yang Seoul National University Cristiano Calcagno Imperial College.
Possible World Semantics for Modal Logic
CS128 – Discrete Mathematics for Computer Science
1 Chapter 7 Propositional and Predicate Logic. 2 Chapter 7 Contents (1) l What is Logic? l Logical Operators l Translating between English and Logic l.
Adapted from Discrete Math
Introduction to Proofs
1 Chapter 7 Propositional and Predicate Logic. 2 Chapter 7 Contents (1) l What is Logic? l Logical Operators l Translating between English and Logic l.
LDK R Logics for Data and Knowledge Representation PL of Classes.
Lecture Propositional Equivalences. Compound Propositions Compound propositions are made by combining existing propositions using logical operators.
Naïve Set Theory. Basic Definitions Naïve set theory is the non-axiomatic treatment of set theory. In the axiomatic treatment, which we will only allude.
CS 285- Discrete Mathematics Lecture 4. Section 1.3 Predicate logic Predicate logic is an extension of propositional logic that permits concisely reasoning.
We will now study some special kinds of non-standard quantifiers. Definition 4. Let  (x),  (x) be two fixed formulae of a language L n such that x is.
Propositional Logic Rather than jumping right into FOL, we begin with propositional logic A logic involves: §Language (with a syntax) §Semantics §Proof.
Lecture 041 Predicate Calculus Learning outcomes Students are able to: 1. Evaluate predicate 2. Translate predicate into human language and vice versa.
Chapter Ten Relational Predicate Logic. 1. Relational Predicates We now broaden our coverage of predicate logic to include relational predicates. This.
Chapter Eight Predicate Logic Semantics. 1. Interpretations in Predicate Logic An argument is valid in predicate logic iff there is no valuation on which.
Section 1.7. Section Summary Mathematical Proofs Forms of Theorems Direct Proofs Indirect Proofs Proof of the Contrapositive Proof by Contradiction.
Lecture 8 Time: McTaggart’s argument
Presented by: Tutorial Services The Math Center
Propositional Logic (a.k.a. Sentential Logic)
? Anti-realism, reductionism, reference
Chapter 7. Propositional and Predicate Logic
Dummett about realism and anti-realism
2. The Logic of Compound Statements Summary
3. The Logic of Quantified Statements Summary
Modal, Dynamic and Temporal Logics
Propositional Logic Russell and Norvig: Chapter 6 Chapter 7, Sections 7.1—7.4 CS121 – Winter 2003.
Advanced Algorithms Analysis and Design
Argument An argument is a sequence of statements.
Logic II CSE 140 etc..
CSNB 143 Discrete Mathematical Structures
Formal Modeling Concepts
Knowledge Representation and Reasoning
Discrete Mathematics Logic.
Lecture 03 Logic and Propositional Calculus Profs. Koike and Yukita
The function of knowledge representation scheme is
The Propositional Calculus
Predicate Calculus Discussion #14 Chapter 2, Section 1 1/20.
Discussion #14 Predicate Calculus
Predicate Calculus Validity
CSE 2353 – September 4th 2002 Logic.
Semantics In propositional logic, we associate atoms with propositions about the world. We specify the semantics of our logic, giving it a “meaning”. Such.
CS 1502 Formal Methods in Computer Science
The Foundations: Logic and Proofs
CSE 311 Foundations of Computing I
Predicate Calculus Discussion #14 Chapter 2, Section 1.
Mathematics for Computer Science MIT 6.042J/18.062J
CS 220: Discrete Structures and their Applications
First Order Logic Rosen Lecture 3: Sept 11, 12.
Back to “Serious” Topics…
MA/CSSE 474 More Math Review Theory of Computation
Discrete Mathematics and Its Applications Kenneth H
Computer Security: Art and Science, 2nd Edition
Discrete Mathematics Logic.
Discrete Mathematics CMP-200 Propositional Equivalences, Predicates & Quantifiers, Negating Quantified Statements Abdul Hameed
Symbolic Characterization of Heap Abstractions
Chapter 7. Propositional and Predicate Logic
Copyright © Cengage Learning. All rights reserved.
Search techniques.
Encoding Knowledge with First Order Predicate Logic
Encoding Knowledge with First Order Predicate Logic
Propositional Logic CMSC 471 Chapter , 7.7 and Chuck Dyer
Logic Logic is a discipline that studies the principles and methods used to construct valid arguments. An argument is a related sequence of statements.
1.3 Propositional Equivalences
Predicate Calculus. Predicate Calculus Topics Predicates Variables and instantiation Quantifiers Logical expressions Bound and free variables.
Encoding Knowledge with First Order Predicate Logic
Representations & Reasoning Systems (RRS) (2.2)
Presentation transcript:

The Size of the World of Logic Jan Woleński Jagiellonian University, Krakow, Poland

Talk Outline What is the world of logic; Different accounts; Other logics; T, (BI) and propositional calculus; The general form of the world of logic; Argument for bivalence; Other.

What is the World of Logic The problem: what is the world of logic Russell: Logic is concerned with the real world just as truly as zoology, though with its more abstract and general features. But what are more abstract and general features of the world? Logic as consisting of tautologies. Frege: Logic is concerned with the predicate “true” Frege’s semantics of sentences: the True and the False as references (senses) of sentences.

What is the World of Logic Example: p  p  q. 1  (1  0), 0  (0  1), 0  (0  0) and 0  (0  1). p  r  q. A  A  B as the way out. “Dual” logic w(A  B) = 1 wtw w(A) = w(B) = 0; otherwise w(A  B) = 0. A  B  A. 1 as the distinguished values.

Different Accounts The world of logic consists of logical value. (BI) every sentence is either true or false. 9. (BI)  (CN)  (EM). (BI) and the theorems of PC.

Different Accounts Béziau on conditions for (BI): Counter-domain of w is two-elements; Domain of w - the set of sentences; w is a total function.

Different Accounts Other account: (a) card(V) = 0; no A is a theorem; (b) card(V) = 1; every A is a theorem; (c) card(V)  2; some A are theorems, some A are not theorems. D – distinguished values, D’ – non-distinguished values, L is consistent if card(V)  card(D) V = D  D’, D  D’ = .

Different Accounts Truth and falsehood as modalities:    

Different Accounts  – 1A,  – 1(A),  – 1(A),  – 1(A). (10) (a)    (b)    (c) (  ) ; (d)    (e)   ; (f))   . What about 0? Either  or . (11) (a) 0A  1A; (b) 0A  1A. (12) 1A  1A  0A.

Different Accounts (11), (12) (BI) and more than 2 values.      

Different Accounts  – 0,  – 1A  0A,  – 1A  0A (11) and the triangle. (13) A(1A  0A), Conclusion: (BI) is not a tautology.

Other Logics Assumption: the only designated value. Is possible to save (BI)? (14) A(D(A)  D(A), D’, DA (15) A(D(A)  DA(A)), DA(A)  D(A) and its legitimization. T-scheme : TA  A, DA and A

Other Logics .        

Other Logics  ,  – A i A. (16) D(A)  A, holds for every value, but reverse dependence not.

T, (BI) and Propositional Calculus. (17) w(T(A)) = 1 iff w(A) = 1; otherwise w(A) = 0. The formula (17) is not generalized to predicate calculus.

The General Form of the World of Logic (WL) {w1, w2 ,…, wn, …}.

Argument for Bivalence Argument for bivalence: metalogic (the role of classical logic, simplicity.

Other Truth – facts, falsehood – the lack of facts’; Various oppositions, spatial, temporal; Biological oppositions; Passive- active; Possession and its lack; Inner – outer; Modal contrasts; Biological rhythms are binary; Perceptual contrasts; Binary structure of the helix and genetic codes; 0-1 nature of information; Truth protects information, falsehood results in its dispersion; Ordinary quantifiers are dual.