Cartesian cut, Heisenberg cut, and the concept of complexity

World Futures 49 (3):333-355 (1997)
Abstract
(1997). Cartesian cut, Heisenberg cut, and the concept of complexity. World Futures: Vol. 49, The Quest for a Unified Theory of Information, pp. 333-355
Keywords No keywords specified (fix it)
Categories No categories specified
(categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 11,826
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Citations of this work BETA

No citations found.

Similar books and articles
Carlo Cellucci (2000). Analytic Cut Trees. Logic Journal of the Igpl 8:733-750.
Marcelo Finger & Dov Gabbay (2006). Cut and Pay. Journal of Logic, Language and Information 15 (3):195-218.
Gilles Dowek & Benjamin Werner (2003). Proof Normalization Modulo. Journal of Symbolic Logic 68 (4):1289-1316.
Neil Tennant (2012). Cut for Core Logic. Review of Symbolic Logic 5 (3):450-479.
Stefan Hetzl (2012). The Computational Content of Arithmetical Proofs. Notre Dame Journal of Formal Logic 53 (3):289-296.
Renling Jin (1992). Cuts in Hyperfinite Time Lines. Journal of Symbolic Logic 57 (2):522-527.
Analytics

Monthly downloads

Added to index

2010-09-01

Total downloads

39 ( #46,661 of 1,100,143 )

Recent downloads (6 months)

2 ( #190,012 of 1,100,143 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.