BEGIN:VCALENDAR
PRODID:-//Grails iCalendar plugin//NONSGML Grails iCalendar plugin//EN
VERSION:2.0
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VEVENT
DTSTAMP:20260426T160800Z
DTSTART;TZID=Australia/Melbourne:20140401T140000
DTEND;TZID=Australia/Melbourne:20140401T150000
SUMMARY:Analyticity - Semantic and Syntactic
UID:20260429T070321Z-iCalPlugin-Grails@philevents-web-6b96c54f56-bljdq
TZID:Australia/Melbourne
LOCATION:University of Melbourne\, Melbourne\, Australia\, 3010
DESCRIPTION:<p>Logicians use&nbsp\;<strong><em>analyticity</em></strong>&nbsp\;in different meanings\, some of them think of it as a&nbsp\;<strong><em>semantic&nbsp\;</em></strong>property of true sentences\; they either think of analytic truths as &lsquo\;truths in virtue of meaning&rsquo\; or as &lsquo\;truth in virtue of meaning of logical words&rsquo\;. Let us call the first understanding of analyticity&nbsp\;<strong><em>the wider&nbsp\;</em></strong>notion of analyticity and the second one&nbsp\;<strong><em>the&nbsp\;narrower&nbsp\;</em></strong>notion of it since restricts analyticity to be true in virtue of a specific kind of words.</p>\n<p><br></p>\n<p>Some other logicians understand analyticity&nbsp\;<strong><em>syntactically</em></strong>\, that is<strong><em>&nbsp\;</em></strong>literally in terms of syntax and structure of expressions. They prefer to call logical systems with sabformula property as &lsquo\;analytic&rsquo\;. One known system with this property is Gentzen&rsquo\;s Sequent Calculus. Since the semantic account of analyticity is silent about the literal composition of an expression out of its elements\, sabformula property is not necessary for a logical system to be analytic. Natural Deduction is a well-known system without Sab-Formula property.</p>\n<p><br></p>\n<p>I will study the possible relation between the semantic/syntactic notions of analyticity by way of a conjecture: if we think of the meaning of logical vocabulary as their role in an argument\, then syntactic issues are significant in characterizing the meaning of them. This conjecture\, I think\, has a support.&nbsp\;&nbsp\;By the normalization theorem\, Prawitz has shown that any proof in Natural Deduction system can be transformed into a normal proof. This happens because the Conditional Elimination rule in a Natural Deduction system offers a different meaning for the conditional\, when compared with the left-rule for the conditional in the Sequent Calculus.</p>\n\n\n
ORGANIZER;CN=Tristram Oliver-Skuse:
METHOD:PUBLISH
END:VEVENT
END:VCALENDAR
