Skip to main content
Article thumbnail
Location of Repository

4 ARGUMENT FROM NEGATION NORMALITY

By  and Jakub Szymanik and Jakub Szymanik and Jakub Szymanik and Jakub Szymanik and Jakub Szymanik

Abstract

Everyday language is easy to understand. We claim that it is bounded by Σ 1 1-properties. Only then Barwise’s test of negation normality works. In finite universe Σ1 1-sentences are (in)directly verifiable

Topics: Argument From Practical Computability
Year: 2007
OAI identifier: oai:CiteSeerX.psu:10.1.1.353.4638
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.jakubszymanik.com/s... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.