gb
' I
a D :
PH! 455: Philosophical Logic land Semester Exam
Department of Humanities and Social Sciences
Indian Institute of Technology Kanpur
all questions. Write y
Max. Marks:
Answer
7:
The co-on knowledge assumption underlies all of game the
Zeitschr. 1. math. Logik und Otundlagen d. Math.
Bd. 9, S. 67-96 ( 1 9 6 3 )
SEMANTICAL ANALYSIS O F MODAL LOGIC I
NORMAL MODAL PROPOSITIONAL CALCULI
by SAULA. KRIPKEin Cambridge, Mass. (U.S.A.)
The present paper attempts to extend the results of [l], in
THREE-VALUED LOGIC
73
information about myself. Hence, any hesitation I may have concerning
"the issue of whether or not I infer" may be due to selfidoubts arising from
the possibility that I am deceiving myself about either the ground of the
inference or
REASONING ABOUT KNOWLEDGE IN PHILOSOPHY;
THE PARADIGM OF EPISTEMIC LOGIC
Jaakko Hintikka
Department of Philosophy
Florida State University
Tallahassee, FL 32306
ABSTRACT
Theories of knowledge representation and reasoning about knowledge in
philosophy are
.
. . . . ,. .~;/
_. .
.
. . . . . .
'\ .
. -.~
Introduction to
Mathematical Logic
FOURTl-1 EI)ITJ()N
Elliott Mendelson
Queens College of the City University of New York
CHAPMAN & HALL
London Weinheim New York Tokyo Melbourne Madras
Published by Chapman &
ON DETERMINISM
Author(s): JAN UKASIEWICZ
Source: The Polish Review, Vol. 13, No. 3 (Summer, 1968), pp. 47-61
Published by: University of Illinois Press on behalf of the Polish Institute of Arts & Sciences of
America
Stable URL: http:/www.jstor.org/stable/
1. Complete the details left open in 5.2.1, 5.4.3, 5.5.4, 5.5.8, 5.6.11, 5.7.2,
5.7.6 and 5.8.8.
5.2.1: Check that Antecedent strengthening, Transitivity, and Contraposition are valid in classical logic.
A B (A C) B
AB
(A C) B)
AC
B
A
C
A
B
A B, B C A C
A
L.A. ZADEH*
FUZZY
LOGIC
AND
APPROXIMATE
REASONING
(In M e m o r y o f Grigore Moisil)
A~STgACT. The term fuzzy logic is used in this paper to describe an imprecise logical
system, FL, in which the truth-values are fuzzy subsets of the unit interval with l
Modal Logic Notes
Melvin Fitting
Dept. Mathematics and Computer Science
Lehman College (CUNY), 250 Bedford Park Boulevard West
Bronx, NY 10468-1589
e-mail: melvin.fitting@lehman.cuny.edu
web page: comet.lehman.cuny.edu/fitting
December 16, 2005
Abstract
M
Foundations of
Decision-Making Agents
Logic, Probability and Modality
This page intentionally left blank
Foundations of
Decision-Making Agents
Logic, Probability and Modality
Subrata Das
World Scientific
Imperial College Press
Published by
World Scientifi
INFOR~ATIO~ AND CONTROL8, 338-353 (1965)
Fuzzy Sets* L. A. ZADEH
Department of Electrical Engineering and Electronics l~esearch Laboratory,
University of California, Berkeley, California
A fuzzy set is a class of objects with a continuum of grades of
memb
1. This exercise concerns combinations of relations.
(a) For each of , , and , produce a relation which satisfies one of these but
none of the others (except that implies , so this case is impossible).
()
w0 Rw1 , w1 Rw2 , w0 Rw0 , w1 Rw1 , w2 Rw2
y
y
y
LOGICIANS WHO REASONABOUTTHEMSELVES
Raymond M. Smullyan
Department of Philosophy
Indiana University
Bloomington~ IN 47405
ABSTRACT
By treating belief as a modality and combining this with problems about
constant truth tellers and constant liars (knights a
An Introduction to Non-Classical Logic
From If to Is
Second Edition
GRAHAM PRIEST
University of Melbourne
and
University ofSt Andrews
CAMBRIDGE
UNIVERSITY PRESS
Contents
Preface to the First Edition
Preface to the Second Edition
Mathematical Prolegomenon
Solutions
Louis Barson
Kyoto University
February 2, 2009
1. Prove that the truth value of A at a world is the same as that of A.
vw (A) = 0
iff
iff
iff
iff
vw (A) = 1
for all w such that wRw , vw (A) = 1
for all w such that wRw , vw (A) = 0
vw (A) = 0
2.
Problems
MA310
Spring 2001
1
Problems
1
2
Some Games
1. This is a two-player game. There is a deck of 9 cards consisting of the ace through the
9 of clubs displayed on the table. Players alternately select a card from the currently
unchosen cards. The rst
10. By constructing suitable tableaux, determine whether the following are
valid in K t . Where the inference is invalid, specify a countermodel.
(a) [F ](p q) ([F ]p [F ]q)
([F ](p q) ([F ]p [F ]q), 0
[F ](p q), 0
([F ]p [F ]q), 0
[F ]p, 0
[F ]q, 0
hF iq
Basic Epistemic Logic
A. V. Ravishankar Sarma
Indian Institute of Technology Kanpur
avrs@iitk.ac.in
June 15, 2016
A. V. Ravishankar Sarma (IIT Kanpur)
Epistemic Logic
June 15, 2016
1 / 59
Quotes
Knowledge and Wisdom
1
He that knows not, and knows not that
Origin of Modal Logic
Syntax of Modal Logic
Semantics of Modal Logic
Validity of fomulas wrt frames
PHI455: Normal Modal Logic
A. V. Ravishankar Sarma
Indian Institute of Technology Kanpur
avrs@iitk.ac.in
February 16, 2015
.
A. V. Ravishankar Sarma (IIT K
what is philosophical logic
A. V. Ravishankar Sarma
January 1, 2016
Indian Institute of Technology Kanpur
what is philosophical logic
A. V. Ravishankar Sarma
January 1, 2016
Indian Institute of Technology Kanpur
0
Proverbs
1. He who knows not knows not th
MAT 1348: Knights and Knaves
These problems are quoted (or sometimes modified from) the wonderful logic puzzle
books of Raymond Smullyan, in particular his book What is the name of this book?
There is an island far off in the Pacific, called the island of
PHI 455: Philosophical Logic
Assignment
Deadline: 15 April 2016
Department of Humanities and Social Sciences
Indian Institute of Technology Kanpur
Answer any two of the following questions. The answers are based on the classic papers uploaded
to the websi
.I m: {a}?
"’3 war :31? dL-‘1I H
{631 u dI'JIL '5.
6L. “2 L— U '25:_]j_ HE.
can w "*7
3W)”; X3114}? {— XEEI- $3! ‘Hﬁpmfmmq I!) again; mm 3.31ch mag-v
aﬁpagmouy 9m; 3310 ‘aauaquads EMF} m; :agﬁoq agmaqsgdg II; uugqmsmurl wanna aq 1L '9
Eﬁﬁfﬁﬁ ”W 1 a mg L ‘
J 1 VII-D1:- -‘-"‘-\—'?' "H:- ﬁbuﬂi‘l
ILL '
. 9L D"? L M} L DO
grDLQ L]: "f :1. LDL. rim
r’ w
I! E farm‘s: a MW
PEI. (, .5,qu (— {’BMJVJ} L.
1 HQ BL 'mj nymﬁmmmm
- l ‘a‘ff mm iﬁ -mm1'mnvu 7P5 Jywmis‘mpram :3 34m =1, Emmi-1m on :3 maximum :1.
L, W Dir “57}
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by Ca
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by Ca