Science-advisor
REGISTER info/FAQ
Login
username
password
     
forgot password?
register here
 
Research articles
  search articles
  reviews guidelines
  reviews
  articles index
My Pages
my alerts
  my messages
  my reviews
  my favorites
 
 
Stat
Members: 3645
Articles: 2'501'711
Articles rated: 2609

20 April 2024
 
  » arxiv » math/0512615

 Article overview


Stability and Paradox in Algorithmic Logic
Wayne Aitken ; Jeffrey A. Barrett ;
Date 28 Dec 2005
Subject Logic
AbstractType-free systems of logic are designed to consistently handle significant instances of self-reference. Some consistent type-free systems also have the feature of allowing the sort of general abstraction or comprehension principle that infamously leads to paradox in naive set theory. Because type-free systems possess these features, and avoid the hierarchy of types that is felt to be unnatural in some contexts, they have the potential to play an important role in the foundations of mathematics, the theory of classes (producing a richer notion of class than that currently used in set theory and category theory), property theory, natural language semantics, the theory of truth, and theoretical computer science. Clearly, type-free systems must depart from classical logic in some way, but there is little agreement on what kind of type-free system to use, and which departures from classical logic should be allowed.
Our approach to type-free logic is to study a naturally occurring type-free system that we believe is in some sense prototypical of systems that will ultimately prove useful. The logic studied in this paper, called algorithmic logic, concerns certain basic statements involving algorithms and the algorithmic rules of inference between such statements. This paper studies the propositional properties of algorithmic logic. A future paper will show that algorithmic logic possesses a general abstraction principle.
Source arXiv, math/0512615
Services Forum | Review | PDF | Favorites   
 
Visitor rating: did you like this article? no 1   2   3   4   5   yes

No review found.
 Did you like this article?

This article or document is ...
important:
of broad interest:
readable:
new:
correct:
Global appreciation:

  Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.

browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)






ScienXe.org
» my Online CV
» Free


News, job offers and information for researchers and scientists:
home  |  contact  |  terms of use  |  sitemap
Copyright © 2005-2024 - Scimetrica