Drexel dragonThe Math ForumDonate to the Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math

Topic: Torkel Franzen argues
Replies: 25   Last Post: May 17, 2013 3:52 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]

Posts: 1,968
Registered: 12/4/12
Re: Torkel Franzen argues
Posted: Apr 26, 2013 10:24 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On 4/24/2013 8:28 PM, Newberry wrote:
> So don't
> tell me that it is all based on manifest truth. In fact I have shown
> in another thread
> https://groups.google.com/forum/?hl=en&fromgroups#!topic/sci.logic/lDJcgOg4vco
> that the proof that the truths of first order arithmetic are not
> recursively enumerable is NOT likely to hold if we use Strawson-like
> semantics.

What exactly do you mean by "Strawson-like"
semantics. Did Strawson ever produce a semantic

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2015. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.